An Efficient Context-aware Opportunistic Routing Protocol

Opportunistic routing is designed for an environment where there is no stable end-to-end routing path between source node and destination node, and messages are forwarded via intermittent contacts between nodes and routed using a store-carry-forward mechanism. In this paper, we consider PRoPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity) protocol as a base opportunistic routing protocol and propose an efficient context-aware opportunistic routing protocol by using the context information of delivery predictability and node type, e.g., pedestrian, car, and tram. In the proposed protocol, the node types of sending node and receiving node are checked. Then, if either sending node or receiving node is tram, messages are forwarded by comparing the delivery predictability of receiving node with predefined delivery predictability thresholds depending on the combination of sending node and receiving node types. Otherwise, messages are forwarded if the delivery predictability of receiving node is higher than that of sending node, as defined in PRoPHET protocol. Finally, we analyze the performance of the proposed protocol from the aspect of delivery ratio, overhead ratio, and delivery latency. Simulation results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than PRoPHET protocol in most of the considered simulation environments.

[1]  Qi Han,et al.  Context-Aware Community Construction in Proximity-Based Mobile Networks , 2015, Mob. Inf. Syst..

[2]  Joel J. P. C. Rodrigues,et al.  Performance of vehicular delay-tolerant networks with relay nodes , 2011, Wirel. Commun. Mob. Comput..

[3]  Donald F. Towsley,et al.  Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing , 2007, MobiCom '07.

[4]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[5]  Gian Paolo Rossi,et al.  Bus switched networks: An ad hoc mobile platform enabling urban-wide communications , 2012, Ad Hoc Networks.

[6]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[7]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[9]  Gian Paolo Rossi,et al.  A solution for mobile DTN in a real urban scenario , 2012, 2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW).

[10]  Anders Lindgren,et al.  Probabilistic Routing Protocol for Intermittently Connected Networks , 2012, RFC.

[11]  Ari Keränen.  Opportunistic Network Environment simulator , 2008 .

[12]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[13]  Aravind Srinivasan,et al.  Mélange: Supporting heterogeneous QoS requirements in delay tolerant sensor networks , 2010, 2010 Seventh International Conference on Networked Sensing Systems (INSS).

[14]  Donald F. Towsley,et al.  Performance modeling of epidemic routing , 2006, Comput. Networks.

[15]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[16]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[17]  P. Das,et al.  Postbox DTN: It's modelling and routing analysis , 2012, 2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing.