欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了提高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.
同期刊论文项目
同项目期刊论文
An Adaptive Algorithm for Connecting Mobile Ad Hoc Network to Internet with Unidirectional Links Sup
Joint relay selection and power allocation algorithm in two-way relay networks with proportional fai
期刊信息
位置：