Dealing with broadcast storm problem in Mobile Ad Hoc Networks

Routing in ad-networks has been a challenging task ever since the wireless networks came into existence. The major reason for this is the constant change in network topology because of the high degree of node mobility. Hence a dynamic routing protocol is needed for these networks to function properly. These protocols using a blind flooding mechanism for broadcasting messages from one to another node. The major drawback of this mechanism is the broadcast storm problem because lots of contention and collision exist in the network and the blind flooding approach may increase broadcast redundancy. In this book, we are proposing an approximation algorithm for the mobile ad hoc network. The proposed mechanism is able to reduce the broadcast redundancy and helps to avoid the broadcast redundancy problem. This work proposes an approach based on the theory of neighbor knowledge to improve the construction of Minimal CDS in the mobile ad hoc network. With the help of the new algorithm, the average message burden of the network could be reduced so that routing becomes much easier and can adapt quickly to network topology changes.