The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing

We analyze the dynamics of a mobility dataset collected in a pipelined disruption-tolerant network (DTN), a particular class of intermittently-connected wireless networks characterized by a one-dimensional topology. First, we collected and investigated traces of contact times among a thousand participants of a rollerblading tour in Paris. The dataset shows extreme dynamics in the mobility pattern of a large number of nodes. Most strikingly, fluctuations in the motion of the rollerbladers cause a typical accordion phenomenon - the topology expands and shrinks with time, thus influencing connection times and opportunities between participants. Second, we show through an analytical model that the accordion phenomenon, through the variation of the average node degree, has a major impact on the performance of epidemic dissemination. Finally, we test epidemic dissemination and other existing forwarding schemes on our traces, and argue that routing should adapt to the varying, though predictable, nature of the network. To this end, we propose DA-SW (density-aware spray-and-wait), a measurement-oriented variant of the spray-and-wait algorithm that tunes, in a dynamic fashion, the number of a message copies disseminated in the network. We show that DA-SW leads to performance results that are close to the best case (obtained with an oracle).

[1]  Tristan Henderson,et al.  CRAWDAD: a community resource for archiving wireless data at Dartmouth , 2005, CCRV.

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

[3]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

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

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

[6]  David Kotz,et al.  Classifying the Mobility of Users and the Popularity of Access Points , 2005, LoCA.

[7]  David Kotz,et al.  Extracting a Mobility Model from Real User Traces , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  Anders Lindgren,et al.  Opportunistic content distribution in an urban setting , 2006, CHANTS '06.

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

[10]  F. James.  Statistical Methods in Experimental Physics , 1973 .

[11]  Tristan Henderson,et al.  The changing usage of a mature campus-wide wireless network , 2008, Comput. Networks.

[12]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

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

[14]  Tristan Henderson,et al.  CRAWDAD: A Community Resource for Archiving Wireless Data at Dartmouth , 2005, IEEE Pervasive Comput..

[15]  Thomas R. Gross,et al.  A mobility model based on WLAN traces and its validation , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

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

[18]  Timur Friedman,et al.  Evaluating Mobility Pattern Space Routing for DTNs , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[20]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..