Paper Details

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

Paresha Barot, Lata Gadhavi, “Efficient Flooding Mechanism for Routing In MANET”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 2, Issue 6, pp. 428-434, June 2015.