Optimal packet scan against malicious attacks in smart grids
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mishra, Subhankar | - |
dc.contributor.author | Dinh, Thang N. | - |
dc.contributor.author | Thai, My T. | - |
dc.contributor.author | Seo, Jungtaek | - |
dc.contributor.author | Shin, Incheol | - |
dc.date.accessioned | 2021-09-15T04:40:16Z | - |
dc.date.available | 2021-09-15T04:40:16Z | - |
dc.date.created | 2021-09-15 | - |
dc.date.issued | 2016-01 | - |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/82130 | - |
dc.description.abstract | With the integration of advanced computing and communication technologies, the Smart Grid is expected to greatly enhance efficiency and reliability of future power systems with renewable energy resources, as well as distributed intelligence and demand response. Along with the salient features of the Smart Grid, cyber security emerges to be a critical issue because millions of electronic devices are inter-connected via communication networks throughout critical power facilities, which has an immediate impact on reliability of such a widespread infrastructure. In this paper, we discuss the packet based attacks and study the Optimal Inspection Points (OIP) problem, which asks us to find a subset of nodes in a given network to perform the Deep Packet Inspection so as to maximize the number of scanned packets while satisfying the delay constraints. This problem finds many applications for malicious attack detection, especially for those cases where each single packet or the network traffic is required to be inspected. Accordingly, we prove OIP is NP-complete and provide an FPTAS in the case of single path routing. For the multiple path routings, we design an FPTAS when the routing graph takes a form of series-parallel graphs, which is commonly used to model electric networks. We also discuss the multi-scan scenario and design PIVOT algorithm to tackle the problem and evaluate the algorithms through experiments. (C) 2015 Elsevier B.V. All rights reserved. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.relation.isPartOf | THEORETICAL COMPUTER SCIENCE | - |
dc.title | Optimal packet scan against malicious attacks in smart grids | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000367275000009 | - |
dc.identifier.doi | 10.1016/j.tcs.2015.07.054 | - |
dc.identifier.bibliographicCitation | THEORETICAL COMPUTER SCIENCE, v.609, pp.606 - 619 | - |
dc.description.isOpenAccess | N | - |
dc.citation.endPage | 619 | - |
dc.citation.startPage | 606 | - |
dc.citation.title | THEORETICAL COMPUTER SCIENCE | - |
dc.citation.volume | 609 | - |
dc.contributor.affiliatedAuthor | Seo, Jungtaek | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.subject.keywordAuthor | Malicious attacks detection | - |
dc.subject.keywordAuthor | Smart Grids | - |
dc.subject.keywordAuthor | Approximation algorithms | - |
dc.subject.keywordPlus | SYSTEM | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
1342, Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, Republic of Korea(13120)031-750-5114
COPYRIGHT 2020 Gachon 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.