A distributed clustering scheme with self nomination: proposal and application to critical monitoring

7Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Clustering is a well known methodology to optimize the use of the resources, to lower the congestion and to improve the reliability in self-organized networks as the wireless sensor networks. This paper deals with the proposal of a novel clustering approach based on a low complexity distributed cluster head election based on a two-stage process. In particular, a suitable objective function is introduced in order to take into account the number of 1-hop neighbours (i.e., node degree) and the residual node energy. It is shown in the paper that the proposed protocol achieves remarkable performance improvements with respect to different alternatives, especially in the case of unpredictable scenarios. Moreover, the proposed protocol exhibits self-organize capabilities that are of special interest for critical monitoring applications, in particular when the effect of nodes mobility is significant.

Cite

CITATION STYLE

APA

Chiti, F., Fantacci, R., Mastandrea, R., Rigazzi, G., Sarmiento, Á. S., & López, E. M. M. (2015). A distributed clustering scheme with self nomination: proposal and application to critical monitoring. Wireless Networks, 21(1), 329–345. https://doi.org/10.1007/s11276-014-0785-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free