z-logo
Premium
LAOF: location‐aware opportunistic forwarding scheme in mobile Ad hoc networks
Author(s) -
Tao Jun,
Xu Yifan,
Chang Le,
Tan Chengwei,
Wang Xiaoxiao
Publication year - 2017
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.2918
Subject(s) - computer science , computer network , waypoint , wireless ad hoc network , node (physics) , latency (audio) , mobility model , probabilistic logic , mobile ad hoc network , overhead (engineering) , exploit , distributed computing , wireless , real time computing , computer security , telecommunications , network packet , structural engineering , artificial intelligence , engineering , operating system
Due to the high mobility of the nodes, the mobile ad hoc networks are expected to provide many opportunities for message forwarding in delay tolerant networks. Considering the typical mobility models, for example, the random waypoint (RWP) model and Manhattan model, we explore the probabilistic characteristics of the node contact provided by the mobile nodes. Following a progressive approach, we propose a location‐aware opportunistic forwarding scheme, which exploits the location information of the messages and the node mobility to conduct message forwarding. In order to provide a stable delivery ratio and avoid the extra network overhead, the message is forwarded to its destination regions or neighbor regions, which offer a better chance to reach the destination node. We construct a simulation environment, integrated with the RWP mobility trace and the Shanghai city taxis traces. Through extensive simulations, our scheme is demonstrated to outperform the best known opportunistic forwarding algorithms in terms of both delivery ratio/latency and transmission overhead. Copyright © 2014 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here