On target coverage in wireless heterogeneous sensor networks with multiple sensing units

Authors:
Kuei-Ping Shih;Hung-Chang Chen;Chien-Min Chou;Bo-Jun Liu
Affiliations:
Department of Computer Science and Information Engineering, Tamkang University, Tamshui, 251 Taipei, Taiwan;Department of Information Technology, Ching Kuo Institute of Management and Health, Keelung 203, Taiwan;Department of Computer Science and Information Engineering, Tamkang University, Tamshui, 251 Taipei, Taiwan;Department of Computer Science and Information Engineering, Tamkang University, Tamshui, 251 Taipei, Taiwan
Venue:
Journal of Network and Computer Applications
Year:
2009

Citing 6
Cited 3

A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
CollECT: Collaborative Event deteCtion and Tracking in Wireless Heterogeneous Sensor Networks

ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications

Coverage problems in sensor networks: A survey

ACM Computing Surveys (CSUR)
Edge betweenness centrality: A novel algorithm for QoS-based topology control over wireless sensor networks

Journal of Network and Computer Applications
Review: A systematic review on clustering and routing techniques based upon LEACH protocol for wireless sensor networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper considers the target coverage problem in wireless heterogeneous sensor networks (WHSNs) with multiple sensing units. This kind of target coverage problem can be reduced to a set cover problem and be further formulated as integer programming (IP) constraints. However, to solve the IP problem is an NP-complete problem. Therefore, two heuristic but distributed schemes, REFS and EEFS, are proposed in the paper to solve the target coverage problem. In REFS (remaining energy first scheme), each sensor considers its remaining energy and neighbors' decisions to enable its sensing units as well as to ensure every target being covered by the sensing attributes which are required to be covered at each target. The advantages of REFS are its simplicity and less communication overhead incurred. However, in order to make the best use of the sensing units on each sensor, another scheme, called EEFS (energy efficient first scheme), is proposed as well. Different from REFS, a sensor in EEFS considers its sensing capabilities and remaining energy as well as those of its neighbors to make a better decision to turn on its sensing units and to ensure each target being covered by required attributes. To our best knowledge, this paper is the first paper to solve the problem for WHSNs with multiple sensing units. Simulation results show that REFS and EEFS can prolong the network lifetime effectively. Furthermore, EEFS outperforms REFS in network lifetime. On the other hand, compared with the performance obtained from the IP solution, the difference between EEFS and the IP solution can be confined within 10%.