Dynamic Edge-Based High-Dimensional Data Aggregation with Differential Privacy

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Edge computing enables efficient data aggregation for services like data sharing and analysis in distributed IoT applications. However, uploading dynamic high-dimensional data to an edge server for efficient aggregation is challenging. Additionally, there is the significant risk of privacy leakage associated with direct such data uploading. Therefore, we propose an edge-based differential privacy data aggregation method leveraging progressive UMAP with a dynamic time window based on LSTM (EDP-PUDL). Firstly, a model of the dynamic time window based on a long short-term memory (LSTM) network was developed to divide dynamic data. Then, progressive uniform manifold approximation and projection (UMAP) with differential privacy was performed to reduce the dimension of the window data while preserving privacy. The privacy budget was determined by the data volume and the attribute’s Shapley value, adding DP noise. Finally, the privacy analysis and experimental comparisons demonstrated that EDP-PUDL ensures user privacy while achieving superior aggregation efficiency and availability compared to other algorithms used for dynamic high-dimensional data aggregation.

Cite

CITATION STYLE

APA

Chen, Q., Ni, Z., Zhu, X., Lyu, M., Liu, W., & Xia, P. (2024). Dynamic Edge-Based High-Dimensional Data Aggregation with Differential Privacy. Electronics (Switzerland), 13(16). https://doi.org/10.3390/electronics13163346

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free