The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation
Abstract
How much information can be carried over a wireless network with a multiplicity of nodes, and how should the nodes cooperate to transfer information? To study these questions, we formulate a model of wireless networks that particularly takes into account the distances between nodes, and the resulting attenuation of radio signals, and study a performance measure that weights information by the distance over which it is transported. Consider a network with the following features. I) n nodes located on a plane, with minimum separation distance /spl rho//sub min/>0. II) A simplistic model of signal attenuation e/sup -/spl gamma//spl rho////spl rho//sup /spl delta// over a distance /spl rho/, where /spl gamma//spl ges/0 is the absorption constant (usually positive, unless over a vacuum), and /spl delta/>0 is the path loss exponent. III) All receptions subject to additive Gaussian noise of variance /spl sigma//sup 2/. The performance measure we mainly, but not exclusively, study is the transport capacity C/sub T/:=sup/spl Sigma/on/sub /spl lscr/=1//sup m/R/sub /spl lscr///spl middot//spl rho//sub /spl lscr//, where the supremum is taken over m, and vectors (R/sub 1/,R/sub 2/,...,R/sub m/) of feasible rates for m source-destination pairs, and /spl rho//sub /spl lscr// is the distance between the /spl lscr/th source and its destination. It is the supremum distance-weighted sum of rates that the wireless network can deliver. We show that there is a dichotomy between the cases of relatively high and relatively low attenuation. When /spl gamma/>0 or /spl delta/>3, the relatively high attenuation case, the transport capacity is bounded by a constant multiple of the sum of the transmit powers of the nodes in the network. However, when /spl gamma/=0 and /spl delta/<3/2, the low-attenuation case, we show that there exist networks that can provide unbounded transport capacity for fixed total power, yielding zero energy priced communication. Examples show that nodes can profitably cooperate over large distances using coherence and multiuser estimation when the attenuation is low. These results are established by developing a coding scheme and an achievable rate for Gaussian multiple-relay channels, a result that may be of interest in its own right.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Ad hoc On-Demand Distance Vector (AODV) Routing
Perkins, C., Belding-Royer, E., & Das, S. (2003) · doi:10.17487/rfc3561 · Cited by 10,686
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
Self-citationHighly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
Capacity theorems for the relay channel
Cover, T., & Gamal, A. E. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056084 · Cited by 4,123
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
Wireless LAN medium access control (MAC) and physical layer (PHY) specifications
Piscataway, N. (1996) · Medical Entomology and Zoology · Cited by 2,999
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Cover, T. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054727 · Cited by 1,670
Three-terminal communication channels
van der Meulen, E. C. (1971) · Advances in Applied Probability · doi:10.1017/s0001867800037605 · Cited by 1,544
Multi-way communication channels
Ahlswede, R. (1973) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 615
Power control and clustering in ad hoc networks
Kawadia, V., & Kumar, P. R. (2004) · doi:10.1109/infcom.2003.1208697 · Cited by 587
Self-citationOn the capacity of wireless networks: the relay case
Gastpar, M., & Vetterli, M. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019409 · Cited by 467
A simple converse for broadcast channels with additive white Gaussian noise (Corresp.)
Bergmans, P. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055184 · Cited by 445
Towards an information theory of large networks: an achievable rate region
Gupta, P., & Kumar, P. R. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.814480 · Cited by 435
Self-citationLiao, H. H.-J. (1972) · Cited by 391
The capacity region of a class of deterministic interference channels (Corresp.)
Gamal, A. E., & Costa, M. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056466 · Cited by 275
Cited by
Stochastic geometry and random graphs for the analysis and design of wireless networks
Haenggi, M., Andrews, J. G., Baccelli, F., Dousse, O., & Franceschetti, M. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090902 · Cited by 1,719
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
On the capacity of MIMO relay channels
Wang, B., Zhang, J., & Host-Madsen, A. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839487 · Cited by 813
A cautionary perspective on cross-layer design
Kawadia, V., & Kumar, P. R. (2005) · IEEE Wireless Communications · doi:10.1109/mwc.2005.1404568 · Cited by 734
Self-citationHierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
Ozgur, A., Leveque, O., & Tse, D. N. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.905002 · Cited by 659
Metadata
- Authors
- Xie, L.-L., & Kumar, P. R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2004-05
- Volume
- 50
- Issue
- 5
- Pages
- 748-767
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2162180430
- Cited by
- 723
- References
- 17
- FWCI
- 100.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.