| Autor: |
Grigoriev, Dima, Harrison, John, Hirsch, Edward A., Shareghi, Pooya, Imani, Navid, Sarbazi-Azad, Hamid |
| Zdroj: |
Computer Science - Theory & Applications; 2006, p580-590, 11p |
| Abstrakt: |
In this paper, we envision a solution for the problem of capturing an intruder in one of the most popular interconnection topologies, namely the pyramid. A set of agents collaborate to capture a hostile intruder in the network. While the agents can move in the network one hop at a time, the intruder is assumed to be arbitrarily fast, i.e. it can traverse any number of nodes contiguously as far as there are no agents in those nodes. Here we consider a new version of the problem where each agent can replicate new agents when needed, i.e. the algorithm starts with a single agent and new agents are created on demand. In particular, we propose two different algorithms on the pyramid network and we will later discuss about the merits of each algorithm based on some performance criteria. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
