E-Scheme in Delay-Tolerant Networks
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Analysis and design of mobile Wireless Social Model
Computer Communications
Evaluating the impact of an acknowledgment strategy for APRP
Proceedings of the 5th International Latin American Networking Conference
Performance analysis of the vehicular delay tolerant network
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
A markov routing algorithm for mobile DTNs based on spatio-temporal modeling of human movement data
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Universal scheme improving probabilistic routing in delay-tolerant networks
Computer Communications
| Hi-index | 0.00 |
Delay tolerant networks (DTNs) are a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes. The topological impairments experienced within a DTN pose unique challenges for designing effective DTN routing protocols. For an important class of DTNs nodes depend on their mobility to carry message to the destination. It is therefore essential to understand the impact of commonly-used mobility models on performance analysis of DTN routing schemes. This paper shows how the underlying statistical properties of a frequently used mobility model can be used to enhance our understanding of DTN simulation results. Using these results we also analyze several DTN routing techniques, including direct transmission, Spray and Wait, and a novel core-assisted routing schemes.