Abstract : In this paper, we are interested in wireless sensor networks trying to collect data from all the nodes to a “sink”-node as long as possible. We present a simple distributed algorithm which compute several Connected Dominating Sets (CDS) so that each sensor belong to the fewest possible number of CDS. The results we will show seem promising and may also be used in order to increase the reliability of the network.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00549866
Contributeur : Sylvain Durand
<>
Soumis le : mercredi 22 décembre 2010 - 19:02:11
Dernière modification le : mardi 23 janvier 2018 - 11:46:01
