Opportunistic shortest path forwarding in delay tolerant networks

Delay Tolerant Networks (DTNs) are characterized by probabilistic links formed among mobile nodes indicating their probabilistic encounters. Prior work on DTN routing uses expected delays as a routing metric to decide the next hop relay node for packet delivery to the destination. However, they measure the expected delays by taking the minimum of the expected delays over all possible paths from a candidate relay. This metric, denoted by MinEx, does not account for the opportunity gain enabled by having multiple paths to the destination through encountering multiple future neighbors. Since DTN routing uses as the relay the first encountered node satisfying given routing criteria, the random delays to multiple relay nodes should be aggregated. Thus, the true expected delays can be measured by taking the expectation of the minimum delays, denoted as ExMin, over all possible probabilistic paths from the candidate.

[1]  Chen-Nee Chuah,et al.  Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[2]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

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

[4]  Srihari Nelakuditi,et al.  On the Efficacy of Opportunistic Routing , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[5]  Jie Wu,et al.  An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.

[6]  Lili Qiu,et al.  SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks , 2009, IEEE Transactions on Mobile Computing.

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

[8]  Injong Rhee,et al.  Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[9]  Eitan Altman,et al.  Decentralized Stochastic Control of Delay Tolerant Networks , 2009, IEEE INFOCOM 2009.

[10]  Paul A. S. Ward,et al.  Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.

[11]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[12]  Sachin Katti,et al.  MORE: A Network Coding Approach to Opportunistic Routing , 2006 .

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

[14]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[15]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[16]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.