Published July 2019
| Submitted
Book Section - Chapter
Open
Differential Privacy of Aggregated DC Optimal Power Flow Data
- Creators
-
Zhou, Fengyu
-
Anderson, James
-
Low, Steven H.
Abstract
We consider the problem of privately releasing aggregated network statistics obtained from solving a DC optimal power flow (OPF) problem. It is shown that the mechanism that determines the noise distribution parameters are linked to the topology of the power system and the monotonicity of the network. We derive a measure of "almost" monotonicity and show how it can be used in conjunction with a linear program in order to release aggregated OPF data using the differential privacy framework.
Additional Information
© 2019 AACC. This work is funded by NSF grants CCF 1637598, ECCS 1619352, CNS 1545096, ARPA-E through grant DE-AR0000699 and the GRID DATA program, and DTRA through grant HDTRA 1-15-1-0003.Attached Files
Submitted - 1903.11237.pdf
Files
1903.11237.pdf
Files
(556.0 kB)
Name | Size | Download all |
---|---|---|
md5:f434745dd812b4759b09f973aa7fccfb
|
556.0 kB | Preview Download |
Additional details
- Eprint ID
- 96754
- DOI
- 10.48550/arXiv.1903.11237
- Resolver ID
- CaltechAUTHORS:20190626-153106599
- NSF
- CCF-1637598
- NSF
- ECCS-1619352
- NSF
- CNS-1545096
- Advanced Research Projects Agency-Energy (ARPA-E)
- DE-AR0000699
- Defense Threat Reduction Agency (DTRA)
- HDTRA 1-15-1-0003
- Created
-
2019-06-27Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field