Dynamic Connectivity in ALOHA Ad Hoc Networks
RadhaKrishna Ganti, Martin Haenggi

TL;DR
This paper models the dynamic connectivity of ALOHA ad hoc networks using a random multi-digraph, analyzing degree distribution, connection delay, and the impact of interference, with theoretical insights supported by simulations.
Contribution
It introduces a dynamic graph model for ALOHA networks, deriving analytical results on connectivity, delay distribution, and interference effects, which improve upon static models.
Findings
Connectivity is enhanced by the network's dynamic nature.
Delay scales linearly with distance under interference.
Simulation results validate the theoretical analysis.
Abstract
In a wireless network the set of transmitting nodes changes frequently because of the MAC scheduler and the traffic load. Previously, connectivity in wireless networks was analyzed using static geometric graphs, and as we show leads to an overly constrained design criterion. The dynamic nature of the transmitting set introduces additional randomness in a wireless system that improves the connectivity, and this additional randomness is not captured by a static connectivity graph. In this paper, we consider an ad hoc network with half-duplex radios that uses multihop routing and slotted ALOHA for the MAC contention and introduce a random dynamic multi-digraph to model its connectivity. We first provide analytical results about the degree distribution of the graph. Next, defining the path formation time as the minimum time required for a causal path to form between the source and…
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
TopicsMobile Ad Hoc Networks · Cooperative Communication and Network Coding · Opportunistic and Delay-Tolerant Networks
