By Topic

Mobile agents for electing a leader

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

1 Author(s)
Deugo, D. ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada

We present a technique for mapping a distributed algorithm to a set of homogeneous agents that solves the general distributed control problem known as election. Election is a decentralized, cooperative information task where one system or node from n is elected as the leader. Our solution is as efficient as the message-based election algorithm, but does not rely on message passing between custom protocols located on communicating nodes. Rather, the proposed solution relies on mobile agents. We show that the number of agent transfers is equivalent to the number of messages in the original algorithm. We also present an environment model for distributed agents that supports not only the mapping of election agents but other agent-based solution to distributed control problems that use distributed algorithms

Published in:

Autonomous Decentralized Systems, 1999. Integration of Heterogeneous Systems. Proceedings. The Fourth International Symposium on

Date of Conference: