CaltechAUTHORS
  A Caltech Library Service

On the Achievable Throughput in Two-Scale Wireless Networks

Gowaikar, Radhika and Hassibi, Babak (2006) On the Achievable Throughput in Two-Scale Wireless Networks. In: 2006 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, pp. 1683-1687. ISBN 1-4244-0505-X. https://resolver.caltech.edu/CaltechAUTHORS:20170511-123623758

[img] PDF - Published Version
See Usage Policy.

226Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170511-123623758

Abstract

We propose a new model of wireless networks which we refer to as "two-scale networks". At a local scale, characterized by nodes being within a distance r, channel strengths are drawn independently and identically from a distance-independent distribution. At a global scale, characterized by nodes being further apart from each other than a distance r, channel connections are governed by a Rayleigh distribution, with the power satisfying a distance-based decay law. Thus, at a local scale, channel strengths are determined primarily by random effects such as obstacles and scatterers whereas at the global scale channel strengths depend on distance. For such networks, we propose a hybrid communications scheme, combining elements of P. Gupta et al. (2000) (for distance-dependent networks) and R. Gowaikar et al. (2006) (for random networks). For a particular class of two-scale networks with N nodes, we show that an aggregate throughput of the form N^(1/(t-1)) / (log^2 N) is achievable, where t > 2 is a parameter that depends on the distribution of the connection at the local scale and is independent of the decay law that operates at a global scale. For t < 3, this offers a significant improvement over the O(√N) results of P. Gupta et al. (2000).


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/ISIT.2006.261641DOIArticle
http://ieeexplore.ieee.org/document/4036254/PublisherArticle
Additional Information:© 2006 IEEE. This work is supported in part by the National Science Foundation under grant nos. CCR-0133818 and CCR-0326554, by the David and Lucille Packard Foundation, and by Caltech’s Lee Center for Advanced Networking.
Funders:
Funding AgencyGrant Number
NSFCCR-0133818
NSFCCR-0326554
David and Lucille Packard FoundationUNSPECIFIED
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Record Number:CaltechAUTHORS:20170511-123623758
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170511-123623758
Official Citation:R. Gowaikar and B. Hassibi, "On the Achievable Throughput in Two-Scale Wireless Networks," 2006 IEEE International Symposium on Information Theory, Seattle, WA, 2006, pp. 1683-1687. doi: 10.1109/ISIT.2006.261641
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:77374
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:12 May 2017 23:49
Last Modified:03 Oct 2019 17:56

Repository Staff Only: item control page