Efficient Traffic Free 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, routing is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and unnecessary packet loss and requires significant overhead if a new route is needed. This problem becomes more visible especially in large-scale transmission of heavy traffic such as multimedia data, where congestion is more probable and the negative impact of packet loss on the service quality is of more significance. 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 Efficient congestion Adaptive Routing Protocol for Mobile Ad-hoc Networks, which out performs even during constrained situation. In order to analyze the performance we have chosen popular routing protocols such as AODV and DSR. We strongly argue that routing should not only be aware of but also be adaptive to network congestion.