Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foukia, N., Hulaas, J.G., Harms, J.: Intrusion Detection with Mobile Agents. In: Proc. of the 11th Annual Conference of the Internet Society, INET 2001 (2001)
Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an Intruder by Mobile Agents. In: Proc. of SPAA 2002, Winnipeg, Manitoba, Canada (2002)
Asaka, M., Okazawa, S., Taguchi, A., Goto, S.: A method of tracing intruders by use of mobile agents. In: Proc. of the 9th Annual Conference of the Internet Society, INET 1999 (1999)
Helmer, G.G., Wong, J.S.K., Honavar, V., Miller, L.: Intelligent agents for intrusion detection. In: IEEE Information Technology Conference, pp. 121–124 (1998)
Flocchini, P., Huang, M.J., Luccio, F.L.: Contiguous Search in the Hyperdiamond for Capturing an Intruder. In: Proc. 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Denver, Colorado (2005)
Breisch, R.: An intuitive approach to speleology. Southwestern Cavers 6, 72–78 (1967)
Parsons, T.D.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs, pp. 426–441. Springer, Heidelberg (1976)
Parsons, T.D.: The search number of a connected graph. In: Proc. Ninth Southeastern Conf. Combinatorics, Graph Theory and Computing, Winnipeg. Congress, vol. XXI, pp. 549–554 (1978)
Alspach, B.: Searching and Sweeping Graphs: A Brief Survey. (September 2004), accessible at ww.dmi.unict.it/combinatorics04/documenti%20pdf/alspach.pdf
Bienstock, D., Seymour, P.: Monotonicity in graph searching. Journal of Algorithms 12, 239–245 (1991)
Cao, F., Hsu, D.F.: Fault-tolerance properties of pyramid networks. IEEE Transactions on Computers 48(1), 88–93 (1999)
Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L.M.: Algorithmic construction of Hamiltonians in pyramids. Information Processing Letters 80, 75–79 (2001)
Dingle, A., Sudborough, H.: Simulation of binary trees and x-trees on pyramid networks. In: Proc. IEEE Symp. on Parallel & Distributed Processing, May 1992, pp. 220–229 (1992)
Leighton, F.T.: Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, San Francisco (1992)
Jenq, J.F., Sahni, S.: Image Shrinking and Expanding on a Pyramid. IEEE Transactions On Parallel and Distributed Systems 4(11), 1291–1296 (1993)
Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The complexity of searching a graph. Journal of the ACM 35(1), 18–44 (1988)
Demirbas, M., Arora, A., Gouda, M.: A pursuer-evader game for sensor networks. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 1–16. Springer, Heidelberg (2003)
Yospanya, P., Laekhanukit, B., Nanongkai, D., Fakcharoenphol, J.: Detecting and cleaning intruders in sensor networks. In: Proceedings of the National Comp. Sci. and Eng. Conf. (NCSEC 2004) (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shareghi, P., Imani, N., Sarbazi-Azad, H. (2006). Capturing an Intruder in the Pyramid. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_58
Download citation
DOI: https://doi.org/10.1007/11753728_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34166-6
Online ISBN: 978-3-540-34168-0
eBook Packages: Computer ScienceComputer Science (R0)