An energy-balanced WSN algorithm based on active hibernation and data recovery

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

Abstract

Nowadays, many algorithms are brought up to elect the optimal nodes as head nodes for WSNs, but the network lifetime may not be optimal because of the lack of maintenance for cluster heads’(CHs) energy. Based on the above consideration, we come up with the CHs’ active hibernation algorithm for dynamic clustering network. First we propose that after the CHs’ energy reaches its threshold, instead of becoming the non-CHs directly, they will enter a FIFO queue in which they can hibernate. Second, in order to avoid the effect that the hibernation has on data collection and network coverage, a data recovery mechanism is designed. Third, a theoretical model is formed to analyze the effect and efficiency improvement of the CHs’ hibernation work. The theoretical analysis and experiments show that without the influence of the redundant nodes, CHs’ hibernation algorithm has better performance in network lifetime and energy balancing.

Cite

CITATION STYLE

APA

Liu, C., Fu, C., Xu, D., Sun, L., & Han, L. (2015). An energy-balanced WSN algorithm based on active hibernation and data recovery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9528, pp. 730–743). Springer Verlag. https://doi.org/10.1007/978-3-319-27119-4_51

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