一种新的无线传感器网络非均匀分簇双簇头算法——UDCH 算法

能量利用效率问题是WSN 领域中一个研究的挑战,因电源容量对其起着至关重要的作用,针对WSN 中分簇路由算 法产生能量空洞问题并且大的分簇中簇头任务过重,同时也为了提高WSN的能量利用效率,提出了一种无线传感器网络非均匀分簇双簇头算法——UDCH. 该算法先综合考虑节点诸项信息(如节点剩余能量、节点到基站的距离、运行轮数的奇偶性等) 来选举簇头,将整个网络划分为大小不等的簇;在规模大些的簇内,再选取副簇头, 然后簇头再构造基于最小生成树的最优传输 路径,通过一系列的仿真结果我们发现 UDCH 路由算法在WSN节约平衡节点能量消耗方面表现优良.

Energy efficiency issues are a challenge in the field of study of WSN because of its power capacity plays a vital role. In traditional clustering routing algorithms for WSN, energy hole and head of cluster's task is too heavy, causing a limited application. To solve the above problems and improve the energy efficiency, we present a new nonuniform double cluster head clustering algorithm for WSN-UDCH. The algorithm firstly takes all nodes's information (such as residual energy, distance from the node to the base station, run rounds parity etc. ) into consideration to select a cluster head. Then the whole network is divided into clusters of varying sizes. In some of the large-scale clusters, and then select deputy clusters head. At last, cluster head then construct optimal transmission path based on the minimum spanning tree. A series of simulation results confirm that UDCH performs well in saving and balancing node energy consumption for WSN.