Ph.D
Group : Parallel Systems
Overcoming interference in the beeping communication model
Starts on 01/10/2016
Advisor : BEAUQUIER, Joffroy
[Janna BURMAN]
Funding : Contrat doctoral uniquement recherche
Affiliation : Université Paris-Saclay
Laboratory : LRI - ParSys
Defended on 27/09/2019, committee :
Directeur de thèse :
- M. Joffroy Beauquier (Université Paris-Sud)
Co-encadrant :
- Mme. Janna Burman (Université Paris-Sud)
Rapporteurs :
- M. Roger Wattenhofer (ETH Zurich)
- M. Arnaud Casteigts (Université de Bordeaux)
Examinateurs :
- Mme. Colette Johnen (Université de Bordeaux )
- M. Pierre Fraigniaud (Université Paris Diderot)
- M. Devan Sohier (Université de Versailles)
Research activities :
Abstract :
Small inexpensive inter-communicating electronic devices have become widely available. Although the individual device has severely limited capabilities (e.g., basic communication, constant-size memory or limited mobility), multitudes of such weak devices communicating together are able to form low-cost, easily deployable, yet highly performant networks. Such distributed systems present significant challenges however when it comes to the design of efficient, scalable and simple algorithms.
In this thesis, we are interested in studying such systems composed of devices with severely limited communication capabilities - using only simple bursts of energy. These distributed systems may be modeled using the beeping model, in which nodes communicate by beeping or listening to their neighbors (according to some undirected communication graph). Simultaneous communications (i.e., collisions) result in non-destructive interference: a node with two or more neighbors beeping simultaneously detects a beep.
Its simple, general and energy efficient communication mechanism makes the beeping model widely applicable. However, that simplicity comes at a cost. Due to the poor expressiveness of beeps and the interference caused by simultaneous communications, algorithm design is challenging. Throughout the thesis, we overcome both difficulties in order to provide efficient communication primitives. A particular focus of the thesis is on deterministic and time-efficient solutions independent of the communication graph’s parameters (i.e., uniform).