Name
Abstract | ||
|---|---|---|
This letter studies the throughput of wireless ad hoc networks in which neither the source nodes nor the destination nodes have channel state information. Work reported in has shown that in the regime of a large network with a total number of nodes n → ∞, the throughput scales at most as log log n. We present a scheme that achieves a throughput scaling of Θ(log n) for the Gauss-Markov fading process and for network sizes of practical interest. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/LCOMM.2010.080410.100994 | IEEE Communications Letters |
Keywords | Field | DocType |
Throughput,Fading,Signal to noise ratio,Training,Ad hoc networks,MIMO,Channel estimation | Wireless network,Code rate,Fading,Computer science,Computer network,MIMO,Optimized Link State Routing Protocol,Wireless ad hoc network,Throughput,Channel state information | Journal |
Volume | Issue | ISSN |
14 | 9 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shengshan Cui | 1 | 26 | 3.66 |
| Alexander M. Haimovich | 2 | 618 | 69.28 |