arxiv: 2603.19379 · v2 · submitted 2026-03-19 · 💻 cs.IT · math.IT

Recognition: 2 theorem links

· Lean Theorem

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

Ali Khalesi

Authors on Pith no claims yet

Pith reviewed 2026-05-15 07:54 UTC · model grok-4.3

classification 💻 cs.IT math.IT

keywords drone swarmsbroadcast gossipslotted AlohaSIR success probabilitymean-square contractionPoisson point processwireless interference

0 comments

The pith

A closed-form SIR success law for Aloha broadcast gossip in drone swarms yields an optimal access probability with explicit density scaling.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper derives a closed-form expression for the probability that a wireless transmission succeeds under slotted Aloha, Rayleigh fading, and threshold decoding in a Poisson field of drones. It then uses this law to bound the mean-square contraction of the gossip process, separating the ideal mixing rate from the slower rate caused by failed updates. A sympathetic reader would care because the resulting proxy access rule gives a simple, interpretable way to choose the Aloha probability that keeps information mixing stable as swarm density changes.

Core claim

Under a quasi-static planar Poisson point process for drone locations and a matching-based abstraction for receiver selection, the signal-to-interference ratio success probability admits a closed-form expression in the Aloha probability, node density, and fading statistics. This expression produces a conservative mean-square contraction bound on the gossip iteration and a closed-form proxy rule for choosing the transmission probability that maintains stable mixing.

What carries the argument

The closed-form SIR success probability derived from the Laplace transform of Poisson interference under Rayleigh fading and threshold decoding, which directly enters the contraction analysis.

If this is right

The mean-square contraction bound separates ideal gossip mixing from the reduction caused by wireless failures and supplies a lower bound on convergence speed.
The closed-form proxy access rule scales the Aloha probability inversely with density to keep the operating point inside the stable region.
Simulations with explicit interference confirm that an intermediate Aloha probability remains robust when receiver selection, noise, fading, or spatial regularity deviate from the model.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same success-law approach could be tested on slowly moving swarms by treating each short time window as quasi-static.
The contraction bound might serve as a design tool for other wireless ad-hoc networks that rely on random access gossip.
Hardware experiments could quantify how much the Poisson assumption under- or over-estimates success rates when real drone placements are more regular.

Load-bearing premise

Drone positions follow a quasi-static planar Poisson point process and receiver selection can be captured by a matching-based abstraction.

What would settle it

Deploy a real drone swarm with measured positions, run slotted Aloha at the predicted optimal probability, and check whether the observed fraction of successful receptions matches the closed-form SIR law within the reported robustness margins.

read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives closed-form SIR success probability and a conservative contraction bound for Aloha gossip in drone swarms under a Poisson model, plus a density-scaled access rule, but the matching abstraction for receivers is the part that needs real-world checks.

read the letter

The main things here are the closed-form SIR success law under Rayleigh fading and slotted Aloha, the mean-square contraction bound that splits ideal mixing from wireless updates, and the proxy access rule that scales with density. These are presented as new for the drone-swarm setting and come with simulations that include explicit interference plus checks on noise, fading, and spatial regularity. That analytical effort is the useful part; it gives a tractable way to pick the Aloha probability without running full Monte Carlo every time. The contraction bound is conservative on purpose, which keeps the math clean but means the numbers are lower bounds rather than tight predictions. The soft spot is the quasi-static planar Poisson point process plus the matching-based receiver abstraction. This setup makes the derivations work but assumes deterministic pairing that does not react to instantaneous interference or local decisions. The robustness checks stay inside the same model, so they do not test whether a different receiver rule, like nearest-neighbor with CSI, would change the success probability expression. If real drone deployments use dynamic selection or faster movement, the closed forms would need adjustment. This paper is for people working on decentralized protocols in wireless sensor networks or robotic swarms who want analytical starting points for Aloha tuning. A reader focused on gossip or consensus under wireless constraints would get concrete expressions to build on. It deserves peer review because the derivations are explicit and the simulations support the intermediate operating region they identify, even if the modeling assumptions will draw questions.

Referee Report

2 major / 0 minor

Summary. The paper studies average-preserving broadcast gossip in decentralized drone swarms under a quasi-static planar Poisson point process model with a matching-based receiver abstraction and slotted Aloha. It derives (1) a closed-form SIR success probability law, (2) a mean-square contraction bound separating ideal mixing from wireless successful updates via a conservative lower bound, and (3) a closed-form proxy access rule for the Aloha transmit probability with interpretable density scaling. These are supported by explicit-interference simulations and robustness checks for noise, fading, and spatial regularity, identifying a stable intermediate Aloha operating region.

Significance. If the modeling assumptions hold, the closed-form derivations for SIR success and the contraction bound, together with the density-scaled Aloha proxy, provide useful analytical tools for designing wireless gossip protocols in drone swarms. The separation of ideal mixing from wireless updates and the provision of reproducible simulation checks with explicit interference are particular strengths that could inform practical parameter selection.

major comments (2)

[Abstract and modeling assumptions] The quasi-static planar Poisson point process with matching-based receiver abstraction (Abstract and core modeling sections): this choice is load-bearing for all three headline results, including the closed-form SIR success law and the conservative lower bound in the contraction analysis. The reported robustness checks for spatial regularity and receiver selection are performed inside the same abstraction and do not test whether alternative mechanisms (e.g., nearest-neighbor or CSI-dependent pairing) would invalidate the expressions, as noted in the stress-test concern.
[Contraction bound derivation] The conservative lower bound separating ideal mixing from wireless updates in the mean-square contraction (as described in the abstract): while it enables the closed-form proxy access rule, the bound's conservatism (circularity score 3.0) may limit its tightness, and the paper does not quantify the gap to the actual contraction rate under the wireless channel.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments. We address each major comment point by point below, indicating where revisions will be made to the manuscript.

read point-by-point responses

Referee: [Abstract and modeling assumptions] The quasi-static planar Poisson point process with matching-based receiver abstraction (Abstract and core modeling sections): this choice is load-bearing for all three headline results, including the closed-form SIR success law and the conservative lower bound in the contraction analysis. The reported robustness checks for spatial regularity and receiver selection are performed inside the same abstraction and do not test whether alternative mechanisms (e.g., nearest-neighbor or CSI-dependent pairing) would invalidate the expressions, as noted in the stress-test concern.

Authors: We agree that the quasi-static planar Poisson point process with matching-based receiver abstraction is foundational to the closed-form derivations. This modeling choice was deliberately adopted to enable analytical tractability for the SIR success probability and contraction bound while reflecting key aspects of interference in drone swarms. The existing robustness checks evaluate sensitivity to spatial regularity and receiver selection within this framework. In the revised manuscript we will add an explicit discussion of the abstraction's scope, including a note that alternative mechanisms such as nearest-neighbor or CSI-dependent pairing fall outside the current analysis and would require separate treatment; we will also flag this as a direction for future work. revision: partial
Referee: [Contraction bound derivation] The conservative lower bound separating ideal mixing from wireless updates in the mean-square contraction (as described in the abstract): while it enables the closed-form proxy access rule, the bound's conservatism (circularity score 3.0) may limit its tightness, and the paper does not quantify the gap to the actual contraction rate under the wireless channel.

Authors: The conservative lower bound was introduced precisely to separate ideal mixing from wireless success probabilities and thereby obtain the closed-form Aloha proxy. We acknowledge that this conservatism leaves a gap relative to the true contraction rate. To address this, the revised manuscript will incorporate additional numerical comparisons between the analytical bound and simulated mean-square contraction rates under the full wireless channel model, providing a quantitative measure of the bound's tightness. revision: yes

Circularity Check

0 steps flagged

No circularity: derivations are direct from model assumptions

full rationale

The paper states explicit derivations of a closed-form SIR success probability, a mean-square contraction bound using a conservative lower bound to separate ideal mixing from wireless updates, and a closed-form proxy access rule based on density scaling, all under the quasi-static planar Poisson point process with matching-based receiver abstraction. These steps are presented as mathematical consequences of the model rather than reductions to fitted inputs, self-definitions, or self-citation chains. The conservative lower bound is explicitly labeled as such and does not force equality by construction. No evidence of ansatz smuggling, uniqueness imported from prior self-work, or renaming of known results appears in the derivation claims. The primary modeling assumptions (PPP and matching abstraction) are open to external validation or falsification and do not create internal circularity.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 0 invented entities

The central claims rest on a quasi-static planar Poisson point process for drone locations, a matching-based abstraction for receiver selection, Rayleigh fading, threshold decoding, and slotted Aloha with fixed transmit probability. No new entities are postulated.

free parameters (1)

Aloha transmit probability p
Chosen to achieve stable intermediate operating region; appears as the variable in the closed-form proxy access rule.

axioms (2)

domain assumption Quasi-static planar Poisson point process model for drone locations
Invoked to enable closed-form SIR success probability derivation.
domain assumption Matching-based abstraction for receiver selection
Simplifies analysis of broadcast gossip updates.

pith-pipeline@v0.9.0 · 5397 in / 1233 out tokens · 17761 ms · 2026-05-15T07:54:40.838011+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1 (SIR success probability) … psucc(r; p) = exp(−λp π r² θ^{2/α} C(α))
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 2 … E[V(t)] ≤ (1 − γ qlb(p))^t V(0)

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.