Connectivity Scaling Laws in Wireless Networks

Abstract

We present scaling laws that dictate both local and global connectivity properties of bounded wireless networks. These laws are defined with respect to the key system parameters of per-node transmit power and the number of antennas exploited for diversity coding and/or beamforming at each node. We demonstrate that the local probability of connectivity scales like $\mathcal{O}(z^{\mathcal{C}})$ in these parameters, where $\mathcal{C}$ is the ratio of the dimension of the network domain to the path loss exponent, thus enabling efficient boundary effect mitigation and network topology control.

4 pages, 1 figure

References in corpus (1)

• Random Rectangular Graphs

Cited by in corpus (6)

• Low Power Wide Area Network Analysis: Can LoRa Scale?
• Embedding Graphs in Lorentzian Spacetime
• Spatial networks with wireless applications
• Underwater Optical Wireless Communications, Networking, and Localization: A Survey
• The Connectivity of Millimeter-Wave Networks in Urban Environments Modeled Using Random Lattices
• Connectivity of Cooperative Ad hoc Networks