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
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
Wireless Device-to-Device Caching Networks: Basic Principles and System Performance
Ji, M., Caire, G., & Molisch, A. F. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2015.2452672 · Cited by 444
An Overview of the Transmission Capacity of Wireless Networks
Weber, S., Andrews, J. G., & Jindal, N. (2010) · IEEE Transactions on Communications · doi:10.1109/tcomm.2010.093010.090478 · Cited by 422
Data Offloading Techniques in Cellular Networks: A Survey
Rebecchi, F., Dias de Amorim, M., Conan, V., Passarella, A., Bruno, R., & Conti, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2369742 · Cited by 352
Transmission capacity of ad hoc networks with spatial diversity
Hunter, A. M., Andrews, J. G., & Weber, S. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/t-wc.2008.071047 · Cited by 329
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 Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks
Weber, S., Andrews, J. G., & Jindal, N. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.907482 · Cited by 322
Li, Q., Hu, R. Q., Qian, Y., & Wu, G. (2012) · IEEE Wireless Communications · doi:10.1109/mwc.2012.6189409 · Cited by 283
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
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
“This has recently been considered in [35], in which it has been proven that network capacity can increase linearly (and hence per-node capacity remains constant) for an increasing number of nodes by using cooperative communication hierarchies; this”
Background
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.