Efficient Flooding Mechanism for Routing In MANET

Abstract

Flooding in MANETs is not only a legitimate candidate for unicast routing protocols e.g. AODV in mobile
scenarios, but also is an important part of a number of other, multicast routing protocols. Simple flooding is the simplest
form of broadcasting, where the source node broadcasts a packet to its neighboring nodes. Each neighboring node
receiving the flood packet for the first time refloods it. As a result, the flooding propagates outwards from the source
node, eventually terminating when every node has received and transmitted the flooded packet exactly once. The main
problem in flooding is how to minimize the number of nodes that rebroadca st the AODV RREQ packets while
maintaining a high degree of reachability in order to discover routes to the destination. Flooding a large number of
RREQ packets may guarantee a high chance of discovering routes to destinations. However, this method of disc overing
destinations may result in an inefficient use of limited system resources such as the communication bandwidth and
battery power. The proposed extended AODV protocol uses a special timing based route discovery mechanism in order
to reduce unnecessary flooding. Here special flooding prevents AODV protocol is proposed and implemented. Modifies
done in AODV route discovering mechanism by considering special timing based mechanism. Simulation results take in
Network Simulator 2 (NS2).