Abstract
In this paper, we envision a solution to the problem of capturing an intruder in a product network. This solution is derived based on the assumed existing algorithms for basic member graphs of a graph product. In this problem, a team of cleaner agents are responsible for capturing 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 in a way that it can traverse any number of nodes contiguously as far as no agents reside in those nodes. Here, we consider a version of the problem where each agent can replicate new agents. Hence, the algorithm start with a single agent and new agents are created on demand.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barrière, L., Flocchini, P., Fraignaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Winnipeg, Manitoba, Canada, pp. 200–209 (2002)
Barrière, L., Fraigniaud, P., Santoro, N., Thilikos, D.M.: Searching is not jumping. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 34–45. Springer, Heidelberg (2003)
Day, K., Al-Ayyoub, A.: Minimal Fault Diameter of Highly resilient Product Networks. IEEE Trans. On Parallel and Distributed Systems 11(9) (September 2000)
Demirbas, M., Arora, A., Gouda, M.G.: 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)
Dimakopoulos, V.V., Dimopolulos, N.J.: A Theory for Total Exchange in Multidimensional Interconnection Networks. IEEE Trans. Parallel and Distributed Systems 9(7), 639–649 (1998)
Fernandez, A., Efe, K.: Generalized Algorithm for Parallel Sorting on Product Networks. IEEE Trans. Parallel and Distributed Systems 8(12), 1211–1225 (1997)
Fernandez, A., Efe, K.: Efficient VLSI Layouts for Homogeneous Product Networks. IEEE Trans. Computers 46(10), 1070–1082 (1997)
Flocchini, P., Huang, M.J., Luccio, F.L.: Contiguous search in the hypercube for capturing an intruder. In: Proc. 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Denver, Colorado (2005)
Harary, F.: On the Group of the Composition of Two Graphs. Duke Math. J. 26 (1959)
Henning, M.A., Rall, R.: On the Total Domination Number of Cartesian Products of Graphs. Graphs and Combinatorics 21, 63–69 (2005)
Imani, N., Sarbazi-Azad, H., Zomaya, A.Y.: Intrusion capturing in product networks, Technical Report TR-3-2006, IPM, School of Computer Science, Tehran, Iran (March 2006)
Klavzar, S., Yeh, H.: On the fractional chromatic number, the chromatic number, and graph products. Discrete Mathematics 247(1-3), 235–242 (2002)
Klavzar, S.: Coloring graph products – A survey. Discrete Mathematics 155(1), 135–145 (1996)
Ku, S., Wang, B., Hung, T.: Constructing Edge-Disjoint Spanning Trees in Product Networks. IEEE Transaction on Parallel And Distributed Systems 14(3) (March 2003)
Peng, S., Ko, M., Ho, C., Hsu, T., Tang, C.: Graph searching on Chordal graphs. Algorithmica 27, 395–426 (2000)
Xu, M., Xu, J.-M., Hou, X.-M.: Fault diameter of Cartesian product graphs. Information Processing Letters 93, 245–248 (2005)
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
Imani, N., Sarbazi-Azad, H., Zomaya, A. (2006). Capturing an Intruder in Product Networks. In: Robert, Y., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2006. HiPC 2006. Lecture Notes in Computer Science, vol 4297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945918_23
Download citation
DOI: https://doi.org/10.1007/11945918_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68039-0
Online ISBN: 978-3-540-68040-6
eBook Packages: Computer ScienceComputer Science (R0)