Power Optimization in Random Wireless Networks

Aris L. Moustakas, Panayotis Mertikopoulos, Nicholas BambosIEEE Trans. Information Theory 2016 · OpenReview

Abstract

In this paper, we analyze the problem of power control in large, random wireless networks that are obtained by “erasing” a finite fraction of nodes from a regular d-dimensional lattice of $N$ transmit-receive pairs. In this model, which has the important feature of a minimum distance between transmitter nodes, we find that when the network is infinite, power control is always feasible below a positive critical value of the users' signal-to-interference-plus-noise ratio (SINR) target. Drawing on tools and ideas from statistical physics, we show how this problem can be mapped to the Anderson impurity model for diffusion in random media. In this way, by employing the so-called coherent potential approximation method, we calculate the average power in the system (and its variance) for 1-D and 2-D networks. This approach is equivalent to traditional techniques from random matrix theory and is in excellent agreement with the numerical simulations; however, it fails to predict when power control becomes infeasible. In this regard, even though infinitely large systems are always unstable beyond a critical value of the users' SINR target, finite systems remain stable with high probability even beyond this critical SINR threshold. We calculate this probability by analyzing the density of low lying eigenvalues of an associated random Schrödinger operator, and we show that the network can exceed this critical SINR threshold by at least $O((\log N)^{-2/d})$ before undergoing a phase transition to the unstable regime.

Introduction: The Power Control Problem

In wireless communications, power control is a fundamental mechanism where transmitters adjust their output to ensure receivers meet a target Signal-to-Interference-plus-Noise Ratio (SINR). This creates a complex feedback loop: as one node increases power to overcome interference, it inadvertently raises the interference floor for its neighbors, who must then raise their own power. In large-scale random networks, this can lead to "infeasible" states where the required power levels theoretically escalate to infinity.

While this phenomenon is well-understood for small or perfectly regular grids, analyzing large-scale random networks has historically been difficult, often relying on simplified models that ignore feedback or on computationally expensive simulations. This research provides an analytical bridge between wireless communications and condensed matter physics to solve these challenges.

Network Model and Methodology

The authors model the network by starting with a regular $d$-dimensional lattice and "erasing" nodes with a specific probability $e$. This creates a "thinned" random network that maintains a realistic minimum distance between nodes, avoiding the mathematical singularities sometimes found in pure Poisson Point Processes.

A regular 2D lattice where a fraction of nodes are randomly 'erased' to model a random wireless network with minimum distance constraints.

To analyze this system, the study employs two distinct mathematical frameworks:

  1. Coherent Potential Approximation (CPA): A "mean-field" technique from physics used to calculate bulk statistics like average power and variance. It replaces the complex random environment with an effective "average" medium.
  2. Lifshitz Tails & Random Schrödinger Operators: To study instability, the authors analyze the "tails" of the system's eigenvalue distribution. This allows for the study of rare events—specifically, large clusters of active nodes that have not been erased—which dominate the system's failure modes.

The Physics Mapping: Anderson Impurity Model

A core contribution of this work is the realization that the matrix governing power control is structurally identical to the Hamiltonian in the Anderson impurity model, originally developed to describe electron motion in disordered metals. This mapping allows decades of research on diffusion in random media to be applied directly to wireless network optimization.

Analytical Performance and Stability

The research demonstrates that while CPA is excellent at predicting "bulk" statistics like average power, it is fundamentally blind to system instability. This is because instability is not caused by the "average" node, but by rare, dense clusters of active nodes that trigger infinite power-increase loops.

Comparison of the Cumulative Distribution Function (CDF) for eigenvalues of the tridiagonal matrix using CPA, numerical simulations, and exact calculations.

Key findings regarding stability include:

  • Infinite vs. Finite Instability: In an infinite random network, power control is always infeasible if the SINR target exceeds a critical threshold $\gamma_c$, as a "killer cluster" of active nodes is guaranteed to exist somewhere in infinite space.
  • The Finite Buffer: Finite networks possess a "safety margin." They can operate slightly beyond the theoretical $\gamma_c$ because the probability of a sufficiently large, dense cluster appearing in a limited area is low. The authors show that finite networks can exceed the critical threshold by a factor of $O((\log N)^{-2/d})$ before undergoing a phase transition to instability.
  • Algorithm Convergence: The study derives the convergence rate for the standard Foschini-Miljanic power control algorithm, revealing that random erasures introduce non-trivial time dependencies that vary between 1D and 2D topologies.

Conclusion and Future Directions

By mapping wireless interference to electron diffusion, this work provides a rigorous framework for predicting both the performance and the breaking points of random networks. While the current model assumes a lattice backbone and focuses on erasure randomness, future work aims to incorporate random fading and variable target SINRs into the same Anderson-model framework to further enhance its applicability to real-world deployments.

Summary updated

Abstract

In this paper, we analyze the problem of power control in large, random wireless networks that are obtained by “erasing” a finite fraction of nodes from a regular d-dimensional lattice of N transmit-receive pairs. In this model, which has the important feature of a minimum distance between transmitter nodes, we find that when the network is infinite, power control is always feasible below a positive critical value of the users' signal-to-interference-plus-noise ratio (SINR) target. Drawing on tools and ideas from statistical physics, we show how this problem can be mapped to the Anderson impurity model for diffusion in random media. In this way, by employing the so-called coherent potential approximation method, we calculate the average power in the system (and its variance) for 1-D and 2-D networks. This approach is equivalent to traditional techniques from random matrix theory and is in excellent agreement with the numerical simulations; however, it fails to predict when power control becomes infeasible. In this regard, even though infinitely large systems are always unstable beyond a critical value of the users' SINR target, finite systems remain stable with high probability even beyond this critical SINR threshold. We calculate this probability by analyzing the density of low lying eigenvalues of an associated random Schrödinger operator, and we show that the network can exceed this critical SINR threshold by at least O((log N) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-2/d</sup> ) before undergoing a phase transition to the unstable regime. Finally, using the same techniques, we also calculate the tails of the distribution of transmit power in the system and the rate of convergence of the Foschini-Miljanic power control algorithm in the presence of random erasures.
BibTeX
@article{moustakas2016power,
  author = {Aris L. Moustakas and Panayotis Mertikopoulos and Nicholas Bambos},
  title = {{Power Optimization in Random Wireless Networks}},
  journal = {IEEE Trans. Information Theory},
  year = {2016},
  url = {https://openreview.net/forum?id=p3dudWoqcVS},
}
Figure