Probability and Priority Based Routing Approach for Opportunistic Networks

Opportunistic networks are wireless networks that have sporadic network connectivity, thus rendering the existence of instantaneous end-to-end paths from a source to a destination difficult. Hence, in such networks, message delivery relies heavily on the store-and-forward paradigm to route messages. However, limited knowledge of the contact times between the nodes poses a big challenge to effective forwarding of messages. This paper describes probability and priority based approach for routing in opportunistic networks, rendering traditional routing protocols unable to deliver messages between hosts. This approach minimizes the copies of the messages in the network and ensures successful delivery of messages.

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

[2]  Qun Li,et al.  Message relay in disconnected ad-hoc networks , 2002, International Mobility and Wireless Access Workshop.

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

[4]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[5]  Leszek Lilien,et al.  The Concept of Opportunistic Networks and their Research Challenges in Privacy and Security , 2007 .

[6]  Jean-Luc Meunier,et al.  Pollen: using people as a communication medium , 2001, Comput. Networks.

[7]  José Neuman de Souza,et al.  Service Assurance with Partial and Intermittent Resources , 2004, Lecture Notes in Computer Science.

[8]  Ling-Jyh Chen,et al.  PRoPHET+: An Adaptive PRoPHET-Based Routing Protocol for Opportunistic Network , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

[9]  Lei Ying,et al.  Back-Pressure Routing for Intermittently Connected Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[10]  Qun Li,et al.  Communication in disconnected ad hoc networks using message relay , 2003, J. Parallel Distributed Comput..

[11]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[12]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[13]  Robbert van Renesse,et al.  The power of epidemics: robust communication for large-scale distributed systems , 2003, CCRV.

[14]  Richard E. Hansen,et al.  Prioritized epidemic routing for opportunistic networks , 2007, MobiOpp '07.

[15]  Vassilis Tsaoussidis,et al.  Routing for Opportunistic Networks Based on Probabilistic Erasure Coding , 2012, WWIC.

[16]  Oliver Brock,et al.  MV routing and capacity building in disruption tolerant networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Athanasios V. Vasilakos,et al.  Backpressure-based routing protocol for DTNs , 2010, SIGCOMM '10.