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

A ClusterTree AODVjr-based hybrid dynamic cluster routing algorithm

作　　者：蔡迎玲[1,2] 杨春勇[1,2] 谷瑑[1,2] 胡雯萱[1,2] 石珊[1,2] 

机构地区：[1]中南民族大学电子信息工程学院,湖北武汉430074 [2]智能无线通信湖北省重点实验室,湖北武汉430074

出　　处：《光通信研究》2013年第3期60-63,共4页Study on Optical Communications

基　　金：国家自然科学基金资助项目(61002013)

摘　　要：针对ZigBee无线传感器网络在移动过程中严重丢包和能量受限问题,通过分析簇算法、簇树(ClusterTree)与AODVjr混合算法,设计了一种基于ClusterTree+AODVjr协议的混合动态成簇路由算法。该算法采用动态成簇机制,能够使节点移动后及时响应拓扑变化,快速重建网络连接,减少丢包现象,提高网络有效分组递交率;同时利用减少RREQ(路由请求分组)的洪泛广播来降低能耗。利用网络仿真器NS2进行了仿真实验,结果表明与原ClusterTree+AODVjr算法相比,该改进算法可平均降低14%的能耗,提高8%的平均有效分组递交率。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-4-AODVjr protocol is designed on the basis of analyzing the clus- ter algorithm and the ClusterTreeq-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＋AOD- Vjr algorithm, this improved one can reduce energy consumption by 14% in average and increase average packet delivery rate by 8%.

关 键 词：ClusterTree+AODVjr混合算法 动态成簇 能耗 分组递交率 

分 类 号：TN929.11[电子电信—通信与信息系统]