{"title":"Multi-copy data dissemination with probabilistic delay constraint in mobile opportunistic device-to-device networks","authors":"Yang Liu, A. Bashar, Fan Li, Yu Wang, Kun Liu","doi":"10.1109/WoWMoM.2016.7523548","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523548","url":null,"abstract":"Device-to-device (D2D) is a new paradigm that enhances network performance by offering a wide variety of advantages over traditional cellular networks, e.g., efficient spectral usage and extended network coverage. Efficient data dissemination is indispensable for supporting many D2D applications such as content distribution and location-aware advertisement. In this work, we study the problem of multi-copy data dissemination with probabilistic delay constraint in mobile opportunistic D2D networks. We first formally formulate the problem and introduce a centralized heuristic algorithm which aims to discover a graph for multicasting, in order to meet delay constraint and achieve low communication cost. While the centralized solution can be adapted to a distributed implementation, it is inefficient in a mobile opportunistic D2D network, since it intends to apply a deterministic transmission strategy in a nondeterministic network by delivering all data packets via a predetermined route. Based on such observation, we develop a distributed online algorithm based on the optimal stopping strategy that makes an efficient decision on every transmission opportunity. Extensive simulations under real-world traces and random walk mobility model are carried out to learn the performance trend of the proposed schemes under various network settings.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114925011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alexandros G. Fragkiadakis, E. Tragos, Luka Kovacevic, Pavlos Charalampidis
{"title":"A practical implementation of an adaptive Compressive Sensing encryption scheme","authors":"Alexandros G. Fragkiadakis, E. Tragos, Luka Kovacevic, Pavlos Charalampidis","doi":"10.1109/WoWMoM.2016.7523561","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523561","url":null,"abstract":"In the new era of IoT, hundreds or even thousands of interconnected miniature sensors have made feasible the creation of novel applications spanning in multiple areas like e-health, environmental monitoring, on-farming, etc. Despite the technological advances in this domain, the sensors are still severe constrained devices, in terms of memory and processing. These limitations cannot only compromise applications' performance but can also affect trust and security in the IoT ecosystem. Besides security and trust, energy efficiency is also of paramount importance as sensors are often battery-operated. For energy minimisation and data security purposes, several contributions have mainly focused either on data compression, or data encryption; however, considering those as two independent operations. The last few years, the Compressive Sensing theory has shown that compression and encryption can be used simultaneously, given that data are sparse in some domain. As data sparsity cannot be known in advance, here, we present a practical implementation of a compressive sensing system where the data sparsity is estimated, and the compression rate is selected accordingly. Our system consists of two entities: a server implemented in Java running on a powerful machine, and a client that runs in a miniature sensor, developed in C and executing in the Contiki operating system. The evaluation results show the superiority of the proposed scheme against a non-adaptive one.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129082194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An architecture for sender-based addressing for selective sensor network wake-up receivers","authors":"J. Blobel, Janis Krasemann, F. Dressler","doi":"10.1109/WoWMoM.2016.7523516","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523516","url":null,"abstract":"Duty cycling has been the main concept for saving energy in sensor networks for a long time. Yet, additional overhead for synchronization and the fact that overhearing and idle listening cannot completely be prevented, motivated further research. Wake-up receiver, i.e., additional ultra-low power radios that are not switched off and can receive a so called wake-up signal, aim to fill this gap. The wake-up signal can either be a simple energy burst that wakes up all nodes in reception range or can include an address to wake up individual nodes. In this paper, we introduce a novel addressing scheme for wake-up receivers that supports broadcast, multicast, and unicast wake-ups, and which can be realized in hardware with little additional complexity at the receiver. We implemented a prototype based on a commercially available wake-up receiver to show the feasibility of our approach. We discuss the tradeoff between the length of the wake-up signal and the possible energy savings and show an application example for sending software updates to sensor nodes in an energy saving way.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128884811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Busy Tone based Prioritized Access for distributed wireless networks","authors":"Xin Zhou, C. Zheng","doi":"10.1109/WoWMoM.2016.7523541","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523541","url":null,"abstract":"Although the physical transmission rate increases rapidly, the quality of service (QoS) support for real-time traffic remains a challenge. 802.11 EDCA can only provide service differentiation, but not ensure the QoS as expected because of the restrained real-time traffic capacity and the uncertainty of prioritized access. This paper proposes a distributed MAC protocol called the Prioritized Access based on Busy Tone (PABT), which utilizes the in-band busy tone reservation, preemptive scheduling and adaptive CW tuning simultaneously to resolve the problems. Simulation results demonstrate that the proposed protocol provides a remarkable improvement in terms of the real-time traffic capacity, throughput and packet loss rate.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131061761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cyber security of smart grids modeled through epidemic models in cellular automata","authors":"Giulia Cisotto, L. Badia","doi":"10.1109/WoWMoM.2016.7523560","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523560","url":null,"abstract":"Due to their distributed management, smart grids can be vulnerable to malicious attacks that undermine their cyber security. An adversary can take control of few nodes in the network and spread digital attacks like an infection, whose diffusion is facilitated by the lack of centralized supervision within the smart grid. In this paper, we propose to investigate these phenomena by means of epidemic models applied to cellular automata. We show that the common key parameters of epidemic models, such as the basic reproductive ratio, are also useful in this context to understand the extent of the grid portion that can be compromised. At the same time, the lack of mobility of individuals limits the spreading of the infection. In particular, we evaluate the role of the grid connectivity degree in both containing the epidemics and avoiding its spreading on the entire network, and also increasing the number of nodes that do not get any contact with the cyber attacks.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130687739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Mingozzi, G. Tanganelli, C. Vallati, Belén Martínez, Izaskun Mendia, Martín González-Rodríguez
{"title":"Semantic-based context modeling for quality of service support in IoT platforms","authors":"E. Mingozzi, G. Tanganelli, C. Vallati, Belén Martínez, Izaskun Mendia, Martín González-Rodríguez","doi":"10.1109/WoWMoM.2016.7523563","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523563","url":null,"abstract":"The Internet of Things (IoT) envisions billions of devices seamlessly connected to information systems, thus providing a sensing platform for applications. The availability of such a huge number of smart things will entail a multiplicity of devices collecting overlapping data and/or providing similar functionalities. In this scenario, efficient discovery and appropriate selection of things through proper context acquisition and management will represent a critical requirement and a challenge for future IoT platforms. In this work we present a practical approach to model and manage context, and how this information can be exploited to implement QoS-aware thing service selection. In particular, it is shown how context can be used to infer knowledge on the equivalence of thing services through semantic reasoning, and how such information can be exploited to allocate thing services to applications while meeting QoS requirements even in case of failures. The proposed approach is demonstrated through a simple yet illustrative experiment in a smart home scenario.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115350899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"How beneficial is the WiFi offloading? A detailed game-theoretical analysis in wireless oligopolies","authors":"Georgios Fortetsanakis, M. Papadopouli","doi":"10.1109/WoWMoM.2016.7523504","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523504","url":null,"abstract":"The rapid advances in networking, mobile computing, and virtualization, lead to a dramatic increase in the traffic demand. A cost-effective solution for serving it, while maintaining a good quality of service (QoS), would be to offload a part of the traffic originally targeted for cellular base stations (BSs) to a WiFi infrastructure. Related work on the WiFi offloading often considers markets with a single provider and omits parameters, such as the effect of the offloading on the perceived QoS by users, the capacity of the WiFi infrastructure, and competition of providers. In contrast to these approaches, this paper develops a detailed modeling framework for analysing the WiFi offloading using network economics, game theory, and queueing networks. It also proposes a novel network aggregation technique to reduce the computational complexity of the analysis. Using this framework, the performance of WiFi offloading was evaluated under various scenarios with respect to the bandwidth of BSs and APs, coverage of WiFi, and user preferences. Our results highlight that it is not always profitable for providers to invest in a large WiFi infrastructure. The limited capacity of the WiFi APs restricts the benefits of the offloading.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117186658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
G. Khodabandelou, Vincent Gauthier, M. El-Yacoubi, M. Fiore
{"title":"Population estimation from mobile network traffic metadata","authors":"G. Khodabandelou, Vincent Gauthier, M. El-Yacoubi, M. Fiore","doi":"10.1109/WoWMoM.2016.7523554","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523554","url":null,"abstract":"Smartphones and other mobile devices are today pervasive across the globe. As an interesting side effect of the surge in mobile communications, mobile network operators can now easily collect a wealth of high-resolution data on the habits of large user populations. The information extracted from mobile network traffic data is very relevant in the context of population mapping: it provides a tool for the automatic and live estimation of population densities, overcoming the limitations of traditional data sources such as censuses and surveys. In this paper, we propose a new approach to infer population densities at urban scales, based on aggregated mobile network traffic metadata. Our approach allows estimating both static and dynamic populations, achieves a significant improvement in terms of accuracy with respect to state-of-the-art solutions in the literature, and is validated on different city scenarios.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115805819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Routing in Delay Tolerant Networks with fine-grained contact characterisation and dynamic message replication","authors":"Luming Wan, Haibo Zhang, Feiyang Liu, Yawen Chen","doi":"10.1109/WoWMoM.2016.7523551","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523551","url":null,"abstract":"Pairwise contacts in Delay-Tolerant Networks (DTNs) for applications such as bus or smartphone based social networking commonly show some regular repeating patterns. Most existing routing protocols only implicitly exploit these patterns to predict future contacts. To enhance message delivery rate, most of the schemes allow messages to be replicated and forwarded to encountered nodes. However, there is no efficient mechanism for dynamically controlling message replication to achieve high message delivery rate with very low message overhead. In this paper, we present FGDR, a routing protocol designed for DTNs by leveraging fine-grained contact characterisation and dynamic message replication. In FGDR, the history contact is characterised in a fine-grained manner using a sliding window mechanism, and an up-to-date future contact prediction can be made based on the most recent history data. We design an efficient message replication scheme, in which replication is controlled in a fully decentralised manner by taking into account the expected message delivery rate, the replication history, and the quality of the encountered node. A replica can be generated only when it is necessary to fulfill the expected message delivery rate. We evaluate our scheme through trace-driven simulations, and results show FGDR can achieve much higher message delivery rate with lower message overhead in comparison with existing schemes.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129819774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Carlos Pereira, Antonio Pinto, Ana Aguiar, Pedro Rocha, Fernando Santiago, Jorge Sousa
{"title":"IoT interoperability for actuating applications through standardised M2M communications","authors":"Carlos Pereira, Antonio Pinto, Ana Aguiar, Pedro Rocha, Fernando Santiago, Jorge Sousa","doi":"10.1109/WoWMoM.2016.7523564","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523564","url":null,"abstract":"Smartphones, with vast connectivity and sensing capabilities, are the natural choice to serve as gateways for physiologic sensors and body area networks. Machine-to-Machine (M2M) middleware standards are driving the emergence of Internet of Things (IoT) applications by providing autonomic interoperability. However, standards remain opaque and difficult to interpret, throttling implementation. In this work, we report the design and development of an ETSI M2M Gateway (GW) on a mobile device, instantiated in a smartphone. We describe our reasoning in interpreting the standard for the varied implementation challenges faced. Further, we develop libraries to ease the deployment of IoT applications using the ETSI M2M ecosystem with reduced development costs. Finally, we validated the implementation with a mobile e-health pilot with 10 participants during 3 weeks.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129159022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}