Early Congestion Detection and Self Cure Routing in Manet

• Published in: Computer Networks and Information Technologies pp. 562 - 567
• Main Authors: Senthil kumaran, T., Sankaranarayanan, V.
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2011
• Series: Communications in Computer and Information Science
• Subjects: Ad hoc Networks; AODV; Congestion; EDCSCAODV
• ISBN: 3642195415; 9783642195419
• ISSN: 1865-0929; 1865-0937
• DOI: 10.1007/978-3-642-19542-6_110

Ad hoc mobile networks are composed of mobile nodes communicating through wireless medium, without any fixed backbone infrastructure. In these networks, congestion occurs in any intermediate node when data packets travel from source to destination incurring high packet loss and long delay, which cause the performance degradation of a network. This paper presents an early detection of congestion and self cure routing protocol for wireless Ad-hoc networks called as EDCSCAODV. All the primary path nodes periodically calculate its queue_status at node level. While using early congestion detection technique, node detects congestion that is likely to happen and send warning message to its neighbors. All neighbors listen to the node’s warning message and apply automatic cure algorithm to get alternate path to it, if and when a non-congested local alternate path is available for transmitting data. Thus, EDCSCAODV improves performance in terms of reducing delay, routing overhead and increases packet delivery ratio without incurring any significant additional cost. The performance of EDCSCAODV was compared with AODV using the Ns-2 simulator. The result reveals that EDCSCAODV has significant improvement over conventional AODV routing schemes.