MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks

Disruption-tolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little information about the state of the partitioned network and transfer opportunities between peers are of limited duration. In this paper, we propose MaxProp, a protocol for effective routing of DTN messages. MaxProp is based on prioritizing both the schedule of packets transmitted to other peers and the schedule of packets to be dropped. These priorities are based on the path likelihoods to peers according to historical data and also on several complementary mechanisms, including acknowledgments, a head-start for new packets, and lists of previous intermediaries. Our evaluations show that MaxProp performs better than protocols that have access to an oracle that knows the schedule of meetings between peers. Our evaluations are based on 60 days of traces from a real DTN network we have deployed on 30 buses. Our network, called UMassDieselNet, serves a large geographic area between five colleges. We also evaluate MaxProp on simulated topologies and show it performs well in a wide variety of DTN environments.

[1]  Mostafa H. Ammar,et al.  Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[2]  Alex Pentland,et al.  DakNet: rethinking connectivity in developing nations , 2004, Computer.

[3]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[4]  Martin Vetterli,et al.  Locating Nodes with EASE: Mobility Diffusion of Last Encounters in Ad Hoc Networks , 2003, INFOCOM.

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

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

[7]  Matthias Grossglauser,et al.  Last Encounter Routing under Random Waypoint Mobility , 2004, NETWORKING.

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

[9]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[10]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

[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]  Martin Vetterli,et al.  Locating nodes with EASE: last encounter routing in ad hoc networks through mobility diffusion , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[14]  Mostafa Ammar,et al.  Multicasting in delay tolerant networks: semantic models and routing algorithms , 2005, WDTN '05.

[15]  Jason Liu,et al.  Experimental evaluation of wireless simulation assumptions , 2004, MSWiM '04.

[16]  Mostafa H. Ammar,et al.  Ferry replacement protocols in sparse MANET message ferrying systems , 2005, IEEE Wireless Communications and Networking Conference, 2005.