Research of Hybrid Mobile Agent Routing in Wireless Sensor Network

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1181-1186

Citation:

Online since:

July 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Tilak S, Abu Ghazaleh N B, Heinzelman W. A taxonomy of wireless micro sensor network models[J]. Mobile Computing and Communications Review, 2002, 1(2): 1-8.

DOI: 10.1145/565702.565708

Google Scholar

[2] YU Fei, GUO Jing, HU Ji-zhen, Study and Simulation of a Wireless Sensor Networks Routing Protocol[J]. Journal of Qingdao University of Science and Technology, 2011, 32(1): 95-99.

Google Scholar

[3] JIANG Chang-Jiang, SHI Wei-Ren, TANG Xian-Lun. Energy-Balanced Unequal Clustering Routing Protocol for Wireless Sensor Networks[J]. Journal of Software , 2012, 23(5): 1122-1132.

DOI: 10.3724/sp.j.1001.2012.04061

Google Scholar

[4] Qi H, Iyengar S S, Chakrabarty K. Multi-resolution data integration using mobile agents in distributed sensor networks[J]. IEEE Trans on Systems, Man, and Cybernetics-Part C: Applications and Reviews, 2001, 31(3): 383-291.

DOI: 10.1109/5326.971666

Google Scholar

[5] YAO Yong-jie, XI Qing-biao, LIU Huixia. Path Planning for UAVs Based on Improved GA Algorithm[J]. Computer Simulation , 2011, 28(6): 44-48.

Google Scholar

[6] Fang Wangsheng Li Feilong. Mobile Agent Routing Algorithm Based on Improved Adaptive Genetic Algorithm in WSN[J]. Computer & Digital Engineering, 2010, 38(12): 4-7.

Google Scholar

[7] Peotta L, Vandergheynst P. Matching pursuit with block incoherent dictionaries[J]. IEEE Trans. On Signal Processing, 2007, 55(9): 4549-4557.

DOI: 10.1109/tsp.2007.896022

Google Scholar

[8] Corlorni A, Dorigo M, Maniezzo V, et al. Ant system for job-shop scheduling[J]. Belgian J Opera Rees Statistic Compute Sci, 2009, 34(1): 34-53.

Google Scholar