MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks

DMCA

MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by John Burgess , Brian Gallagher , David Jensen , Brian Neil Levine

Venue:	In Proc. IEEE INFOCOM
Citations:	488 - 12 self

Citations

654	Probabilistic routing in intermittently connected networks,” - Lindgren, Doria, et al. - 2003 (Show Context) Citation Context ...n-first-out (FIFO) queues [13]. Our Drop Least Encountered (DLE) algorithm [2] proposed dropping messages with the lowest likelihood of delivery, and other papers have followed on this idea [1], [3], =-=[9]-=-, [12]. All of these algorithms approximate delivery probability as the likelihood of a delivery path existing. Others have taken a more proactive approach to routing in DTNs, made possible by stronge...
621	Routing in a delay tolerant network,” - Jain, Fall, et al. - 2004 (Show Context) Citation Context ...oactive approach to routing in DTNs, made possible by stronger assumptions such as knowledge of geographic location, prior knowledge of connectivity patterns, and control over peer movement [1], [3], =-=[4]-=-, [8], [12], [16], [17], [18], [19], [10], [15]. A few similar deployments have been created for DTN research. Many projects have been focused on bringing Internet connectivity to developing and rural...
498	A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks,” in - Zhao, Ammar, et al. - 2004 (Show Context) Citation Context ...uting in DTNs, made possible by stronger assumptions such as knowledge of geographic location, prior knowledge of connectivity patterns, and control over peer movement [1], [3], [4], [8], [12], [16], =-=[17]-=-, [18], [19], [10], [15]. A few similar deployments have been created for DTN research. Many projects have been focused on bringing Internet connectivity to developing and rural communities. DakNet in...
358	Epidemic Routing for Partiallyconnected Ad Hoc Networks - Vahdat, Becker (Show Context) Citation Context ...messages to forward during a meeting with a given peer and which messages to drop when buffers reach capacity. One epidemic routing algorithm manages finite buffers as firstin-first-out (FIFO) queues =-=[13]-=-. Our Drop Least Encountered (DLE) algorithm [2] proposed dropping messages with the lowest likelihood of delivery, and other papers have followed on this idea [1], [3], [9], [12]. All of these algori...
260	Experimental evaluation of wireless simulation assumptions - Kotz, Newport, et al. (Show Context) Citation Context ...t and communication patterns of peers is likely to affect the relative performance of protocols. In fact, mobility research to date has been criticized for having too many oversimplifying assumptions =-=[7]-=-. We have constructed a DTN testbed composed of 30 buses operated by the UMass Amherst branch of the Pioneer Valley Transport Authority (PVTA) that we have fitted with a custom package of off-the-shel...
242	DakNet: Rethinking Connectivity in Developing Nations, - Pentland, Fletcher, et al. - 2004 (Show Context) Citation Context ...9], [10], [15]. A few similar deployments have been created for DTN research. Many projects have been focused on bringing Internet connectivity to developing and rural communities. DakNet in Calcutta =-=[11]-=- and the Wizzy Digital Courier in South Africa [14] are two examples. Zebranet [5] provided sensor collection and routing for a herd of zebras and is perhaps the closest work to ours. III. THE MAXPROP...
164	Sending messages to mobile users in disconnected ad-hoc wireless networks. - Li, Rus - 2000 (Show Context) Citation Context ...ve approach to routing in DTNs, made possible by stronger assumptions such as knowledge of geographic location, prior knowledge of connectivity patterns, and control over peer movement [1], [3], [4], =-=[8]-=-, [12], [16], [17], [18], [19], [10], [15]. A few similar deployments have been created for DTN research. Many projects have been focused on bringing Internet connectivity to developing and rural comm...
154	MV routing and capacity building in disruption tolerant networks, - Burns, Brock, et al. - 2005 (Show Context) Citation Context ...ficantly better than previous approaches. Our protocol addresses scenarios in which either transfer duration or storage is a limited resource in the network. MaxProp extends our previous routing work =-=[1]-=- to address several problems that we have observed in our real network topology. Existing approaches have a bias towards short-distance destinations, which MaxProp addresses by using hop counts in pac...
145	Controlling the mobility of multiple data transport ferries in a delay-tolerant network. In - Zhao, Ammar, et al. - 2005 (Show Context) Citation Context ...in DTNs, made possible by stronger assumptions such as knowledge of geographic location, prior knowledge of connectivity patterns, and control over peer movement [1], [3], [4], [8], [12], [16], [17], =-=[18]-=-, [19], [10], [15]. A few similar deployments have been created for DTN research. Many projects have been focused on bringing Internet connectivity to developing and rural communities. DakNet in Calcu...
120	Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks. - Zhao, Ammar - 2003 (Show Context) Citation Context ... to routing in DTNs, made possible by stronger assumptions such as knowledge of geographic location, prior knowledge of connectivity patterns, and control over peer movement [1], [3], [4], [8], [12], =-=[16]-=-, [17], [18], [19], [10], [15]. A few similar deployments have been created for DTN research. Many projects have been focused on bringing Internet connectivity to developing and rural communities. Dak...
117	Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks. - Davis, Fagg, et al. - 2001
28	et al. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet - Juang - 2002 (Show Context) Citation Context ...projects have been focused on bringing Internet connectivity to developing and rural communities. DakNet in Calcutta [11] and the Wizzy Digital Courier in South Africa [14] are two examples. Zebranet =-=[5]-=- provided sensor collection and routing for a herd of zebras and is perhaps the closest work to ours. III. THE MAXPROP PROTOCOL In this section, we present our assumptions, and we detail the protocol ...
10	Last encounter routing under random waypoint mobility - Sarafijanovic-Djukic, Grossglauser - 2004 (Show Context) Citation Context ...st-out (FIFO) queues [13]. Our Drop Least Encountered (DLE) algorithm [2] proposed dropping messages with the lowest likelihood of delivery, and other papers have followed on this idea [1], [3], [9], =-=[12]-=-. All of these algorithms approximate delivery probability as the likelihood of a delivery path existing. Others have taken a more proactive approach to routing in DTNs, made possible by stronger assu...
6	Ferry replacement protocols in sparse manet message ferrying systems. - Yang, Chen, et al. - 2004 (Show Context) Citation Context ...ible by stronger assumptions such as knowledge of geographic location, prior knowledge of connectivity patterns, and control over peer movement [1], [3], [4], [8], [12], [16], [17], [18], [19], [10], =-=[15]-=-. A few similar deployments have been created for DTN research. Many projects have been focused on bringing Internet connectivity to developing and rural communities. DakNet in Calcutta [11] and the W...
5	Space-time routing in wireless networks with predictable mobility - Merugu, Ammar, et al. - 2004 (Show Context) Citation Context ...e possible by stronger assumptions such as knowledge of geographic location, prior knowledge of connectivity patterns, and control over peer movement [1], [3], [4], [8], [12], [16], [17], [18], [19], =-=[10]-=-, [15]. A few similar deployments have been created for DTN research. Many projects have been focused on bringing Internet connectivity to developing and rural communities. DakNet in Calcutta [11] and...
3	Locating Peers With Ease: Mobility Diffusion Of Last Encounters - Grossglauser, Vetterli - 2003 (Show Context) Citation Context ...irstin-first-out (FIFO) queues [13]. Our Drop Least Encountered (DLE) algorithm [2] proposed dropping messages with the lowest likelihood of delivery, and other papers have followed on this idea [1], =-=[3]-=-, [9], [12]. All of these algorithms approximate delivery probability as the likelihood of a delivery path existing. Others have taken a more proactive approach to routing in DTNs, made possible by st...
2	Multicast routing in delay tolerant networks: Semantic models and routing algorithms - Zhao, Ammar, et al. - 2005 (Show Context) Citation Context ...s, made possible by stronger assumptions such as knowledge of geographic location, prior knowledge of connectivity patterns, and control over peer movement [1], [3], [4], [8], [12], [16], [17], [18], =-=[19]-=-, [10], [15]. A few similar deployments have been created for DTN research. Many projects have been focused on bringing Internet connectivity to developing and rural communities. DakNet in Calcutta [1...