Impact of persistent storage on the DTN routing performance

Authors:
Veeramani Mahendran;Thammana Praveen;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'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Year:
2012

Citing 7
Cited 0

A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Stochastic properties of the random waypoint mobility model

Wireless Networks
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Storage routing for DTN congestion control: Research Articles

Wireless Communications & Mobile Computing - Wireless Ad Hoc and Sensor Networks
An optimal joint scheduling and drop policy for Delay Tolerant Networks

WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Machine learning in disruption-tolerant MANETs

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Integrated buffer and route management in a DTN with message ferry

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The store, carry, and forward paradigm of the Delay- Tolerant Network (DTN) architecture enables a node to carry messages for a long period of time. This long-term storage is supported by the DTN architecture with the usage of persistent storage; however to the best of our knowledge, the routing/scheduling framework that incorporates support for persistent storage has not been addressed much in the DTN literature. In this paper, we investigate the impact of persistent storage on the routing performance over different buffer scheduling policies. Our extensive simulation studies demonstrate that they exhibit an improvement in delivery ratio, but with a compromise on delivery delay. This shows the pressing need for a new scheduling policy to tap the complete potential of the persistent storage. To this end, we propose a Time in Primary Scheduling (TiPS) policy with two variants (one using local information and the other using global information) that outperforms the contemporary buffer scheduling policies with respect to the persistent storage framework.