At the core of distributed computing there is the necessity to coordinate a group of entities in face of the uncertainty present in the environment. Classically, such uncertainty was mainly the one introduced by the loss or the delay of messages (asynchrony and failures). In this chapter we focus on the uncertainty introduced by the dynamism of the communication topology. We use the paradigm of mobile agents. In such paradigm the computational entities are intelligent messages circulating on top of a dynamic graph. We consider the problems of Exploration, Gathering and Deployment. We survey the most recent results in this interesting and relatively new field
This paper describes how multiple interacting swarms of adaptive mobile agents can be used to locate...
this paper we present a contrasting model, a dynamic, wireless, peer to peer network with routing ta...
. Contemporary computer networks are heterogeneous; even a single network consists of many kinds of ...
At the core of distributed computing there is the necessity to coordinate a group of entities in fac...
The past two decades have seen the rapid growth and development of the field of distributed computin...
International audienceWe study the standard communication problem of broadcast for mobile agents mov...
This chapter introduces and discusses the existing computational models employed in the literature f...
The provision of a reliable communication infras-tructure for mobile agents is still an open researc...
International audienceMobile agents are a well-known paradigm for the design and implementation of d...
In the graph exploration problem, a team of mobile computational entities, called agents, arbitraril...
This paper shows how mobile agents can use a dynamic routing algorithm to guarantee message transmis...
In highly dynamic networks, topological changes are not anomalies but rather integral part of their ...
In this thesis we study mobile agent systems consisting of a network of nodes and a set of autonomou...
International audienceSelf-stabilization is a versatile technique to withstand any transient fault i...
Abstract — This paper describes an original approach to writing reactive algorithms on highly dynami...
This paper describes how multiple interacting swarms of adaptive mobile agents can be used to locate...
this paper we present a contrasting model, a dynamic, wireless, peer to peer network with routing ta...
. Contemporary computer networks are heterogeneous; even a single network consists of many kinds of ...
At the core of distributed computing there is the necessity to coordinate a group of entities in fac...
The past two decades have seen the rapid growth and development of the field of distributed computin...
International audienceWe study the standard communication problem of broadcast for mobile agents mov...
This chapter introduces and discusses the existing computational models employed in the literature f...
The provision of a reliable communication infras-tructure for mobile agents is still an open researc...
International audienceMobile agents are a well-known paradigm for the design and implementation of d...
In the graph exploration problem, a team of mobile computational entities, called agents, arbitraril...
This paper shows how mobile agents can use a dynamic routing algorithm to guarantee message transmis...
In highly dynamic networks, topological changes are not anomalies but rather integral part of their ...
In this thesis we study mobile agent systems consisting of a network of nodes and a set of autonomou...
International audienceSelf-stabilization is a versatile technique to withstand any transient fault i...
Abstract — This paper describes an original approach to writing reactive algorithms on highly dynami...
This paper describes how multiple interacting swarms of adaptive mobile agents can be used to locate...
this paper we present a contrasting model, a dynamic, wireless, peer to peer network with routing ta...
. Contemporary computer networks are heterogeneous; even a single network consists of many kinds of ...