DFTMicroagg: a dual-level anonymization algorithm for smart grid data

被引:0
|
作者
Kayode S. Adewole
Vicenç Torra
机构
[1] Umeå University,Department of Computing Science
[2] University of Ilorin,Department of Computer Science
关键词
Smart meters; Smart grid; Privacy preserving; Discrete Fourier transform; Microaggregation; Load forecasting;
D O I
暂无
中图分类号
学科分类号
摘要
The introduction of advanced metering infrastructure (AMI) smart meters has given rise to fine-grained electricity usage data at different levels of time granularity. AMI collects high-frequency daily energy consumption data that enables utility companies and data aggregators to perform a rich set of grid operations such as demand response, grid monitoring, load forecasting and many more. However, the privacy concerns associated with daily energy consumption data has been raised. Existing studies on data anonymization for smart grid data focused on the direct application of perturbation algorithms, such as microaggregation, to protect the privacy of consumers. In this paper, we empirically show that reliance on microaggregation alone is not sufficient to protect smart grid data. Therefore, we propose DFTMicroagg algorithm that provides a dual level of perturbation to improve privacy. The algorithm leverages the benefits of discrete Fourier transform (DFT) and microaggregation to provide additional layer of protection. We evaluated our algorithm on two publicly available smart grid datasets with millions of smart meters readings. Experimental results based on clustering analysis using k-Means, classification via k-nearest neighbor (kNN) algorithm and mean hourly energy consumption forecast using Seasonal Auto-Regressive Integrated Moving Average with eXogenous (SARIMAX) factors model further proved the applicability of the proposed method. Our approach provides utility companies with more flexibility to control the level of protection for their published energy data.
引用
收藏
页码:1299 / 1321
页数:22
相关论文
共 50 条
  • [1] DFTMicroagg: a dual-level anonymization algorithm for smart grid data
    Adewole, Kayode S.
    Torra, Vicenc
    INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2022, 21 (06) : 1299 - 1321
  • [2] Smart grid data anonymization for smart grid privacy
    Telecommunications Software and Systems Group, Waterford Institute of Technology, Waterford, Ireland
    不详
    Commun. Comput. Info. Sci., (89-96):
  • [3] Smart Grid Privacy via Anonymization of Smart Metering Data
    Efthymiou, Costas
    Kalogridis, Georgios
    2010 IEEE 1ST INTERNATIONAL CONFERENCE ON SMART GRID COMMUNICATIONS (SMARTGRIDCOMM), 2010, : 238 - 243
  • [4] A fast dual-level fingerprinting scheme for data deduplication
    Wei, Jiansheng
    Zhou, Ke
    Tian, Lei
    Wang, Hua
    Feng, Dan
    International Journal of Digital Content Technology and its Applications, 2012, 6 (01) : 271 - 282
  • [5] Dual-level clustering ensemble algorithm with three consensus strategies
    Yunxiao Shan
    Shu Li
    Fuxiang Li
    Yuxin Cui
    Minghua Chen
    Scientific Reports, 13
  • [6] Dual-level clustering ensemble algorithm with three consensus strategies
    Shan, Yunxiao
    Li, Shu
    Li, Fuxiang
    Cui, Yuxin
    Chen, Minghua
    SCIENTIFIC REPORTS, 2023, 13 (01)
  • [7] New Dual Algorithm to Placement the Data Aggregation Point for Smart Grid Meters
    Abdullah, Ahmed A.
    Ashraf, Eman
    SMART GRIDS AND SUSTAINABLE ENERGY, 2024, 9 (01)
  • [8] A Novel Dual Euclidean Algorithm for Secure Data Transmission in Smart Grid System
    Vijayanand, R.
    Devaraj, D.
    Kannapiran, B.
    2014 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMPUTING RESEARCH (IEEE ICCIC), 2014, : 447 - 451
  • [9] Dual-Level Key Management for secure grid communication in dynamic and hierarchical groups
    Zou, Xukai
    Dai, Yuan-Shun
    Ran, Xiang
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2007, 23 (06): : 776 - 786
  • [10] Application of Multiblock Grid and Dual-Level Parallelism in Coastal Ocean Circulation Modeling
    Phu Luong
    Clay P. Breshears
    Le N. Ly
    Journal of Scientific Computing, 2004, 20 : 257 - 275