基于减聚类优化算法的无线传感网络分簇路由协议研究

无线传感网络是当前无线网络研究的热点领域,分簇路由协议作为降低网络能耗、提高网络生存时间的核心技术而备受关注。在深入分析已有算法存在诸多不足的基础上,本文提出了一种基于减聚类优化的分簇路由算法。本文首先建立一阶能耗模型,确定网络最优簇首数量;然后建立减聚类优化数学模型,确定可供选择的分簇方案;最后以最小化最大簇内距离方差作为评价指标,确定最优的分簇结果。仿真结果表明:相比经典的LEACH分簇路由协议,该算法划分的网络能够有效地降低网络能耗、提高网络生存时间,弥补已有算法的不足之处。

Research on Clustering Routing Algorithm for Wireless Senor Networks Based on the Improved Subtractive Clustering Algorithm

Wireless Senor Network (WSN) is a hot spot of the research of wireless networks currently; clustering routing protocol is the key of controlling the node energy to improve the lifetime of the WSN. After analyzing the drawbacks of the existing algorithms, this paper puts forward a routing algorithm based on the improved subtractive clustering algorithm. Firstly, the algorithm analyzed the one-order energy consumption model and put forward the calculation formula of optimum cluster-head number according to the lowest energy consumption principle. Then, this paper build the improved the classical subtractive clustering algorithm (ISCA), several clustering solutions can be calculated by the ISCA. On that basis, this paper gives the indexes to evaluate the clustering solutions. Results of simulation show that comparing with LEACH clustering routing; performance of the lifetime can be improved and more stable.