Candidate Neighbours to Rebroadcast the RREQ for efficient flooding in mobile ad hoc network
Sofian Hamad, Nazar Radhi, Hamed Saffa Al-Raweshidy · 2011
Most of the Routing protocol used flooding as the process to disseminate the update packets in the network. The basic flooding is cause high retransmissions which lead to packet collisions and media congestion that can significantly degrade the network performance. Knowing the geographical position of the mobile nodes can assist the protocol to reduce the number of retransmissions, therefore enhancing the protocol performance. In this paper, an Efficient Flooding Algorithm has been proposed that makes use of the nodes' position to rebroadcast the packets and efficiently spread the control traffic in the network. The proposed algorithm is applied on the route discovery process of Ad-hoc On Demand Distance Vector (AODV) protocol to reduce the number of propagating Route Request (RREQ) messages. The RREQ has been modified by assigning a list to the RREQ contain fourth Candidate Neighbours to Rebroadcast the RREQ (CNRR). The simulation results shows that our scheme reduces the routing overhead of AODV protocol up to 38%.