Analytical depoissonization and its applications
Theoretical Computer Science
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Performance modeling of epidemic routing
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
On the connectivity of dynamic random geometric graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the latency for information dissemination in mobile wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Analytic Combinatorics
IEEE Communications Surveys & Tutorials
The capacity of wireless networks
IEEE Transactions on Information Theory
Local data gathering using opportunistic networking in a urban scenario
Proceedings of the 8th ACM Symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Information spreading in dynamic graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the exploration of time-varying networks
Theoretical Computer Science
Opportunistic MANETs: mobility can make up for low transmission power
IEEE/ACM Transactions on Networking (TON)
On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks
Wireless Personal Communications: An International Journal
Resource-aware capacity evaluation for heterogeneous, disruption-tolerant networks
Proceedings of the 9th Asian Internet Engineering Conference
Optimal Routing Control in Delay Tolerant Networks with Time-Varying Fees
Wireless Personal Communications: An International Journal
Modeling message diffusion in epidemical DTN
Ad Hoc Networks
| Hi-index | 754.84 |
The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multihop paths may not exist and communication routes may only be available through time and mobility. We use analytical tools to derive generic theoretical upper bounds for the information propagation speed in large scale mobile and intermittently connected networks. In other words, we upper-bound the optimal performance, in terms of delay, that can be achieved using any routing algorithm. We then show how our analysis can be applied to specific mobility models to obtain specific analytical estimates. In particular, in 2-D networks, when nodes move at a maximum speed v and their density ν is small (the network is sparse and asymptotically almost surely disconnected), we prove that the information propagation speed is upper bounded by (1 + O(ν2))v in random waypoint-like models, while it is upper bounded by O(√νvv for other mobility models (random walk, Brownian motion). We also present simulations that confirm the validity of the bounds in these scenarios. Finally, we generalize our results to 1-D and 3-D networks.