一种基于遗传算法的无线传感器网络路由算法  

A Solution of Routing Problem Based on Generation Algorithm in Wireless Sensor Networks

作　　者：张重毅[1,2] 刘彦斌[1] 于繁华[2] 刘大有[1] 

机构地区：[1]吉林大学计算机科学与技术学院,长春130012 [2]长春师范学院计算机科学与技术学院,长春130032

出　　处：《吉林大学学报（理学版）》2010年第3期433-438,共6页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:60603030;60773099;60703022;60873149);国家高技术研究发展计划863项目基金(批准号:2006AA10Z245;2006AA10A309)

摘　　要：针对传感器节点在能量储备、计算能力、通信能力方面制约性强等问题,采用进化算法理论,提出一种适用于无线传感器网络的移动Agent路由选择算法.该算法能为移动Agent探测具有最小能耗的路径,同时保证信息收集的完整性.实验结果表明,该算法自适应性强,可减少传感器节点的能量消耗,满足无线传感器网络在实际应用中对移动Agent路由算法的需求.The authors analyzed the constraint conditions and the objective function of the mobile Agent routing problem in WSNs. We employed the theory of evolutionary algorithm to propose a new method of genetic operation in connection of the constraints of the energy reserves,computing power,and the communicating ability of the sensor node,i.e.,a routing selecting algorithm for mobile Agent in WSNs. This algorithm can detect the path with the minimal energy consumption for mobile Agent,and also ensure the integrity of information-gathering. The experimental results show that this algorithm has the better adaptability,and can reduce the energy consumption of sensor node,which better meets the WSNs demand of mobile Agent routing algorithm in the real world.

关 键 词：无线传感器网络(WSNs) 移动AGENT 路由问题 遗传算法 

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