A control loop reduction scheme for wireless process control on traffic light networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Junghoon | - |
dc.contributor.author | Park, Gyung-Leen | - |
dc.contributor.author | Shin, In-Hye | - |
dc.contributor.author | Kim, Choel Min | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.date.accessioned | 2022-12-20T18:41:04Z | - |
dc.date.available | 2022-12-20T18:41:04Z | - |
dc.date.created | 2022-09-16 | - |
dc.date.issued | 2010-03 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/175302 | - |
dc.description.abstract | This paper designs a loop reduction scheme and measures its performance for the wireless process control application running on the grid-style traffic light network, aiming at improving the response time of the control system. Based on the WirelessHART standard, which assigns a slot to each (sender, receiver) pair according to the routing schedule, the allocation scheme puts all the pairs having no interference to a single slot, reducing the loop length. For further reduction, the classic Dijkstra's shortest path algorithm is modified such that the number of end-to-end paths starting from the horizontal links and the vertical link, respectively, is almost same. The transmission of the controller, which initiates all message delivery and is the main bottleneck point, will not be blocked. The simulation result demonstrates that the proposed scheme can significantly reduce the control loop length, and the modified path finding algorithm further achieves about 9.8 % improvement, just sacrificing the 3.2 % of transmission success ratio. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Springer Verlag | - |
dc.title | A control loop reduction scheme for wireless process control on traffic light networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1007/978-3-642-12179-1_1 | - |
dc.identifier.scopusid | 2-s2.0-77952310094 | - |
dc.identifier.wosid | 000279384400001 | - |
dc.identifier.bibliographicCitation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.6018 LNCS, no.PART 3, pp.1 - 10 | - |
dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.citation.title | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.citation.volume | 6018 LNCS | - |
dc.citation.number | PART 3 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 10 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | Data communication equipment | - |
dc.subject.keywordPlus | Dijkstra&apos | - |
dc.subject.keywordPlus | s shortest path algorithm | - |
dc.subject.keywordPlus | End-to-end path | - |
dc.subject.keywordPlus | Horizontal links | - |
dc.subject.keywordPlus | Loop reduction | - |
dc.subject.keywordPlus | Message delivery | - |
dc.subject.keywordPlus | Traffic-light networks | - |
dc.subject.keywordPlus | Transmission success ratios | - |
dc.subject.keywordPlus | Wireless process control | - |
dc.subject.keywordPlus | Process control | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/978-3-642-12179-1_1 | - |
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.