The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
Open accessAbstract
An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the same 1/radicn transmission rate of arbitrarily located nodes. This contrasts with previous results suggesting that a 1/radicnlogn reduced rate is the price to pay for the randomness due to the location of the nodes. The network operation strategy to achieve the result corresponds to the transition region between order and disorder of an underlying percolation model. If nodes are allowed to transmit over large distances, then paths of connected nodes that cross the entire network area can be easily found, but these generate excessive interference. If nodes transmit over short distances, then such crossing paths do not exist. Percolation theory ensures that crossing paths form in the transition region between these two extreme scenarios. Nodes along these paths are used as a backbone, relaying data for other nodes, and can transport the total amount of information generated by all the sources. A lower bound on the achievable bit rate is then obtained by performing pairwise coding and decoding at each hop along the paths, and using a time division multiple access scheme
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Percolation processes: I. Crystals and mazes
Broadbent, S. R., & Hammersley, J. M. (1957) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100032680 · Cited by 2,032
Grimmett, G. (1999) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-03981-6 · Cited by 1,366
Wilson, R. J. (1972) · Cited by 926
Meester, R., & Roy, R. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511895357 · Cited by 853
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
Gilbert, E. N. (1961) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0109045 · Cited by 656
Percolation Theory for Mathematicians
Kesten, H. (1982) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4899-2730-9 · Cited by 633
Percolation Theory for Mathematicians.
Hammersley, J. M., & Kesten, H. (1984) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981754 · Cited by 612
Throughput-delay trade-off in wireless networks
El Gamal, A., Mammen, J., Prabhakar, B., & Shah, D. (2004) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354518 · Cited by 585
A Deterministic Approach to Throughput Scaling in Wireless Networks
Kulkarni, S. R., & Viswanath, P. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828055 · Cited by 316
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
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
Self-citationCovering algorithms, continuum percolation and the geometry of wireless networks
Booth, L., Bruck, J., Franceschetti, M., et al. (2003) · The Annals of Applied Probability · doi:10.1214/aoap/1050689601 · Cited by 122
Self-citationContinuum Percolation with Unreliable and Spread-Out Connections
Franceschetti, M., Booth, L., Cook, M., et al. (2005) · Journal of Statistical Physics · doi:10.1007/s10955-004-8826-0 · Cited by 94
Self-citationBeineke, L. W., & Wilson, R. J. (1974) · American Mathematical Monthly · doi:10.2307/2319240 · Cited by 84
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
Self-citation(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Hierarchical 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
Self-citationWireless 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
Metadata
- Authors
- Franceschetti, M., Dousse, O., Tse, D. N. C., & Thiran, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2007-03
- Volume
- 53
- Issue
- 3
- Pages
- 1009-1018
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2135356058
- Cited by
- 654
- References
- 17
- FWCI
- 105.28
- 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.