Stéphane Devismes

Learn More
Given an arbitrary network $G$ of {\ndes} with unique IDs and no designated leader,and given a $k$-dominating set $I\subseteq G$, we propose a silent self-stabilizing distributed algorithm that computes a subset $D$ of $I$ which is a minimal $k$-dominating set of $G$.Using $D$ as the set of cluster heads, a partition of $G$ into clusters, each of radius(More)
In this paper, we propose a silent self-stabilizing asynchronous distributed algorithm for constructing a kclustering of any connected network with unique IDs. Our algorithm stabilizes in O(n) rounds, using O(log n) space per process, where n is the number of processes. In the general case, our algorithm constructs O(n/k) k-clusters. If the network is a(More)
We consider a team of k identical, oblivious, and semi-synchronous mobile robots that are able to sense (i.e., view) their environment, yet are unable to communicate, and evolve on a constrained path. Previous results in this weak scenario show that initial symmetry yields high lower bounds when problems are to be solved by deterministic robots. In this(More)
Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization only gives probabilistic convergence to a correct behavior. Also, weak-stabilization only gives the(More)
We propose SR3, a secure and resilient algorithm for convergecast routing in WSNs. SR3 uses lightweight cryptographic primitives to achieve data confidentiality and data packet unforgeability. SR3 has a security proven by formal tool. We made simulations to show the resiliency of SR3 against various scenarios, where we mixed selective forwarding, blackhole,(More)
We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating exploration (exploration for short) of a grid-shaped network by a team of k asynchronous oblivious robots in the asynchronous non-atomic model, so-called CORDA. In more details, we first consider the ATOM model. We show that it is impossible to explore a grid of at(More)
We propose SR3, a secure and resilient algorithm for convergecast routing in WSNs. SR3 uses lightweight cryptographic primitives to achieve data confidentiality and data packet unforgeability. SR3 has a security proven by formal tool. We made simulations to show the resiliency of SR3 against various scenarios, where we mixed selective forwarding, blackhole,(More)
In this paper, we address the unison problem. We consider the self-stabilizing algorithm proposed by Boulinier <i>et al</i>. We exhibit a bound on the step complexity of its stabilization time. In more details, the stabilization time of this algorithm is at most 2<i>Dn</i><sup>3</sup> + (&alpha; + 1)<i>n</i><sup>2</sup> + (&alpha; -- 2<i>D</i>)<i>n</i>(More)
In this paper, we present a silent algorithm for finding cut-nodes and bridges in arbitrary rooted networks. This algorithm must be composed with an algorithm from Collin and Dolev. This latter algorithm is also silent and computes a Depth First Search ( ) Spanning Tree of the network. The composition of these two algorithms is self-stabilizing: starting(More)