基于定向天线的自组网邻居发现及链路调度算法

Neighbor Discovery and Link Schedule Algorithm in Ad hoc Based on Directional Antennas

由于定向天线具有增大覆盖范围、降低干扰的优点,它成为提升自组织网络性能的关键技术之一。文章基于纯定向天线的自组织网络,提出了快扫描邻居节发现(NDFS,Neighbor Discovery based on Fast Scanning)和基于抑制检查的链路调度(LSSC,Link Schedule based on Suppression Check)算法。NDFS算法通过定位扫描结合发送扫描,能够在无外部基准时钟条件下,迅速地发现邻居节点,有效缩短网络建立的时间和节点再入网时间。同时,LSSC算法利用抑制检查确定链路的共存条件,可以有效避免链路干扰,增大时隙复用率,提高了网络容量和吞吐量。理论分析和计算机仿真结果均验证了所提算法的优势。

The advantages of directional antennas make it one of the key technologies of improving the ad hoc performance, which include increasing the communication distance and reducing interference. Based on pure directional antennas, A new neighbor discovery and link schedule algorithm are proposed in this paper, termed Neighbor Discovery Based on Fast Scanning(NDFS)and Link Schedule Based on Suppression Check(LSSC). By orienting scaning combined with sending scanning, neighbor can be discovered without external reference clock rapidly, which shortens the time of building and accessing networks. Meanwhile,the conditions of links coexisting can be determined by LSSC in the use of suppression check. The link interference is effectively avoided and the slot reuse ratio also is raised, which improve the network capacity and throughput. Theoretical analysis and computer simulation results have verified the advantages of the proposed algorithm.