Throughput scaling of wireless networks with random connections

Shengshan Cui, Alexander M. Haimovich, Oren Somekh, H. Vincent Poor, Shlomo Shamai

Research output: Chapter in Book/Report/Conference proceedingConference contribution


This paper studies the throughput scaling of wireless networks over channels with random connections, in which the channel connections are independent and identically distributed (i.i.d.) according to a common distribution. The channel distribution is quite general, with the only limitations being that the mean and variance are finite. Previous works have shown that, when channel state information (CSI) of the entire network is known a priori to all the nodes, wireless networks are degrees-of-freedom limited rather than interference limited. In this work, we show that this is not the case with a less demanding CSI assumption. Specifically, we quantify the throughput scaling for different communication protocols under the assumption of perfect receiver CSI and partial transmitter CSI (via feedback). It is shown that the throughput of single-hop and two-hop schemes are upper-bounded by respectively, O(n1/3) and O(n1/2), where n is the total number of source-to-destination pairs. In addition, multihop schemes cannot do better than the two-hop relaying scheme. Furthermore, the achievability of the Θ(n1/2) scaling for the two-hop scheme is demonstrated by a constructive example.

Original languageEnglish (US)
Title of host publicationProceedings - 2009 IEEE International Conference on Communications, ICC 2009
StatePublished - 2009
Event2009 IEEE International Conference on Communications, ICC 2009 - Dresden, Germany
Duration: Jun 14 2009Jun 18 2009

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486


Other2009 IEEE International Conference on Communications, ICC 2009

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Throughput scaling of wireless networks with random connections'. Together they form a unique fingerprint.

Cite this