Congestion Avoidance through Cooperative Routing in Manets

Data communication through wireless channels faces a challenging issue towards congestion and link quality variation. Regardless of stationary or mobile nodes in the network, the link between the nodes experiences a fluctuation in link quality. Congestion is an intriguing issue which occurs when there is a detoriation in QoS at the link which carries the data. The consequences of these problems are overcome by cooperative communication which has revealed a new path in research by uniting the nature of broadcasting in autonomous network and the link quality fluctuation. Our solution in tackling this problem is put forward as CARMAN (Congestion Avoidance through Cooperative Routing in MANets). This CARMAN is triggered by setting a threshold value for “Number of hops” and the “Number of packets”. There exists a methodology proposed as Cooperative Opportunistic Routing in Mobile Ad hoc Networks (CORMAN) which has an issue regarding congestionand also a problem towards multi packet transmission. These problems can be overcome by our proposed scheme. This scheme (CARMAN) has been simulated for results in Network Simulator-2 (ns2) to compare the performance with CORMAN and AODV respectively. The simulated results show a drastic increase in packet delivery ratio and reduction in packet drop compared to CORMAN & AODV, thus proving the efficiency of the proposed scheme. This CARMAN helps in congestion and traffic control along the path. Also the overall time delay of the network is managed.