Throughput of Large One-hop Wireless Networks with General Fading

TL;DR

This paper analyzes the throughput scaling of large one-hop wireless networks under general fading conditions, providing a closed-form expression for a heuristic strategy and proving its order-optimality for Nakagami-m fading.

Contribution

It introduces a general throughput scaling expression for a heuristic strategy in fading channels and establishes its order-optimality for Nakagami-m fading.

Findings

Closed-form throughput scaling for general fading distributions.

Validation for Gamma, Weibull, Pareto, and Log-normal channels.

Order-optimality of the heuristic strategy for Nakagami-m fading.

Abstract

Consider $n$ source-destination pairs randomly located in a shared wireless medium, resulting in interference between different transmissions. All wireless links are modeled by independently and identically distributed (i.i.d.) random variables, indicating that the dominant channel effect is the random fading phenomenon. We characterize the throughput of one-hop communication in such network. First, we present a closed-form expression for throughput scaling of a heuristic strategy, for a completely general channel power distribution. This heuristic strategy is based on activating the source-destination pairs with the best direct links, and forcing the others to be silent. Then, we present the results for several common examples, namely, Gamma (Nakagami-$m$ fading), Weibull, Pareto, and Log-normal channel power distributions. Finally -- by proposing an upper bound on throughput of all possible strategies for super-exponential distributions -- we prove that the aforementioned heuristic method is order-optimal for Nakagami-$m$ fading.