Probabilistic and Neighbour Knowledge Based Flooding Mechanism for AODV

摘要

Mobile Adhoc Network (MANET) is consist of group of mobile nodes communicating in a multi-hop way with no fixed infrastructure. To search such a multi-hop route to another nodes, each MANET node widely use HELLO packet. Flooding is important and most fundamental routing operation in MANET. Route discovery, route maintenance, and topology update packets processes massive rely on flooding for spreading. In flooding mechanism, a node sends a hello message to all of its immediate node, until the message has been spread to the entire network. If node coverage density is high, flooding can become inefficient because of redundant, forwarding. Impact of it increasing control overhead and congestion in wireless network which lead to degrade performance of network. Efficient flooding work either according to topology or neighborhood information is available, only a subset of neighbour is required to participate in flooding to guarantee the complete flooding. In this paper, proposed algorithms works in efficient way for route discovery based on local network density, forwarding node probability and Node coverage area. In terms of improvement normalized routing load, throughput, end to end delay and packet delivery ration is going to be better compare to conventional AODV routing protocol.