Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
Proceedings of the 7th International Workshop on Security Protocols
Mobility helps security in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Effect of node mobility on highway mobile infostation networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Locating mobile nodes with EASE: learning efficient routes from encounter histories alone
IEEE/ACM Transactions on Networking (TON)
Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN)
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Performance of ad hoc networks with two-hop relay routing and limited packet lifetime
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
An Agenda Based Mobility Model21
ANSS '06 Proceedings of the 39th annual Symposium on Simulation
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Impact of mobility on the performance of relaying in ad hoc networks - Extended version
Computer Networks: The International Journal of Computer and Telecommunications Networking
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Mining behavioral groups in large wireless LANs
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
| Hi-index | 0.00 |
In delay-tolerant networks (DTN), nodes explore various opportunities to connect and communicate with each other. A series of encounters of different nodes will create such opportunities and spread a message among many nodes and eventually deliver to the designated destination. We study one common DTN scenario where the message exchanges happen when nodes meet others at certain locations. In this situation, the success of message delivery and the quality of the delivery depend highly on the likeliness of nodes' encounters and time elapsed between encounters. We study two important qualities of service requirements: the probability of two nodes meeting each other (encounter probability) and the time it takes for two nodes to meet (encounter delay). The key considerations are how nodes pick their next locations (mobility patterns) and the features of the dwell time. In this paper, we will study several mobility patterns, including random movement, and activity agenda based movement. We also study an additional message delivery constraint, i.e., a message will be dropped if not delivered within a limited number of locations visited. We develop mathematical formulas using Markov chain as a main tool. Our work is presented as an illustration through case studies. The methodology applies to mobility models alike and is extendable to real trace analysis. We present numerical results when closed form formulas cannot be acquired. Our results help the management of message delivery for DTN, e.g., in selecting a proper time-to-live threshold for a message.