首页 | 官方网站   微博 | 高级检索  
     

Ad Hoc网络中按需路由协议的动态广播算法
引用本文:扈鹏,刘元安,马晓雷,高松. Ad Hoc网络中按需路由协议的动态广播算法[J]. 北京邮电大学学报, 2009, 32(6): 53-56
作者姓名:扈鹏  刘元安  马晓雷  高松
作者单位:北京邮电大学,电子工程学院,北京,100876;北京邮电大学,电子工程学院,北京,100876;北京邮电大学,电子工程学院,北京,100876;北京邮电大学,电子工程学院,北京,100876
基金项目:国家高技术研究发展计划项目,国家自然科学基金项目 
摘    要:为了提高Ad hoc网络的广播效率,分析了广播中的额外覆盖面积和信道竞争问题,并提出了一种针对按需路由协议的动态广播算法. 该算法利用邻居节点的密度信息和距离信息来计算报文的转发概率,通过减小冗余报文的转发概率,减轻了信道竞争问题. 仿真结果表明,该算法有效地减少了网络中的冗余信息,并提高了路由协议的效率.

关 键 词:Ad hoc网络  广播  动态广播算法
收稿时间:2009-04-09
修稿时间:2009-09-17

A Dynamic Broadcasting Algorithm for on-Demand Routing Protocol in Ad Hoc Network
HU Peng,LIU Yua-nan,MA Xiao-lei,GAO Song. A Dynamic Broadcasting Algorithm for on-Demand Routing Protocol in Ad Hoc Network[J]. Journal of Beijing University of Posts and Telecommunications, 2009, 32(6): 53-56
Authors:HU Peng  LIU Yua-nan  MA Xiao-lei  GAO Song
Affiliation:(School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China)
Abstract:Broadcasting is a common operation in on-demand routing protocols to establish and refresh routing table. A straightforward broadcasting by flooding is usually very costly and will result in serious redundancy and contention. A dynamic broadcasting algorithm for on-demand routing protocol is proposed, which computes the rebroadcast probability of message through neighbor node density and relative distance. The rebroadcast probability of redundancy message is reduced and the contention problem is alleviated. By applying this algorithm to ODMRP protocol in ns-2 platform, the simulation results show that the proposed algorithm improves the protocol efficiency and reduces the redundant information.
Keywords:Ad Hoc network  broadcast  dynamic broadcasting algorithm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号