On the Probability of Network States with Gaussian Connectivity Functions
Amy S. Inwood, Peter J. Smith, Pawel Dmochowski, Carl P. Dettmann, Justin P. Coon, Michail Matthaiou
Abstract
In this paper, we consider the connectivity of a random network of N mobile devices in three dimensions (3D), where the location of each device or node has a Gaussian distribution in each dimension. For each pair of nodes, the probability of connectivity is related to the nodes' separation by a Gaussian connectivity function. The fundamental analytical tool for studying such systems is the probability of a given network state, derived and expressed in terms of its graph Laplacian. Leveraging this result, we obtain results for the connectivity of small networks, the probability of a complete network (where all nodes are connected to all other nodes), and the probability of an isolated node, which gives an approximation to the connectivity probability of larger networks. The general results are then simplified for special cases and limiting scenarios.
Create a lesson
Related papers
From Multimode Near-Field Coupling to Friis
Mats Gustafsson
Distributed Sensing on a 110-kV Overhead-Line Maintenance Operation on an Operational Optical Ground Wire
Konstantinos Alexoudis, Torm Järvelill, Hendrik Johann Kerm et al.
Stable Filters for Generative Modeling of Graph Signals
Martin Schmidt, Gonzalo Mateos
Learning Array Signal Topologies as Conditional Neural Manifolds
Julian P. Merkofer, Vincent van de Schaft, Ruud J. G. van Sloun
QUBO Formulations of the Downlink MIMO Scheduling Problem in 5G Base Stations
Olli Apilo, Jorma Kilpi
Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation
Smriti Uniyal, Tianyu Fang, Van-Dinh Nguyen et al.