Utilizing correlated node mobility for efficient DTN routing

In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly not known. Therefore, effective forwarding based on limited knowledge of contact behavior of nodes is challenging. Most of the previous studies assumed that mobility of a node is independent from mobility of other nodes and looked at only the pairwise node relations to decide routing. In contrast, in this paper, we analyze the temporal correlation between the meetings of each node with other nodes and utilize this correlation for efficient routing. We introduce a new metric called conditional intermeeting time (CIT), which computes the average intermeeting time between two nodes relative to a meeting with a third node. Then, we modify existing DTN routing protocols using the proposed metric to improve their performance. Extensive simulations based on real and synthetic DTN traces show that the modified algorithms perform better than the original ones.

[1]  Rabin K. Patra,et al.  Using redundancy to cope with failures in a delay tolerant network , 2005, SIGCOMM '05.

[2]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

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

[4]  Marcelo Dias de Amorim,et al.  The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing , 2009, IEEE INFOCOM 2009.

[5]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[6]  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).

[7]  Cecilia Mascolo,et al.  CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks , 2009, IEEE Transactions on Mobile Computing.

[8]  David Lazer,et al.  Inferring friendship network structure by using mobile phone data , 2009, Proceedings of the National Academy of Sciences.

[9]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[10]  FallKevin,et al.  Routing in a delay tolerant network , 2004 .

[11]  Pan Hui,et al.  Impact of human mobility on the performance of opportunistic forwarding algorithms , 2006, INFOCOM 2006.

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

[13]  Sudha Krishnamurthy,et al.  CREST: An Opportunistic Forwarding Protocol Based on Conditional Residual Time , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[14]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

[15]  Jie Wu,et al.  Practical Routing in a Cyclic MobiSpace , 2011, IEEE/ACM Transactions on Networking.

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

[17]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

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

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

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

[21]  Anders Lindgren,et al.  CRAWDAD dataset upmc/content (v.2006-11-17) , 2006 .

[22]  Jie Wu,et al.  LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[23]  Boleslaw K. Szymanski,et al.  Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[24]  Ahmed Helmy,et al.  Modeling Time-Variant User Mobility in Wireless Mobile Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[25]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[27]  D. Lazer,et al.  Inferring Social Network Structure using Mobile Phone Data , 2006 .

[28]  Cauligi S. Raghavendra,et al.  Performance analysis of mobility-assisted routing , 2006, MobiHoc '06.

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

[30]  Rahim Tafazolli,et al.  Delay-/Disruption-Tolerant Networking State of the Art and Future Challenges , 2009 .

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

[32]  Pablo Rodriguez,et al.  Fair Routing in Delay Tolerant Networks , 2009, IEEE INFOCOM 2009.

[33]  Boleslaw K. Szymanski,et al.  Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks , 2010, IEEE/ACM Transactions on Networking.

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

[35]  Boleslaw K. Szymanski,et al.  Efficient routing in delay tolerant networks with correlated node mobility , 2010, The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010).

[36]  Boleslaw K. Szymanski,et al.  Cost Efficient Erasure Coding Based Routing in Delay Tolerant Networks , 2010, 2010 IEEE International Conference on Communications.

[37]  B. Szymanski,et al.  Cost Effective Multi-Period Spraying for Routing in Delay Tolerant Networks , 2012 .

[38]  Arun Venkataramani,et al.  Replication Routing in DTNs: A Resource Allocation Approach , 2010, IEEE/ACM Transactions on Networking.

[39]  Jie Wu,et al.  On Multicopy Opportunistic Forwarding Protocols in Nondeterministic Delay Tolerant Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[40]  Boleslaw K. Szymanski,et al.  Grammatical Inference for Modeling Mobility Patterns in Networks , 2013, IEEE Transactions on Mobile Computing.

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