Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
A community based mobility model for ad hoc network research
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
A hybrid routing approach for opportunistic networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Routing in intermittent network topologies
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
The Impact of the Mobility Model on Delay Tolerant Networking Performance Analysis
ANSS '07 Proceedings of the 40th Annual Simulation Symposium
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Contact-based buffering for delay-tolerant ad hoc broadcasting
Computer Communications
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
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
NECTAR: a DTN routing protocol based on neighborhood contact history
Proceedings of the 2009 ACM symposium on Applied Computing
E-PROPHET: a novel routing protocol for intermittently connected wireless networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Deep-Space Transport Protocol: A novel transport scheme for Space DTNs
Computer Communications
The design and implementation of a session layer for delay-tolerant networks
Computer Communications
FFRDV: fastest-ferry routing in DTN-enabled vehicular ad hoc networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 2
Optimal energy-aware epidemic routing in DTNs
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Hi-index | 0.24 |
Many application protocols designed for the Internet architecture cannot operate well in challenged network environments. The communication in a delay-tolerant networking architecture, which is characterized by very long delay paths and frequent network partitions, basically relies on asynchronous, store-carry-forward message delivery. In most of the existing probabilistic routing approaches, messages are promptly forwarded to nodes that have higher delivery predictability values. We find that it is wise to wait till much better opportunities arise to minimize the communication cost without degrading the delivery ratio and latency. In this paper, a universal scheme, named E-Scheme, is proposed to improve most of the existing routing approaches based on the ''probability to deliver'' metrics. Providing that there are n opportunities, E-Scheme lets the first k opportunities go by (except when the node encounters the destination of the messages) and accepts the opportunities which are better than all of the k ones. We demonstrate that when k equals (n-1)/e or (n-1)(n-2)/e, where e is the mathematical constant, E-Scheme improves performance of existing probabilistic routing approaches in single-copy and 2-copy scenarios, respectively. The performance of E-Scheme has been evaluated in personal delay-tolerant networks in both single-copy and 2-copy situation.