Table Driven Approach against Flooding Attack in Ad- hoc Network

Broadcasting in MANET usually based on flooding in which source node broadcast a packet to its neighbours. Main problem with flooding is that it causes unproductive often result in harmful bandwidth congestion and causes redundant broadcasting of packets so it creates Broadcast Storm Problem. Our proposed algorithm Table Driven Approach against Flooding Attack (TDAFA) helps in reducing flooding attack by maintaining count of hello packets. Using simulation we proved that our algorithm results increase in packet delivery ratio, increase in throughput and decrease in packet loss ratio as compared to AODV protocol. In daily life people need to move and communicate with each other. So to satisfy their need, mobile network has been formed. MANET (Mobile Ad-Hoc network) is a group of autonomous mobile nodes. These mobile nodes worked as both host and router. MANET acts as light weighted terminal with less CPU processing capability, small memory size and less power storage. MANET is a dynamically self organized network with no central administrator and infrastructure support. Due to this litheness it can easily used in the military operation to maintain the information network between the solider. MANET has some limitations like limited resources and physical security. MANET is hard to detect the malicious node because of its volatile network topology. There are some major issues which are involved in MANET such as broadcasting, mobility management, and power management. Our paper focuses on broadcasting where source node send same packet to its entire neighbor. Broadcasting is a basic operation in all type of network used to discover neighbor. Solution to broadcast is flooding where each node receives a broadcast packet and then it simply rebroadcast to its entire neighbor. Broadcasting through flooding is very expensive method which gives the result in transmission redundancy and collision in the network. Such a situation is referred as broadcast storm problem. Many researchers have identified this problem by showing how severe is through simulation. Researchers proposed several suggestions based on counter-based where number of duplicate message received at node is less than threshold value . In some cases threshold value is based on local connectivity information (3). Threshold based on neighbourhood information which divides according to the Average number of neighbours to decide the node region. In some research counter based scheme combine with other scheme such as position based scheme where two separate threshold value set for EAC (Expected additional Coverage). Also combine with Probability based scheme using rebroadcast probability value around 6.5 where node dynamically adjusts counter value using neighbourhood information to reduce problem. To address these varying threshold values and reducing storm problem proposed algorithm used table driven approach against flooding attack (TDAFA) containing two phases where first phase counts number of neighbors of each node in the network and select its specific region. In second phase node maintains a hello packet transaction. If a node receives more number of hello packets from the specific node within a threshold time period then flooding attack is detected and reduced. The paper is organized as follows. Section II briefly illustrates the related work. Section III explains the proposed algorithm. The design and implementation details are depicted in section IV and conclusion in section V.