By Topic

Dynamic matching approach for interest management in distributed agent-based simulation

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)
Yingxing Zhang ; Sch. of Comput. Sci., Nat. Univ. of Defense Technol., Changsha, China ; Yiping Yao

One key issue for distributed agent-based simulation is to maintain the shared environment state. The approach that distributes the environmental state to the relevant agents can overcome the performance bottleneck of the central way, while it needs to minimize irrelevant data transmission in network by using interest management. The performance of interest management strongly relies on the procedure that detecting relevant information between agents. This paper proposes an efficient matching approach which is good to deal with dynamic scenarios by limiting the matching computing only in the moving path. Our experiment results show that this matching approaching is suitable for the requirements of large-scale distributed agent-based simulation.

Published in:

Computer Application and System Modeling (ICCASM), 2010 International Conference on  (Volume:3 )

Date of Conference:

22-24 Oct. 2010