Asymmetric sensing by decoupling scheduling from switching

  • Authors:
  • Yu Gu;Tian He

  • Affiliations:
  • University of Minnesota, Twin Cities;University of Minnesota, Twin Cities

  • Venue:
  • ACM SIGMOBILE Mobile Computing and Communications Review
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively. Researchers have designed many coverage protocols to provide various kinds of service guarantees within the network. While the state-of-the-art is encouraging, we believe there are some aspects that need further investigation. First, currently different sensing coverage algorithms focus on different service guarantees. Any single design is not general enough to meet a wide range of sensing requirements under different operating scenarios. Second, lifetime extension in most algorithms is essentially achieved through coordination among neighboring nodes. The local node density, therefore, imposes a theoretical upper bound on the system lifetime.