-
Mobility model and resource allocation in high efficiency opportunistic networks
When a major disaster occurs, such as an earthquake or fire, the efficiency of the rescue workers depends of the coordination between the different emergency teams.... -
L-distance-edge-coloring and clustering : studies and self-stabilizing algori...
Graph coloring is a famous combinatorial optimization problem and is very attractive for its numerous applications. Many variants and generalizations of the... -
Algorithme de k-partitionnement auto-stabilisant et compétitif
International audience -
Fault-tolerant and Self-stabilizing Mobile Robots Gathering - Feasibility Stu...
Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial location and no initial... -
Dominating sets-based Self* Minimum Connected Covers of Query Regions in Sens...
Sensor networks are mainly used to gather strategic information in various monitored area. Sensors may be deployed in zones where their internal memory or the sensors... -
Clustering auto-stabilisant à k sauts dans les réseaux Ad Hoc
International audience -
Self-stabilizing algorithms for spanning tree construction and for the manage...
In the context of large-scale networks, the consideration of faults is an evident necessity. This document is focussing on the self-stabilizing approach which aims at...
