Algorithms for the m-coverage problem and k-connected m-coverage problem in wireless sensor networks

Authors:
Deying Li;Jiannong Cao;Dongsheng Liu;Ying Yu;Hui Sun
Affiliations:
School of Information, Renmin University of China, Beijing, China and Key Laboratory of Data Engineering and Knowledge Engineering, MOE;Department of Computing, The Hong Kong Polytechnic University, HongKong;School of Information, Renmin University of China, Beijing, China;School of Information Engineering, University of Science and Technology of Beijing;School of Information, Renmin University of China, Beijing, China
Venue:
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Year:
2007

Citing 8
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
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
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
Coverage and connectivity in three-dimensional networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to One Target

IEEE Transactions on Parallel and Distributed Systems
Maximizing lifetime of sensor surveillance systems

IEEE/ACM Transactions on Networking (TON)
Coverage in wireless ad hoc sensor networks

IEEE Transactions on Computers

An approximation algorithm for dominating nodes selection in multi-channel multi-radio wireless sensor networks

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

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.