CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks

  • Shouwen Lai
  • Bo Zhang
  • Binoy Ravindran
  • Hyeonjoong Cho
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5401)

Abstract

Due to the heterogenous power-saving requirement in wireless sensor networks, we propose the Cyclic Quorum System Pair (CQS-Pair) which can guarantee that two asynchronous nodes adopt different cyclic quorum systems can hear each other at least once in bounded time intervals. To quickly assemble a CQS-Pair, we present a fast construction scheme, which is based on the Multiplier Theorem and the \((N,k,M,\emph{l})\)-difference pair defined by us. We show that via the CQS-Pair, two heterogenous nodes can achieve different power saving ratios while maintaining connectivity. The performance of a CQS-Pair is analyzed in terms of average delay and quorum ratio.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Shouwen Lai
    • 1
  • Bo Zhang
    • 1
  • Binoy Ravindran
    • 1
  • Hyeonjoong Cho
    • 2
  1. 1.ECE DepartmentVirginia TechBlacksburgUSA
  2. 2.ETRI, RFID/USN Research Group, Yuseong-guDaejeonKorea

Personalised recommendations