MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks
Top Cited Papers
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 1-11
- https://doi.org/10.1109/infocom.2006.228
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- Multicasting in delay tolerant networksPublished by Association for Computing Machinery (ACM) ,2005
- Experimental evaluation of wireless simulation assumptionsPublished by Association for Computing Machinery (ACM) ,2004
- Routing in a delay tolerant networkACM SIGCOMM Computer Communication Review, 2004
- DakNet: rethinking connectivity in developing nationsComputer, 2004
- Message ferrying: Proactive routing in highly-partitioned wireless ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Locating nodes with EASE: last encounter routing in ad hoc networks through mobility diffusionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Probabilistic Routing in Intermittently Connected NetworksPublished by Springer Nature ,2004
- Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Energy-efficient computing for wildlife trackingACM SIGOPS Operating Systems Review, 2002
- Network News Transfer ProtocolPublished by RFC Editor ,1986