RAODV Routing Protocol for Congestion Detection and Relief in Ad Hoc Wireless Networks

Abstract

Ad hoc wireless networks depend on mutual collaboration among nodes. Congestion in ad hoc wireless networks thus presents more of a challenge than for other network types. This article proposes RAODV (relieving AODV), a modification of the AODV routing protocol, to handle congestion via third party neighbour nodes in dense and static ad hoc networks. RAODV nodes use a T-entropy threshold-based congestion detection algorithm to determine the congestion status of their neighbours. If RAODV determines that congestion is occurring, it then tries to relieve congestion via a local repair modification algorithm that replaces the congested node by a suitable monitoring/third party neighbour node. This article also shows evidence that RAODV results in better network performance than AODV in simulations with random network topologies.