The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Throughput-delay trade-off in wireless networks
Abstract
Gupta and Kumar (2000) introduced a random network model for studying the way throughput scales in a wireless network when the nodes are fixed, and showed that the throughput per source-destination pair is /spl otimes/(1//spl radic/nlogn). Grossglauser and Tse (2001) showed that when nodes are mobile it is possible to have a constant or /spl otimes/(1) throughput scaling per source-destination pair. The focus of this paper is on characterizing the delay and determining the throughput-delay trade-off in such fixed and mobile ad hoc networks. For the Gupta-Kumar fixed network model, we show that the optimal throughput-delay trade-off is given by D(n) = /spl otimes/(nT(n)), where T(n) and D(n) are the throughput and delay respectively. For the Grossglauser-Tse mobile network model, we show that the delay scales as /spl otimes/(n/sup 1/2//v(n)), where v(n) is the velocity of the mobile nodes. We then describe a scheme that achieves the optimal order of delay for any given throughput. The scheme varies (i) the number of hops, (ii) the transmission range and (iii) the degree of node mobility to achieve the optimal throughput-delay trade-off. The scheme produces a range of models that capture the Gupta-Kumar model at one extreme and the Grossglauser-Tse model at the other. In the course of our work, we recover previous results of Gupta and Kumar, and Grossglauser and Tse using simpler techniques, which might be of a separate interest.
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
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Probability: Theory and Examples.
Prewitt, K., & Durrett, R. (1992) · Journal of the American Statistical Association · doi:10.2307/2290301 · Cited by 3,085
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
Stochastic Modeling and the Theory of Queues
Wolff, R. W. (1989) · Cited by 1,593
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
Even one-dimensional mobility increases ad hoc wireless capacity
Diggavi, S. N., Grossglauser, M., & Tse, D. N. C. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2002.1023624 · Cited by 112
Cited by
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
Self-citationEfficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.897962 · Cited by 1,108
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
Transmission Capacity of Wireless Ad Hoc Networks With Outage Constraints
Weber, S. P., Yang, X., Andrews, J. G., & deVeciana, G. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858939 · Cited by 579
Gossip algorithms: design, analysis and applications
Boyd, S., Ghosh, A., Prabbakar, B., & Shah, D. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498447 · Cited by 558
Self-citation
Metadata
- Authors
- El Gamal, A., Mammen, J., Prabhakar, B., & Shah, D.
- Venue
- IEEE INFOCOM 2004
- Publisher
- IEEE
- Published
- 2004-12-23
- Volume
- 1
- Pages
- 464-475
- OpenAlex
- W2161725792
- Cited by
- 585
- References
- 7
- FWCI
- 24.58
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Throughput-delay trade-off in wireless networks. https://app.cochat.ai/papers/10.1109/infcom.2004.1354518
- The paper
- El Gamal, A., Mammen, J., Prabhakar, B., & Shah, D. (2004). Throughput-delay trade-off in wireless networks. IEEE INFOCOM 2004. https://doi.org/10.1109/infcom.2004.1354518
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.