Dana, Amir F. and Hassibi, Babak (2004) Power bandwidth trade-off for sensory and ad-hoc wireless networks. In: International Symposium on Information Theory, 2004. ISIT 2004. Proceedings. IEEE , Piscataway, NJ, p. 469. ISBN 0-7803-8280-3. https://resolver.caltech.edu/CaltechAUTHORS:20150225-074130900
![]() |
PDF
- Published Version
See Usage Policy. 226kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20150225-074130900
Abstract
We look at the power bandwidth trade-off in random sensory and ad-hoc wireless networks with n users and r ≤ √n simultaneous source/destination pairs. Under a specific protocol, we show that the minimum power required for maintaining an achievable scaling law of R_(sum)=Θ(f(n)) for the sum-rate in the network, scales like Θ(f(n)/√n). The required bandwidth B in this case is of order Θ(f(n)/r). It is also proved that the minimum achievable energy per information bit (E_b/N_0)min for this protocol, scales as Θ(1/√n) and in this case the spectral efficiency is nonzero and is of constant order.
Item Type: | Book Section | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
Related URLs: |
| |||||||||
Additional Information: | © 2004 IEEE. This work was supported in part by the National Science Foundation under grant no. CCR-0133818, by the office of Naval Research under grant no. N00014-02-1-0578, and by Caltech’s Lee Center for Advanced Networking. | |||||||||
Funders: |
| |||||||||
DOI: | 10.1109/ISIT.2004.1365506 | |||||||||
Record Number: | CaltechAUTHORS:20150225-074130900 | |||||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20150225-074130900 | |||||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
ID Code: | 55177 | |||||||||
Collection: | CaltechAUTHORS | |||||||||
Deposited By: | Shirley Slattery | |||||||||
Deposited On: | 25 Feb 2015 20:00 | |||||||||
Last Modified: | 10 Nov 2021 20:42 |
Repository Staff Only: item control page