Optimal Paths on the Space-Time SINR Random Graph
Francois Baccelli, Bartlomiej Blaszczyszyn, Mir Omid Haji Mirsadeghi

TL;DR
This paper investigates optimal packet transmission paths in a space-time SINR wireless network model, revealing conditions under which the minimum delay between nodes is finite or infinite, based on network infrastructure.
Contribution
It introduces a novel analysis of space-time SINR graphs, establishing conditions for finite or infinite delay constants in wireless networks with random node placement and transmission policies.
Findings
Time constant is infinite in pure Poisson networks under natural conditions.
Adding a small periodic infrastructure makes the time constant finite.
Results inform the design of more reliable wireless network routing.
Abstract
We analyze a class of Signal-to-Interference-and-Noise-Ratio (SINR) random graphs. These random graphs arise in the modeling packet transmissions in wireless networks. In contrast to previous studies on the SINR graphs, we consider both a space and a time dimension. The spatial aspect originates from the random locations of the network nodes in the Euclidean plane. The time aspect stems from the random transmission policy followed by each network node and from the time variations of the wireless channel characteristics. The combination of these random space and time aspects leads to fluctuations of the SINR experienced by the wireless channels, which in turn determine the progression of packets in space and time in such a network. This paper studies optimal paths in such wireless networks in terms of first passage percolation on this random graph. We establish both "positive" 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.
