The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A Deterministic Approach to Throughput Scaling in Wireless Networks
Abstract
We address the problem of how throughput in a wireless network scales as the number of users grows. Following the model of Gupta and Kumar, we consider n identical nodes placed in a fixed area. Pairs of transmitters and receivers wish to communicate but are subject to interference from other nodes. Throughput is measured in bit-meters per second. We provide a very elementary deterministic approach that gives achievability results in terms of three key properties of the node locations. As a special case, we obtain /spl Omega/(/spl radic/n) throughput for a general class of network configurations in a fixed area. Results for random node locations in a fixed area can also be derived as special cases of the general result by verifying the growth rate of three parameters. For example, as a simple corollary of our result we obtain a stronger (almost sure) version of the /spl radic/n//spl radic/(logn) throughput for random node locations in a fixed area obtained by Gupta and Kumar. Results for some other interesting non-independent and identically distributed (i.i.d.) node distributions are also provided.
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
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
Mobility increases the capacity of ad hoc wireless networks
Grossglauser, M., & Tse, D. N. C. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801403 · Cited by 2,839
Capacity of Ad Hoc wireless networks
Li, J., Blake, C., Couto, D. S. J. D., et al. (2001) · Proceedings of the 28th Annual International Conference on Mobile Computing And Networking · doi:10.1145/381677.381684 · Cited by 1,637
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
Universal prediction of individual sequences
Feder, M., Merhav, N., & Gutman, M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144706 · Cited by 373
Rates of convergence of nearest neighbor estimation under arbitrary sampling
Kulkarni, S. R., & Posner, S. E. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.391248 · Cited by 120
Self-citationTight worst-case loss bounds for predicting with expert advice
Haussler, D. H., Kivinen, J., & Warmuth, M. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59119-2_169 · Cited by 88
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
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
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
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
Metadata
- Authors
- Kulkarni, S. R., & Viswanath, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2004-06
- Volume
- 50
- Issue
- 6
- Pages
- 1041-1049
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2108190032
- Cited by
- 316
- References
- 8
- FWCI
- 25.53
- 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.