An Efficient location‐aware routing approach in opportunistic networks

Abstract

An opportunistic network is a kind of self‐organizing network that makes use of the encountering opportunities to realize short‐distance wireless communication. Because of the intermittent connectivity between nodes and dynamic network topology, how to devise a reliable and efficient routing approach has become a challenging issue. However, the periodic update mechanism of the node's location information in the existing works costs too much. To address this issue, we propose a location‐aware opportunistic routing (LAOR) approach. In the the proposed LAOR, we first establish a location‐aware prediction model based on the Markov process to predict the node's next location. Then we devise a decision‐making scheme of message forwarding to select the desired relay nodes based on the node's delivery probability. In addition, we introduce a dynamic buffer management strategy to determine the message priority. Finally, we validate the effectiveness of our proposed model and the high efficiency of the LAOR approach. Simulation results demonstrate that the proposed LAOR outperforms the existing Epidemic, Prophet, history‐based prediction routing, and location prediction‐based forwarding for routing using Markov chain algorithms in terms of delivery ratio, overhead ratio, and the number of messages dropped. © 2020 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

Dynamic Co-Operative Energy-Efficient Routing Algorithm Based on Geographic Information Perception in Opportunistic Mobile Networks

“…Nevertheless, insufficient attention is given to the application of node location information, and there is a lack of integration among various methodologies. Furthermore, the significance of geographic information in OMNs is often overlooked as it primarily serves message routing techniques [25][26][27] rather than energy conservation purposes, despite its equal importance in the energy management of nodes within OMNs.…”

An Efficient Opportunistic Routing Protocol with Low Latency for Farm Wireless Sensor Networks

“…The relay node selected the nearest neighbor to minimize the hops between the source node and the target node. A forwarding decision method was used to select the relay node according to the forwarding probability [32]. Based on the location information, depth information, and current residual energy, Karim et al weighted the normalized energy, transmission probability, and normalized distance to reduce the energy consumption and improve the network lifetime [33].…”

Activity-based routing algorithm in opportunistic mobile social networks

“…The algorithm uses past and current context information to classify intermediate forwarding nodes as reliable forwarders and unreliable forwarders, so as to achieve efficient multi-copy routing in communication. In order to reduce the cost of the regular update mechanism of node location information, Wang et al 22 proposed a location-aware opportunity routing algorithm. First, a location-aware prediction model based on Markov process was established to predict the next location of the node.…”