A coverage-guaranteed algorithm to improve network lifetime of wireless sensor networks

13Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

This study propose a novel hybrid genetic algorithm (HGADSC) comprising both basic generic operations with a fitness-improving local-search strategy to divide all wireless sensor nodes into a maximum number of disjoint set covers (DSCs), where every cover can monitor all targets. The purpose of the HGADSC is to solve the NP-complete problem. By periodically switching disjoint set covers, a full sensing coverage as well as a longer network lifetime can be guaranteed. The simulation results show that HGADSC outperforms the existing methods by generating more disjoint set covers and prolongs network lifetime ranging from 0.54% to 36.1% under different simulation scenarios. The results indicate that the network lifetime can be effectively extended by the proposed method, which is also valuable for a wide range of node deployment environments.

Cite

CITATION STYLE

APA

Chen, C. P., Chuang, C. L., Lin, T. S., Lee, C. Y., & Jiang, J. A. (2010). A coverage-guaranteed algorithm to improve network lifetime of wireless sensor networks. In Procedia Engineering (Vol. 5, pp. 192–195). Elsevier Ltd. https://doi.org/10.1016/j.proeng.2010.09.080

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