DynaPro: Dynamic Wireless Sensor Network Data Protection Algorithm in IoT via Differential Privacy

With the advent of the era of intelligent Internet of Things (IoT), more and more personal information are collected in the process of deploying IoT in various domains. This brings the problem of data protection in IoT. To address this problem, we propose a data protection algorithm, called DynaPro, based on differential privacy for dynamic wireless sensor networks (WSN), which is the sensor layer of IoT. DynaPro has addressed two issues in data protection of wireless sensor networks. The first issue is the dynamic topology of the network. In order to solve this problem, DynaPro has adopted methods like time window, hierarchical sampling, and graph similarity to process the snapshots of the dynamic network topology. The second issue is addition of noise in differential privacy. To address this issue, DynaPro uses Hierarchical Random Graph (HRG) as middleware to apply differential privacy protection. Instead of adding noise to network data and topology directly, DynaPro adds noise to HRG. In this way, DynaPro can hide the network topology but retain the necessary structural information to support data analysis. Theoretical analysis and experimental results show that DynaPro can preserve the important network features of the original network topology under the premise of the differential privacy protection model.

[1]  Yi Wang,et al.  Differential Privacy Preserving in Big Data Analytics for Connected Health , 2016, Journal of Medical Systems.

[2]  Zhenyu Liu,et al.  An Efficient Dynamic Trust Evaluation Model for Wireless Sensor Networks , 2017, J. Sensors.

[3]  Xiaolei Dong,et al.  $\hbox{EP}^{2}\hbox{DF}$: An Efficient Privacy-Preserving Data-Forwarding Scheme for Service-Oriented Vehicular Ad Hoc Networks , 2011, IEEE Transactions on Vehicular Technology.

[4]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[5]  Rong Jin,et al.  A Random Matrix Approach to Differential Privacy and Structure Preserved Social Network Graph Publishing , 2013, ArXiv.

[6]  Lei Chen,et al.  Parallel Community Detection Based on Distance Dynamics for Large-Scale Network , 2018, IEEE Access.

[7]  Prerna Agarwal,et al.  DyPerm: Maximizing Permanence for Dynamic Community Detection , 2018, PAKDD.

[8]  Sheng Zhong,et al.  Privacy-Preserving Data Aggregation in Mobile Phone Sensing , 2016, IEEE Transactions on Information Forensics and Security.

[9]  Xiao Fu,et al.  Detecting Overlapping and Correlated Communities without Pure Nodes: Identifiability and Algorithm , 2019, ICML.

[10]  Jong Kim,et al.  Publishing Graph Data with Subgraph Differential Privacy , 2015, WISA.

[11]  Yanjiao Chen,et al.  InPrivate Digging: Enabling Tree-based Distributed Data Mining with Differential Privacy , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

[12]  Qian Xiao,et al.  Differentially private network data release via structural inference , 2014, KDD.

[13]  Kunpeng Wang,et al.  Efficient Leveled (Multi) Identity-Based Fully Homomorphic Encryption Schemes , 2019, IEEE Access.

[14]  Mahmoud Ammar,et al.  Journal of Information Security and Applications , 2022 .

[15]  Wei Chen,et al.  A game-theoretic framework to identify overlapping communities in social networks , 2010, Data Mining and Knowledge Discovery.

[16]  Damas P. Gruska Differential Privacy and Security , 2014, CS&P.

[17]  Gene Tsudik,et al.  QUEST Software and , 2022 .

[18]  Matthieu Latapy,et al.  Computing maximal cliques in link streams , 2015, Theor. Comput. Sci..

[19]  Zhe Xia,et al.  Privacy-preserving raw data collection without a trusted authority for IoT , 2019, Comput. Networks.

[20]  Petko Bogdanov,et al.  Local Community Detection in Dynamic Networks , 2017, 2017 IEEE International Conference on Data Mining (ICDM).

[21]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[22]  Marina Blanton,et al.  Secure Multiparty Computation , 2011, Encyclopedia of Cryptography and Security.

[23]  Dirk Westhoff,et al.  Concealed Data Aggregation for Reverse Multicast Traffic in Sensor Networks: Encryption, Key Distribution, and Routing Adaptation , 2006, IEEE Transactions on Mobile Computing.

[24]  Nagehan Ilhan,et al.  Predicting community evolution based on time series modeling , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[25]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[26]  Dino Pedreschi,et al.  Tiles: an online algorithm for community discovery in dynamic social networks , 2017, Machine Learning.

[27]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[28]  Pierangela Samarati,et al.  Protecting Respondents' Identities in Microdata Release , 2001, IEEE Trans. Knowl. Data Eng..

[29]  Michele Garetto,et al.  De-anonymizing Clustered Social Networks by Percolation Graph Matching , 2018, ACM Trans. Knowl. Discov. Data.

[30]  Jalel Akaichi,et al.  Tracking dynamic community evolution in social networks , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[31]  Jin Wang,et al.  A network state based reliability evaluation model for WSNs , 2017, 2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD).

[32]  Hassan Artail,et al.  A Framework for Secure and Efficient Data Acquisition in Vehicular Ad Hoc Networks , 2013, IEEE Transactions on Vehicular Technology.

[33]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[34]  Leting Wu,et al.  Differential Privacy Preserving Spectral Graph Analysis , 2013, PAKDD.