By Topic

Theoretical analysis on a traffic-based routing algorithm of mobile agents

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

3 Author(s)
Wenyu Qu ; Graduate Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan ; Hong Shen ; Yingwei Jin

In this paper, we propose a mobile agent-based routing algorithm in which the traffic cost is considered. We define a traffic cost function for each link based on known traffic information and find the probability distribution that mobile agents may select a neighboring node and move to. We theoretically analyze the probability distribution and provide the optimal probability distribution that makes inference on the known traffic information and approximates to a unbiased distribution.

Published in:

Intelligent Agent Technology, IEEE/WIC/ACM International Conference on

Date of Conference:

19-22 Sept. 2005