Analysis and simulation of congestion-aware routing protocols for mobile and hoc networks

Congestion is one of the most important restrictions of mobile ad hoc networks. It results in long delay, high overhead and low throughput in ad hoc network. These problems are solved by the congestion-aware routing protocols in certain degree. In this paper, the congestion metrics and route mechanisms of three congestion-aware routing protocols, CARM, CARA, and CADV, are studied. After analysis of their performance, it has found that CARM has heavier overhead and longer delay than CARA, and the overhead of CADV is too heavy, although its delay is short. These conclusions are verified by simulating the performance of these three protocols.