2007 International Conference on Wireless Communications, Networking and Mobile Computing 2007
DOI: 10.1109/wicom.2007.410
|View full text |Cite
|
Sign up to set email alerts
|

Contention and Queue-Aware Routing Protocol for Mobile Ad Hoc Networks

Abstract: Most load aware protocols for ad hoc networks use queue size as the main traffic load metric. However, this metric does not reflect the impact of channel contention from neighbor nodes. In this paper, we propose a load-aware routing protocol using two load metrics for route selection, which include MAC layer channel contention information, and the number of packets in the interface queue. MAC layer contention information provides an accurate estimation of neighbor nodes' state, and queue length provides a meas… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(31 citation statements)
references
References 11 publications
0
31
0
Order By: Relevance
“…Contention and Queue-aware Routing (CQR) [6] is proposed that utilizes the contention information (contention window, CW) collected from the 802.11 Distributed Coordination Function (DCF) and queue size. Two load metrics are used for route selection, including MAC layer channel contention information, and the number of packets in the queue of node.…”
Section: Typical Improved Congestion Control Approachesmentioning
confidence: 99%
“…Contention and Queue-aware Routing (CQR) [6] is proposed that utilizes the contention information (contention window, CW) collected from the 802.11 Distributed Coordination Function (DCF) and queue size. Two load metrics are used for route selection, including MAC layer channel contention information, and the number of packets in the queue of node.…”
Section: Typical Improved Congestion Control Approachesmentioning
confidence: 99%
“…We use the mechanism based on contention window (CW) and queue length proposed in [25] for load estimation in a node. The random number resulting from the binary exponential back-off algorithm used in the DCF is uniformly distributed in a range, called the contention window, the size of which doubles each time the attempt to transmit is delayed, until a maximum size is reached for the range.…”
Section: Estimation Of Loadmentioning
confidence: 99%
“…Hence CW gives a good indication of contention of the channel. Thus the traffic load around a mobile node can be estimated by calculating the average contention of the channel around that node [25]. Traffic load over a long period is estimated in order to mitigate the effect of traffic bursts.…”
Section: Estimation Of Loadmentioning
confidence: 99%
“…Load or delay aware routing metrics [2], [3], [4], [5], [6] have been adopted by single path routing protocols to avoid congested routes.…”
Section: Related Workmentioning
confidence: 99%
“….The size of the contention window determines how long a node would backoff before attempting to gain access to the channel. In other words CW [5] indicates the busyness of the medium and can be considered as a useful metric for contention and traffic interference. A large CW would mean more amount of traffic interference.…”
Section: B Metric For Interflow Interference and Loadmentioning
confidence: 99%