The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
Open accessAbstract
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r-alphaas well as a random phase. We identify the scaling laws of the information-theoretic capacity of the network when nodes can relay information for each other. In the case of dense networks, where the area is fixed and the density of nodes increasing, we show that the total capacity of the network scales linearly with n. This improves on the best known achievability result of n2/3of Aeron and Saligrama. In the case of extended networks, where the density of nodes is fixed and the area increasing linearly with n, we show that this capacity scales as n2-alpha/2for 2lesalpha4. Thus, much better scaling than multihop can be achieved in dense networks, as well as in extended networks with low attenuation. The performance gain is achieved by intelligent node cooperation and distributed multiple-input multiple-output (MIMO) communication. The key ingredient is a hierarchical and digital architecture for nodal exchange of information for realizing the cooperation.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Self-citationCapacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
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
Foschini, G. J. (2002) · Bell Labs Technical Journal · doi:10.1002/bltj.2015 · Cited by 6,205
Stanley, R. P., & Rota, G.-C. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511805967 · Cited by 6,025
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
Stanley, R. P., & Fomin, S. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609589 · Cited by 2,203
Information Theory and Reliable Communication
Gallager, R. (1972) · Springer eBooks · doi:10.1007/978-3-7091-2945-6 · Cited by 1,204
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
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
Franceschetti, M., Dousse, O., Tse, D. N. C., & Thiran, P. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.890791 · Cited by 654
Self-citationBounds 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
Upper Bounds to Transport Capacity of Wireless Networks
Jovicic, A., Viswanath, P., & Kulkarni, S. R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.836936 · Cited by 234
Information-Theoretic Upper Bounds on the Capacity of Large Extended Ad Hoc Wireless Networks
Leveque, O., & Telatar, I. E. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.842576 · Cited by 229
Self-citationThe Transport Capacity of Wireless Networks Over Fading Channels
Xue, F., Xie, L.-L., & Kumar, P. R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.842628 · Cited by 216
A Random Walk Model of Wave Propagation
Franceschetti, M., Bruck, J., & Schulman, L. J. (2004) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2004.827540 · Cited by 151
Wireless Ad hoc Networks: Strategies and Scaling Laws for the Fixed SNR RegimePreprint
Aeron, S., & Saligrama, V. (2006) · Cited by 86
Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime
Aeron, S., & Saligrama, V. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.896858 · Cited by 76
Cited by
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
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
Fundamental Limits of Wideband Localization— Part II: Cooperative Networks
Shen, Y., Wymeersch, H., & Win, M. Z. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2059720 · Cited by 781
Spectrum Sharing for Device-to-Device Communication in Cellular Networks
Lin, X., Andrews, J. G., & Ghosh, A. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.2360202 · Cited by 460
Metadata
- Authors
- Ozgur, A., Leveque, O., & Tse, D. N. C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2007-10
- Volume
- 53
- Issue
- 10
- Pages
- 3549-3572
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2002649876
- Cited by
- 659
- References
- 21
- FWCI
- 112.46
- Type
- journal article
- Language
- en
- Open access
- green
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.