On the Design of Large Scale Wireless Systems (with detailed proofs)

TL;DR

This paper analyzes the performance bounds and scaling laws of large-scale OFDMA wireless networks, providing theoretical insights, design guidelines, and a distributed resource allocation scheme applicable to various network configurations.

Contribution

It derives novel bounds and scaling laws for large OFDMA networks, introduces a distributed resource allocation method, and extends results to multi-antenna transmitters, offering comprehensive design principles.

Findings

Established sum-rate bounds as functions of network parameters.

Proposed a distributed resource allocation scheme matching upper bound scaling.

Compared peer-to-peer and high-powered single-transmitter network designs.

Abstract

In this paper, we consider the downlink of large OFDMA-based networks and study their performance bounds as a function of the number of - transmitters $B$, users $K$, and resource-blocks $N$. Here, a resource block is a collection of subcarriers such that all such collections, that are disjoint have associated independently fading channels. In particular, we analyze the expected achievable sum-rate as a function of above variables and derive novel upper and lower bounds for a general spatial geometry of transmitters, a truncated path-loss model, and a variety of fading models. We establish the associated scaling laws for dense and extended networks, and propose design guidelines for the regulators to guarantee various QoS constraints and, at the same time, maximize revenue for the service providers. Thereafter, we develop a distributed resource allocation scheme that achieves the same sum-rate scaling as that of the proposed upper bound for a wide range of $K, B, N$. Based on it, we compare low-powered peer-to-peer networks to high-powered single-transmitter networks and give an additional design principle. Finally, we also show how our results can be extended to the scenario where each of the $B$ transmitters have $M (>1)$ co-located antennas.