光通信研究, 2013 (3): 60, 网络出版: 2013-06-25  

基于簇树AODVjr的混合动态成簇路由算法

A ClusterTree AODVjr-based hybrid dynamic cluster routing algorithm
蔡迎玲 1,2杨春勇 1,2谷瑑 1,2胡雯萱 1,2石珊 1,2
作者单位
1 中南民族大学 电子信息工程学院,湖北 武汉430074
2 智能无线通信湖北省重点实验室,湖北 武汉430074
摘要
针对ZigBee无线传感器网络在移动过程中严重丢包和能量受限问题,通过分析簇算法、簇树(ClusterTree)与AODVjr混合算法,设计了一种基于ClusterTree+AODVjr协议的混合动态成簇路由算法。该算法采用动态成簇机制,能够使节点移动后及时响应拓扑变化,快速重建网络连接,减少丢包现象,提高网络有效分组递交率;同时利用减少RREQ(路由请求分组)的洪泛广播来降低能耗。利用网络仿真器NS2进行了仿真实验,结果表明与原ClusterTree+AODVjr算法相比,该改进算法可平均降低14%的能耗,提高8%的平均有效分组递交率。
Abstract
In view of the serious packet loss and energy constraint in the movement of ZigBee wireless sensor networks, a hybrid dynamical cluster routing algorithm based on the ClusterTree+AODVjr protocol is designed on the basis of analyzing the cluster algorithm and the ClusterTree+AODVjr algorithm. By adopting the dynamic cluster mechanism, this algorithm enable the moved nodes to respond in time to the topological changes and rapidly reestablish network connection, thus reducing the packet loss and improving the effective packet delivery rate, while reducing the energy consumption by decreasing flood broadcast of RREQ packet. Simulation results by using network simulator NS2 show that compared with the original ClusterTree+AODVjr algorithm, this improved one can reduce energy consumption by 14% in average and increase average packet delivery rate by 8%.

蔡迎玲, 杨春勇, 谷瑑, 胡雯萱, 石珊. 基于簇树AODVjr的混合动态成簇路由算法[J]. 光通信研究, 2013, 39(3): 60. Cai Yingling, Yang Chunyong, Gu Zhuan, Hu Wenxuan, Shi Shan. A ClusterTree AODVjr-based hybrid dynamic cluster routing algorithm[J]. Study On Optical Communications, 2013, 39(3): 60.

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!