Wireless Broadcast Gossip for Decentralized Drone Swarms: Success Probability, Contraction, and Optimal Aloha

Abstract

We study a tractable baseline for average-preserving broadcast gossip in decentralized drone swarms under a quasi-static planar Poisson model and a matching-based abstraction. With slotted Aloha, Rayleigh fading, and threshold decoding, we derive: 1) a closed-form SIR success law; 2) a mean-square contraction bound that separates ideal mixing from wireless successful updates via a conservative lower bound; and 3) a closed-form proxy access rule with interpretable density scaling. Explicit-interference simulations, together with robustness checks for receiver selection, noise, fading, and spatial regularity, confirm a stable intermediate operating region for the Aloha probability.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…