Congestion Adaptive Most Favorable Control Routing In Ad Hoc Networks

摘要

Routing protocols for mobile ad hoc networks have been researched extensively in recent years. However, most routing protocols attempt to discover a new route when congestion is said to have occurred. Such an approach is suggested to cause further delay, high packet loss and requires significant overhead for identifying a new path. An ideal routing protocol is expected to detect congestion as well as be adaptive to network congestion. Adaptability to congestion helps to increase both effectiveness and efficiency of routing. This paper proposes an improved AODV routing protocol that attempts to discover a new path if congestion is likely in a present path, using a routing algorithm called CAMFCR (congestion adaptive most favorable control routing). Initially, CAMFCR segregates the network in to five regions according to the means of neighbors. After segregation of the network, it initiates a most favorable route discovery process. Once new paths were identified, all the nodes in primary path periodically calculate its queue_status at the node level. In this approach, each node will send a warning message to its previous node if the former node is likely to be congested. In response, the latter node will attempt to identify a new path for the approaching packets to be sent through, by applying a most favorable route discovery method. Thus, CAMFCR improves the network performance in terms of reducing delay and routing overhead and increasing packet delivery ratio. The analysis using Ns-2 simulator revealed that CAMFCR is superior over AODV and CAAODV routing schemes.