SIAM Journal on Computing
Power consumption in packet radio networks
Theoretical Computer Science
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
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
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
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
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
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
Information spreading in stationary Markovian evolving graphs
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
IEEE Communications Surveys & Tutorials
Modelling mobility: a discrete revolution
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Modelling mobility: A discrete revolution
Ad Hoc Networks
Tight bounds on information dissemination in sparse mobile networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Close-to-optimal energy balanced data propagation via limited, local network density information
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Parsimonious flooding in geometric random-walks
DISC'11 Proceedings of the 25th international conference on Distributed computing
Information dissemination via random walks in d-dimensional space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Mobile geometric graphs: detection, coverage and percolation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Spatial node distribution of manhattan path based random waypoint mobility models with applications
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Direction-based adaptive data propagation for heterogeneous sensor mobility
Journal of Parallel and Distributed Computing
Information spreading in dynamic graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Exploiting limited density information towards near-optimal energy balanced data propagation
Computer Communications
Opportunistic MANETs: mobility can make up for low transmission power
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We consider Mobile Ad-hoc NETworks (MANETs) formed by n nodes that move independently at random over a finite square region of the plane. Nodes exchange data if they are at distance at most r within each other, where r 0 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 the speed of information spreading in dynamic networks. We derive a nearly-tight upper bound on the flooding time which is a decreasing function of the maximal velocity of the nodes. It turns out that, when the node velocity is "sufficiently" high, even if the node transmission radius r is far below the connectivity threshold , the flooding time does not asymptotically depend on r . So, flooding can be very fast even though every snapshot (i.e. the static random geometric graph at any fixed time) of the MANET is fully disconnected. Our result is the first analytical evidence of the fact that high, random node mobility strongly speed-up information spreading and, at the same time, let nodes save energy .