改进K-ACO无线传感器网络的分簇路由算法  

Improved K-ACO clustering routing algorithm for wireless sensor networks

作　　者：戴菲菲[1] 彭力[1,2] 董国勇[1] 

机构地区：[1]江南大学物联网工程学院,江苏无锡214122 [2]江南感知能源研究院,江苏无锡214122

出　　处：《传感器与微系统》2013年第8期135-138,共4页Transducer and Microsystem Technologies

基　　金：国家自然科学基金资助项目(60973095)

摘　　要：针对现有分簇路由算法普遍存在分簇不均匀、整体网络能耗不均衡的问题,提出了改进K-ACO分簇路由算法。K-medoids聚类算法对随机分布的传感器节点进行聚类,这样很好地解决了分簇不均匀的缺点,同时结合改进的蚁群算法,在更换簇头节点和簇头之间数据传输选择下一跳节点时,综合考虑了节点的剩余能量,达到均衡整个网络的能耗,仿真结果表明:与其他路由算法相比较,提出的K-ACO路由算法性能较优,达到延长网络生命周期的效果。Aiming at the problems of uneven clustering and unbalanced overall network energy consumption,the existing clustering routing algorithms commonly have,improved K-ACO clustering routing algorithm is proposed.K-medoids clustering algorithm can cluster random distributed sensor nodes,which solves shortcoming of uneven clustering.Combined with improved ant colony algorithm,when replace the cluster head node and select the next hop node for data transmission between the cluster head nodes,this algorithm can consider node residual energy and balance network energy consumption.Simulation results show K-ACO algorithm has better performance and longer network life cycle compared with other routing algorithms.

关 键 词：无线传感器网络 K-medoids聚类的蚁群优化 路由算法 分簇算法 

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