Please use this identifier to cite or link to this item:
Title: K-connected target coverage problem in wireless sensor networks
Authors: Li, D
Cao, J 
Liu, M
Zheng, Y
Keywords: Heuristic algorithms
K-connected augmentation
K-connected target coverage
NP-hard problems
Wireless sensor networks
Issue Date: 2007
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2007, v. 4616 LNCS, p. 20-31 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
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.
Description: 1st International Conference on Combinatorial Optimization and Applications, COCOA 2007, Xi'an, 14-16 August 2007
ISBN: 9783540735557
ISSN: 0302-9743
EISSN: 1611-3349
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 4, 2018

Page view(s)

Last Week
Last month
Citations as of Jul 9, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.