摘要
在Ad Hoc网络中,定向天线的应用需要新的邻居发现算法来发现节点的邻居并建立链路。介绍了一种基于扫描的邻居发现算法,考虑了由于单个波束方向上有超过一个的邻居节点而造成的碰撞情况,通过仿真讨论在有碰撞情况和无碰撞情况的拓扑结构下,2种算法下已发现邻居个数与扫描时间的关系,证明改进后算法可在有碰撞的情况下有效地发现邻居,并针对不同的静默概率进行仿真,分析静默概率对邻居发现效率的影响。
The application of directional antennas in ad hoc networks requires new neighbor discovery algorithm for setting up links between nodes and their neighbors. This paper proposes a scan-based algorithm for neighbor discovery, taking into account the collision in condition that more than one node exists in single directional beam.Based on simulation ,the two algorithms are discussed in the topology structure with or without collisions, and the relation between accumulated probability and scan time of neighbor discovery. The simulation results indicate the superiority of the improved algorithm in finding neighbors.The simulation is done for different silent probability to analyze the impact of silent probability on discovery efficiency.
出处
《无线电工程》
2014年第2期9-12,33,共5页
Radio Engineering
关键词
定向天线
邻居发现
碰撞
OPNET仿真
directional antennas
neighbor discovery
collision
OPNET simulation
