A Neighbor Discovery Algorithm for Flying Ad Hoc Network Using Directional Antennas

摘要

In this paper, we consider the neighbor discovery problem in Flying Ad Hoc Network using directional antennas. Based on realistic scenarios, the height of UAVs can be approximated to follow a Gaussian distribution. A novel 2-way neighbor discovery algorithm that adjusts the selection probability according to transmission space divided by pitch angle parameter is proposed. Then we derive analytical expressions of the probability of a successful discovery between two nodes and the expected value of time slots needed to complete the neighbor discovery. We also adopt a practical way to determine when to terminate the discovery procedure. Lastly, simulation results are presented to show the effectiveness of proposed algorithm.