作　　者： ; ; ;

机构地区： 汕头大学工学院电子工程系

出　　处： 《测试技术学报》 2011年第5期434-439,共6页

摘　　要： 非均匀分簇能有效解决由多跳路由引起的"热区"问题,但现有非均匀分簇算法在簇头选择时消耗大量能量.本文提出了基于时间驱动簇头选择非均匀分簇路由算法,它的核心是在簇头选择阶段,节点广播成为簇头消息的时间与其剩余能量成反比,广播半径为其竞争半径,并由节点广播半径构造出大小不等的簇,因此降低了算法消息复杂度以及节省了节点能量.仿真结果表明,与LEACH和EEUC算法比较,该算法能有效地均衡网络节点的能量消耗和延长网络的生存时间. Unequal clustering algorithm was effective to solve the problem of ＂hot region＂ which was caused by multi-hop routing, but it consumed a lot of energy in cluster head selection stage. This paper presents an unequal clustering algorithm based on time-driven cluster head selection. Its core is that the time of node broadcasting the message of node becoming cluster head is inversely proportional to its residual energy; the broadcasting radius is its competition radius in cluster head selection stage; and then the nodes use broadcast- ing radius to construct clusters of unequal sizes, which reduces the message complexity of the algorithm and saves nodes energy. Simulation results show that comparing with LEACH and EEUC, the routing algorithm effectively balances the energy consumption among sensors and achieves an obvious improvement on the net- works lifetime

关 键 词： 非均匀分簇 时间驱动簇头选择 多跳路由 竞争半径

领　　域： [自动化与计算机技术] [自动化与计算机技术]