Optimal paths on the space-time SINR random graph

DOI10.1239/AAP/1300198516zbMATH Open1223.60011OpenAlexW3105871235MaRDI QIDQ2996573FDOQ2996573

Authors Francois Baccelli, Bartlomiej Blaszczyszyn, Mir-Omid Haji-Mirsadeghi

Publication date 3 May 2011

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0911.3721

zbMATH Keywords

random graphpercolationmobile networksSINR

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Combinatorial optimization (90C27)

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 "negative" results on the associated time constant. The latter determines the asymptotics of the minimum delay required by a packet to progress from a source node to a destination node when the Euclidean distance between the two tends to infinity. The main negative result states that this time constant is infinite on the random graph associated with a Poisson point process under natural assumptions on the wireless channels. The main positive result states that when adding a periodic node infrastructure of arbitrarily small intensity to the Poisson point process, the time constant is positive and finite.

Recommendations

• SINR percolation for Cox point processes with random powers
• Constrained minimum passage time in random geometric graphs
• Topological properties of random wireless networks
• A note on interference in random networks
• A Random Graph Model of Mobile Wireless Networks

Cites work

• scientific article; zbMATH DE number 3148802 (Why is no real title available?)
• scientific article; zbMATH DE number 17688 (Why is no real title available?)
• scientific article; zbMATH DE number 3357109 (Why is no real title available?)
• An Aloha protocol for multihop mobile wireless networks
• An Introduction to the Theory of Point Processes
• Asymptotic Behavior of Total Times for Jobs That Must Start Over if a Failure Occurs
• Euclidean models of first-passage percolation
• Fundamentals of Wireless Communication
• Navigation on a Poisson point process
• Percolation in the signal to interference ratio graph
• Random Plane Networks
• Subadditive ergodic theory
• The radial spanning tree of a Poisson point process
• The small-world phenomenon: an algorithmic perspective
• The time constant and critical probabilities in percolation models

Cited in

(8)

• Space-time percolation and detection by mobile nodes
• SINR percolation for Cox point processes with random powers
• Information Transmission under Random Emission Constraints
• Asymptotic properties of Euclidean shortest-path trees in random geometric graphs
• Point-shift foliation of a point process
• Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
• Random transceiver networks
• On scaling limits of power law shot-noise fields

This page was built for publication: Optimal paths on the space-time SINR random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996573)