GTHI: A Heuristic Algorithm to Detect Malicious Users in Smart Grids | |
Xia XF(夏小芳)1,2,3![]() ![]() ![]() ![]() | |
Department | 工业控制网络与系统研究室 |
Source Publication | IEEE Transactions on Network Science and Engineering
![]() |
ISSN | 2327-4697 |
2020 | |
Volume | 7Issue:2Pages:805-816 |
Indexed By | SCI ; EI |
EI Accession number | 20182905558716 |
WOS ID | WOS:000543044200018 |
Contribution Rank | 1 |
Funding Organization | National Key Research and Development Program of China (2017YFE0101300), US National Science Foundation (NSF) with the grant # CNS-1059265, the National Natural Science Foundation of China under grant #v61374200, #v61673371, and # 71661147005, and the Youth Innovation Promotion Association Chinese Academy of Sciences under grant #v2015157. |
Keyword | Electricity theft smart grid smart meters cyber attacks security |
Abstract | With many countries trying to establish their own smart grids, smart meters are massively deployed throughout the world. Although smart meters are manufactured with low tamper-resistant components, malicious users with just a moderate level of computer knowledge are able to launch cyber attacks. By manipulating electricity consumption readings to smaller values, malicious users can steal electricity from utility companies. To reduce the losses incurred by electricity theft, utility companies must provide preventative and detective methods to identify fraudulent behaviors. Our goal is to identify all malicious users in a neighborhood area network within the shortest detection time. To achieve this goal, we propose Group Testing based Heuristic Inspection (GTHI) algorithm, which can estimate the ratio of malicious users on-line, mainly by collecting the information that how many malicious users have been identified during the inspection process. Based upon the ratio of malicious users, the GTHI algorithm adaptively adjusts inspection strategies between an individual inspection strategy and a group testing strategy. This helps shorten the detection time. Furthermore, when applying the group testing strategy, the GTHI algorithm also determines the group size of users to be probed in line with the estimated malicious user ratio. Experiment results show that compared to existing methods, the GTHI algorithm has advantages of conducting fewer inspection steps or being more practical. |
Language | 英语 |
WOS Subject | Engineering, Multidisciplinary ; Mathematics, Interdisciplinary Applications |
WOS Keyword | NONTECHNICAL LOSS FRAUD ; NEIGHBORHOOD AREA NETWORKS ; METER INSPECTION ; SCHEME |
WOS Research Area | Engineering ; Mathematics |
Funding Project | National Key Research and Development Program of China[2017YFE0101300] ; US National Science Foundation (NSF)[CNS-1059265] ; National Natural Science Foundation of China[61374200] ; National Natural Science Foundation of China[61673371] ; National Natural Science Foundation of China[71661147005] ; Youth Innovation Promotion Association Chinese Academy of Sciences[2015157] |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.sia.cn/handle/173321/22149 |
Collection | 工业控制网络与系统研究室 |
Corresponding Author | Xiao Y(肖杨); Liang W(梁炜) |
Affiliation | 1.The University of alabama, tuscaloosa, Tuscaloosa, Alabama United States 2.Computer Science, The University of alabama, Tuscaloosa, Alabama United States 3.EE, Shenyang Institute of Automation, 66327 Shenyang, Liaoning China |
Recommended Citation GB/T 7714 | Xia XF,Xiao Y,Liang W,et al. GTHI: A Heuristic Algorithm to Detect Malicious Users in Smart Grids[J]. IEEE Transactions on Network Science and Engineering,2020,7(2):805-816. |
APA | Xia XF,Xiao Y,Liang W,&Zheng M.(2020).GTHI: A Heuristic Algorithm to Detect Malicious Users in Smart Grids.IEEE Transactions on Network Science and Engineering,7(2),805-816. |
MLA | Xia XF,et al."GTHI: A Heuristic Algorithm to Detect Malicious Users in Smart Grids".IEEE Transactions on Network Science and Engineering 7.2(2020):805-816. |
Files in This Item: | ||||||
File Name/Size | DocType | Version | Access | License | ||
GTHI_ A Heuristic Al(1545KB) | 期刊论文 | 作者接受稿 | 开放获取 | CC BY-NC-SA | View Application Full Text |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment