TY - GEN
T1 - Secure data collection in constrained tree-based Smart Grid environments
AU - Jin, Haiming
AU - Uludag, Suleyman
AU - Lui, King Shan
AU - Nahrstedt, Klara
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2015/1/12
Y1 - 2015/1/12
N2 - To facilitate more efficient control, massive amounts of sensors or measurement devices will be deployed in the Smart Grid. Data collection then becomes non-trivial. In this paper, we study the scenario where a data collector is responsible for collecting data from multiple measurement devices, but only some of them can communicate with the data collector directly. Others have to rely on other devices to relay the data. We first develop a communication protocol so that the data reported by each device is protected again honest-but-curious data collector and devices. To reduce the time to collect data from all devices within a certain security level, we formulate our approach as an integer linear programming problem. As the problem is NP-hard, obtaining the optimal solution in a large network is not very feasible. We thus develop an approximation algorithm to solve the problem. We test the performance of our algorithm using real topologies. The results show that our algorithm successfully identifies good solutions within reasonable amount of time.
AB - To facilitate more efficient control, massive amounts of sensors or measurement devices will be deployed in the Smart Grid. Data collection then becomes non-trivial. In this paper, we study the scenario where a data collector is responsible for collecting data from multiple measurement devices, but only some of them can communicate with the data collector directly. Others have to rely on other devices to relay the data. We first develop a communication protocol so that the data reported by each device is protected again honest-but-curious data collector and devices. To reduce the time to collect data from all devices within a certain security level, we formulate our approach as an integer linear programming problem. As the problem is NP-hard, obtaining the optimal solution in a large network is not very feasible. We thus develop an approximation algorithm to solve the problem. We test the performance of our algorithm using real topologies. The results show that our algorithm successfully identifies good solutions within reasonable amount of time.
UR - http://www.scopus.com/inward/record.url?scp=84922439904&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84922439904&partnerID=8YFLogxK
U2 - 10.1109/SmartGridComm.2014.7007664
DO - 10.1109/SmartGridComm.2014.7007664
M3 - Conference contribution
AN - SCOPUS:84922439904
T3 - 2014 IEEE International Conference on Smart Grid Communications, SmartGridComm 2014
SP - 308
EP - 313
BT - 2014 IEEE International Conference on Smart Grid Communications, SmartGridComm 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE International Conference on Smart Grid Communications, SmartGridComm 2014
Y2 - 3 November 2014 through 6 November 2014
ER -