Language:

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

Lai, Shouwen ; Zhang, Bo ; Ravindran, Binoy ; Cho, Hyeonjoong Baker, Theodore P. ; Bui, Alain ; Tixeuil, Sébastien

Principles of Distributed Systems, p.295-310 [Peer Reviewed Journal]

No full-text

Citations Cited by

Title:
CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks
Author: Lai, Shouwen ; Zhang, Bo ; Ravindran, Binoy ; Cho, Hyeonjoong
Baker, Theodore P. ; Bui, Alain ; Tixeuil, Sébastien
Subjects: Average Delay ; Cycle Length ; Relay Node ; Sensor Network ; Wireless Sensor Network
Is Part Of: Principles of Distributed Systems, p.295-310
Description: 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 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$(N,k,M,\emph{l})$\end{document}-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.
Publisher: Berlin, Heidelberg: Springer Berlin Heidelberg
Language: English

Back to results list

Previous Result 20 Next Go to Next page