By Topic

A Study of Congestion-Aware Routing Protocols for Wireless Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wei Wu ; Commun. Res. Center in Harbin Inst. of Technol., HIT-NEC Joint Lab. on Adv. Commun. Technol., Harbin ; Zhongzhao Zhang ; Xuejun Sha ; Danyang Qin

Congestion is one of the most important restrictions of wireless ad hoc networks. Most of the existing ad hoc routing protocols take no account of the congestion factor. It results in long delay, high overhead and low throughput. These problems are solved by the congestion-aware routing protocols in certain degree. In this paper, we study the congestion metrics and route mechanisms of three congestion-aware routing protocols, CARM, CARA, and CADV, and analyze and compare the performance of them. Finally, the future direction of congestion-aware routing protocols is presented.

Published in:

2008 4th International Conference on Wireless Communications, Networking and Mobile Computing

Date of Conference:

12-14 Oct. 2008