The complexity of data aggregation in static and dynamic wireless sensor networks

Quentin Bramas 1, * Sébastien Tixeuil 2, 1
* Auteur correspondant
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : The contribution of this paper is threefold. First, we give tight bounds for the complexity of the problem of data aggregation in static networks. In more details, we show that the problem remains NP-complete when the graph is of degree at most three. Second, we investigate the complexity of the same problem in a dynamic network, that is, a network whose topology can evolve through time. In the case of dynamic networks, we show that the problem is NP-complete even in the case where the graph is of degree at most two. Third, we give the first lower and upper bounds for the minimum data aggregation time in a dynamic graph. We also observe that even in a well-connected evolving graphs, the optimal solution cannot be found by a distributed algorithm or by a centralized algorithm that does not know the future.
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.sorbonne-universite.fr/hal-01419900
Contributeur : Gestionnaire Hal-Upmc <>
Soumis le : mardi 20 décembre 2016 - 10:17:17
Dernière modification le : jeudi 21 mars 2019 - 14:37:53
Document(s) archivé(s) le : mardi 21 mars 2017 - 05:46:33

Fichier

Bramas_The_complexity_of.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Quentin Bramas, Sébastien Tixeuil. The complexity of data aggregation in static and dynamic wireless sensor networks. Information and Computation, Elsevier, 2017, 255 (3), pp.369-383. 〈10.1016/j.ic.2016.12.004〉. 〈hal-01419900〉

Partager

Métriques

Consultations de la notice

480

Téléchargements de fichiers

184