Co-Grid: an efficient coverage maintenance protocol for distributed sensor networks

  • Authors:

  • Guoliang Xing;Chenyang Lu;Robert Pless;Joseph A. O'Sullivan

  • Affiliations:

  • Washington University in St. Louis, St. Louis, MO;Washington University in St. Louis, St. Louis, MO;Washington University in St. Louis, St. Louis, MO;Washington University in St. Louis, St. Louis, MO

  • Venue:
  • Proceedings of the 3rd international symposium on Information processing in sensor networks
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Wireless sensor networks often face the critical challenge of sustaining long-term operation on limited battery energy. Coverage maintenance protocols can effectively prolong network lifetime by maintaining sufficient sensing coverage over a region using a small number of active nodes while scheduling the others to sleep. We present a novel distributed coverage maintenance protocol called the Coordinating Grid (Co-Grid). In contrast to existing coverage maintenance protocols which are based on simpler detection models, Co-Grid adopts a distributed detection model based on data fusion that is more consistent with many distributed sensing applications. Co-Grid organizes the network into coordinating fusion groups located on overlapping virtual grids. Through coordination among neighboring fusion groups, Co-Grid can achieve comparable number of active nodes as a centralized algorithm, while reducing the network (re-)configuration time by orders of magnitude. Co-Grid is especially suitable for large and energy-constrained sensor networks that require quick (re-)configuration in response to node failures and environmental changes. We validate our claims by both theoretical analysis and simulations.