Evaluating MobySpace-based routing strategies in delay-tolerant networks

Because a delay-tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and a large-scale evaluation of routing schemes using MobySpace by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visits of nodes to each possible location. We present simulation results for single-copy and multi-copy routing strategies that use MobySpace as a means to route bundles or to control flooding. We show that routing based on MobySpace can achieve good performance compared to a number of common algorithms.

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

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

[3]  Ravi Jain,et al.  Evaluating location predictors with extensive Wi-Fi mobility data , 2004, INFOCOM.

[4]  Ling-Jyh Chen,et al.  A hybrid routing approach for opportunistic networks , 2006, CHANTS '06.

[5]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.

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

[7]  Paul A. S. Ward,et al.  Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.

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

[9]  Chunming Qiao,et al.  On Profiling Mobility and Predicting Locations of Campus-Wide Wireless Network Users , 2005 .

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

[11]  James A. Davis,et al.  Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks , 2001, Proceedings Fifth International Symposium on Wearable Computers.

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

[13]  Kevin C. Almeroth,et al.  Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks , 2005, NETWORKING.

[14]  Jörg Widmer,et al.  Network coding for efficient communication in extreme networks , 2005, WDTN '05.

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

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

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

[18]  Maria Udén,et al.  Providing connectivity to the Saami nomadic community , 2002 .

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

[20]  Chris Lonvick,et al.  The BSD Syslog Protocol , 2001, RFC.

[21]  Magdalena Balazinska,et al.  Characterizing mobility and network usage in a corporate wireless local-area network , 2003, MobiSys '03.

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

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

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