Improvement of AODV Routing in Dense networks

Mobile Ad Hoc networks (MANETs) consist of wireless hosts that may move often. They don´t use some existing infrastructure so they are very useful in crisis conditions as earthquakes, or military actions. However, MANETs have low bandwidth. The well-known Ad Hoc On-demand Distance Vector (AODV) protocol broadcasts control packets to determine new paths or reinitialize paths when they´re broken. Consequently, it is important to reduce the number of control packets. We propose an algorithm which reduces the search area of AODV protocol. Source broadcasts a route request that other nodes can transmit only if they are in an area whose form is a quadrilateral. The quadrilateral has a symmetry axis passing through the source and the destination. Reducing the search area reduces the number of control packets. To show the efficiency of our protocol, simulations have been carried out under NS-2 simulator.