a genetic-based algorithm to solve priority-based ‎target coverage problem in directional sensor ‎networks

The directional sensor networks (dsns) have recently drawn considerable attention with respect to their extensive applications in various situations. in this regard, covering a set of targets in a specific region while maximizing network lifetime is considered as a major problem related to the dsn, which is resulted from limitation in sensing angle and battery power of directional sensors. the problem gets more challenging when the targets have different coverage quality requirements. in the present study, this problem is referred to as priority-based target coverage (ptc) that has been proved to be an np-complete problem. in this regard, a genetic-based algorithm along with a repair operator is developed, which is able to select a proper subset of directional sensors for providing the coverage quality requirements for all targets. in order to evaluate the performance of the proposed algorithm, several experiments were performed and the results were compared to those of another algorithms already introduced to literature.