On the Role of Mobility for Multi-message Gossip
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews

TL;DR
This paper investigates how limited user mobility in wireless networks affects the efficiency of multi-message dissemination, proposing a strategy that nearly achieves optimal spreading rates with constrained mobility.
Contribution
It introduces a two-stage dissemination strategy that leverages partial mobility to approach optimal spreading rates in large wireless networks.
Findings
Random push is significantly slower than optimal in static networks.
Partial mobility with sufficient velocity enables near-optimal dissemination.
The proposed scheme achieves a logarithmic gap to the optimal spreading rate.
Abstract
We consider information dissemination in a large -user wireless network in which users wish to share a unique message with all other users. Each of the users only has knowledge of its own contents and state information; this corresponds to a one-sided push-only scenario. The goal is to disseminate all messages efficiently, hopefully achieving an order-optimal spreading rate over unicast wireless random networks. First, we show that a random-push strategy -- where a user sends its own or a received packet at random -- is order-wise suboptimal in a random geometric graph: specifically, times slower than optimal spreading. It is known that this gap can be closed if each user has "full" mobility, since this effectively creates a complete graph. We instead consider velocity-constrained mobility where at each time slot the user moves locally using a discrete…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
