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

Due to the heterogeneous power-saving requirement in wireless sensor networks, the authors propose the Cyclic Quorum System Pair (CQS-Pair) which can guarantee that two asynchronous nodes adopting different cyclic quorum systems can hear each other at least once in bounded time intervals. To quickly assemble a CQS-Pair, the authors present a fast construction scheme, which is based on the Multiplier Theorem and the (N; k;M; l)-difference pair defined by them. They show that via the CQS-Pair, two heterogeneous 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.