Throughput and transmission capacity of ad hoc networks with channel state information

This paper develops a general framework for deriving the spatial throughput and transmission capacity of spatially Poisson distributed ad hoc networks for (i) random (e.g., fading) channels, and (ii) random transmission distances. In both of these scenarios the randomness of the channels and ranges invariably lowers both throughput and transmission capacity assuming that users randomly elect to transmit with some probability (i.e., Aloha). Assuming each node knows the channel state information (CSI, e.g., the channel gain and/or channel distance) to just its intended receiver, we propose a simple distributed threshold-based scheduling rule and derive the threshold that optimizes throughput. The gains are surprisingly large: a factor of three increase in throughput over Aloha is typical even with no further coordination between the nodes in the network.

[1]  Malvin Carl Teich,et al.  Power-law shot noise , 1990, IEEE Trans. Inf. Theory.

[2]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[3]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[4]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[5]  Andrea J. Goldsmith,et al.  Large wireless networks under fading, mobility, and delay constraints , 2004, IEEE INFOCOM 2004.

[6]  John A. Silvester,et al.  Optimum Transmission Ranges in a Direct-Sequence Spread-Spectrum Multihop Packet Radio Network , 1990, IEEE J. Sel. Areas Commun..

[7]  Jeffrey G. Andrews,et al.  WLC02-1: Bounds on the SIR Distribution for a Class of Channel Models in Ad Hoc Networks , 2006, IEEE Globecom 2006.

[8]  Babak Hassibi,et al.  Communication over a wireless network with random connections , 2006, IEEE Transactions on Information Theory.

[9]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  François Baccelli,et al.  An Aloha protocol for multihop mobile wireless networks , 2006, IEEE Transactions on Information Theory.

[11]  Ness B. Shroff,et al.  The Fundamental Capacity-Delay Tradeoff in Large Mobile Wireless Networks , .

[12]  Tamer A. ElBatt,et al.  Joint scheduling and power control for wireless ad hoc networks , 2002, IEEE Transactions on Wireless Communications.

[13]  Panganamala Ramana Kumar,et al.  The transport capacity of wireless networks over fading channels , 2004, IEEE Transactions on Information Theory.

[14]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[15]  Jeffrey G. Andrews,et al.  Transmission capacity of wireless ad hoc networks with outage constraints , 2005, IEEE Transactions on Information Theory.

[16]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[17]  Jeffrey G. Andrews,et al.  Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation , 2007, IEEE Transactions on Information Theory.

[18]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[19]  Dimitrios Hatzinakos,et al.  Analytic alpha-stable noise modeling in a Poisson field of interferers or scatterers , 1998, IEEE Trans. Signal Process..