Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/14159
Title: Algorithms for the m-coverage problem and k-connected m-coverage problem in wireless sensor networks
Authors: Li, D
Cao, J 
Liu, D
Yu, Y
Sun, H
Keywords: Approximation algorithm
Energy-efficient
K-connected m-coverage
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. 4672 LNCS, p. 250-259 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 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.
Description: 2007 IFIP International Conference on Network and Parallel Computing, NPC 2007, Dalian, 18-21 September 2007
URI: http://hdl.handle.net/10397/14159
ISBN: 9783540747833
ISSN: 0302-9743
EISSN: 1611-3349
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

3
Last Week
0
Last month
Citations as of Sep 16, 2017

Page view(s)

70
Last Week
3
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check



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