20 datasets found

Best Paper Award

In large scale multihop wireless networks, flat architectures are not scalable. In order to overcome this major drawback, clusterization is introduced to support...

We propose a transformer building a silent self-stabilizing with service guarantee 1-hop clustering protocol TP of an input silent self-stabilizing 1-hop clustering...

Graph coloring is a famous combinatorial optimization problem and is very attractive for its numerous applications. Many variants and generalizations of the...

This work is under review in Distributed Computing Journal

International audience

Containment-based trees encompass various handy structures such as B+-trees, R-trees and M-trees. They are widely used to build data indexes, range-queryable overlays,...

In graph searching, a team of mobile agents aims at clearing the edges of a contaminated graph. To clear an edge, an agent has to slide along it, however, an edge can...

Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial location and no initial...

Ad hoc networks are spontaneous wireless networks without any wired infrastructure, composed of mobile terminals. We assume that nodes must collaborate to set up an...

Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits. Speculation consists in guaranteeing that the...

We propose a fast silent self-stabilizing building a k-independent dominating set, named FID. The convergence of protocol FID is established for any computation under...

International audience

International audience

12 pages -- Edition: World Scientific Version 2: soumission ArXiv

14 pages; International conférence; Uniform self-stabilizing variant of the problem

International audience

International audience

International audience

International audience