Priority-based target coverage in directional sensor networks using a genetic algorithm

Sensor networks have been applied in a wide variety of situations. Recently directional sensor networks consisting of directional sensors have gained attention. As for the traditional target coverage problem, the limited sensing angle of directional sensors makes it even more challenging. Moreover, individual targets may also be associated with differentiated priorities. Considering the distance between the directional sensors and targets influences sensing quality, this paper proposes the priority-based target coverage problem and strives to choose a minimum subset of directional sensors that can monitor all targets, satisfying their prescribed priorities. Due to the NP-Complete complexity, the minimum subset of directional sensors is approximated by using a genetic algorithm. Simulation results reveal the effects of multiple factors on the size of the resulting subset.