Power consumption scheduling for peak load reduction in smart grid homes
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Junghoon | - |
dc.contributor.author | Park, Gyung-Leen | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.contributor.author | Kim, Hye-Jin | - |
dc.contributor.author | Sung, Chang Oan | - |
dc.date.accessioned | 2022-07-16T21:37:41Z | - |
dc.date.available | 2022-07-16T21:37:41Z | - |
dc.date.created | 2021-05-11 | - |
dc.date.issued | 2011-03 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/168960 | - |
dc.description.abstract | This paper presents a design and evaluates the performance of a power consumption scheduler in smart grid homes, aiming at reducing the peak load in individual homes as well as in the system-wide power transmission network. Following the task model consist of actuation time, operation length, deadline, and a consumption profile, the scheduler copies or maps the profile according to the task type, which can be either preemptive or nonpreemptive. The proposed scheme expands the search space recursively to traverse all the feasible allocations for a task set. A pilot implementation of this scheduling method reduces the peak load by up to 23.1% for the given task set. The execution time greatly depends on the search space of a preemptive task, as its time complexity is estimated to be O (MNnp · (M M/2)Np), where M, Nnp, and N p are the number of time slots, preemptive tasks, and nonpreemptive tasks, respectively. However, it can not only be reduced almost to 2% but also made stable with a basic constraint processing mechanism which prunes a search branch when the partial peak value already exceeds the current best. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinary, Inc. | - |
dc.title | Power consumption scheduling for peak load reduction in smart grid homes | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1145/1982185.1982310 | - |
dc.identifier.scopusid | 2-s2.0-79959303776 | - |
dc.identifier.bibliographicCitation | Proceedings of the ACM Symposium on Applied Computing, pp.584 - 588 | - |
dc.relation.isPartOf | Proceedings of the ACM Symposium on Applied Computing | - |
dc.citation.title | Proceedings of the ACM Symposium on Applied Computing | - |
dc.citation.startPage | 584 | - |
dc.citation.endPage | 588 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Execution time | - |
dc.subject.keywordPlus | home controller | - |
dc.subject.keywordPlus | Peak load | - |
dc.subject.keywordPlus | power schedule | - |
dc.subject.keywordPlus | Smart grid | - |
dc.subject.keywordPlus | Electric power transmission networks | - |
dc.subject.keywordPlus | Scheduling | - |
dc.subject.keywordPlus | Smart power grids | - |
dc.subject.keywordAuthor | execution time | - |
dc.subject.keywordAuthor | home controller | - |
dc.subject.keywordAuthor | peak load reduction | - |
dc.subject.keywordAuthor | power schedule | - |
dc.subject.keywordAuthor | smart grid | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/1982185.1982310 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.