Sciweavers

Share
MSWIM
2006
ACM

Routing in intermittent network topologies

9 years 2 months ago
Routing in intermittent network topologies
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. Categories and Subject Descriptors C.2.1 [Network Architecture and Design]: Network Topology, Store and Forward Networks, Routing Algorithms General Terms Algor...
Padma Mundur, Sookyoung Lee, Matthew Seligman
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where MSWIM
Authors Padma Mundur, Sookyoung Lee, Matthew Seligman
Comments (0)
books