New Uneven Double Cluster Head Clustering Algorithm for WSN—UDCH Algorithm

作者：WU Zheng jiang; ZHAO Ming; DENG Yi qin

来源：小型微型计算机系统, 2016, 37(12).

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

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.

• 单位
  中南大学