Book ChapterDOI
Impact of persistent storage on the DTN routing performance
V. Mahendran,Thammana Praveen,C. Siva Ram Murthy +2 more
- pp 513-524
TLDR
This paper proposes 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.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.read more
Citations
More filters
Journal ArticleDOI
Performance Modeling of Delay-Tolerant Network Routing via Queueing Petri Nets
TL;DR: It is found that the model accurately captures the behavior of a DTN in numerous realistic scenarios, showing the efficacy of QPNs as a suitable analytical framework for evaluating DTNs.
Proceedings ArticleDOI
Performance modeling of Delay Tolerant Network routing via Queueing Petri Nets
TL;DR: This paper develops QPN models for DTNs of increasing complexity in an incremental fashion and finds that the model accurately captures the behavior of a DTN in numerous realistic scenarios, showing the efficacy of QPNs as a suitable modeling framework for evaluating the DTN routing protocols.
Journal ArticleDOI
On storage dynamics of space delay/disruption tolerant network node
TL;DR: An analytical framework based on two-dimension Markov chain is proposed to evaluate the behaviors of bundles delivery in DTN intermediate nodes and results indicate that Dividing the source files into bigger bundles for transmission causes a longer storage-occupancy time on intermediary nodes and the transmission success probability of a bundle is more dependent on a DTN bundle size than on a LTP segment size.
Book ChapterDOI
Performance Analysis of DTN Routing Protocol for Vehicular Sensor Networks
TL;DR: Performance of two routing protocols, namely MaxProp and packet-oriented routing (POR), are analysed and compared on the basis of different parameters and both the protocols are simulated on MATLAB.
Proceedings ArticleDOI
A pragmatic node based DTN performance modeling
TL;DR: This PhD research focuses on the DTN performance modeling with a pragmatic node abstraction and the practical bi-level hierarchical storage structure and the latest wireless technologies such as MIMO in the mobile phones, exemplify the oversimplified nature of the existing node abstraction.
References
More filters
Epidemic routing for partially-connected ad hoc networks
TL;DR: This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
Proceedings ArticleDOI
A delay-tolerant network architecture for challenged internets
TL;DR: This work proposes a network architecture and application interface structured around optionally-reliable asynchronous message forwarding, with limited expectations of end-to-end connectivity and node resources.
Proceedings ArticleDOI
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
TL;DR: A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.
Delay-Tolerant Networking Architecture
Kevin Fall,Keith Scott,Scott Burleigh,Leigh Torgerson,Adrian J. Hooke,Howard Weiss,Robert C. Durst,Vinton G. Cerf +7 more
TL;DR: This document describes an architecture that addresses a variety of problems with internetworks having operational and performance characteristics that make conventional (Internet-like) networking approaches either unworkable or impractical.
Journal ArticleDOI
Stochastic properties of the random waypoint mobility model
TL;DR: The random waypoint model is a commonly used mobility model for simulations of wireless communication networks and some of its fundamental stochastic properties are investigated, including the transition length and time of a mobile node between two waypoints, the spatial distribution of nodes, and the direction angle at the beginning of a movement transition.