Routing in intermittent network topologies

Authors:
Padma Mundur;Sookyoung Lee;Matthew Seligman
Affiliations:
University of Maryland, Baltimore County, MD;University of Maryland, Baltimore County, MD;Laboratory for Telecommunication Sciences, College Park, MD
Venue:
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Year:
2006

Citing 5
Cited 1

A message ferrying approach for data delivery in sparse mobile ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in a delay tolerant network

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks

WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Alternative custodians for congestion control in delay tolerant networks

Proceedings of the 2006 SIGCOMM workshop on Challenged networks

Universal scheme improving probabilistic routing in delay-tolerant networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The topic of this paper is the algorithmic development of routing techniques for Delay Tolerant Networks (DTNs). Assuming a store and forward type of network transfers, our main objective in designing routing algorithms is to minimize the delay and maximize delivery subject to storage constraints on intermediate nodes connected by intermittent links. We present a novel modification to the breadth-first search algorithm to find the quickest route between a given source and any destination node in a delay-tolerant network. This is done without flooding the network - at any one time we maintain only one copy of the message in the network. We implement the proposed routing algorithm in NS2 and present an extensive performance analysis using metrics such as delivery ratio, incomplete transfers with no routes and dropped messages.