一种基于节点相关度的无线传感器网络分簇算法

提出了一种基于节点相关度的无线传感器网络分簇算法。该算法根据接收信号强度、节点剩余能量和网络连通度选取簇头节点,根据节点相关度确定簇内成员。分析与仿真结果表明,与经典的LEACH算法相比,该算法选出的簇头分布更均匀,并提高了簇内负载平衡程度,延长了网络生存时间。

A Better Algorithm for Choosing Cluster Heads for Wireless Sensor Network

Aim. Prolonged network lifetime,good scalability and proper load balancing are important requirements for many sensor network applications.We now propose an algorithm for choosing cluster heads that we believe can be fairly satisfactory for meeting these important requirements.We call our algorithm CANC(clustering algorithm based on node correlation).In the full paper,we explain in some detail our algorithm and its simulation results.In this abstract,we just add some pertinent remarks to listing the two topics of explanation.The first topic is: CANC.Its subtopics are: the establishment of clusters(subtopic 1.1) and the stable communication among clusters(subtopic 1.2).The sub-subtopics of subtopic 1.1 are: choosing cluster heads(sub-subtopic 1.1.1),choosing cluster members(sub-subtopic 1.1.2),the computation of node connectivity and correlation(sub-subtopic 1.1.3),and the optimum number of cluster heads(sub-subtopic 1.1.4).Sub-subtopic 1.1.1 forms a part of the core of this paper.At the end of subtopic 1.2,we mention that the optimum total number of nodes is re-fixed after every ten stages,where each stage includes the establishment of clusters and the stable communication among clusters.The second topic is: simulation results and their analysis.There are six figures in the full paper summarizing the simulation results.These simulation results show preliminarily that the new CANC algorithm can make cluster-heads well distributed and achieve good performance in terms of system lifetime,scalability,and LBF(load balancing factor).