Asymmetric sensing by decoupling scheduling from switching

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.

References

1. V. T. Paschos. A Survey of Approximately Optimal Solutions to Some Covering and Packing Problems. In ACM Computing Surveys, June 1997.
2. T. Yan, T. He, and J. A. Stankovic. Differentiated Surveillance Service for Sensor Networks. In Sen-Sys'03, November 2003.

Index Terms

• Hardware

  • Communication hardware, interfaces and storage

    • Signal processing systems

• Networks

  • Network protocols

  • Network services

    • Network management

  • Network types

    • Mobile networks

    • Wireless access networks