J4 ›› 2010, Vol. 48 ›› Issue (03): 433-438.

• 计算机科学 • 上一篇    下一篇

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

张重毅1,2, 刘彦斌1, 于繁华2, 刘大有1   

  1. 1. 吉林大学 计算机科学与技术学院, 长春 130012|2. 长春师范学院 计算机科学与技术学院, 长春 130032
  • 收稿日期:2009-10-26 出版日期:2010-05-26 发布日期:2010-05-19
  • 通讯作者: 刘大有 E-mail:liudy@jlu.edu.cn

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

ZHANG Zhongyi1,2, LIU Yanbin1, YU Fanhua2, LIU Dayou1   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;2. College of Computer Science and Technology, Changchun Normal University, Changchun 130032, China
  • Received:2009-10-26 Online:2010-05-26 Published:2010-05-19
  • Contact: LIU Dayou E-mail:liudy@jlu.edu.cn

摘要:

针对传感器节点在能量储备、 计算能力、 通信能力方面制约性强等问题, 采用进化算法理论, 提出一种适用于无线传感器网络的移动Agent路由选择算法. 该算法能为移动Agent探测具有最小能耗的路径, 同时保证信息收集的完整性. 实验结果表明, 该算法自适应性强, 可减少传感器节点的能量消耗, 满足无线传感器网络在实际应用中对移动Agent路由算法的需求.

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

Abstract:

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.

Key words: wireless sensor networks(WSNs), mobile Agent, routing problem, genetic algorithm

中图分类号: 

  • TP39