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

Deying Li, Jiannong Cao, Dongsheng Liu, Ying Yu, Hui Sun

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

5 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationNetwork and Parallel Computing - IFIP International Conference, NPC 2007, Proceedings
Pages250-259
Number of pages10
Publication statusPublished - 1 Dec 2007
Event2007 IFIP International Conference on Network and Parallel Computing, NPC 2007 - Dalian, China
Duration: 18 Sep 200721 Sep 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4672 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2007 IFIP International Conference on Network and Parallel Computing, NPC 2007
Country/TerritoryChina
CityDalian
Period18/09/0721/09/07

Keywords

  • Approximation algorithm
  • Energy-efficient
  • K-connected m-coverage
  • Sensor networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this