Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Topology management for sensor networks: exploiting latency and density
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Combinatorial Designs: Constructions and Analysis
Combinatorial Designs: Constructions and Analysis
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks
Mobile Networks and Applications
Transport layer approaches for improving idle energy in challenged sensor networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
An Asymmetric Quorum-based Power Saving Protocol for Clustered Ad Hoc Networks
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
An Automatic Presence Service for Low Duty-Cycled Mobile Sensor Networks
Mobile Networks and Applications
On multihop broadcast over adaptively duty-cycled wireless sensor networks
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
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.