Research on Mobile Agent Migration Algorithm Based on Optimized Ant Colony Algorithm

2013 ◽  
Vol 5 (2) ◽  
pp. 649-656
Author(s):  
ZHANG Deyu ◽  
LI Chunyan
Keyword(s):  
Mobile Agent ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Agent Migration

Wireless Sensor Network Mobile Agent Routing Based on the Improved Ant Colony Algorithm

2014 ◽  
Vol 587-589 ◽  
pp. 2339-2345
Author(s):  
Jia Yan Li ◽  
Jun Ping Wang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Mobile Agent ◽  
Large Scale ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Redundant Data

This paper proposes a new wireless sensor routing algorithm by combining the ant colony algorithm with the mobile agent technology. This algorithm considers the distance and path energy overhead among nodes and residual node energy, equalizes the energy overhead in the network, improves the update rule of the ant colony information elements and speeds up convergence of the ant colony algorithm to get the optimal values. The simulation results indicate that this algorithm can improve the globalization and convergence speed, effectively reduce redundant data transmission and communication overhead, extend the network lifecycle and be very suitable for a large-scale wireless sensor network compared to other mobile agent routing algorithms.

Research of Hybrid Mobile Agent Routing in Wireless Sensor Network

2013 ◽  
Vol 341-342 ◽  
pp. 1181-1186
Author(s):  
Li Hong Zhang ◽  
Shu Qian Chen
Keyword(s):  
Mobile Agent ◽  
Ant Colony Algorithm ◽  
Data Transfer ◽  
Average Energy ◽  
Optimal Solution ◽  
Global Search ◽  
Ant Colony ◽  
Feedback Information ◽  
Low Efficiency ◽  
Average Energy Consumption

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.

Application Research of Improved Ant Colony Algorithm in Hybrid Mobile Agent Routing

2013 ◽  
Vol 734-737 ◽  
pp. 3093-3097
Author(s):  
Li Hong Zhang ◽  
Shu Qian Chen ◽  
Gui Zhi Bai
Keyword(s):  
Mobile Agent ◽  
Ant Colony Algorithm ◽  
Average Energy ◽  
Optimal Solution ◽  
Residual Energy ◽  
Ant Colony ◽  
Wireless Sensor Node ◽  
Feedback Information ◽  
Low Efficiency ◽  
Improved Ant Colony Algorithm

Mobile agent routing essentially is a multi-constraint optimization problem, for Ant Colony algorithm for global search capability is weak, the feedback information of the system does not use and has the problem of low efficiency of finding exact solutions, propose an improved Ant Colony Algorithm for WSN mobile agent routing. This algorithm takes full use of the wireless sensor node energy, the direction of ants is determined according to the residual energy and the distance of nodes, quickly 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, effectively alleviate network congestion, and extend the network lifetime.

Sign in / Sign up

Export Citation Format

Share Document