The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
The capacity of wireless networks
Abstract
When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assigned, and each transmission's range is optimally chosen, the bit-distance product that can be transported by the network per second is /spl Theta/(W/spl radic/An) bit-meters per second. Thus even under optimal circumstances, the throughput is only /spl Theta/(W//spl radic/n) bits per second for each node for a destination nonvanishingly far away. Similar results also hold under an alternate physical model where a required signal-to-interference ratio is specified for successful receptions. Fundamentally, it is the need for every node all over the domain to share whatever portion of the channel it is utilizing with nodes in its local neighborhood that is the reason for the constriction in capacity. Splitting the channel into several subchannels does not change any of the results. Some implications may be worth considering by designers. Since the throughput furnished to each user diminishes to zero as the number of users is increased, perhaps networks connecting smaller numbers of users, or featuring connections mostly with nearby neighbors, may be more likely to be find acceptance.
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
Graph Theory with Applications
Bondy, J. A., & Murty, U. S. R. (1976) · doi:10.1007/978-1-349-03521-2 · Cited by 9,043
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
Okabe, A., Boots, B. N., & Sugihara, K. (1992) · Cited by 3,546
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
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
Estimation of Dependences Based on Empirical Data
Vapnik, V. (2006) · Information Science and Statistics · doi:10.1007/0-387-34239-7 · Cited by 2,238
Bharghavan, V., Demers, A. J., Shenker, S. J., & Zhang, L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190334 · Cited by 1,771
Critical Power for Asymptotic Connectivity in Wireless Networks
Gupta, P., & Kumar, P. R. (1999) · Stochastic Analysis, Control, Optimization and Applications · doi:10.1007/978-1-4612-1784-8_33 · Cited by 1,137
Self-citationEstimation of Dependences Based on Empirical Data.
Shoesmith, E., Vapnik, V., & Kotz, S. (1984) · The Statistician · doi:10.2307/2988246 · Cited by 764
Cited by
Items 101–103 of 103
Dohler, M., Heath, R. W., Lozano, A., Papadias, C. B., & Valenzuela, R. A. (2011) · IEEE Communications Magazine · doi:10.1109/mcom.2011.5741160 · Cited by 221
Information Dissemination Delay in Vehicle-to-Vehicle Communication Networks in a Traffic Stream
Du, L., & Dao, H. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2014.2326331 · Cited by 94
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
- 2000-03
- Volume
- 46
- Issue
- 2
- Pages
- 388-404
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2137775453
- Cited by
- 8,292
- References
- 14
- FWCI
- 131.67
- 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.