New Uneven Double Cluster Head Clustering Algorithm for WSN—PUDCH Algorithm*

作者：DAI Zhiqiang; YAN Cheng; WU Zhengjiang

来源：传感技术学报, 2016, 29(12).

DOI：10.3969/j.issn.1004-1699.2016.12.022

• wireless sensor networks
• double cluster head
• parity
• uneven clustering
• minimum spanning tree

Energy utilization efficiency problem has been a bottleneck restricting the wide application of WSN,and the energy capacity of each network node is very important. In view of the WSN"energy hole problem"and due to the cluster head role overload caused by excessive energy consumption and to improve the energy efficiency of WSN proposed non uniform clustering algorithm of dual cluster head—PUDCH a wireless sensor network. The algorithm first considering node comprehensive information such as the distance of the residual energy of node,the node to the base station,according to the comprehensive information of the node through the mechanism of competition in different time to elect cluster heads,the whole network is divided into uneven clustering;in the larger clusters,in order to reduce the burden of light cluster head then select vice cluster head. Finally,the cluster head is then constructed based on the optimal transmission path of the minimum spanning tree. A series of simulations show that the PUDCH routing algorithm has excellent performance in the energy consumption of WSN saving and balancing nodes.

• 单位
  吉首大学