K-connected target coverage problem in wireless sensor networks

Authors:
Deying Li;Jiannong Cao;Ming Liu;Yuan Zheng
Affiliations:
Internet and Mobile Computing Lab, Department of Computing, Hong Kong Polytechtic University, Hung Hom, Kowloon, Hong Kong and School of Information, Renmin University of China, Beijing, China;Internet and Mobile Computing Lab, Department of Computing, Hong Kong Polytechtic University, Hung Hom, Kowloon, Hong Kong;Internet and Mobile Computing Lab, Department of Computing, Hong Kong Polytechtic University, Hung Hom, Kowloon, Hong Kong;Internet and Mobile Computing Lab, Department of Computing, Hong Kong Polytechtic University, Hung Hom, Kowloon, Hong Kong
Venue:
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Year:
2007

Citing 8
Cited 3

Improved methods for approximating node weighted Steiner trees and connected dominating sets

Information and Computation
Fault tolerant deployment and topology control in wireless networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
FLSS: a fault-tolerant topology control algorithm for wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
Energy-efficient coverage problems in wireless ad-hoc sensor networks

Computer Communications
Coverage in wireless ad hoc sensor networks

IEEE Transactions on Computers

Coverage problems in sensor networks: A survey

ACM Computing Surveys (CSUR)
An approximation algorithm for dominating nodes selection in multi-channel multi-radio wireless sensor networks

International Journal of Sensor Networks
A least-movement topology repair algorithm for partitioned wireless sensor-actor networks

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important issue in deploying a WSN is to provide target coverage with high energy efficiency and fault-tolerance. Sensor nodes in a wireless sensor network are resource-constrained, especially in energy supply, and prone to failure. In this paper, we study the problem of constructing energy efficient and fault-tolerant target coverage. More specifically, we propose solutions to forming k-connected coverage of targets with the minimal number of active nodes. We first address the k-connected augmentation problem, and then show that the k-connected target coverage problem is NP-hard. We propose two heuristic algorithms to solve the problem. We have carried out extensive simulations to study the performance of the proposed algorithms. The evaluation results have demonstrated their desirable efficiency.