CAJ | 학술논문

针对低能量自适应分簇路由LEACH存在的簇头分布不均和路由通信代价过大的缺陷,提出了一种基于蚁群的区域簇头选择路由算法（LEACH-ACANEW）.首先,将整个网络划分为若干个Dirichlet图单元,然后综合考虑节点剩余能量与消耗能量的关系,在单元区域内选取簇头,最后通过优化人工蚂蚁的路径选择机制,搜索到簇头和汇聚节点之间数据通信的全局最优路径.仿真试验表明,与其他同类算法相比,LEACH-ACANEW算法在节省节点能量消耗和延长网络生命周期方面,效果明显.
침대저능량자괄응분족로유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.