Gossip in a Smartphone Peer-to-Peer Network
Calvin Newport

TL;DR
This paper investigates gossip algorithms in a mobile peer-to-peer network model tailored for smartphones, analyzing their efficiency under dynamic topologies and limited communication, and introduces new algorithms with proven performance bounds.
Contribution
It introduces and analyzes new randomized gossip algorithms for the mobile telephone model, including solutions with and without shared randomness, and improves understanding of gossip in dynamic and stable networks.
Findings
Significant time complexity gap based on bit advertisement capability.
Two solutions for 1-bit advertisement: shared randomness and pseudorandomness generator.
Enhanced gossip algorithm performance in stable network topologies.
Abstract
In this paper, we study the fundamental problem of gossip in the mobile telephone model: a recently introduced variation of the classical telephone model modified to better describe the local peer-to-peer communication services implemented in many popular smartphone operating systems. In more detail, the mobile telephone model differs from the classical telephone model in three ways: (1) each device can participate in at most one connection per round; (2) the network topology can undergo a parameterized rate of change; and (3) devices can advertise a parameterized number of bits about their state to their neighbors in each round before connection attempts are initiated. We begin by describing and analyzing new randomized gossip algorithms in this model under the harsh assumption of a network topology that can change completely in every round. We prove a significant time complexity gap…
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.
Taxonomy
TopicsOpportunistic and Delay-Tolerant Networks · Complex Network Analysis Techniques · Caching and Content Delivery
