大规模WSN分簇路由蚁群算法的研究  

Clustering Routing Algorithm for Large-scale Wireless Sensor Networks Based on Ant Colony System

作　　者：余成波[1] 熊飞[1] 李洪兵[1,2] 张一萌[1] 刘峪瑄[1] 

机构地区：[1]重庆理工大学远程测试与控制技术研究所,重庆400050 [2]重庆三峡学院,重庆404100

出　　处：《四川兵工学报》2011年第11期1-5,共5页Journal of Sichuan Ordnance

基　　金：重庆市科技攻关项目(CSTC2;011AC2179);重庆市科技创新项目(渝经信科技[2010]9号);重庆市九龙坡科技计划项目(九龙坡科委发[2009]52号)

摘　　要：为提高大规模WSN路由性能,提出了基于蚁群算法的无线传感器网络分簇路由算法。首先将网络节点进行聚类,将整个网络分解成一些小规模的区域类,然后利用蚁群算法对每个区域类并行求解最佳路径,并将所有区域类的路径解按一定规则生成整个网络路由的较优解。该算法根据聚类特征对任务进行分解,利用蚁群算法并行求解子问题后再生成全局解的方式,极大地加快了算法的求解速度,对建立大规模WSN路由有着重要启示。算法的时间复杂度和仿真测试分析表明,此算法具有良好的性能。To improve the routing performance of large-scale wireless sensor networks--WSN , the clustering routing algorithm is proposed for wireless sensor networks based on ant colony algorithm. Firstly cluster the network nodes, decompose the entire network into some small-scale regional categories, then use the ant colony algorithm parallel to solve the optimum path for each region and generate the entire optimum network routing according to certain rules based on each regional path solution. The way that the algorithm decomposes the task according to the clustering features and uses the ant colony algorithm to generate a global solution through the sub -problems solutions parallel worked out before accelerates the speed of the algorithm solution. It gives an important inspiration to the establishment of routing for large-scale WSN. The algorithm＇ s time complexity analysis and simulation tests show that the algorithm has a good performance.

关 键 词：WSN 分簇路由 蚁群算法 聚类 大规模网络 

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