The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2011 vol.10)
pp: 1755-1768
Pierre-Ugo Tournoux , AAS/CNRS, Toulouse
Jérémie Leguay , Thales Communications, Colombes
Farid Benbadis , Thales Communications, Colombes
John Whitbeck , UPMC Sorbonne Universités, France
Vania Conan , Thales Communications, Colombes
Marcelo Dias de Amorim , UPMC Sorbonne Universités, France
ABSTRACT
We analyze the dynamics of a mobility data set collected in a pipelined disruption-tolerant network (DTN), a particular class of intermittently-connected wireless networks characterized by a 1-D topology. First, we collected and investigated traces of contact times among thousands of participants of a rollerblading tour in Paris. The data set 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 conclude 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 to be disseminated in the network. The particularity of DA-SW is that it relies on a set of abaci that represents the three phases of the accordion phenomenon: aggregation, expansion, and stabilization. We show that DA-SW leads to performance results that are close to the best case (obtained with an oracle).
INDEX TERMS
Delay-tolerant networking, mobility traces, opportunistic networking, routing.
CITATION
Pierre-Ugo Tournoux, Jérémie Leguay, Farid Benbadis, John Whitbeck, Vania Conan, Marcelo Dias de Amorim, "Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case", IEEE Transactions on Mobile Computing, vol.10, no. 12, pp. 1755-1768, December 2011, doi:10.1109/TMC.2010.247
REFERENCES
[1] P.-U. Tournoux, J. Leguay, F. Benbadis, V. Conan, M.D. de Amorim, and J. Whitbeck, “The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing,” Proc. IEEE INFOCOM, pp. 1116-1124, 2009.
[2] D. Johnson and D. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks. Kluwer Academic, vol. 353, 1996.
[3] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms,” Proc. IEEE INFOCOM, 2006.
[4] M. Kim, D. Kotz, and S. Kim, “Extracting a Mobility Model from Real User Traces,” Proc. IEEE INFOCOM, 2006.
[5] K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” Proc. ACM SIGCOMM, 2003.
[6] UMass DieselNet, “A Bus-Based Disruption Tolerant Network,” http://prisms.cs.umass.edu/domeumassdieselnet , 2009.
[7] X. Liu and A. Goldsmith, “Effects of Communication Delay on String Stability in Vehicle Platoons,” Proc. IEEE Intelligent Transportation Systems Conf. (ITSC '01), 2001.
[8] T. Spyropoulos, K. Psounis, and C. Raghavendra, “Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks,” Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN '05), 2005.
[9] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case,” IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 63-76, Feb. 2008.
[10] J. Whitbeck, M. Amorim, and V. Conan, “Plausible Mobility: Inferring Movement from Contacts,” Proc. ACM Int'l Workshop Mobile Opportunistic Networking (MobiOpp '10), 2010.
[11] S. Corson, Mobile Ad Hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations, IETF RFC 2501, pp. 1-13, Jan. 1999.
[12] “RollerNet: Analysis and Use of Mobility in Rollerblade Tours,” http://www-rp.lip6.frrollernet, 2011.
[13] B.S. Kerner, The Physics of Traffic, Empirical Freeway Pattern Features, Engineering Application, and Theory. Springer, 2004.
[14] J. Whitbeck, “Plausible Mobility,” http:/plausible.lip6.fr, 2009.
[15] T. Clausen and P. Jacquet, Optimized Link State Routing Protocol (OLSR), IETF RFC 3626, Oct. 2003.
[16] C. Perkins, E. Belding-Royer, and S. Das, Ad Hoc On-Demand Distance Vector (AODV) Routing, IETF RFC 3561, July 2003.
[17] V. Borrel, M.H. Ammar, and E.W. Zegura, “Understanding the Wireless and Mobile Network Space: A Routing-Centered Classification,” Proc. Second ACM Workshop Challenged Networks, 2007.
[18] W. Eadie, Statistical Methods in Experimental Physics. Elsevier Science Ltd., 1971.
[19] B. Bollobás, Random Graphs, second ed. Cambridge Univ., 2001.
[20] A. Keränen, J. Ott, and T. Kärkkäinen, “The ONE Simulator for DTN Protocol Evaluation,” Proc. Second Int'l Conf. Simulation Tools and Techniques (SIMUTools '09), 2009.
[21] N. Eagle and A. Pentland, “Reality Mining: Sensing Complex Social Systems,” Personal and Ubiquitous Computing, vol. 10, pp. 255-268, 2005.
[22] J. Burgess, B. Gallagher, D. Jensen, and B.N. Levine, “MaxProp: Routing for Vehicle-Based Disruption Tolerant Networking,” Proc. IEEE INFOCOM, 2006.
[23] J. Leguay, A. Lindgren, J. Scott, T. Friedman, and J. Crowcroft, “Opportunistic Content Distribution in an Urban Setting,” Proc. ACM Workshop Challenged Networks, 2006.
[24] T. Henderson, D. Kotz, and I. Abyzov, “The Changing Usage of a Mature Campus-Wide Wireless Network,” Proc. ACM MobiCom, 2004.
[25] M. Kim and D. Kotz, “Classifying the Mobility of Users and the Popularity of Access Points,” Proc. Int'l Workshop Location- and Context-Awareness (LoCA '05), vol. 3479, pp. 198-209, May 2005.
[26] J. Leguay, T. Friedman, and V. Conan, “Evaluating Mobility Pattern Space Routing for DTNs,” Proc. IEEE INFOCOM, 2006.
[27] C. Tuduce and T. Gross, “A Mobility Model Based on WLAN Traces and Its Validation,” Proc. IEEE INFOCOM, 2005.
[28] A. Lindgren, A. Doria, and O. Schelen, “Probabilistic Routing in Intermittently Connected Networks,” ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 3, July 2003.
[29] B. Burns, O. Brock, and B.N. Levine, “MV Routing and Capacity Building in Disruption Tolerant Networks,” Proc. IEEE INFOCOM, 2005.
[30] M.M.B. Tariq, M. Ammar, and E. Zegura, “Message Ferry Route Design for Sparse Ad Hoc Networks with Mobile Nodes,” Proc. ACM MobiHoc, 2006.
[31] J. Leguay and F. Benbadis, “CRAWDAD Data Set UPMC/RollerNet (v. 2009-02-02),” http://crawdad.cs.dartmouth.edu/upmcrollernet , 2011.
[32] P. Hui, J. Crowcroft, and E. Yoneki, “BUBBLE Rap: Social-Based Forwarding in Delay Tolerant Networks,” Proc. ACM MobiHoc, 2008.
[33] A. Balasubramanian, B.N. Levine, and A. Venkataramani, “DTN Routing as a Resource Allocation Problem,” Proc. ACM SIGCOMM, 2007.
[34] “Rollers & Coquillages,” http:/www.rollers-coquillages.org, 2011.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool