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.
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
- Ad hoc networks
- channel state information (CSI)