摘要
针对低能量自适应分簇路由LEACH存在的簇头分布不均和路由通信代价过大的缺陷,提出了一种基于蚁群的区域簇头选择路由算法(LEACH-ACANEW).首先,将整个网络划分为若干个Dirichlet图单元,然后综合考虑节点剩余能量与消耗能量的关系,在单元区域内选取簇头,最后通过优化人工蚂蚁的路径选择机制,搜索到簇头和汇聚节点之间数据通信的全局最优路径.仿真试验表明,与其他同类算法相比,LEACH-ACANEW算法在节省节点能量消耗和延长网络生命周期方面,效果明显.
A routing algorithm of cluster heads selection in regions（LEACH-ACANEW） based on ant colony algorithm was proposed by analyzing the problems of Low-Energy Adaptive Clustering Hierarch（LEACH） that of uneven cluster heads distribution and excessive cost caused by routing communication.Firstly,divided the whole network into several Dirichlet cell.Then selected cluster heads in each cell with considering the relationship of residual energy and consumed energy.At last,optimized path selection mechanism of artificial ant in order to search the global optimal data communication path between cluster heads and sink node.The simulation results show that LEACH-ACANEW performances more significant on saving energy consumption and prolonging the network life cycle than other similar algorithms.
出处
《长沙理工大学学报（自然科学版）》
CAS
2012年第2期75-80,共6页
Journal of Changsha University of Science and Technology:Natural Science
基金
湖南省自然科学基金资助项目(09JJ6094)
湖南省科技计划资助项目(2011FJ3082)
关键词
无线传感器网络
分簇路由
区域划分
蚁群算法
信息素
局部最优
wireless sensor network（WSN）
clustering routing
regional division
ant colony optimization（ACO）
pheromone
local optimum
