Cellular, Cell-less, and Everything in Between: A Unified Framework for Utility Region Analysis in Wireless Networks
Renato Luis Garrido Cavalcante, Tomasz Piotrowski, Slawomir Stanczak
TL;DR
The paper develops a unified framework for analyzing wireless utility regions using SINR and achievable rate metrics in modern architectures such as cell-less and massive MIMO. It recasts user utilities as $U_n({\boldsymbol{p}})=\frac{p_n}{t_n({\boldsymbol{p}})}$ with standard interference mappings and shows a fundamental link between conditional eigenpairs and the nonlinear spectral radius $\rho(T_{\|\cdot\|})$, enabling compact, geometry-based representations of feasible regions. This framework yields practical convexity certificates via inverse Z-matrices, facilitates tractable convex reformulations for sum-rate optimization, and introduces channel-compatibility concepts to gauge when time-sharing is unnecessary. Counterexamples and simulations demonstrate the framework’s breadth, guiding design choices for interference management in next-generation networks while highlighting when rate-based formulations are advantageous over SINR-based ones.
Abstract
We introduce a unified framework for analyzing utility regions of wireless networks, with a focus on signal-to-interference-plus-noise-ratio (SINR) and achievable rate regions. The framework provides valuable insights into interference patterns of modern network architectures, including extremely large MIMO and cell-less networks. A central contribution is a simple characterization of feasible utility regions using the concept of spectral radius of nonlinear mappings. This characterization provides a powerful mathematical tool for wireless system design and analysis. For example, it allows us to generalize existing characterizations of the weak Pareto boundary using compact notation. It also allows us to derive tractable sufficient conditions for the identification of convex utility regions. This property is particularly important because, on the weak Pareto boundary, it guarantees that time sharing (or user grouping) cannot simultaneously improve the utilities of all users. Beyond geometrical insights, these sufficient conditions have two key implications. First, they identify a family of (weighted) sum-rate maximization problems that are inherently convex, thus paving the way for the development of efficient, provably optimal solvers for this family. Second, they provide justification for formulating sum-rate maximization problems directly in terms of achievable rates, rather than SINR levels. Our theoretical insights also motivate an alternative to the concept of favorable propagation in the massive MIMO literature -- one that explicitly accounts for self-interference and the beamforming strategy.
