Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks
- Authors
- Lai, Shouwen; Ravindran, Binoy; Cho, Hyeonjoong
- Issue Date
- 11월-2010
- Publisher
- IEEE COMPUTER SOC
- Keywords
- multiplier theorem; Wake-up scheduling; asynchronous wake-up; quorum; wireless sensor networks; difference set
- Citation
- IEEE TRANSACTIONS ON COMPUTERS, v.59, no.11, pp.1562 - 1575
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON COMPUTERS
- Volume
- 59
- Number
- 11
- Start Page
- 1562
- End Page
- 1575
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/115370
- DOI
- 10.1109/TC.2010.20
- ISSN
- 0018-9340
- Abstract
- We present heterogenous quorum-based asynchronous wake-up scheduling schemes for wireless sensor networks. The schemes can ensure that two nodes that adopt different quorum systems as their wake-up schedules can hear each other at least once in bounded time intervals. We propose two such schemes: cyclic quorum system pair (cqs-pair) and grid quorum system pair (gqs-pair). The cqs-pair which contains two cyclic quorum systems provides an optimal solution, in terms of energy saving ratio, for asynchronous wake-up scheduling. 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. Regarding the gqs-pair, we prove that any two grid quorum systems will automatically form a gqs-pair. We further analyze the performance of both designs, in terms of average discovery delay, quorum ratio, and energy saving ratio. We show that our designs achieve better trade-off between the average discovery delay and quorum ratio (and thus energy consumption) for different cycle lengths. We implemented the proposed designs in a wireless sensor network platform of Telosb motes. Our implementation-based measurements further validate the analytically-established performance trade-off of our designs.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer and Information Science > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.