Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lai, Shouwen | - |
dc.contributor.author | Ravindran, Binoy | - |
dc.contributor.author | Cho, Hyeonjoong | - |
dc.date.accessioned | 2021-09-07T23:04:25Z | - |
dc.date.available | 2021-09-07T23:04:25Z | - |
dc.date.created | 2021-06-14 | - |
dc.date.issued | 2010-11 | - |
dc.identifier.issn | 0018-9340 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/115370 | - |
dc.description.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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Cho, Hyeonjoong | - |
dc.identifier.doi | 10.1109/TC.2010.20 | - |
dc.identifier.scopusid | 2-s2.0-77957603431 | - |
dc.identifier.wosid | 000282091200010 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON COMPUTERS, v.59, no.11, pp.1562 - 1575 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON COMPUTERS | - |
dc.citation.title | IEEE TRANSACTIONS ON COMPUTERS | - |
dc.citation.volume | 59 | - |
dc.citation.number | 11 | - |
dc.citation.startPage | 1562 | - |
dc.citation.endPage | 1575 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordAuthor | multiplier theorem | - |
dc.subject.keywordAuthor | Wake-up scheduling | - |
dc.subject.keywordAuthor | asynchronous wake-up | - |
dc.subject.keywordAuthor | quorum | - |
dc.subject.keywordAuthor | wireless sensor networks | - |
dc.subject.keywordAuthor | difference set | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.