File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TETC.2015.2484841
- Scopus: eid_2-s2.0-84962159454
- WOS: WOS:000209846000006
Supplementary
- Citations:
- Appears in Collections:
Article: A Dynamic Programming Algorithm for Leveraging Probabilistic Detection of Energy Theft in Smart Home
Title | A Dynamic Programming Algorithm for Leveraging Probabilistic Detection of Energy Theft in Smart Home |
---|---|
Authors | |
Keywords | Dynamic Programming Energy Theft FRTU Probabilistic Detection Smart Home and Community |
Issue Date | 2015 |
Citation | IEEE Transactions on Emerging Topics in Computing, 2015, v. 3, n. 4, p. 502-513 How to Cite? |
Abstract | In 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 Identifier | http://hdl.handle.net/10722/336151 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhou, Yuchen | - |
dc.contributor.author | Chen, Xiaodao | - |
dc.contributor.author | Zomaya, Albert Y. | - |
dc.contributor.author | Wang, Lizhe | - |
dc.contributor.author | Hu, Shiyan | - |
dc.date.accessioned | 2024-01-15T08:23:57Z | - |
dc.date.available | 2024-01-15T08:23:57Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | IEEE Transactions on Emerging Topics in Computing, 2015, v. 3, n. 4, p. 502-513 | - |
dc.identifier.uri | http://hdl.handle.net/10722/336151 | - |
dc.description.abstract | In 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.language | eng | - |
dc.relation.ispartof | IEEE Transactions on Emerging Topics in Computing | - |
dc.subject | Dynamic Programming | - |
dc.subject | Energy Theft | - |
dc.subject | FRTU | - |
dc.subject | Probabilistic Detection | - |
dc.subject | Smart Home and Community | - |
dc.title | A Dynamic Programming Algorithm for Leveraging Probabilistic Detection of Energy Theft in Smart Home | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/TETC.2015.2484841 | - |
dc.identifier.scopus | eid_2-s2.0-84962159454 | - |
dc.identifier.volume | 3 | - |
dc.identifier.issue | 4 | - |
dc.identifier.spage | 502 | - |
dc.identifier.epage | 513 | - |
dc.identifier.eissn | 2168-6750 | - |
dc.identifier.isi | WOS:000209846000006 | - |