• Agent placement in wireless embedded systems: Memory space and energy optimizations 

      Tziritas, N.; Loukopoulos, T.; Lalis, S.; Lampsas, P. (2010)
      Embedded applications can be structured in terms of mobile agents that are flexibly installed on available nodes. In wireless systems, such nodes typically have limited battery and memory resources; therefore it is important ...
    • Black virus decontamination of synchronous ring networks by initially scattered mobile agents 

      Giachoudis N., Kokkou M., Markou E. (2020)
      We study the Black Virus Decontamination problem in ring topologies for initially scattered mobile agents. In this problem a number of mobile agents operate in a network where one of its nodes u is hostile (contaminated) ...
    • Broadcasting with Mobile Agents in Dynamic Networks 

      Das S., Giachoudis N., Luccio F.L., Markou E. (2021)
      We study the standard communication problem of broadcast for mobile agents moving in a network. The agents move autonomously in the network and can communicate with other agents only when they meet at a node. In this model, ...
    • Dangerous graphs 

      Markou E., Shi W. (2019)
      Anomalies and faults are inevitable in computer networks, today more than ever before. This is due to the large scale and dynamic nature of the networks used to process big data and to the ever-increasing number of ad-hoc ...
    • Different speeds suffice for rendezvous of two agents on arbitrary graphs 

      Kranakis E., Krizanc D., Markou E., Pagourtzis A., Ramírez F. (2017)
      We consider the rendezvous problem for two robots on an arbitrary connected graph with n vertices and all its edges of length one. Two robots are initially located on two different vertices of the graph and can traverse ...
    • Gathering of robots in a grid with mobile faults 

      Das S., Giachoudis N., Luccio F.L., Markou E. (2019)
      The gathering of two or more agents in a graph is an important problem in the area of distributed computing and has been extensively studied especially for the fault free scenario. In this paper we consider the mobile ...
    • Gathering of robots in a ring with mobile faults 

      Das S., Focardi R., Luccio F.L., Markou E., Squarcina M. (2019)
      This paper studies the well-known problem of gathering multiple mobile agents moving in a graph, but unlike previous results, we consider the problem in the presence of an adversarial mobile entity which we call the malicious ...
    • Gathering of robots in a ring with mobile faults 

      Das S., Focardi R., Luccio F.L., Markou E., Moro D., Squarcina M. (2016)
      In this paper, we consider the problem of gathering mobile agents in a graph in the presence of mobile faults that can appear anywhere in the graph. Faults are modeled as a malicious mobile agent that attempts to block the ...
    • A health care monitoring system that uses ontology agents 

      Christopoulou S.C., Kotsilieris T., Anagnostopoulos I. (2016)
      The healthcare domain is mission critical and vast research efforts keep being funded in order to improve life quality of people. Health management consists of specific cooperation intensive activities, while medical ...
    • 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, ...
    • Interconnecting distributed virtual worlds using Metabots: Performance evaluation against the traditional client-server model 

      Kotsilieris, T.; Karetsos, G. T.; Anagnostopoulos, I.; Dimopoulou, N. A. (2014)
      Virtual Worlds evolution is breaking the barriers of virtual isolation, thus allowing users to participate in geographically dispersed and culturally diverse places. At the same time, mobile agents have been established ...
    • Mobile agents rendezvous in spite of a malicious agent 

      Das S., Luccio F.L., Markou E. (2015)
      We examine the problem of rendezvous, i.e., having multiple mobile agents gather in a single node of the network. Unlike previous studies, we need to achieve rendezvous in presence of a very powerful adversary, a malicious ...
    • On deploying tree structured agent applications in networked embedded systems 

      Tziritas, N.; Loukopoulos, T.; Lalis, S.; Lampsas, P. (2010)
      Given an application structured as a set of communicating mobile agents and a set of wireless nodes with sensing/actuating capabilities and agent hosting capacity constraints, the problem of deploying the application ...
    • 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 ...