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

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, 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, quorum ratio, and issues for supporting multicast/broadcast.

• Type: Conference
• Year: 2008
• Where: OPODIS
• Authors: Shouwen Lai, Bo Zhang, Binoy Ravindran, Hyeonjoong Cho
• Keywords: Cyclic Quorum Systems, Distributed And Parallel Computing, Heterogenous Power-saving Requirement, OPODIS 2008, Quorum System Pair