摘要
针对带定向天线无线Mesh网络的邻居发现问题,提出一种双令牌动态异步邻居发现(D-DANDi)算法。在时间异步条件下,该算法通过节点的扇区轮换发现邻居,把已发现节点的分享信息快速加入当前节点的邻居表。基于迭代深入搜索思想实现双令牌并行邻居发现,快速建立局部网络的拓扑。仿真结果表明,在不同节点数和不同扇区数的设置下,该算法的相关性能均优于典型异步邻居发现算法,能够提高邻居发现速度。
To tackle the neighbor discovery issue of wireless mesh networks with directional antennas,a dual-token dynamic asynchronous neighbor discovery(D-DANDi)algorithm was proposed.Under asynchronous conditions,the node sector rotation was employed to discover neighbors,and the shared information from discovered nodes was instantly added into the neighbor table of the current node.The dual-token parallel neighbor discovery was implemented based on the iterative deep search idea,facilitating the rapid topology construction of the local network.Simulation results demonstrate the superior performance of the proposed algorithm compared to that of typical asynchronous neighbor discovery algorithms,showcasing that it can accelerate neighbor discovery speed with varying nodes and sectors.
作者
赵训威
吉芝璐
吴晓军
张春玲
王志刚
白杰
ZHAO Xun-wei;JI Zhi-lu;WU Xiao-jun;ZHANG Chun-ling;WANG Zhi-gang;BAI Jie(Institute of Information and Communication Technology,State Grid Information and Telecommunication Group Co.,Ltd,Beijing 100052,China;School of Software Engineering,Faculty of Electronic and Information Engineering,Xi’an Jiaotong University,Xi’an 710000,China)
出处
《计算机工程与设计》
北大核心
2025年第5期1311-1317,共7页
Computer Engineering and Design
基金
国网信息通信产业集团有限公司科技基金项目(52680021N00D)。
关键词
无线MESH网络
定向天线
邻居发现
双令牌
并行邻居
扇区轮换
时间异步
wireless Mesh network
directional antennas
neighbor discovery
dual token
parallel neighbor
sector rotation
time asynchrony
