Routing for data delivery in dynamic networks

Authors:
Padma Mundur;Sookyoung Lee;Matthew Seligman
Affiliations:
Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, Hilltop Circle, MD;Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, Hilltop Circle, MD;Laboratory for Telecommunication Sciences, College Park, MD
Venue:
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Year:
2006

Citing 8
Cited 2

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Communication in disconnected ad hoc networks using message relay

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
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

Analytical evaluation of average delay and maximum stable throughput along a typical two-way street for vehicular ad hoc networks in sparse situations

Computer Communications
Buffer aware routing in interplanetary ad hoc network

COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a routing algorithm for a class of dynamic networks called the Delay Tolerant Networks (DTNs). The proposed algorithm takes into account the quintessential DTN characteristic namely, intermittent link connectivity. Assuming a store and forward type of network transfers, our main objective in designing routing algorithms for such an environment is to maximize the number of delivered messages subject to storage constraints on intermediate nodes. We modify the simple breadth first search (BFS) algorithm to take into account link activation/deactivation and find the quickest route possible between source and destination nodes. We adopt a message drop policy at intermediate nodes to incorporate storage constraint into data delivery. We also introduce the idea of storage domain where a few connected nodes act as a single storage unit by sharing the aggregated storage capacity of the nodes in the domain. We evaluate the routing algorithm with and without storage domain in an extensive simulation for two types of network topologies - flat and layered. 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. The most significant simulation result shows that routing with storage domain mitigates the storage bottleneck at a gateway node for a layered network topology. For instance, the delivery ratio for storage capacity of 10 with storage domain surpasses the delivery ratio for storage capacity of 20 without storage domain.