Dynamic Probabilistic Broadcast based on Neighbour Discovery

Abstract

Abstract Broadcasting in Ad hoc networks is an important information dissemination way. However, flooding may give rise to broadcast storm problem which causes severe contention, collision and delay. This paper proposes a dynamic probabilistic broadcast algorithm based on neighbour discovery that ensures the higher reliability at lower retransmission. The dynamic probabilistic broadcast algorithm forwards the information from the node (INode) that has obtained it to the node (UNode) that has not received it. By counting the number of UNode and INode of neigbors, INodes dynamically adjust the probability of broadcasting to reduce the number of information replication but cover more UNodes. Dynamic probabilistic algorithm can not only effectively reduce the number of retransmission, but also ensure the effectiveness and reliability. Simulation results show that the number of broadcasting of this algorithm is significantly lower than other algorithms.