Journal of Computer and System Sciences
SIAM Journal on Computing
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
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
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
The random trip model: stability, stationary regime, and perfect simulation
IEEE/ACM Transactions on Networking (TON)
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
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
Fast and energy efficient sensor data collection by multiple mobile sinks
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
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
Adaptive redundancy for data propagation exploiting dynamic sensory mobility
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
MANETS: High Mobility Can Make Up for Low Transmission Power
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Information spreading in stationary Markovian evolving graphs
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Information propagation speed in mobile and delay tolerant networks
IEEE Transactions on Information Theory
Editorial: Special section on Mobile Opportunistic Networking
Pervasive and Mobile Computing
Tight bounds on information dissemination in sparse mobile networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Information Spreading in Stationary Markovian Evolving Graphs
IEEE Transactions on Parallel and Distributed Systems
Mobile geometric graphs: detection, coverage and percolation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Opportunistic mobile ad hoc networks (MANETs) are a special class of sparse and disconnected MANETs where data communication exploits sporadic contact opportunities among nodes. We consider opportunistic MANETs where nodes move independently at random over a square of the plane. Nodes exchange data if they are at a distance at most r within each other, where r O is the node transmission radius. The flooding time is the number of time-steps required to broadcast a message from a source node to every node of the network. Flooding time is an important measure of how fast information can spread in dynamic networks. We derive the first upper bound on the flooding time, which is a decreasing function of the maximal speed of the nodes. The bound holds with high probability, and it is nearly tight. Our bound shows that, thanks to node mobility, even when the network is sparse and disconnected, information spreading can be fast.