定向Ad hoc网络中一种带冲突避免的邻居发现算法  

A Neighbor Discovery Algorithm with Collision Avoidance in Ad hoc Networks Using Directional Antennas

作　　者：景中源 曾浩洋[1] 李大双[1] 毛建兵[1] 

机构地区：[1]中国电子科技集团公司第三十研究所,四川成都610041

出　　处：《通信技术》2015年第5期582-588,共7页Communications Technology

摘　　要：定向天线应用于ad hoc网络,一方面能显著提升网络性能,另一方面也需要新的MAC和路由协议来控制定向天线系统。邻居发现算法作为其中最重要的协议之一,是定向ad hoc网络组网的基础和前提,针对现有文献中提出的各种邻居发现算法大多没有考虑同一定向波束扇区内存在多个节点时的冲突情况,提出一种带冲突避免的定向邻居发现算法DAND/CA。DAND/CA通过随机选择发送控制消息占用的微时隙,能有效避免碰撞冲突的发生。仿真结果表明,提出的DAND/CA算法在邻居发现时间和成功率等方面明显优于现有算法。Directional antennas applied in Ad hoc network,could obviously improve network performance,and however,also needs new MAC and routing protocols to control the directional antenna system. Neighbor discovery algorithm,as one of the most important protocols,is the basis and premise for ad hoc networking. In the light that most of the proposed neighbor discovery algorithms consider no the collision case that multiple nodes exist in the same directional beam sector,a new directional neighbor discovery algorithm with collision avoidance called DAND / CA（ Directional Antenna Neighbor Discovery with Collision Avoidance） is proposed. DAND / CA algorithm could efficiently avoid collision case by randomly selecting mini-slot to transmit control messages. Simulation results indicate that the proposed DAND / CA is remarkably superior to the existing algorithms in terms of neighbor discovery time and success ratio.

关 键 词：定向天线 AD HOC网络 邻居发现 冲突避免 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]