A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Move-optimal gossiping among mobile agents
Theoretical Computer Science
Optimal moves for gossiping among mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
| Hi-index | 0.00 |
We present a technique for mapping a distributed algorithm to a set of homogeneous agents that solves the general distributed control problem know 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.