A Probing and p-Probability Based Two Round Directional Neighbor Discovery Algorithm

Neighbor node discovery is one of the important steps in a wireless directed ad hoc network. Improving the efficiency of neighbor node discovery can not only reduce the collision during node communication, but also improve the performance of the wireless ad hoc network as a whole. In the Ad-hoc network of directional antennas, by analyzing and summarizing the deficiencies of the neighbor discovery algorithm, this paper proposes a probing and p-probability based two round directional neighbor discovery algorithm (PPTR). The second round adjusts the probability of neighboring neighbor nodes competing for slots based on the number of free slots, successful slots, and collision slots in the first round, thereby reducing the collision of neighboring nodes to reach the maximum number of neighbors discovered within a fixed time. We verified the protocol through network simulation. The simulation results show that the PPTR algorithm and the traditional neighbor discovery algorithm have the same neighbor discovery efficiency when the number of network nodes and the number of time slots are consistent. But The neighbor discovery efficiency increases on average 81.3% when the number of nodes increases to five times the number of timeslots.