无线传感器网络的自适应分簇组网算法研究

针对经典算法LEACH和HEED的不足,提出了一种能自适应分簇组网的优化算法。构建了节点信息权重模型,并借鉴邻节点信息交换的思想,在成簇过程中与探测范围内的节点交换权重信息,自适应完成分布式网络的簇首选举,并根据最小距离原则成簇。理论分析和仿真实验表明,该算法比LEACH和HEED算法选取的簇首及形成的簇结构更加合理,同时更有效地降低与均衡了网络的能耗,提高了传感器网络的生命周期。

Abstract：

A self-adaptive and optimized clustering algorithm was put forward according to the shortage of LEACH and HEED. The Heavy-weight model about nodes＇ messages was created,and the idea that neighbor nodes exchanged messages each other was used for reference. The nodes which were able to communicate with each other exchanged the Heavy-weight during making clusters,elect self-adaptively the cluster head in distributing networks,and made some clusters based on the minimum distance principle. The theoretic analysis and simulation results prove that the elected cluster head and cluster structure are more reasonable,the energy expenditure in networks is less,the longevity of networks is longer by the optimized algorithm compared to LEACH and HEED.

Research on Self-adaptive Clustering Algorithm for Wireless Sensor Networks

A self-adaptive and optimized clustering algorithm was put forward according to the shortage of LEACH and HEED. The Heavy-weight model about nodes＇ messages was created,and the idea that neighbor nodes exchanged messages each other was used for reference. The nodes which were able to communicate with each other exchanged the Heavy-weight during making clusters,elect self-adaptively the cluster head in distributing networks,and made some clusters based on the minimum distance principle. The theoretic analysis and simulation results prove that the elected cluster head and cluster structure are more reasonable,the energy expenditure in networks is less,the longevity of networks is longer by the optimized algorithm compared to LEACH and HEED.