The DOI matches its Crossref record; 19 of the 20 references it cites were found in a registry or an index.
TCP over multihop 802.11 networks: issues and performance enhancement
Abstract
Analyzing TCP operation over 802.11 multihop ad hoc networks involves a cross-layer study. In this work, we investigate the effect of congestion and MAC contention on the interaction between TCP and on-demand ad hoc routing protocol in the 802.11 ad hoc networks. Our study reveals several problems stemming from lack of coordination and sharing in such networks. It is observed that TCP induces the over-reaction of routing protocol and hurts the quality of end-to-end connection. So, one of the critical sources of lowering TCP throughput lies in the TCP window mechanism itself. To fix this problem, we propose a fractional window increment (FeW) scheme for TCP to prevent the over-reaction of the on-demand routing protocol by limiting TCP's aggressiveness. The proposed scheme is applicable to a wide range of transport protocols using the basic TCP mechanism, and the protocol behavior is analytically tractable. Our simulation results demonstrate that the proposed scheme can dramatically improve TCP performance and network stability in a variety of 802.11 multihop networks. For example, in some chain-like topologies, the proposed scheme outperforms basic TCP by over 90%, and recent related variants of TCP (ADTCP, LRED) by over 70%.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Whereas, TCP-FALA only achieves better fairness than TCP-FeW.”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [329]
In the citing paper
“Furthermore, the simulations demonstrate that Learning-TCP is superior to TCP-FALA and TCP-FeW [329] (a non-ML TCP variant enhanced for WANETs) with respect to these performance metrics.”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [329]
Citations
Cites
Ad hoc On-Demand Distance Vector (AODV) Routing
Perkins, C. S., Belding‐Royer, E. M., & Das, S. (2003) · doi:10.17487/rfc3561 · Cited by 10,702
The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)
Johnson, D. B. (2004) · Medical Entomology and Zoology · Cited by 3,206
Padhye, J. D., Firoiu, V., Towsley, D., & Kurose, J. (1998) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/285237.285291 · Cited by 2,107
Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?
Xu, S., & Saadawi, T. (2001) · IEEE Communications Magazine · doi:10.1109/35.925681 · Cited by 912
Advances in network simulation
Breslau, L., Estrin, D. L., Fall, K., Floyd, S., Heidemann, J., Helmy, A., Polly Huang, B., McCanne, S., Varadhan, K., Xu, Y., et al. (2000) · Computer · doi:10.1109/2.841785 · Cited by 800
Self-citationAnalysis of TCP performance over mobile ad hoc networks
Holland, G., & Vaidya, N. H. (1999) · doi:10.1145/313451.313540 · Cited by 708
The impact of multihop wireless channel on TCP throughput and loss
Fu, Z., Zerfos, P., Luo, H., Lu, S., Zhang, L., & Gerla, M. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2003.1209197 · Cited by 524
ATCP: TCP for mobile ad hoc networks
Liu, J., & Singh, S. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.932698 · Cited by 508
Analysis of TCP Performance over Mobile Ad Hoc Networks
Holland, G., & Vaidya, N. H. (2002) · Wireless Networks · doi:10.1023/a:1013798127590 · Cited by 408
Sundaresan, K., Anantharaman, V., Hsieh, H., & Sivakumar, R. (2003) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/778415.778424 · Cited by 198
On setting TCP's congestion window limit in mobile ad hoc networks
Chen, K., Xue, Y., & Nahrstedt, K. (2004) · International Conference on Communications · doi:10.1109/icc.2003.1204525 · Cited by 186
How bad TCP can perform in mobile ad hoc networks
Fu, Z., Meng, X., & Lu, S. (2003) · IEEE International Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2002.1021693 · Cited by 136
The utility of explicit rate-based flow control in mobile ad hoc networks
Chen, K., Nahrstedt, K., & Vaidya, N. H. (2004) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2004.1311847 · Cited by 111
Yu, X. (2004) · Proceedings of the 28th Annual International Conference on Mobile Computing And Networking · doi:10.1145/1023720.1023743 · Cited by 105
Understanding bandwidth-delay product in mobile ad hoc networks
Chen, K., Xue, Y., Shah, S. H., & Nahrstedt, K. (2004) · Computer Communications · doi:10.1016/j.comcom.2004.01.020 · Cited by 99
A transport protocol for supporting multimedia streaming in mobile ad hoc networks
Fu, Z., Meng, X., & Lu, S. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.816461 · Cited by 73
Limitations of equation-based congestion control in mobile ad hoc networks
Chen, K., & Nahrstedt, K. (2004) · International Conference on Distributed Computing Systems Workshops · doi:10.1109/icdcsw.2004.1284118 · Cited by 44
On the scale of probe traffic for internet transport protocols
Kuo, C. ‐. J., & Nahm, K. (2005) · Cited by 1
Self-citationOn the scale of probe traffic for Internet transport protocols
Nahm, K. (. (2014) · University of Southern California Digital Library · doi:10.25549/usctheses-c16-334528 · Cited by 1
Self-citation
Research works printed but not linked: 1
- J. Monks , P. Sinha , and V. Bharghavan , " Limitations of TCP-ELFN for ad hoc networks," in Proc . IEEE MOMUC '00 , Tokyo, Japan , 2000 .]] J. Monks, P. Sinha, and V. Bharghavan, "Limitations of TCP-ELFN for ad hoc networks," in Proc. IEEE MOMUC '00, Tokyo, Japan, 2000.]]
Cited by
Sorted by citations
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036
Kramer, G. G., Marić, I., & Yates, R. D. (2007) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 288
A survey on congestion control for mobile ad hoc networks
Lochert, C., Scheuermann, B., & Martin Mauve, A. (2007) · Wireless Communications and Mobile Computing · doi:10.1002/wcm.524 · Cited by 187
Cross‐Layer Support for Energy Efficient Routing in Wireless Sensor Networks
Chilamkurti, N., Zeadally, S., Vasilakos, A. V., & Sharma, V. (2009) · Journal of Sensors · doi:10.1155/2009/134165 · Cited by 162
DiffQ: Practical Differential Backlog Congestion Control for Wireless Networks
Warrier, A. C., Janakiraman, S., Ha, S., & Injong Rhee, Y. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5061929 · Cited by 145
Metadata
- Authors
- Nahm, K., Helmy, A., & Jay Kuo, C.-C.
- Affiliations
- University of Southern California (US)
- University of Southern California, Los Angeles, CA
- ORCID
- Helmy, Ahmed
- Venue
- Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
- Publisher
- ACM
- Published
- 2005-05-25
- Pages
- 277-287
- OpenAlex
- W2071882788
- Cited by
- 135
- References
- 20
- Citations by year
- 2022: 1 · 2021: 1 · 2019: 1 · 2018: 1 · 2017: 3 · 2016: 1 · 2015: 3 · 2013: 7 · 2012: 11
- FWCI
- 12.48
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
- Keywords
- TCP, multi-hop ad hoc networks, IEEE 802.11, on-demand routing, congestion, TCP window size, TCP throughput, cross-layer design, network stability
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
