Neighbor Discovery with Capture Effect Based on Directional Transmission in Ad Hoc Networks

Abstract

This paper studies the capture effect on the neighbor discovery in directional Ad Hoc network. If the nodes in adopt the random neighbor discovery algorithm, the problem of packet conflict occurring in the process of neighbor discovery is solved by the capture effect, which makes the problem no longer invalid transmission and effectively improves the throughput and stability of the network. Through the comparison of the simulation results, it is concluded that under the capture effect, the total time slots needed by the nodes to complete the neighbor discovery process has been significantly increased. In addition, on the premise that the nodes have the capture effect, aiming at the influence of node transmission probability on the convergence rate of algorithm. The simulation experiments of three transmission probabilities are carried out. By comparing the total number of time slots consumed by nodes to complete the neighbor discovery process, it is concluded that the algorithm has a better performance when the transmission probability P <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</inf> =0.5.