Abstract

Malicious data injection attacks against smart grid systems are one of the most significant problems in cyber security. Previously, these are either targeted attacks or attacks with restrictions. In this paper, optimal random undetectable attacks are considered for the first time. In the state of the art, stealth attacks can always exist if the number of compromised measurements exceeds a certain value. In this paper, it is shown that undetectable attacks can be accomplished by altering only a much smaller number of measurements. On the other hand, a robust detection algorithm is designed by taking advantage of the sparse and low rank properties of the block measurements for a time interval. The element-wise constraints are introduced to improve the error tolerance and the problem of detecting false data with partial observations is also considered in this paper. The performance of the proposed algorithms is investigated based on IEEE test systems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.