基于跳数和剩余能量的WSN蚁群路由算法  

WSN Ant Colony Routing Algorithm Based on Hop Count and Residual Energy

作　　者：邓小军[1] 叶水生[1] 吕莉[2] 

机构地区：[1]南昌航空大学信息工程学院,南昌330063 [2]南昌工程学院信息工程学院,南昌330099

出　　处：《能源研究与管理》2011年第1期33-36,58,共5页Energy Research and Management

基　　金：江西省科技厅科技支撑项目;基于无线传感器网络的鄱阳湖环境监测系统设计(2009ZDG08400)

摘　　要：针对无线传感器网络能量受限的特点,将蚁群算法应用于无线传感器网络路由协议中,通过蚁群算法构造一条从源节点到目的节点的最小跳数路径,该算法不仅考虑了节点的跳数,而且还考虑了节点的剩余能量,多角度节能,延长了网络的寿命。为了防止局部最优,算法采用具有奖罚机制的信息素更新方法,即在搜索过程中,若发现的路径比以往的最优解更优则进行奖励,否则进行惩罚。结果表明,该算法各方面性能良好,并且优于目前几种典型路由算法。As the limitation of energy of wireless sensor network node,an ant colony algorithm was introduced,and the minimum hop path from source node to destination node was constructed,not only hops but also the residual energy of nodes were considered in this algorithm,which can economize energy and prolong the network lifetime.In order to prevent local optimization,a reward and punishment mechanism for the pheromone of updating method was used in this algorithm,namely,if the found path was better than ever most cost-effective solution in the search process was better to reward,or punishment.The results show that the algorithm is excellent and superior to the other current typical route algorithms.

关 键 词：跳数 剩余能量 无线传感器网络 蚁群算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]