Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
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
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
Characterizing pairwise inter-contact patterns in delay tolerant networks
Proceedings of the 1st international conference on Autonomic computing and communication systems
Stationary Distributions for the Random Waypoint Mobility Model
IEEE Transactions on Mobile Computing
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
DTN support for news dissemination in an urban area
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
DTN support for news dissemination in an urban area
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
We consider disruption tolerant networks (DTN) in which mobile nodes are wireless devices carried by humans. Mobile users subscribe to a content distribution service and share their contents if they share the same interests. We assume that we know the probability of the event that a node subscribes to a content and the distribution of inter-contact times. We investigate both closed-form expressions and asymptotic approximations of the expected message delay and the number of copies of the message at the time the message is delivered. The analytical results are validated through simulation under a number of mobility models (the random waypoint, random direction and the random walker mobility models).