TY - JOUR
T1 - Distributed privacy-preserving data aggregation against dishonest nodes in network systems
AU - He, Jianping
AU - Cai, Lin
AU - Cheng, Peng
AU - Pan, Jianping
AU - Shi, Ling
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2019/4
Y1 - 2019/4
N2 - Privacy-preserving data aggregation (DA) in network systems, e.g., Internet of Things (IoT), is a challenging problem, considering the dynamic network topology, limited computing capacity, energy supply of IoT devices, etc. The difficulty is exaggerated when there exist dishonest nodes, and how to ensure privacy, accuracy, and robustness of the DA process against dishonest nodes remains an open issue. Different from the widely investigated cryptographic approaches, in this paper, we address this challenging problem by exploiting the distributed consensus technique. To mitigate the pollution from dishonest nodes, we propose an enhanced secure consensus-based DA (E-SCDA) algorithm that allows neighbors to detect dishonest nodes, and derive the error bound when there are undetectable dishonest nodes. We prove the convergence of the E-SCDA and show that the algorithm can preserve the privacy associated to nodes' initial states. Extensive simulations have shown that the proposed algorithm has a high convergence accuracy and low complexity, even when there exist dishonest nodes in the network.
AB - Privacy-preserving data aggregation (DA) in network systems, e.g., Internet of Things (IoT), is a challenging problem, considering the dynamic network topology, limited computing capacity, energy supply of IoT devices, etc. The difficulty is exaggerated when there exist dishonest nodes, and how to ensure privacy, accuracy, and robustness of the DA process against dishonest nodes remains an open issue. Different from the widely investigated cryptographic approaches, in this paper, we address this challenging problem by exploiting the distributed consensus technique. To mitigate the pollution from dishonest nodes, we propose an enhanced secure consensus-based DA (E-SCDA) algorithm that allows neighbors to detect dishonest nodes, and derive the error bound when there are undetectable dishonest nodes. We prove the convergence of the E-SCDA and show that the algorithm can preserve the privacy associated to nodes' initial states. Extensive simulations have shown that the proposed algorithm has a high convergence accuracy and low complexity, even when there exist dishonest nodes in the network.
KW - Average consensus
KW - data aggregation (DA)
KW - distributed computing
KW - network systems
KW - privacy preservation
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000467564700020
UR - https://openalex.org/W2800873021
UR - https://www.scopus.com/pages/publications/85046806347
U2 - 10.1109/JIOT.2018.2834544
DO - 10.1109/JIOT.2018.2834544
M3 - Journal Article
SN - 2327-4662
VL - 6
SP - 1462
EP - 1470
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
IS - 2
M1 - 8356738
ER -