Abstract | ||
---|---|---|
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 upper-bounded by O(n1/3) for single-hop schemes, and O(n1/2) for two-hop (and multihop) schemes; 2) the Θ(n1/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 Θ(n) is achievable with Pareto-type fading models. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1109/TIT.2010.2051470 | Clinical Orthopaedics and Related Research |
Keywords | DocType | Volume |
single-user decoding,channel state information,two-hop scheme,two-hop opportunistic relaying,radio transmitters,throughput scaling,variance,ad hoc wireless network,index terms—ad hoc networks,multihop scheme,transmitter,statistical analysis,common distribution,finite mean,random connection,wireless network,receiver,opportunistic communication,ad hoc networks,demanding csi assumption,transmitting node,wireless channels,single-hop scheme,receiving node,multiuser diversity,random connections,two-hop relaying scheme,scaling law,channel connections,channel connection,pareto-type fading model,throughput.,radio receivers,throughput,decoding,channel distribution,channel state information csi,channel state information (csi),transmitters,communication protocol,feedback,interference,wireless networks,upper bound,protocols | Journal | 56 |
Issue | ISSN | Citations |
8 | 0018-9448 | 6 |
PageRank | References | Authors |
0.61 | 27 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shengshan Cui | 1 | 26 | 3.66 |
Alexander M. Haimovich | 2 | 618 | 69.28 |
Oren Somekh | 3 | 560 | 48.58 |
H. V. Poor | 4 | 25411 | 1951.66 |
Shlomo Shamai | 5 | 4531 | 410.89 |