Next Article in Journal
Next Article in Special Issue
Previous Article in Journal
Previous Article in Special Issue
Sensors 2011, 11(2), 1888-1906; doi:10.3390/s110201888
Article

A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks

1
 and 2,*
Received: 7 December 2010; in revised form: 21 January 2011 / Accepted: 28 January 2011 / Published: 1 February 2011
View Full-Text   |   Download PDF [607 KB, uploaded 21 June 2014]
Abstract: As a promising tool for monitoring the physical world, directional sensor networks (DSNs) consisting of a large number of directional sensors are attracting increasing attention. As directional sensors in DSNs have limited battery power and restricted angles of sensing range, maximizing the network lifetime while monitoring all the targets in a given area remains a challenge. A major technique to conserve the energy of directional sensors is to use a node wake-up scheduling protocol by which some sensors remain active to provide sensing services, while the others are inactive to conserve their energy. In this paper, we first address a Maximum Set Covers for DSNs (MSCD) problem, which is known to be NP-complete, and present a greedy algorithm-based target coverage scheduling scheme that can solve this problem by heuristics. This scheme is used as a baseline for comparison. We then propose a target coverage scheduling scheme based on a genetic algorithm that can find the optimal cover sets to extend the network lifetime while monitoring all targets by the evolutionary global search technique. To verify and evaluate these schemes, we conducted simulations and showed that the schemes can contribute to extending the network lifetime. Simulation results indicated that the genetic algorithm-based scheduling scheme had better performance than the greedy algorithm-based scheme in terms of maximizing network lifetime.
Keywords: target coverage; directional sensors; network lifetime; greedy algorithms; genetic algorithms target coverage; directional sensors; network lifetime; greedy algorithms; genetic algorithms
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |
EndNote


MDPI and ACS Style

Gil, J.-M.; Han, Y.-H. A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks. Sensors 2011, 11, 1888-1906.

AMA Style

Gil J-M, Han Y-H. A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks. Sensors. 2011; 11(2):1888-1906.

Chicago/Turabian Style

Gil, Joon-Min; Han, Youn-Hee. 2011. "A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks." Sensors 11, no. 2: 1888-1906.



Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert