Encryption scheduling for remote state estimation under an operation constraint
In remote state estimation, data transmitted by a sensor through a wireless communication channel may be overheard by an eavesdropper. One possible way to avoid information leakage is to encrypt the transmitted data all the time. However, this may impose an extra operation energy burden on the senso...
Saved in:
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/159355 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-159355 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1593552022-06-16T02:41:13Z Encryption scheduling for remote state estimation under an operation constraint Huang, Lingying Ding, Kemi Leong, Alex S. Quevedo, Daniel E. Shi, Ling School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Privacy Encryption Scheduling In remote state estimation, data transmitted by a sensor through a wireless communication channel may be overheard by an eavesdropper. One possible way to avoid information leakage is to encrypt the transmitted data all the time. However, this may impose an extra operation energy burden on the sensor. In this paper, we investigate the optimal encryption scheduling in order to protect data privacy and ensure estimation accuracy under an energy constraint. Specifically, the sensor computes its local state estimate and then quantizes it using a non-subtractively dithered quantizer. Before each transmission, the sensor determines whether encrypting the data or not in order to strike a balance between data privacy and estimation accuracy. As the information about eavesdropper is unknown to the estimator, we introduce the concept of eavesdropper-invariant schedules and derive associated structural results. In addition, we propose a practical algorithm that compares a finite number of points to obtain an ε-optimal encryption schedule. Numerical examples are provided to illustrate performance benefits of the proposed methods. The work by L. Huang and L. Shi is supported by a Hong Kong RGC General Research Fund 16204218. 2022-06-16T02:41:13Z 2022-06-16T02:41:13Z 2021 Journal Article Huang, L., Ding, K., Leong, A. S., Quevedo, D. E. & Shi, L. (2021). Encryption scheduling for remote state estimation under an operation constraint. Automatica, 127, 109537-. https://dx.doi.org/10.1016/j.automatica.2021.109537 0005-1098 https://hdl.handle.net/10356/159355 10.1016/j.automatica.2021.109537 2-s2.0-85102045707 127 109537 en Automatica © 2021 Elsevier Ltd. All rights reserved. |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Electrical and electronic engineering Privacy Encryption Scheduling |
spellingShingle |
Engineering::Electrical and electronic engineering Privacy Encryption Scheduling Huang, Lingying Ding, Kemi Leong, Alex S. Quevedo, Daniel E. Shi, Ling Encryption scheduling for remote state estimation under an operation constraint |
description |
In remote state estimation, data transmitted by a sensor through a wireless communication channel may be overheard by an eavesdropper. One possible way to avoid information leakage is to encrypt the transmitted data all the time. However, this may impose an extra operation energy burden on the sensor. In this paper, we investigate the optimal encryption scheduling in order to protect data privacy and ensure estimation accuracy under an energy constraint. Specifically, the sensor computes its local state estimate and then quantizes it using a non-subtractively dithered quantizer. Before each transmission, the sensor determines whether encrypting the data or not in order to strike a balance between data privacy and estimation accuracy. As the information about eavesdropper is unknown to the estimator, we introduce the concept of eavesdropper-invariant schedules and derive associated structural results. In addition, we propose a practical algorithm that compares a finite number of points to obtain an ε-optimal encryption schedule. Numerical examples are provided to illustrate performance benefits of the proposed methods. |
author2 |
School of Electrical and Electronic Engineering |
author_facet |
School of Electrical and Electronic Engineering Huang, Lingying Ding, Kemi Leong, Alex S. Quevedo, Daniel E. Shi, Ling |
format |
Article |
author |
Huang, Lingying Ding, Kemi Leong, Alex S. Quevedo, Daniel E. Shi, Ling |
author_sort |
Huang, Lingying |
title |
Encryption scheduling for remote state estimation under an operation constraint |
title_short |
Encryption scheduling for remote state estimation under an operation constraint |
title_full |
Encryption scheduling for remote state estimation under an operation constraint |
title_fullStr |
Encryption scheduling for remote state estimation under an operation constraint |
title_full_unstemmed |
Encryption scheduling for remote state estimation under an operation constraint |
title_sort |
encryption scheduling for remote state estimation under an operation constraint |
publishDate |
2022 |
url |
https://hdl.handle.net/10356/159355 |
_version_ |
1736856407495409664 |