Mobile agent routing based on a two-stage optimization model and a hybrid evolutionary algorithm in wireless sensor networks

Authors:
Shaojun Yang;Rui Huang;Haoshan Shi
Affiliations:
School of Electronics and Information, Northwestern Polytechnical University, Xi'an, Shaanxi, P.R. China;School of Electronics and Information, Northwestern Polytechnical University, Xi'an, Shaanxi, P.R. China;School of Electronics and Information, Northwestern Polytechnical University, Xi'an, Shaanxi, P.R. China
Venue:
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Year:
2006

Citing 9
Cited 0

Next century challenges: scalable coordination in sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Integrity protection for code-on-demand mobile agents in e-commerce

Journal of Systems and Software
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Directed diffusion for wireless sensor networking

IEEE/ACM Transactions on Networking (TON)
Optimal Component Configuration and Component Routing

IEEE Transactions on Mobile Computing
A Formal Framework for Agent Itinerary Specification, Security Reasoning and Logic Analysis

ICDCSW '05 Proceedings of the Third International Workshop on Mobile Distributed Computing - Volume 06
On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks

IEEE Transactions on Knowledge and Data Engineering
Multiresolution data integration using mobile agents in distributedsensor networks

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new two-stage optimization model for mobile agent routing in the wireless sensor network is presented as a integer linear programming problem based on the virtual connection topology sub graph. In the model, the solution is presented by two subpaths instead of the closed path which is usually applied in many path search methods to keep balance between computation cost and accuracy. A hybrid technique of genetic algorithm (GA) integrated with discrete particle swarm optimization (PSO), GAPSO is designed to solve the problem. Simulation experiments with different sizes and distributions of nodes show the effectiveness of the new model and GAPSO algorithm.