检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李想 朱小军[2] 冯斯梦 董超 张磊 LI Xiang;ZHU Xiaojun;FENG Simeng;DONG Chao;ZHANG Lei(College of Electronic and Information Engineering,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China;College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China)
机构地区:[1]南京航空航天大学电子信息工程学院,南京211106 [2]南京航空航天大学计算机科学与技术学院,南京211106
出 处:《计算机科学》2025年第3期306-317,共12页Computer Science
基 金:国家自然科学基金重点项目(61931011);国家自然科学基金面上项目(62372230)。
摘 要:对当前无线定向自组网领域中的定向邻居发现算法的相关研究成果进行了系统性总结。首先,从定向自组网在无线通信中的重要性出发,介绍了相关背景知识和基本概念,指出其在无线通信领域的研究前景。然后,依据不同的技术标准,对定向邻居发现算法进行了多个维度的分类和比较,分别深入探讨了各种算法在不同应用场景下的适用性和局限性,具体分类包括基于扫描序列设计的确定性和随机性算法、同步和异步算法、纯定向和全向辅助发现算法、全盲和半盲算法,以及直接和间接邻居发现算法。接着,结合提出的分类方法以及算法的实际应用情况,详细阐述了部分重要定向邻居发现算法的设计原理及其收敛过程,包括确定及随机性邻居发现算法、异步邻居发现算法,以及利用机器学习技术的优化算法。最后,探讨了定向邻居发现算法的未来研究方向及应用趋势。A systematic summary is provided for the research achievements in directional neighbor discovery algorithms within the current domain of wireless directional ad hoc networks.Initially,stemming from the crucial significance of directional ad hoc networks in wireless communication,relevant background knowledge and fundamental concepts are introduced,delineating its research prospects in the realm of wireless communication.Subsequently,based on distinct technical standards,directional neighbor discovery algorithms are categorized and compared across multiple dimensions,delving into various applicable scenarios and associated limitations.Specific classifications include deterministic and random algorithms based on scanning sequence design,synchronous and asynchronous algorithms,purely directional and omnidirectional-assisted discovery algorithms,blind and semi-blind algorithms,as well as direct and indirect neighbor discovery algorithms.Moreover,by integrating the proposed classification methodology with the practical application scenarios of algorithms,the design principles and convergence processes of significant directional neighbor discovery algorithms are elaborately elucidated,including deterministic and random neighbor discovery algorithms,asynchronous neighbor discovery algorithms,and optimization algorithms utilizing machine learning techniques.Lastly,the future research directions and application trends of directional neighbor discovery algorithms are deliberated upon.
关 键 词:邻居发现 定向天线 定向自组网 无线网络 扫描序列 异步算法
分 类 号:TN827.4[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49