Spatial-temporal coverage optimization in wireless sensor networks

Changlei Liu, Guohong Cao

Research output: Contribution to journalArticle

69 Scopus citations

Abstract

Mission-driven sensor networks usually have special lifetime requirements. However, the density of the sensors may not be large enough to satisfy the coverage requirement while meeting the lifetime constraint at the same time. Sometimes, coverage has to be traded for network lifetime. In this paper, we study how to schedule sensors to maximize their coverage during a specified network lifetime. Unlike sensor deployment, where the goal is to maximize the spatial coverage, our objective is to maximize the spatial-temporal coverage by scheduling sensors' activity after they have been deployed. Since the optimization problem is NP-hard, we first present a centralized heuristic whose approximation factor is proved to be {1\over 2}, and then, propose a distributed parallel optimization protocol (POP). In POP, nodes optimize their schedules on their own but converge to local optimality without conflict with one another. Theoretical and simulation results show that POP substantially outperforms other schemes in terms of network lifetime, coverage redundancy, convergence time, and event detection probability.

Original languageEnglish (US)
Article number5582097
Pages (from-to)465-478
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume10
Issue number4
DOIs
StatePublished - Apr 1 2011

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this