Minimum energy cost k-barrier coverage in wireless sensor networks

  • Authors:
  • Huiqiang Yang;Deying Li;Qinghua Zhu;Wenping Chen;Yi Hong

  • Affiliations:
  • Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, P.R. China;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, P.R. China;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, P.R. China;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, P.R. China;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, P.R. 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

Barrier coverage problem is one of important issues in wireless sensor networks. In this paper we study the minimum energy cost k-barrier coverage problem in wireless sensor network in which each sensor has l + 1 sensing power levels. First, we transform the minimum energy cost k-barrier coverage problem into a minimum cost flow problem with side constraints. Then we use Lagrangian relaxation technique to solve this minimum cost flow problem. Moreover, we propose two efficient heuristics for the minimum energy cost k-barrier coverage problem. Simulations evaluate that our algorithms are efficient.