Context-aware adaptive routing for opportunistic network

Opportunistic networking-forwarding messages in a disconnected mobile ad hoc network via any encountered nodes offers a new mechanism for exploiting the mobile devices that many users already carry. However, forwarding messages in such a network is trapped by many particular challenges, and some protocols have contributed to solve them partly. In this paper, we propose a Context-Aware Adaptive opportunistic Routing algorithm (CAAR). The algorithm firstly predicts the approximate location and orientation of the destination node by using its movement key positions and historical communication records, and then calculates the best neighbor for the next hop by using location and velocity of neighbors. In the unpredictable cases, forwarding messages will be delivered to the more capable forwarding nodes or wait for another transmission while the capable node does not exist in the neighborhood. The proposed algorithm takes the movement pattern into consideration and can adapt different network topologies and movements. The experiment results show that the proposed routing algorithm outperforms the epidemic forwarding (EF) and the prophet forwarding (PF) in packet delivery ratio while ensuring low bandwidth overhead.

[1]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[2]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[3]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[4]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[5]  Yong Zhang,et al.  Heterogeneous context-aware routing protocol for opportunistic network , 2010, 5th International Conference on Pervasive Computing and Applications.

[6]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.

[7]  Jie Wu,et al.  Behavioral Malware Detection in Delay Tolerant Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[8]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[9]  Jian Ma,et al.  A Data Transmission Scheme for Community-Based Opportunistic Networks , 2009, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[10]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[11]  Martin Everett,et al.  Ego network betweenness , 2005, Soc. Networks.

[12]  Marco Conti,et al.  HiBOp: a History Based Routing Protocol for Opportunistic Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[13]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[14]  Gil Eduardo de Andrade,et al.  Routing Protocol Based on the Position, Velocity, and Direction of the Nodes , 2013, 2013 27th International Conference on Advanced Information Networking and Applications Workshops.

[15]  Li Chen,et al.  Multihop-Delivery-Quality-Based Routing in DTNs , 2015, IEEE Transactions on Vehicular Technology.