2005
DOI: 10.1007/s11276-005-1764-1
|View full text |Cite
|
Sign up to set email alerts
|

TCP Unfairness in Ad Hoc Wireless Networks and a Neighborhood RED Solution

Abstract: Significant TCP unfairness in ad hoc wireless networks has been reported during the past several years. This unfairness results from the nature of the shared wireless medium and location dependency. If we view a node and its interfering nodes to form a "neighborhood", the aggregate of local queues at these nodes represents the distributed queue for this neighborhood. However, this queue is not a FIFO queue. Flows sharing the queue have different, dynamically changing priorities determined by the topology and t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
26
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 43 publications
(27 citation statements)
references
References 22 publications
1
26
0
Order By: Relevance
“…We note that Xu et al [30] have proposed the use of RED over a virtual distributed 'neighborhood' queue comprising nodes that contend for channel access. This was in the context of wireless ad hoc networks in which flows do not necessarily share traffic aggregation points.…”
Section: Packet-drop/marking Algorithmsmentioning
confidence: 99%
“…We note that Xu et al [30] have proposed the use of RED over a virtual distributed 'neighborhood' queue comprising nodes that contend for channel access. This was in the context of wireless ad hoc networks in which flows do not necessarily share traffic aggregation points.…”
Section: Packet-drop/marking Algorithmsmentioning
confidence: 99%
“…Xu et al [59] proposed a NRED scheme that is based on the RED [58] algorithm to reduce the impact of unfairness among nodes. The NRED scheme introduced a distributed neighbourhood queue approach which is an aggregation of neighbourhood queues so that each neighbour node holds a portion of the distributed queue.…”
Section: Neighbourhood Randomly Early Detection (Nred)mentioning
confidence: 99%
“…Neighborhood RED [14] proposes a variant of the RED algorithm, whereby queues at nodes within two hops are also taken into account, and not just the local queue. Warrier et al have proposed a cross-layer architecture that is based on recent theoretical work on cross-layer optimization [15] Traffic-aware channel assignment in LANs has been considered in [16].…”
Section: Related Workmentioning
confidence: 99%