Showing papers by "Karine Altisen published in 2018"
04 Nov 2018
TL;DR: It is shown that any algorithm of this class is silent and self-stabilizing under the distributed unfair daemon, and has a stabilization time polynomial in moves and asymptotically optimal in rounds.
Abstract: We formalize design patterns, commonly used in self-stabilization, to obtain general statements regarding both correctness and time complexity. Precisely, we study a class of algorithms devoted to networks endowed with a sense of direction describing a spanning forest whose characterization is a simple (i.e., quasi-syntactic) condition. We show that any algorithm of this class is (1) silent and self-stabilizing under the distributed unfair daemon, and (2) has a stabilization time polynomial in moves and asymptotically optimal in rounds. To illustrate the versatility of our method, we review several works where our results apply.
Posted Content•
TL;DR: In this article, the authors formalize design patterns commonly used in the self-stabilizing area to obtain general statements regarding both correctness and time complexity guarantees, and show that any algorithm of this class is silent and self-stable under the distributed unfair daemon, and has a stabilization time which is polynomial in moves and asymptotically optimal in rounds.
Abstract: In this paper, we formalize design patterns, commonly used in the self-stabilizing area, to obtain general statements regarding both correctness and time complexity guarantees. Precisely, we study a general class of algorithms designed for networks endowed with a sense of direction describing a spanning forest (e.g., a directed tree or a network where a directed spanning tree is available) whose characterization is a simple (i.e., quasi-syntactic) condition. We show that any algorithm of this class is (1) silent and self-stabilizing under the distributed unfair daemon, and (2) has a stabilization time which is polynomial in moves and asymptotically optimal in rounds. To illustrate the versatility of our method, we review several existing works where our results apply.
28 May 2018
TL;DR: In this paper, a solution complete les algorithmes de construction de tels echeanciers en limitant la reutilisation de cellules deja utilisees par des noeuds voisins.
Abstract: Les reseaux multi-sauts 802.15.4e TSCH s'appuient sur des echeanciers de communication efficaces. Notre solution complete les algorithmes de construction de tels echeanciers en limitant la reutilisation de cellules temps-frequence deja utilisees par des noeuds voisins. Nos simulations montrent un gain significatif par rapport a l'existant.