检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘永广[1,2]
机构地区:[1]广东轻工职业技术学院,广东广州510300 [2]中国电子科技集团第七研究所,广东广州510310
出 处:《重庆邮电大学学报(自然科学版)》2014年第2期165-170,共6页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基 金:国家自然科学基金(61001113)~~
摘 要:通过对一种基于飞鸟迁徙原理的Ad hoc网络组网算法的研究,发现该算法中的信标报文发送、路由恢复等设计存在缺陷,从而产生网络负载增加、路由重建效率低下等问题,严重影响了路由算法的效率。针对信标报文发送存在的问题,设计了新的信标报文发送策略,该策略综合考虑了结点的移动距离、移动方向、移动范围内的结点密度等影响因素,并通过和一个新增加的心跳报文一起工作,来改善原算法中存在的问题;针对路由恢复存在的问题,通过在协议运行过程中生成一个应急路由表来避免原算法中的报文回传策略,从而提高原算法的效率。仿真表明,新算法能有效克服原算法的问题,降低了路由开销和平均时延,提高了成功率,网络的整体性能进一步得到提升。According to the research on a routing algorithm for ad hoc networks based on bird flight, the defects in the de-sign of sending beacon packets and route recovery in this algorithm were found and hence could cause network overload and low efficiency in route reconstruction. These problems influenced the algorithm' s efficiency severely. For the problems caused by beacon packets' sending, a new strategy of beacon packet' s sending was designed. The new strategy considered node's moving distance, moving direction and node's density in moving boundary. The new design improved the primary algorithm' s problem by working with a new added heart live message. For the problems caused by routing recovery, the primary algorithm' s efficiency was improved by avoiding the packet' s loopback strategy with an emergency routing table created during the protocol' s running. Simulations showed that the new algorithm could overcome the problems in the pri-mary algorithm effectively, decrease route load and average delay, and increase success ratio and improve the performance of the entire network further.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.146.157