A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
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
Access and mobility of wireless PDA users
ACM SIGMOBILE Mobile Computing and Communications Review
Practical routing in delay-tolerant networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing in a mobility pattern space
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
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
Analysis and implications of student contact patterns derived from campus schedules
Proceedings of the 12th annual international conference on Mobile computing and networking
IEEE Communications Surveys & Tutorials
Mobility entropy and message routing in community-structured delay tolerant networks
Proceedings of the 4th Asian Conference on Internet Engineering
Message routing on potential-fields in forwarding-based DTNs
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
The movement of real users often follows some patterns that can be characterized by certain statistical metrics of the contacts. Such metrics are useful for nodes to make routing decisions, especially in sparse mobile ad hoc networks where instantaneous network connectivity is rare and messages are delivered using store-carry-forward routing. None of the statistical metrics used in existing routing algorithms considers the dependency between neighboring contacts, thus resulting in an inaccurate estimation of message delays over paths. In this paper, a new metric called the expected dependent delay that characterizes the expected delay of a contact dependent on the previous hop is proposed. With this new metric, the closed-form expression for the expected delay of a path is given and can be further simplified in highly partitioned mobile networks. Simulation results show that the proposed algorithm has a significant improvement in terms of the message delay than those that consider only the delivery probability or the expected delay.