On Capacity Scaling in Arbitrary Wireless Networks
Name
Shah_On capacity scaling.pdf
Size
581.76 KB
Format
Adobe PDF
Checksum (MD5)
b0cf1f06548ed57df1cd306689b88cfa
Author(s)
Niesen, Urs
Gupta, Piyush
Shah, Devavrat
Date Issued
May 2009
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Niesen, Urs, Piyush Gupta, and Devavrat Shah. “On Capacity Scaling in Arbitrary Wireless Networks.” IEEE Transactions on Information Theory 55.9 (2009): 3959–3982. © Copyright 2009 IEEE
Version
Final published version
Abstract
In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., n nodes are placed uniformly at random in a square region of area n). They showed that for small path-loss exponents alpha isin (2,3], cooperative communication is order optimal, and for large path-loss exponents alpha > 3, multihop communication is order optimal. However, their results (both the communication scheme and the proof technique) are strongly dependent on the regularity induced with high probability by the random node placement. In this paper, we consider the problem of characterizing the throughput scaling in extended wireless networks with arbitrary node placement. As a main result, we propose a more general novel cooperative communication scheme that works for arbitrarily placed nodes. For small path-loss exponents alpha isin (2,3], we show that our scheme is order optimal for all node placements, and achieves exactly the same throughput scaling as in Ozgur. This shows that the regularity of the node placement does not affect the scaling of the achievable rates for alpha isin (2,3]. The situation is, however, markedly different for large path-loss exponents alpha > 3. We show that in this regime the scaling of the achievable per-node rates depends crucially on the regularity of the node placement. We then present a family of schemes that smoothly ldquointerpolaterdquo between multihop and cooperative communication, depending upon the level of regularity in the node placement. We establish order optimality of these schemes under adversarial node placement for alpha > 3.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tit.2009.2025537
