File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A Dynamic Programming Algorithm for Leveraging Probabilistic Detection of Energy Theft in Smart Home

TitleA Dynamic Programming Algorithm for Leveraging Probabilistic Detection of Energy Theft in Smart Home
Authors
KeywordsDynamic Programming
Energy Theft
FRTU
Probabilistic Detection
Smart Home and Community
Issue Date2015
Citation
IEEE Transactions on Emerging Topics in Computing, 2015, v. 3, n. 4, p. 502-513 How to Cite?
AbstractIn the modern smart home and community, smart meters have been massively deployed for the replacement of traditional analog meters. Although it significantly reduces the cost of data collection as the meter readings are wireless transmitted, a smart meter is not tamper-resistant. As a consequence, the smart grid infrastructure is under threat of energy theft, by means of attacking a smart meter so that it undercounts the electricity usage. Deployment of feeder remote terminal unit (FRTU) helps narrow the search zone of energy theft in smart home and community. However, due to budgetary limit, utility companies can only afford to insert the minimum number of FRTUs. This imposes a signifcant challenge to deploy the minimum number of FRTUs while each smart meter is still effectively monitored. To the best of our knowledge, the only work addressing this problem is [1], which uses stochastic optimization methods. Their algorithm is not very practical as it cannot handle large distribution networks because of the scalability issue. Due to the inherent heuristic and non-deterministic nature, there is no guarantee on the solution quality as well. Thus, the high performance energy theft detection is still needed for this energy theft problem. In order to resolve this challenge, we propose a new dynamic programming algorithm that inserts the minimum number of FRTUs satisfying the detection rate constraint. It evaluates every candidate solution in a bottom-up fashion using an innovative pruning technique. As a deterministic polynomial time algorithm, it is able to handle large distribution networks. In contrast to [1] which can only handle small system, our technique can perform FRTU insertion for a large scale power system. Our experimental results demonstrate that the average number of FRTUs required is only 26% of the number of smart meters in the community. Compared with the previous work, the number of FRTUs is reduced by 18.8% while the solution quality in terms of anomaly coverage index metric is still improved.
Persistent Identifierhttp://hdl.handle.net/10722/336151
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorZhou, Yuchen-
dc.contributor.authorChen, Xiaodao-
dc.contributor.authorZomaya, Albert Y.-
dc.contributor.authorWang, Lizhe-
dc.contributor.authorHu, Shiyan-
dc.date.accessioned2024-01-15T08:23:57Z-
dc.date.available2024-01-15T08:23:57Z-
dc.date.issued2015-
dc.identifier.citationIEEE Transactions on Emerging Topics in Computing, 2015, v. 3, n. 4, p. 502-513-
dc.identifier.urihttp://hdl.handle.net/10722/336151-
dc.description.abstractIn the modern smart home and community, smart meters have been massively deployed for the replacement of traditional analog meters. Although it significantly reduces the cost of data collection as the meter readings are wireless transmitted, a smart meter is not tamper-resistant. As a consequence, the smart grid infrastructure is under threat of energy theft, by means of attacking a smart meter so that it undercounts the electricity usage. Deployment of feeder remote terminal unit (FRTU) helps narrow the search zone of energy theft in smart home and community. However, due to budgetary limit, utility companies can only afford to insert the minimum number of FRTUs. This imposes a signifcant challenge to deploy the minimum number of FRTUs while each smart meter is still effectively monitored. To the best of our knowledge, the only work addressing this problem is [1], which uses stochastic optimization methods. Their algorithm is not very practical as it cannot handle large distribution networks because of the scalability issue. Due to the inherent heuristic and non-deterministic nature, there is no guarantee on the solution quality as well. Thus, the high performance energy theft detection is still needed for this energy theft problem. In order to resolve this challenge, we propose a new dynamic programming algorithm that inserts the minimum number of FRTUs satisfying the detection rate constraint. It evaluates every candidate solution in a bottom-up fashion using an innovative pruning technique. As a deterministic polynomial time algorithm, it is able to handle large distribution networks. In contrast to [1] which can only handle small system, our technique can perform FRTU insertion for a large scale power system. Our experimental results demonstrate that the average number of FRTUs required is only 26% of the number of smart meters in the community. Compared with the previous work, the number of FRTUs is reduced by 18.8% while the solution quality in terms of anomaly coverage index metric is still improved.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Emerging Topics in Computing-
dc.subjectDynamic Programming-
dc.subjectEnergy Theft-
dc.subjectFRTU-
dc.subjectProbabilistic Detection-
dc.subjectSmart Home and Community-
dc.titleA Dynamic Programming Algorithm for Leveraging Probabilistic Detection of Energy Theft in Smart Home-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TETC.2015.2484841-
dc.identifier.scopuseid_2-s2.0-84962159454-
dc.identifier.volume3-
dc.identifier.issue4-
dc.identifier.spage502-
dc.identifier.epage513-
dc.identifier.eissn2168-6750-
dc.identifier.isiWOS:000209846000006-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats