The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Towards an information theory of large networks: an achievable rate region
Abstract
We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel (DMC). We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reversely degraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast and allcast capacities. Applying the proposed scheme to a specific wireless network of n nodes located in a region of unit area, we show that a transport capacity of /spl Theta/(n) bit-meters per second (bit-meters/s) is feasible in a certain family of networks, as compared to the best possible transport capacity of /spl Theta/(/spl radic/n) bit-meters/s in Gupta et al. (2000), where the receiver capabilities were limited. Even though the improvement is shown for a specific class of networks, a clear implication is that designing and employing more sophisticated multiuser coding schemes can provide sizable gains in at least some large wireless networks.
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
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1024422 · Cited by 13,644
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
Foschini, G. J., & Gans, M. J. (1998) · Wireless Personal Communications · doi:10.1023/a:1008889222784 · Cited by 10,091
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-citationAhlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Foschini, G. J. (2002) · Bell Labs Technical Journal · doi:10.1002/bltj.2015 · Cited by 6,205
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
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
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Cited by
Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838089 · Cited by 12,193
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
Laneman, J. N., & Wornell, G. W. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817829 · Cited by 4,002
Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective
Goldsmith, A., Jafar, S. A., Maric, I., & Srinivasa, S. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2015717 · Cited by 2,398
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Design challenges for energy-constrained ad hoc wireless networks
Goldsmith, A. J., & Wicker, S. B. (2002) · IEEE Wireless Communications · doi:10.1109/mwc.2002.1028874 · Cited by 952
Jafar, S. A., & Shamai, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.911262 · Cited by 757
A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation
Xie, L.-L., & Kumar, P. R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.826631 · Cited by 723
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
(2006) · Springer eBooks · doi:10.1007/1-4020-4711-8 · Cited by 363
Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation
Weber, S. P., Andrews, J. G., Yang, X., & de Veciana, G. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.901153 · Cited by 342
Interference Alignment and the Degrees of Freedom for the K User Interference Channel
Cadambe, V. R., & Jafar, S. A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.0323 · Cited by 323
The Guard Zone in Wireless Ad hoc Networks
Hasan, A., & Andrews, J. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.04793 · Cited by 300
Bounds on capacity and minimum energy-per-bit for AWGN relay channels
El Gamal, A., Mohseni, M., & Zahedi, S. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871579 · Cited by 294
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
A Comprehensive Survey on Cooperative Relaying and Jamming Strategies for Physical Layer Security
Jameel, F., Wyne, S., Kaddoum, G., & Duong, T. Q. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2865607 · Cited by 271
Distributed EM algorithms for density estimation and clustering in sensor networks
Nowak, R. D. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.814623 · Cited by 256
Cooperation in 4G - Hype or Ripe?
Dohler, M., Meddour, D.-D., Senouci, S.-M., & Saadani, A. (2008) · IEEE Technology and Society Magazine · doi:10.1109/mts.2008.918035 · Cited by 46
Metadata
- Authors
- Gupta, P., & Kumar, P. R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2003-08
- Volume
- 49
- Issue
- 8
- Pages
- 1877-1894
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2136812100
- Cited by
- 435
- References
- 26
- FWCI
- 68.52
- 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.