Can I read Mobile Agents Rendezvous in spite of a Malicious Agent on EtoBox?

Mobile Agents Rendezvous in spite of a Malicious Agent by Das, Shantanu; Luccio, Flaminia L.; Markou, Euripides is a scholarly article available to read on EtoBox.

What is Mobile Agents Rendezvous in spite of a Malicious Agent about?

We examine the problem of rendezvous, i.e., having multiple mobile agents gather in a single node of the network. Unlike previous studies, we need to achieve rendezvous in presence of a very powerful adversary, a malicious agent that moves through the network and tries to block the honest agents and prevents them from gathering. The malicious agent is assumed to be arbitrarily fast, has full knowledge of the network and it cannot be exterminated by the honest agents. On the other hand, the honest agents are assumed to be quite weak: They are asynchronous and anonymous, they have only finite memory, they have no prior knowledge of the network and they can communicate with the other agents only when they meet at a node. Can the honest agents achieve rendezvous starting from an arbitrary configuration in spite of the malicious agent? We present some necessary conditions for solving rendezvous in spite of the malicious agent in arbitrary networks. We then focus on the ring and mesh topologies and provide algorithms to solve rendezvous. For ring networks, our algorithms solve rendezvous in all feasible instances of the problem, while we show that rendezvous is impossible for an even num

Author

Das, Shantanu; Luccio, Flaminia L.; Markou, Euripides

Published

2014

Language

EN