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

Authors:
Jian Wang;Changyong Niu;Ruimin Shen
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, 200030, China;Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, 200030, China;Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, 200030, China
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 7
Cited 6

Utility-based decision-making in wireless sensor networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Utility based sensor selection

Proceedings of the 5th international conference on Information processing in sensor networks
Lightweight deployment-aware scheduling for wireless sensor networks

Mobile Networks and Applications
Barrier coverage with wireless sensors

Wireless Networks
A density control algorithm for surveillance sensor networks

WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Minimum dominating sets for solving the coverage problem in wireless sensor networks

UCS'06 Proceedings of the Third international conference on Ubiquitous Computing Systems
On coverage problems of directional sensor networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks

Integer linear programming model for multidimensional two-way number partitioning problem

Computers & Mathematics with Applications
Effect of Utility Function on Lifetime of Directional Sensor Networks

GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
On coverage issues in directional sensor networks: A survey

Ad Hoc Networks
Lifetime maximization considering target coverage and connectivity in directional image/video sensor networks

The Journal of Supercomputing
Learning Automata-Based Algorithms for Solving the Target Coverage Problem in Directional Sensor Networks

Wireless Personal Communications: An International Journal
Solving Target Coverage Problem Using Cover Sets in Wireless Sensor Networks Based on Learning Automata

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.09

Visualization

Abstract

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.