Research of Hybrid Mobile Agent Routing in Wireless Sensor Network
The mobile agent route is essentially a multi-constraint optimization problem,Genetic Algorithms has fast random global search ability,but the feedback information of the system does not use and has the problem of low efficiency of finding exact solutions,propose a genetic hybrid ant colony algorithm for WSN mobile agent route.Use of the fast random global search capabilities of genetic algorithm to find better solutions,then the better solution replaced by the initial pheromone of the ant colony algorithm,finally use the advantages of convergence speed of ant colony algorithm to find the global optimal solution for mobile agent route.Simulation results show that the algorithm can find optimal mobile agent route in a relatively short time,relative to other routing algorithms,reducing network latency and average energy consumption,improving the speed and efficiency of data transfer.
Routing algorithm GA ACA Wireless sensor network Mobile agent
Lihong Zhang Shuqian Chen
School of Computer Engineering,Huaihai Institute of Technology,Lianyungang,222005,China
国际会议
2013 International Conference on Energy Research and Power Engineering(2013能源研究与电力工程国际会议)(ERPE2013)
郑州
英文
1447-1452
2013-05-24(万方平台首次上网日期,不代表论文的发表时间)