| An overview of computational models for wireless sensor networks|
du groupe Algorithmique Distribuée
|Date|| 2015-06-01 14:00-15:00|
|Titre|| An overview of computational models for wireless sensor networks |
|Résumé||In this talk, we will give an overview of some computational models designed for networks of tiny artifacts with sensing capabilities and with limited resources.
We will focus on the population protocols (PP) model of Angluin et al. which is based on pairwise interactions between anonymous passively mobile finite state agents. We will consider, among other examples, the PP that stably computes the OR predicate and that we applied to the broadcast problem.
We will also consider works that extend the PP model such as the mediated population protocols.
In all these models, the interacting pairs are supposed to be chosen by a fair scheduler. In this talk, we will present a new fair one based on the rendezvous algorithm. |
|Orateur||Nesrine Ouled Abdallah |
Aucun document lié à cet événement.RetourRetour à l'index