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

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

作　　者：杨海波[1] 华惊宇[2] 刘半藤[1] 

机构地区：[1]浙江树人大学信息学院,杭州310015 [2]东南大学移动通信国家重点实验室,南京210096

出　　处：《传感技术学报》2012年第11期1603-1606,共4页Chinese Journal of Sensors and Actuators

基　　金：浙江省科技计划项目(2012R10011-6);东南大学移动通信国家重点实验室开放基金项目(2010D06)

摘　　要：无线传感网络是当前无线网络研究的热点领域,分簇路由协议作为降低网络能耗、提高网络生存时间的核心技术而备受关注。在深入分析已有算法存在诸多不足的基础上,本文提出了一种基于减聚类优化的分簇路由算法。本文首先建立一阶能耗模型,确定网络最优簇首数量;然后建立减聚类优化数学模型,确定可供选择的分簇方案;最后以最小化最大簇内距离方差作为评价指标,确定最优的分簇结果。仿真结果表明:相比经典的LEACH分簇路由协议,该算法划分的网络能够有效地降低网络能耗、提高网络生存时间,弥补已有算法的不足之处。Wireless Sensor Network （WSN）is the very important issue in the wireless network research. As the key technology, clustering routing protocol can control the node energy to improve the lifetime of the WSN. After analyzing the existing algorithms, this paper puts forward a routing algorithm based on the improved subtractive clustering algorithm. Firstly, this paper analyzed the one-order energy consumption model and put forward the calculation formula of optimum number of cluster-head according to the lowest energy consumption principle. Then, this paper build the improved classical subtractive clustering algorithm （ISCA）, several clustering solutions can be calculated by the ISCA. On that basis, this paper gives the indexes to evaluate this several clustering solutions to choose the best routing solution. Results of simulation show that comparing with LEACH clustering routing, the lifetime can be improved and more stable.

关 键 词：无线传感网络 分簇算法 减聚类算法 路由协议设计 LEACH 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]