SIAM Review
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
From battlefields to urban grids: New research challenges in ad hoc wireless networks
Pervasive and Mobile Computing
Discrete Applied Mathematics
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Infection spread in wireless networks with random and adversarial node mobilities
Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Opportunistic spatial gossip over mobile social networks
Proceedings of the first workshop on Online social networks
Vehicular Networks: From Theory to Practice
Vehicular Networks: From Theory to Practice
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
Tight Bounds for the Cover Time of Multiple Random Walks
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Information spreading in stationary Markovian evolving graphs
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing
Multiple Random Walks in Random Regular Graphs
SIAM Journal on Discrete Mathematics
Mobile geometric graphs: detection, coverage and percolation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Viral processes by random walks on random regular graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
Opportunistic MANETs: mobility can make up for low transmission power
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
| Hi-index | 0.00 |
Motivated by the growing interest in mobile systems, we study the dynamics of information dissemination between agents moving independently on a plane. Formally, we consider k mobile agents performing independent random walks on an n-node grid. At time 0, each agent is located at a random node of the grid and one agent has a rumor. The spread of the rumor is governed by a dynamic communication graph process {Gt(r)|t ≥ 0}, where two agents are connected by an edge in Gt(r) iff their distance at time t is within their transmission radius r. Modeling the physical reality that the speed of radio transmission is much faster than the motion of the agents, we assume that the rumor can travel throughout a connected component of Gt before the graph is altered by the motion. We study the broadcast time TB of the system, which is the time it takes for all agents to know the rumor. We focus on the sparse case (below the percolation point rc ≈ √n/k) where, with high probability, no connected component in Gt has more than a logarithmic number of agents and the broadcast time is dominated by the time it takes for many independent random walks to meet one other. Quite surprisingly, we show that for a system below the percolation point, the broadcast time does not depend on the transmission radius. In fact, we prove that TB = Θ(n/√k) for any 0 ≤ r rc, even when the transmission range is significantly larger than the mobility range in one step, giving a tight characterization up to logarithmic factors. Our result complements a recent result of Peres et al. (SODA 2011) who showed that above the percolation point the broadcast time is polylogarithmic in k.