Secure data collection in constrained tree-based Smart Grid environments

SmartGridComm(2014)

引用 11|浏览66
暂无评分
摘要
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.
更多
查看译文
关键词
trees (mathematics),approximation theory,tree-based smart grid environments,np-hard problem,power system security,integer programming,integer linear programming problem,linear programming,approximation algorithm,power system measurement,computational complexity,communication protocol,multiple measurement devices,smart power grids,secure data collection,topology,np hard problem,approximation algorithms,cryptography,data collection
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要