Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Middleware extensions that trade consistency for availability
Concurrency and Computation: Practice & Experience
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
Performance Evaluation
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
A framework for characterizing the wireless and mobile network continuum
ACM SIGCOMM Computer Communication Review
Analysing delay-tolerant networks with correlated mobility
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
| Hi-index | 0.00 |
Worst-case latency is an important characteristic of information dissemination protocols. However, in sparse mobile ad hoc networks where end-to-end connectivity cannot be achieved and store-carry-forward algorithms are needed, such worst-case analyses have not been possible to perform on real mobility traces due to lack of suitable models. We propose a new metric called delay expansion that reflects connectivity and reachability properties of intermittently connected networks. Using the delay expansion, we show how bounds on worst-case latency can be derived for a general class of broadcast protocols and a wide range of real mobility patterns. The paper includes theoretical results that show how worst-case latency can be related with delay expansion for a given mobility scenario, as well as simulations to validate the theoretical model.