Optimal two-hop routing in delay-tolerant networks

In this work we deal with the problem of dynamic decentralized self-optimization of forwarding protocols in delay-tolerant networks. We consider the two-hop forwarding protocol and we model the routing problem as an optimization one. We describe, under mild assumptions on the contact process among mobile nodes, the connection between the number of copies of a message and the cumulative probability distribution function of the message delay. We show that, despite the possible presence of a plurality of optimal policies, there always exists a threshold policy that is optimal. We also show that such an optimal strategy can be achieved at run-time by probing the network and with minimal message overhead. The approach is validated by implementing a self-optimizing algorithm in a network simulator; the performance of our solution is analyzed in the case of various real-world contact traces.

[1]  Stratis Ioannidis,et al.  Distributing content updates over a mobile social network , 2009, MOCO.

[2]  Jean-Yves Le Boudec,et al.  Perfect simulation and stationarity of a class of mobility models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  H. Kushner.  Control of Trunk Line Systems in Heavy Traffic , 1995 .

[4]  Jean-Claude Bermond,et al.  Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks , 2009, IEEE INFOCOM 2009.

[5]  Imrich Chlamtac,et al.  Why neighbourhood matters: interests-driven opportunistic data diffusion schemes , 2008, CHANTS '08.

[6]  Francesco De Pellegrini,et al.  Dynamic control of Coding in Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[7]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[8]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[9]  Eitan Altman,et al.  Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks , 2008, Valuetools 2008.

[10]  Eitan Altman,et al.  Optimal control in two-hop relay routing , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[11]  H. Kushner,et al.  Stochastic Approximation and Recursive Algorithms and Applications , 2003 .

[12]  Jean-Yves Le Boudec,et al.  Performance Analysis of Self Limiting Epidemic Forwarding , 2006 .

[13]  J. L. Maryak.  Some guidelines for using iterate averaging in stochastic approximation , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[14]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[15]  Thrasyvoulos Spyropoulos,et al.  Minimum Expected *-Cast Time in DTNs , 2009, BIONETICS.

[16]  Ellen W. Zegura,et al.  Controlling the mobility of multiple data transport ferries in a delay-tolerant network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[18]  Eitan Altman,et al.  Performance of Ad Hoc Networks with Two-Hop Relay Routing and Limited Packet Lifetime , 2006, 200614th IEEE International Workshop on Quality of Service.

[19]  Giovanni Neglia,et al.  Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study , 2006, CHANTS '06.

[20]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[21]  Thrasyvoulos Spyropoulos,et al.  Optimal Buffer Management Policies for Delay Tolerant Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[22]  Stefan Saroiu,et al.  A preliminary investigation of worm infections in a bluetooth environment , 2006, WORM '06.

[23]  Boris Polyak,et al.  Acceleration of stochastic approximation by averaging , 1992 .