Energy-efficient algorithm for the target Q-coverage problem in wireless sensor networks

  • Authors:
  • Hui Liu;Wenping Chen;Huan Ma;Deying Li

  • Affiliations:
  • Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, China;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, China;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, China;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, China

  • Venue:
  • WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we study the target Q-coverage (TQC) problem where each target needs to be covered by different numbers of sensors. We try to find a collection of Q-covsets which satisfy the coverage quality requirement to maximize the network lifetime. We first prove that the problem is NP-Hard. Then we design a greedy algorithm to efficiently compute the Q-covsets. Finally, simulation results are presented to verify our approach.