一种定向无线自组网邻居发现算法

针对使用定向天线的无线移动网络在自组网过程中邻居搜索时间较长且不确定性较大等问题，提出了一种根据二进制编码序列确定收发模式的异步邻居发现算法，通过为每个节点分配独立的二进制编码来确定节点的收发模式，并根据收发状态给出确定的节点波束扫描方式。讨论了应用于该算法的编码需要满足的条件，并给出一个满足要求的编码序列组，在节点时间异步情况下完成邻居发现的时长具有确定的上界。仿真结果表明，相较其他确定时长的异步邻居搜索算法，该算法能够提高节点间相互发现概率，缩减节点邻居发现的平均和最大用时。

A neighbor discovery algorithm for wireless ad hoc networks with directional antennas

For the problems of long neighbor searching time and great uncertainty in the networking process of wireless ad hoc networks using directional antennas,an asynchronous neighbor discovery algorithm is proposed which determines the transmit receive mode according to binary code.More precisely,the transmit receive mode of nodes is determined by assigning an independent binary code to each node,and the beam scanning mode of the node is given according to the transmit receive status.The conditions that codes applied in this algorithm should satisfy are discussed,and a sequence group that meets the requirements is proposed.When the clock between nodes is asynchronous,the time needed to complete the neighbor discovery has a definite upper bound.Simulation results demonstrate that compared with other asynchronous algorithms with a certain searching time,the proposed algorithm can improve the probability of mutual discovery among nodes and reduce the average and maximum time for node neighbor discovery.