首页> 外文期刊>Computers & Security >Coded grouping-based inspection algorithms to detect malicious meters in neighborhood area smart grid
【24h】

Coded grouping-based inspection algorithms to detect malicious meters in neighborhood area smart grid

机译:基于编码分组的检查算法可检测邻域智能电网中的恶意电表

获取原文
获取原文并翻译 | 示例

摘要

When modern hardware and software technologies are integrated into smart grid, numerous vulnerabilities are introduced at the same time. The vulnerabilities are now leveraged by malicious users for the purpose of electricity theft. Many approaches are proposed to identify malicious users. However, some of them have low detection rates; the others suffer from either low inspection speed or huge cost of deploying monitoring devices. In this paper, to accurately locate malicious users stealing electricity in a fast and economic way, we propose three novel inspection algorithms. First, Binary-Coded Grouping-based Inspection (BCGI) algorithm is proposed. Under some assumptions, it can locate malicious users with only one inspection step. Given n users, the BCGI algorithm requires Theta(log(2)(n)) inspectors. Unfortunately, in some cases we do not have enough inspectors for the BCGI algorithm to work. To deal with these cases, we further propose two algorithms: M-ary Coded Grouping-based Inspection (MCGI) and Generalized BCGI (G-BCGI). In the MCGI algorithm, users' identification (ID) numbers are encoded into (1+1)-nary notations, wherelis adaptively determined by the number of users and the number of available inspectors. It can locate malicious users within linspection steps. In G-BCGI algorithm, users' IDs are encoded into binary notations, similar to the BCGI algorithm, and multiple rounds may be needed to locate malicious users. Experiment results show that the proposed algorithms can locate malicious users accurately and efficiently. (C) 2018 Elsevier Ltd. All rights reserved.
机译:当现代硬件和软件技术集成到智能电网中时,同时会引入许多漏洞。恶意用户现在利用这些漏洞来窃电。提出了许多方法来识别恶意用户。但是,其中一些检测率较低。其他则受到检查速度低或部署监控设备的巨大成本的困扰。在本文中,为了快速,经济地准确定位恶意用户窃电,我们提出了三种新颖的检查算法。首先,提出了基于二进制编码的分组检查(BCGI)算法。在某些假设下,它仅需一步即可找到恶意用户。给定n个用户,BCGI算法需要Theta(log(2)(n))检查器。不幸的是,在某些情况下,我们没有足够的检查器来运行BCGI算法。为了处理这些情况,我们进一步提出了两种算法:基于M元编码分组的检查(MCGI)和广义BCGI(G-BCGI)。在MCGI算法中,用户标识(ID)编号被编码为(1 + 1)进制表示法,其由用户数量和可用检查员数量自适应确定。它可以在检查步骤中找到恶意用户。在G-BCGI算法中,类似于BCGI算法,用户ID被编码为二进制符号,并且可能需要进行多轮查找恶意用户。实验结果表明,该算法能够准确,有效地定位恶意用户。 (C)2018 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号