@inproceedings{e8c8dd22a6d747fe80da782d0cbde5c9,
title = "Algorithms for the m-coverage problem and k-connected m-coverage problem in wireless sensor networks",
abstract = "An important issue in deploying a wireless sensor network (WSN) is to provide target coverage with high energy efficiency and fault-tolerance. In this paper, we study the problem of constructing energy-efficient and faulttolerant target coverage with the minimal number of active nodes which form an m-coverage for targets and a k-connected communication subgraph. We propose two heuristic algorithms for m-coverage problem, and get the performance ratio of one heuristic. Then two heuristic algorithms are further proposed to solve the k-connected m-coverage problem. The simulation results demonstrate the desired efficiency of the proposed algorithms.",
keywords = "Approximation algorithm, Energy-efficient, K-connected m-coverage, Sensor networks",
author = "Deying Li and Jiannong Cao and Dongsheng Liu and Ying Yu and Hui Sun",
year = "2007",
month = dec,
day = "1",
language = "English",
isbn = "9783540747833",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "250--259",
booktitle = "Network and Parallel Computing - IFIP International Conference, NPC 2007, Proceedings",
note = "2007 IFIP International Conference on Network and Parallel Computing, NPC 2007 ; Conference date: 18-09-2007 Through 21-09-2007",
}