The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
WTCP: a reliable transport protocol for wireless wide-area networks
Open accessAbstract
Most current wireless wide area packet data networks (WWANs) are characterized by low and variable bandwidths, high and variable delays, significant non-congestion related loss, asymmetric uplink and downlink channels, and occasional blackouts.Additionally, the majority of the latency in a WWAN connection is incurred over the wireless link.Under such operating conditions, most contemporary wireless TCP algorithms do not perform very well.In this paper, we present WTCP, a reliable transport protocol that is designed to operate efficiently over commercial WWAN networks such as CDPD.WTCP is rate-based, uses only end-to-end mechanisms, performs rate control at the receiver, and uses the ratio of sending rate to receiving rate as the primary metric for rate control.We have implemented and evaluated WTCP over the CDPD network, and also simulated it in the ns-2 simulator.Our initial results indicate the WTCP can improve on the performance of comparable algorithms such as TCP-NewReno, TCP-Vegas, and Snoop-TCP by between 20% to 200% for typical operating conditions.'Most of the current deployment uses the proxy model for three reasons: (a) the connection quality of the WWAN network is too poor to sustain typical client-server applications, (b) the amount of data transfered to the mobile host must be filtered because of the orders of magnitude difference in bandwidth between the wired and WWAN connections, and (c) many portable computing devices have display and processing limitations that must be addressed by the proxy before sending the processed/filtered response to the mobile user.Permission to make digital or hard copies of all or part of this work tw personal or classroom use is gxnted without fee provided that coPi= are oat ma& or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first Page.To COPY othenvise, to rqublish, to post on servers or to redistribute to lists, reqllires prior specific permissioll and/or a fee.
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 NewReno Modification to TCP's Fast Recovery Algorithm
Henderson, T., Floyd, S., Gurtov, A., & Nishida, Y. (2012) · doi:10.17487/rfc6582 · Cited by 1,410
Cited by
CODA: congestion detection and avoidance in sensor networks
Wan, C.-Y., Eisenman, S. B., & Campbell, A. T. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958523 · Cited by 895
Providing robust and ubiquitous security support for mobile ad-hoc networks
Jiej, Petros, Z., Luo, H., Lu, S., & Zhang, L. (2001) · Proceedings Ninth International Conference on Network Protocols ICNP 2001 ICNP-01 · doi:10.1109/icnp.2001.992905 · Cited by 688
A feedback-based scheme for improving TCP performance in ad hoc wireless networks
Chandran, K., Raghunathan, S., Venkatesan, S., & Prakash, R. (2001) · IEEE Personal Communications · doi:10.1109/98.904897 · Cited by 305
ATP: a reliable transport protocol for ad hoc networks
Sundaresan, K., Anantharaman, V., Hsieh, H.-Y., & Sivakumar, A. R. (2005) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2005.81 · Cited by 287
Ahn, G.-S., Campbell, A. T., Veres, A., & Sun, L.-H. (2002) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2002.1081755 · Cited by 283
Metadata
- Authors
- Sinha, P., Venkitaraman, N., Sivakumar, R., & Bharghavan, V.
- Venue
- Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 1999-08
- Pages
- 231-241
- OpenAlex
- W2062387388
- Cited by
- 190
- References
- 1
- FWCI
- 9.36
- Type
- conference paper
- Language
- en
- Open access
- gold
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: WTCP: a reliable transport protocol for wireless wide-area networks. https://app.cochat.ai/papers/10.1145/313451.313541
- The paper
- Sinha, P., Venkitaraman, N., Sivakumar, R., & Bharghavan, V. (1999). WTCP: a reliable transport protocol for wireless wide-area networks. Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking. https://doi.org/10.1145/313451.313541
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.