Ad Hoc网络中按需路由协议的动态广播算法  

A Dynamic Broadcasting Algorithm for on-Demand Routing Protocol in Ad Hoc Network

作　　者：扈鹏[1] 刘元安[1] 马晓雷[1] 高松[1] 

机构地区：[1]北京邮电大学电子工程学院,北京100876

出　　处：《北京邮电大学学报》2009年第6期53-56,82,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家高技术研究发展计划项目(2008AA01Z211);国家自然科学基金项目(60802033;60873190)

摘　　要：为了提高Ad hoc网络的广播效率,分析了广播中的额外覆盖面积和信道竞争问题,并提出了一种针对按需路由协议的动态广播算法.该算法利用邻居节点的密度信息和距离信息来计算报文的转发概率,通过减小冗余报文的转发概率,减轻了信道竞争问题.仿真结果表明,该算法有效地减少了网络中的冗余信息,并提高了路由协议的效率.Broadcasting is a common operation for establishing on-demand routing protocols and updating routing table. A straightforward broadcasting by flooding results in serious redundancy and contention. To increase broadcasting efficiency of Ad hoc network, a dynamic broadcasting algorithm for on-demand routing protocol is proposed, which computes the rebroadcast probability of message based on neighbor node density and relative distance. Consequently the rebroadcast probability of redundancy message is reduced and the contention problem is alleviated. By applying this algorithm in network simulation platform, the simulation results show that the proposed algorithm improves the protocol efficiency and reduces the redundant information.

关 键 词：AD HOC网络 广播 动态广播算法 

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