AODV Routing Protocol with Selective Flooding

Abstract

Ad-hoc network is a self organizing and adaptive in nature. Since it is a dynamic multihop wireless network and established by a cluster of mobile nodes on a shared wireless channel. The transitive closure of the neighborhood of all the hosts or nodes in the set of mobiles under consideration forms network. Each node is potentially a router and it is possible to dynamically establish routes by changing together a sequence of neighboring hosts from a source to destination in the adhoc network. In this paper study compares the relative performance of existing protocols and evaluates them. It has been determined that under similar conditions AODV outperforms the other protocols. In this work we have proposed an algorithm to overcome flooding problem in the network. The proposed algorithm is selective flooding in place of broadcasting. It is proposed to lessen the number of packets within the network. This reduces the routing Packet overhead. The algorithm was incorporated in the AODV algorithm and simulated in the identical environment it has improved throughput in the network.