Achievable Throughput in Two-Scale Wireless Networks
- Creators
- Gowaikar, Radhika
- Hassibi, Babak
Abstract
We propose a new model of wireless networks which we refer to as "two-scale networks." At a local scale, characterised by nodes being within a distance r, channel strengths are drawn independently and identically from a distance-independent distribution. At a global scale, characterised 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 distance-dependent networks and random networks. For particular classes of two-scale networks with N nodes, we show that an aggregate throughput that is slightly sublinear in N, for instance, of the form N/ log^4 N is achievable. This offers a significant improvement over a throughput scaling behaviour of O(√N) that is obtained in other work.
Additional Information
© Copyright 2009 IEEE. Manuscript received 22 August 2008; revised 31 January 2009. 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.Attached Files
Published - Gowaikar2009p5876Ieee_J_Sel_Area_Comm.pdf
Files
Name | Size | Download all |
---|---|---|
md5:beb9572caba27541dc6c4821387b6147
|
454.9 kB | Preview Download |
Additional details
- Eprint ID
- 15808
- Resolver ID
- CaltechAUTHORS:20090911-153601945
- NSF
- CCR-0133818
- NSF
- CCR-0326554
- David and Lucile Packard Foundation
- Lee Center for Advanced Networking, Caltech
- Created
-
2009-10-07Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field