Maximum lifetime coverage preserving scheduling algorithms in sensor networks

Maggie X. Cheng, Xuan Gong

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

In wireless sensor networks, when each target is covered by multiple sensors, sensors can take turns to monitor the targets in order to extend the lifetime of the network. In this paper, we address how to improve network lifetime through optimal scheduling of sensor nodes. We present two algorithms to achieve the maximum lifetime while maintaining the required coverage: a linear programming-based exponential-time exact solution, and an approximation algorithm. Numerical simulation results from the approximation algorithm are compared to the exact solution and show a high degree of accuracy and efficiency.

Original languageEnglish (US)
Pages (from-to)447-462
Number of pages16
JournalJournal of Global Optimization
Volume51
Issue number3
DOIs
StatePublished - Nov 2011

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics

Keywords

  • Approximation algorithm
  • Coverage
  • Lifetime
  • Linear programming
  • Sensor network

Fingerprint

Dive into the research topics of 'Maximum lifetime coverage preserving scheduling algorithms in sensor networks'. Together they form a unique fingerprint.

Cite this