The complexity of searching a graph
Journal of the ACM (JACM)
Monotonicity in graph searching
Journal of Algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault Tolerance Properties of Pyramid Networks
IEEE Transactions on Computers
Algorithmic construction of Hamiltonians in pyramids
Information Processing Letters
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Image Shrinking and Expanding on a Pyramid
IEEE Transactions on Parallel and Distributed Systems
Contiguous Search in the Hypercube for Capturing an Intruder
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
A pursuer-evader game for sensor networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Connected searching of weighted trees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Connected searching of weighted trees
Theoretical Computer Science
| Hi-index | 0.00 |
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.