Optimal Joint Expected Delay Forwarding in Delay Tolerant Networks

Multicopy forwarding schemes have been employed in delay tolerant network (DTN) to improve the delivery delay and delivery rate. Much effort has been focused on reducing the routing cost while retaining high performance. This paper aims to provide an optimal joint expected delay forwarding (OJEDF) protocol which minimizes the expected delay while satisfying a certain constant on the number of forwardings per message. We propose a comprehensive forwarding metric called joint expected delay (JED) which is a function of remaining hop-count (or ticket) and residual lifetime. We use backward induction to calculate JED by modeling forwarding as an optimal stopping rule problem. We also present an extension to allow OJEDF to run in delay constrained scenarios. We implement OJEDF as well as several other protocols and perform trace-driven simulations. Simulation results confirm that OJEDF shows superiority in delay and cost with acceptable decrease of delivery rate.

[1]  Lingfen Sun,et al.  WSN10-5: Adaptive Multi-Copy Routing for Intermittently Connected Mobile Ad Hoc Networks , 2006, IEEE Globecom 2006.

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

[3]  Ming Liu,et al.  Relative Distance-Aware Data Delivery Scheme for Delay Tolerant Mobile Sensor Networks: Relative Distance-Aware Data Delivery Scheme for Delay Tolerant Mobile Sensor Networks , 2010 .

[4]  Thierry Turletti,et al.  Utility-based Message Replication for Intermittently Connected Heterogeneous Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[5]  Klara Nahrstedt,et al.  3R: Fine-grained encounter-based routing in Delay Tolerant Networks , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[6]  Li Li,et al.  Practical Routing in Delay-Tolerant Networks , 2007, IEEE Trans. Mob. Comput..

[7]  Jie Wu,et al.  Message forwarding in Cyclic MobiSpace: the multi-copy case , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[8]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

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

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

[11]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

[12]  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..

[13]  A. Jindal,et al.  Optimizing Multi-Copy Routing Schemes for Resource Constrained Intermittently Connected Mobile Networks , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[14]  D. Clawin,et al.  Queueing Networks , 2004 .

[15]  Philippe Bonnet,et al.  Smart-tag based data dissemination , 2002, WSNA '02.

[16]  Limin Sun,et al.  Opportunistic Networks: Opportunistic Networks , 2009 .

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

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

[19]  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.

[20]  Saleem N. Bhatti,et al.  Exploiting Self-Reported Social Networks for Routing in Ubiquitous Computing Environments , 2008, 2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[21]  Katia Obraczka,et al.  TAROT: trajectory-assisted routing for intermittently connected networks , 2009, CHANTS '09.

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

[23]  Lingfen Sun,et al.  Adaptive Multi-Copy Routing for Intermittently Connected Mobile Ad Hoc Networks , 2006 .

[24]  Martin Herdegen.  Optimal Stopping and Applications Example 2 : American options , 2009 .

[25]  Zheng Guo,et al.  Prediction Assisted Single-Copy Routing in Underwater Delay Tolerant Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[26]  Liu Ming,et al.  Relative Distance-Aware Data Delivery Scheme for Delay Tolerant Mobile Sensor Networks , 2010 .

[27]  Timur Friedman,et al.  DTN routing in a mobility pattern space , 2005, WDTN '05.

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

[29]  Pan Hui,et al.  Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding , 2005 .

[30]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[31]  Cecilia Mascolo,et al.  SCAR: context-aware adaptive routing in delay tolerant mobile sensor networks , 2006, IWCMC '06.

[32]  Alex Pentland,et al.  DakNet: rethinking connectivity in developing nations , 2004, Computer.

[33]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.