Όλο το DSpace

Πλοήγηση ανά Συγγραφέα "Markou, E."

Αποτελέσματα 1-8 από 8

    • Black hole search and exploration in unoriented tori with synchronous scattered finite automata 

      Markou, E.; Paquette, M. (2012)
      We consider the problem of locating a black hole in a synchronous, anonymous, and unoriented torus network using mobile agents. A black hole is a harmful network node that destroys any agent visiting it without leaving any ...

    • Black hole search with finite automata scattered in a synchronous torus 

      Chalopin, J.; Das, S.; Labourel, A.; Markou, E. (2011)
      We consider the problem of locating a black hole in synchronous anonymous networks using finite state agents. A black hole is a harmful node in the network that destroys any agent visiting that node without leaving any ...

    • Deterministic symmetric rendezvous with tokens in a synchronous torus 

      Kranakis, E.; Krizanc, D.; Markou, E. (2011)
      In the rendezvous problem, the goal for two mobile agents is to meet whenever this is possible. In the rendezvous with detection problem, an additional goal for the agents is to detect the impossibility of a rendezvous ...

    • Emergency Connectivity in Ad-hoc Networks with Selfish Nodes 

      Karakostas, G.; Markou, E. (2014)
      Inspired by the CONFIDANT protocol (Buchegger and Boudec in Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 226-236, 2002), we define and study a basic reputation-based ...

    • Improved periodic data retrieval in asynchronous rings with a faulty host 

      Bampas, E.; Leonardos, N.; Markou, E.; Pagourtzis, A.; Petrolia, M. (2014)
      The exploration problem has been extensively studied in unsafe networks containing malicious hosts of a highly harmful nature, called black holes, which completely destroy mobile agents that visit them. In a recent work, ...

    • Online graph exploration with advice 

      Dobrev, S.; Královič, R.; Markou, E. (2012)
      We study the problem of exploring an unknown undirected graph with non-negative edge weights. Starting at a distinguished initial vertex s, an agent must visit every vertex of the graph and return to s. Upon visiting a ...

    • Tight bounds for black hole search with scattered agents in synchronous rings 

      Chalopin, J.; Das, S.; Labourel, A.; Markou, E. (2013)
      We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole is a harmful stationary process residing in a node of the ...

    • Tight bounds for scattered black hole search in a ring 

      Chalopin, J.; Das, S.; Labourel, A.; Markou, E. (2011)
      We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole destroys all mobile agents visiting that node without leaving ...