Advertisement

Intruder Capture in Sierpiński Graphs

  • Flaminia L. Luccio
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)

Abstract

In this paper we consider the problem of capturing an intruder in a networked environment. The intruder is defined as a mobile entity that moves arbitrarily fast inside the network and escapes from a team of software agents. The agents have to collaborate and coordinate their moves in order to isolate the intruder. They move asynchronously and they know the network topology they are in is a particular fractal graph, the Sierpiński graph SG n .

We first derive lower bounds on the minimum number of agents, number of moves and time steps required to capture the intruder. We then consider two models: one in which agents have a capability, of “seeing” the state of their neighbors; the second one in which the actions of the agents are leaded by a coordinator. One of our goals is to continue a previous study on what is the impact of visibility on complexity: we have found that in this topology the visibility assumption allows us to reach an optimal bound on the number of agents required for the cleaning strategy. On the other hand, the second strategy relies only on local computations but requires an extra agent and a higher (by a constant) complexity in terms of time and number of moves.

Keywords

Mobile agents intruder capture Sierpiński graphs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barrière, L., Comellas, F., Dalfó, C.: Fractality and the small-world effect in Sierpiński graphs. Journal of Physics A: Mathematical and General 39, 11739–11753 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proceedings of the 14-th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Winnipeg, Manitoba, Canada, pp. 200–209. ACM Press, New York (2002)Google Scholar
  3. 3.
    Blin, L., Fraigniaud, P., Nisse, N., Vial, S.: Distributed Chasing of Network Intruders by Mobile Agents. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 70–84. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Breish, R.: An intuitive approach to speleotopology. Southwestern cavers VI(5), 28–72 (1967)Google Scholar
  5. 5.
    Ellis, J.A., Sudborough, I.H., Turner, J.S.: The vertex separation and search number of a graph. Information and Computation 113, 50–79 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Flocchini, P., Huang, M.J., Luccio, F.L.: Decontamination of chordal rings and tori. In: Proceedings of the 8th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), Rodi, Greece, 2006. Extended version to appear in International Journal of Foundations of Computer Science (IJFCS) (2006)Google Scholar
  7. 7.
    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), IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  8. 8.
    Flocchini, P., Luccio, F.L., Song, L.X.: Size Optimal Strategies for Capturing an Intruder in Mesh Networks. In: Proceedings of the International Conference on Communications in Computing (CIC), Las Vegas, USA, pp. 200–206 (2005)Google Scholar
  9. 9.
    Flocchini, P., Nayak, A., Shulz, A.: Cleaning an arbitrary regular network with mobile agents. In: Proceedings of the 2nd International Conference on Distributed Computing & Internet Technology (ICDCIT), Bhubaneswar, India, pp. 132–142 (2005)Google Scholar
  10. 10.
    Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. Theoretical Computer Science 47, 205–218 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Lapaugh, A.: Recontamination does not help to search a graph. Journal of the ACM 40(2), 224–245 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Parson, T.: Pursuit-evasion problem on a graph. In: Theory and applications of graphs. Lecture Notes in Mathematics, pp. 426–441. Springer, Heidelberg (1976)Google Scholar
  14. 14.
    Sierpiński, W.: Sur une courbe dont tout point est une point de ramification. C.R. Acad. Sci. Paris 160, 302–305 (1915)zbMATHGoogle Scholar
  15. 15.
    Teufl, E., Wagner, S.: The number of spanning trees of finite Sierpiński graphs. In: Proceedings of the 4th Colloquium on Mathematics and Computer Science, DMTCS, pp. 411–414 (2006)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Flaminia L. Luccio
    • 1
  1. 1.Dipartimento di Informatica, Università Ca’ Foscari Venezia, VeniceItaly

Personalised recommendations