Cart (Loading....) | Create Account
Close category search window
 

Analysis on route selection by mobile agents using genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Selamat, A. ; Div. of Comput. & Syst. Sci., Osaka Prefecture Univ., Sakai, Japan ; Omatu, S.

Mobile agents often have the task to collect data from several predefined sites from the Internet. The tasks should be done in an efficient way by minimizing the elapsed time. This paper shows the optimal threshold point depends on the number of visits the mobile agent takes where the collected network information does not get outdated by using a genetic algorithm. Our mobile agent for routing algorithm tries to minimize the query retrieval cost while maintaining a reasonable path delay. Simulations results show that the proposed routing algorithm is able to obtain a better solution with different running parameters.

Published in:

SICE 2003 Annual Conference  (Volume:2 )

Date of Conference:

4-6 Aug. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.