Neighbor Discovery for Opportunistic Networking in Internet of Things Scenarios: A Survey
Open Access
- 15 July 2015
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 3, 1101-1131
- https://doi.org/10.1109/access.2015.2457031
Abstract
Neighbor discovery was initially conceived as a means to deal with energy issues at deployment, where the main objective was to acquire information about network topology for subsequent communication. Nevertheless, over recent years, it has been facing new challenges due to the introduction of mobility of nodes over static networks mainly caused by the opportunistic presence of nodes in such a scenario. The focus of discovery has, therefore, shifted toward more challenging environments, where connectivity opportunities need to be exploited for achieving communication. In fact, discovery has traditionally been focused on tradeoffs between energy and latency in order to reach an overlapping of communication times between neighboring nodes. With the introduction of opportunistic networking, neighbor discovery has instead aimed toward the more challenging problem of acquiring knowledge about the patterns of encounters between nodes. Many Internet of Things applications (e.g., smart cities) can, in fact, benefit from such discovery, since end-to-end paths may not directly exist between sources and sinks of data, thus requiring the discovery and exploitation of rare and short connectivity opportunities to relay data. While many of the older discovery approaches are still valid, they are not entirely designed to exploit the properties of these new challenging scenarios. A recent direction in research is, therefore, to learn and exploit knowledge about mobility patterns to improve the efficiency in the discovery process. In this paper, a new classification and taxonomy is presented with an emphasis on recent protocols and advances in this area, summarizing issues and ways for potential improvements. As we will show, knowledge integration in the process of neighbor discovery leads to a more efficient scheduling of the resources when contacts are expected, thus allowing for faster discovery, while, at the same time allowing for energy savings when such contacts are not expected.Keywords
Funding Information
- EU FP7 SOCIOTAL Project (CNECT-ICT-609112)
- EU FP7 iCore Project (ICT-2011-287708)
This publication has 136 references indexed in Scilit:
- A high-performance quantum dot superluminescent diode with a two-section structureNanoscale Research Letters, 2011
- A framework for Resource-Aware Data Accumulation in sparse wireless sensor networksComputer Communications, 2011
- Data Collection in Wireless Sensor Networks with Mobile ElementsACM Transactions on Sensor Networks, 2011
- Hierarchical power management in disruption tolerant networks using traffic-aware optimizationComputer Communications, 2009
- Reliable and energy-efficient data collection in sparse sensor networks with mobile elementsPerformance Evaluation, 2009
- An asynchronous neighbor discovery algorithm for wireless sensor networksAd Hoc Networks, 2007
- Geographic random forwarding (geraf) for ad hoc and sensor networks: energy and latency performanceIEEE Transactions on Mobile Computing, 2003
- Geographic random forwarding (geraf) for ad hoc and sensor networks: multihop performanceIEEE Transactions on Mobile Computing, 2003
- Delay-tolerant networking: an approach to interplanetary InternetIEEE Communications Magazine, 2003
- Optimizing sensor networks in the energy-latency-density design spaceIEEE Transactions on Mobile Computing, 2002