Learn More
Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at their assumptions on the underlying network. This paper focuses on the study of such assumptions in dynamic networks, where the connectivity is expected to change, predictably or not, during the execution. Our main contribution is a(More)
—This paper proposes a new solution to the problem of self-deploying a network of wireless mobile robots with simultaneous consideration to several criteria, that are, the fault-tolerance (biconnectivity) of the resulting network, its coverage, its diameter, and the quantity of movement required to complete the deployment. These criteria have already been(More)
— This paper investigates the problem of building and maintaining distributed spanning trees in dynamic networks. Contrarily to previous solutions, we do not assume the existence of stabilization periods between topological changes, and address the more general case where such changes may occur at anytime and disconnect the network. Hence, we present an(More)
Ensuring the security of services in a distributed system requires the collaboration of all the elements involved in providing this service. In this paper we present how the security of collaborative distributed services is ensured in the Java Card TM1 Grid project carried out at LaBRI, Labora-toire Bordelais de Recherche en Informatique. The aim of this(More)
We address the problem of testing whether a given dynamic graph is temporally connected , i.e. a temporal path (also called a journey) exists between all pairs of vertices. We consider a discrete version of the problem, where the topology is given as an evolving graph G = {G1, G2, ..., G k } whose set of vertices is invariant and the set of (directed) edges(More)