Abstract: In MANET, congestion is severe problem and in spite of the lot of works already done in the area, still due to involvement of new techniques and devices it is required to be reconsidered again. Congestion control using congestion window management has also been addressed earlier but there is no algorithm proposed which is controlling congestion window dynamically using packet count and information received from the neighbor nodes about packet count. CARMAN helps in avoiding congestion and provides a network layer solution. It is an extension of CORMAN to provide pipeline transmission of data packets for long distance multihop transmissions. The objectives of CARMAN algorithm are it allows pipeline data transmission for long distance multipath transmission and also provides faster transmission of data packets avoiding congestion. Measure challenges faced in CARMAN are Hop Count Calculation. The CARMAN faces the problems due to application of hop count based calculations for data forwarding and will not be suitable for large networks. This work proposes to eliminate the hop count threshold calculation. It also proposes to use AODV protocol for testing the proposed improved congestion control.
Keywords: AODV, Congestion control, Cooperative Routing, Mobile Ad-Hoc network.
Title: Congestion Avoidance in Mobile Ad-Hoc Networks, through Cooperative AODV Routing
Author: Steffi George, Sharda Patel
International Journal of Computer Science and Information Technology Research
ISSN 2348-120X (online), ISSN 2348-1196 (print)
Research Publish Journals
