Throughput scaling of wireless ad hoc networks with no side information

Shengshan Cui, Alexander M. Haimovich

Research output: Contribution to journalArticlepeer-review


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 [3] 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.

Original languageEnglish (US)
Article number5557640
Pages (from-to)836-838
Number of pages3
JournalIEEE Communications Letters
Issue number9
StatePublished - Sep 2010

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


  • Ad hoc networks
  • channel state information (CSI)
  • throughput


Dive into the research topics of 'Throughput scaling of wireless ad hoc networks with no side information'. Together they form a unique fingerprint.

Cite this