基于SVM的LEACH分簇算法优化

针对LEACH算法中簇首分布不均匀和每轮循环簇首数目未知的缺陷,提出两方面的优化：①基于SVM的优化,即考虑节点的地理位置,寻找支持向量并对网络进行区域划分,改善簇首分布不均匀的缺陷.②改进LEACH算法的簇首选举机制,即规定每轮循环的簇首数目,改善LEACH算法中簇首数目未知的缺陷.最后对优化的LEACH算法进行实验,实验结果表明,优化后的算法能有效延长整个网络的生存周期,降低网络能量消耗.

Optimization of LEACH Clustering Algorithm Based on SVM

The uneven distribution of cluster-heads and the uncertainty of the number of cluster-heads in every loop cause defects in the LEACH algorithm. In this paper, the optimization from two different aspects based on the above problems is proposed. The first one is the optimization based on the SVM, that is, taking the location of the node into consideration and searching for supporting vectors to divide the wireless sensor network （WNS） into several zones, which can relieve the inefficiency caused by the unbalanced distribution of the cluster heads. The second one is to improve the cluster-heads selection mecha- nism in the LEACH algorithm, that is to say, solving inefficiency caused by the uncertainty of the number of cluster-heads in every loop through defining the number of cluster-heads in every single loop. From the analysis of the statistics and data collected from the simulation experiments of the improved LEACH algorithms, the conclusion can be drawn that the optimized algorithm can prolong the life cycle of WNS effectively as well as decrease the energy consumption of WNS obviously.