A realistic framework for delay-tolerant network routing in open terrains with continuous churn

Authors:
Veeramani Mahendran;Sivaraman K. Anirudh;C. Siva Ram Murthy
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India;Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India;Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India
Venue:
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Year:
2011

Citing 8
Cited 0

A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Characterizing mobility and network usage in a corporate wireless local-area network

Proceedings of the 1st international conference on Mobile systems, applications and services
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Performance analysis of mobility-assisted routing

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Analysis of random mobility models with PDE's

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A mobility model for pedestrian content distribution

Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations

IEEE Transactions on Mobile Computing
DTN: an architectural retrospective

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The conventional analysis of Delay-Tolerant Network (DTN) routing assumes that the terrain over which nodes move is closed implying that when the nodes hit a boundary, they either wrap around or get reflected. In this work, we study the effect of relaxing this closed terrain assumption on the routing performance, where a continuous stream of nodes enter the terrain and get absorbed upon hitting the boundary. We introduce a realistic framework that models the open terrain as a queue and compares performance with the closed terrain for a variety of routing protocols. With three different mobility scenarios and four different routing protocols, our simulation shows that the routing delays in an open terrain are statistically equivalent to those in closed terrains for all routing protocols. However, in terms of cost some protocols differ widely in two cases while some continue to demonstrate the statistical equivalence. We believe that this could be a new way to classify routing protocols based on the difference in their behavior under churn.