HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item:
Title: Capacity of large scale wireless networks under Gaussian channel model
Authors: Li, Shi
Liu, Yunhao
Li, Xiang-Yang
Keywords: Wireless ad hoc networks
probability theory
Percolation theory
Issue Date: 2008
Citation: Proceedings of the 14th ACM International Conference on Mobile Computing and Networking, 14-19 September 2008, San Francisco, California, USA, p. 140-151
Abstract: In this paper, we study the multicast capacity of a large scale random wireless network. We simply consider the extended multihop network, where a number of wireless nodes vi(1 ≤ i ≤ n) are randomly located in a square region with side-length a = √n, by use of Poisson distribution with density 1. All nodes transmit at constant power P, and the power decays along path, with attenuation exponent α > 2. The data rate of a transmission is determined by the SINR as B log(1 + SINR). There are ns randomly and independently chosen multicast sessions. Each multicast has k randomly chosen terminals. We show that, when k ≤ θ1 n/(log n)2α+6, and ns ≥ θ2n1/2+β, the capacity that each multicast session can achieve, with high probability, is at least c8√n/ns√k, where θ1, θ2, and c8 are some special constants and β > 0 is any positive real number. Our result generalizes the unicast capacity [3] for random networks using percolation theory.
Rights: © ACM, 2008. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 14th ACM International Symposium on Mobile Ad Hoc Networking & Computing, 14-19 September 2008, San Francisco, California, USA
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
CapacityofLargeScaleWireless.pdfpre-published version389KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.