Ad Hoc网络邻居发现协议算法分类及现状研究  

Research on Neighbor Discovery Protocol Algorithm Status and Types in Ad Hoc Network

作　　者：高斐[1] 赵娜[1] GAO Fei;ZHAO Na(Beijing Polytechnic,Beijing 100176)

机构地区：[1]北京电子科技职业学院,北京100176

出　　处：《软件》2021年第10期81-83,共3页Software

摘　　要：由于邻居发现是移动自组网的常规工作,对路由和组网具有基础支撑作用,且由于能耗的限制,移动自组网必须以低功耗的方式实现邻居发现工作,因此邻居发现一直是学术界研究的热点问题。本文通过研究大量关于邻居发现的研究论文分析了邻居发现协议的分类。目前主流的邻居发现协议是基于全向天线的单信道邻居发现算法,包括单信道概率性邻居发现算法、单信道确定性邻居发现算法。此外也有基于定向天线的单信道邻居发现算法等。Because neighbor discovery is a routine work of mobile Ad Hoc networks,it provides basic support for routing and networking.Moreover,due to the limitation of energy consumption,mobile Ad Hoc networks must realize neighbor discovery with low power consumption.Therefore,neighbor discovery has always been a hot issue in academic research.This paper analyzes the classification of neighbor discovery protocols by studying a large number of research papers on neighbor discovery.At present,the mainstream neighbor discovery protocols are single-channel neighbor discovery algorithms based on omnidirectional antenna,including single-channel probabilistic neighbor discovery algorithm and single-channel deterministic neighbor discovery algorithm.In addition,there are also single-channel neighbor discovery algorithms based on directional antennas.

关 键 词：Ad Hoc 邻居发现 邻居发现协议 

分 类 号：TN925.9[电子电信—通信与信息系统]