Dominique Désérable

Prof. Dominique Désérable

Institut National des Sciences Appliquées de Rennes, Rennes, Bretagne, France
orcid

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2002 in SIAM Journal on Applied Mathematics
Verified
Journal Article
Closed access
Dominique DésérableDominique Désérable
Dominique Désérable
We present a two-dimensional cellular automata network applied to granular flow and often called a "lattice-grain" model. The time evolution is purely kinematical and is governed by an original two-stage, synchronous "request-exchange" mechanism. The transition rule follows a simple logic including three physical components: an external field, a set of kinematical exclusion rules, and an inertial effect. The transition rule also includes a mode which propagates the void while preserving synchrony. The versatility of the model, which allows user-defined initial and boundary conditions, is illustrated by examples.

1 July 1999 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
Dominique DésérableDominique Désérable
Dominique Désérable

15 March 2011 in Complex Systems
Verified
Journal Article
Closed access
Dominique DésérableDominique Désérable
Dominique Désérable
PDPascal Dupont
Pascal Dupont
MHMustapha Hellou
Mustapha Hellou
SKSiham Kamali-Bernard
Siham Kamali-Bernard

16 June 2022 in Natural Computing
Verified
Journal Article
Open access
PDF file
RHRolf Hoffmann
Rolf Hoffmann
Dominique DésérableDominique Désérable
Dominique Désérable
FSFranciszek Seredynski
Franciszek Seredynski
The problem of an optimal coverage of a wireless sensor network area is considered. To solve this problem, a Cellular Automata (CA) approach is proposed. More specifically, the objective is to find CA rules which are able to cover the 2D space by a minimum number of so–called “Sensor Tiles”. A sensor tile consists of a von Neumann neighborhood of range 2 centered at sensor “point” and surrounded by 12 sensing “pixels”. Two probabilistic CA rules were designed that can perform this task. Results of an experimental study show that the first rule evolves very fast stable sub-optimal coverings, starting from a random configuration. The second rule finds optimal coverings, however it needs much more time for their evolution. The results are supported by a theoretical study on von Neumann neighborhoods and borrowing either from heuristics or from the spectral theory of circulant graphs.

2 February 2021 in The Journal of Supercomputing
Verified
Journal Article
Open access
PDF file
RHRolf Hoffmann
Rolf Hoffmann
Dominique DésérableDominique Désérable
Dominique Désérable
FSFranciszek Seredynski
Franciszek Seredynski
The objective is to demonstrate that a probabilistic cellular automata rule can place reliably a maximal number of dominoes in different active area shapes, exemplarily evaluated for the square and diamond. The basic rule forms domino patterns, but the number of dominoes is not necessarily maximal and the patterns are not always stable. It works with templates derived from domino tiles. The first proposed enhancement (Rule Option 1) can form always stable patterns. The second enhancement (Rule Option 2) can maximize the number of dominoes, but the reached patterns are not always stable. All rules drive the evolution by specific noise injection.

12 April 2023 in Sensors
Verified
Journal Article
Open access
PDF file
FSFranciszek Seredynski
Franciszek Seredynski
TKTomasz Kulpa
Tomasz Kulpa
RHRolf Hoffmann
Rolf Hoffmann
Dominique DésérableDominique Désérable
Dominique Désérable
We propose an approach to self-optimizing wireless sensor networks (WSNs) which are able to find, in a fully distributed way, a solution to a coverage and lifetime optimization problem. The proposed approach is based on three components: (a) a multi-agent, social-like interpreted system, where the modeling of agents, discrete space, and time is provided by a 2-dimensional second-order cellular automata, (b) the interaction between agents is described in terms of the spatial prisoner’s dilemma game, and (c) a local evolutionary mechanism of competition between agents exists. Nodes of a WSN graph created for a given deployment of WSN in the monitored area are considered agents of a multi-agent system that collectively make decisions to turn on or turn off their batteries. Agents are controlled by cellular automata (CA)-based players participating in a variant of the spatial prisoner’s dilemma iterated game. We propose for players participating in this game a local payoff function that incorporates issues of area coverage and sensors energy spending. Rewards obtained by agent players depend not only on their personal decisions but also on their neighbor’s decisions. Agents act in such a way to maximize their own rewards, which results in achieving by them a solution corresponding to the Nash equilibrium point. We show that the system is self-optimizing, i.e., can optimize in a distributed way global criteria related to WSN and not known for agents, provide a balance between requested coverage and spending energy, and result in expanding the WSN lifetime. The solutions proposed by the multi-agent system fulfill the Pareto optimality principles, and the desired quality of solutions can be controlled by user-defined parameters. The proposed approach is validated by a number of experimental results.