ECARP: An Efficient Congestion Adaptive Routing Protocol for Mobile Ad Hoc Networks

Mobile ad hoc networks shows unexpected behavior with multiple data streams under heavy traffic load such as multimedia data when it is sent to common destination. The main reason for packet loss in mobile ad hoc networks is due to congestion. In the current design, the routing protocols are not congestion adaptive. The way in which the congestion is handled results in longer delay and more packet loss. When a new route is needed the routing protocols take significant overhead in finding it. In this paper we propose an adaptive congestion control algorithm, which out-performs even during constrained situation. For analyzing the performance we have chosen four popular routing protocols such as AODV, DSR, DSDV and TORA. We also observe through simulation in NS-2 that AODV outperforms other routing protocols in normal situation and DSR out-performs in constraint environment. The proposed congestion control routing protocol outperforms all the other routing protocols during heavy traffic loads. We strongly argue that routing should not only be aware of but also be adaptive to network congestion