Throughput Scaling of Wireless Networks With Random Connections

Shengshan Cui, Alexander M Haimovich, Oren Somekh, H Vincent Poor, Shlomo Shamai
2010 IEEE Transactions on Information Theory  
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) for a class of connection models with finite mean and variance, the throughput scaling is
more » ... pper-bounded by ( 1 3 ) for single-hop schemes, and ( 1 2 ) for two-hop (and multihop) schemes; 2) the 2( 1 2 ) throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters; 3) by relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling 2( ) is achievable with Pareto-type fading models. Index Terms-Ad hoc networks, channel state information (CSI), multiuser diversity, opportunistic communication, random connections, scaling law, throughput.
doi:10.1109/tit.2010.2051470 fatcat:dln2ycsxfvew7dlleijj3xrhda