Throughput of Large One-hop Wireless Networks with General Fading
Abstract
Consider 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- 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- fading.
Keywords
Cite
@article{arxiv.1306.5291,
title = {Throughput of Large One-hop Wireless Networks with General Fading},
author = {Seyed Pooya Shariatpanahi and Babak Hossein Khalaj and Kasra Alishahi and Hamed Shah-Mansouri},
journal= {arXiv preprint arXiv:1306.5291},
year = {2013}
}
Comments
27 pages, 2 figures