Cited by 135Network Traffic and Congestion ControlWireless Networks and ProtocolsAdvanced Wireless Network Optimization

TCP over multihop 802.11 networks: issues and performance enhancement

Nahm, Kitae, Helmy, Ahmed, Jay Kuo, C.-C.·2005·Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing

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%.

Integrity signals

Registry

Crossref · 10.1145/1062689.1062725

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Cites

Flagged first, then by citations

1 of the 20 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Nahm, K., Helmy, A., & Jay Kuo, C.-C.
Affiliations
  • University of Southern California (US)
  • University of Southern California, Los Angeles, CA
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