Improving node reachability QoS during broadcast storm in Manets using neighbourhood density kowledge (NDK)

Abstract

The Counter-based scheme was developed to reduce Broadcast Storm problem. However, to be able to maintain high delivery ratio in either a sparse or dense networks, different thresholds are required. Because of the nature of MANETs determining this threshold require a level of dynamism, without which its operation will be marred. Our earlier research work proposed an algorithmic framework to address the BSP problem, using the knowledge of it neighbourhood density to dynamically determine the threshold so as to adapt to both dense and sparse network while limiting the above stated constrains. In this work, we present the simulation result of our attempt to improve reachability of nodes in MANETs using Neighbourhood Density Knowledge (NDK). While the major characteristics of MANETs remain indeterminate behaviours in the number of participating nodes, mobility and sporadic topology changes based on nodal movement, ability of any supporting protocol to function under both sparsely and densely population of nodes. With the Counter based threshold value based on the neighbourhood information, an important metric considered is the reacheability which is defined in terms of the ratio of nodes that received the broadcast message out of the entire node in the network. Overall, the NDK approach performs best on both sparser and dense networks.