Throughput of Large One-Hop Ad Hoc Wireless Networks With General Fading

We consider the problem of determining throughput of one-hop unicast transmissions in ad hoc wireless networks. We consider an interference-limited scenario in which wireless links between different nodes are modeled by independently and identically distributed random variables. The main decoding challenge for receive nodes is due to interference of nonintended concurrent transmissions. In this scenario, we consider a heuristic one-hop transmission strategy based on activating source-destination pairs with strongest direct links and forcing other pairs to be silent. We present a closed-form expression for throughput scaling of such strategy, for a completely general channel power distribution. As case studies, we consider practical channel power distributions (e.g., Gamma (Nakagami-m fading and Weibull distributions) and derive the throughput scaling of the heuristic scheme.