-
Security and pseudo-anonymity with a cluster-based approach for MANET
International audience -
Efficient multicore scheduling of dataflow process networks
International audience -
Multiple Target Discovery and Coverage with Mobile Wireless Sensors
International audience -
How to gather asynchronous oblivious robots on anonymous rings
A set of robots arbitrarily placed on the nodes of an anonymous graph have to meet at one common node and remain in there. This problem is known in the literature as... -
Asynchronous distributed principal component analysis using stochastic approx...
International audience -
Partitionable group membership in mobile ad hoc networks
In Mobile Ad hoc NETworks or MANETs, partitionable group membership is a basic service for building partition-tolerant applications. None of the existing... -
Applications and DTN services for cooperative UAVs fleet
The work presented in this thesis, carried out at LaBRI, deals with the set up of a fleet of UAVs and the porting on it of distributed collaborative applications that... -
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... -
Easily rendering token-ring algorithms of distributed and parallel applicatio...
We propose in this paper a new algorithm that, when called by existing token ring-based algorithms of parallel and distributed applications, easily renders the token... -
A Simple Broadcast Algorithm for Recurrent Dynamic Systems
This paper presents a simple broadcast algorithm suited to dynamic systems where links can repeatedly appear and disappear. The algorithm is proved correct and a... -
Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network
Computing with mobile agents is rapidly becoming a topic of mainstream research in the theory of distributed computing. The main research questions undertaken in this... -
From an intermittent rotating star to a leader
Ce rapport présente un protocole d'élection d'un leader inéluctable dans un système réparti défini par des hypothèses de synchronisme très faible. \\Considering an... -
Bounding the Impact of Unbounded Attacks in Stabilization
International audience -
Distributed control of job-shop systems via edge reversal dynamics for automa...
International audience -
Signature-Free Asynchronous Byzantine Consensus with $t < n/3$ and $O(n^2)$ M...
International audience -
Presentation and study of some distributed algorithm problems
In this thesis, we first present a study of several problems in the field of distributed algorithms. We provide a formal model that relies on anonymous networks. In... -
On the complexity of distributed BFS in ad hoc networks with spontaneous wake...
Distributed Computing and Networking
