Minimizing AoI under Covertness Constraints in Internet of Things Networks

Danyang Wang; Huimin Qin; Zan Li; Peihan Qi; Ning Zhang; Xianfu Chen; Keping Yu

doi:10.1109/ICFTIC54370.2021.9647130

Minimizing AoI under Covertness Constraints in Internet of Things Networks

Danyang Wang, Huimin Qin, Zan Li, Peihan Qi, Ning Zhang, Xianfu Chen, Keping Yu

BA6401 Connectivity solutions

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

3 Citations (Scopus)

Abstract

Covertly collecting the latest status information is great crucial for the controller to make decision in Internet of Things (IoT) networks. In this paper, age of information (AoI) is leveraged to evaluate the information freshness. To improve the information freshness, packet re-transmission is exploited at the transmitter, while the re-transmission increases the probability that the transmission behavior is being detected by the adversaries. Hence, we propose a time constrained re-transmission strategy to make a trade-off between the AoI and transmission covertness. Specifically, the maximum allowable re-transmission times have different effects on the AoI and transmission covertness. We formulate an optimization problem to minimize AoI under the constraint of system covertness. The closed-form expression of the average AoI and the expected probability of error detection are derived. Then, the number of maximum re-transmission time slots is optimized to minimize the average AoI. Finally, numerical results demonstrate that the optimal choice of the re-transmission times is the upper bound value of the consecutive transmission time slots that satisfies the covertness constraint. Proposed retransmission strategy can guarantee the information freshness under a given covertness constraint.

Original language	English
Title of host publication	2021 IEEE 3rd International Conference on Frontiers Technology of Information and Computer (ICFTIC)
Publisher	IEEE Institute of Electrical and Electronic Engineers
Pages	694-700
ISBN (Electronic)	978-1-6654-0605-5, 978-1-6654-0604-8
ISBN (Print)	978-1-6654-0606-2
DOIs	https://doi.org/10.1109/ICFTIC54370.2021.9647130
Publication status	Published - 12 Nov 2021
MoE publication type	A4 Article in a conference publication
Event	IEEE 3rd International Conference on Frontiers Technology of Information and Computer, ICFTIC 2021 - Virtual Duration: 12 Nov 2021 → 14 Nov 2021

Conference

Conference	IEEE 3rd International Conference on Frontiers Technology of Information and Computer, ICFTIC 2021
Period	12/11/21 → 14/11/21

Keywords

AoI
component
Covert communication
Internet of Things
Rayleigh fading

Access to Document

10.1109/ICFTIC54370.2021.9647130

Cite this

Wang, D., Qin, H., Li, Z., Qi, P., Zhang, N., Chen, X., & Yu, K. (2021). Minimizing AoI under Covertness Constraints in Internet of Things Networks. In 2021 IEEE 3rd International Conference on Frontiers Technology of Information and Computer (ICFTIC) (pp. 694-700). IEEE Institute of Electrical and Electronic Engineers. https://doi.org/10.1109/ICFTIC54370.2021.9647130

@inproceedings{413a46f05ddf4aa49f98a2c55f385907,

title = "Minimizing AoI under Covertness Constraints in Internet of Things Networks",

abstract = "Covertly collecting the latest status information is great crucial for the controller to make decision in Internet of Things (IoT) networks. In this paper, age of information (AoI) is leveraged to evaluate the information freshness. To improve the information freshness, packet re-transmission is exploited at the transmitter, while the re-transmission increases the probability that the transmission behavior is being detected by the adversaries. Hence, we propose a time constrained re-transmission strategy to make a trade-off between the AoI and transmission covertness. Specifically, the maximum allowable re-transmission times have different effects on the AoI and transmission covertness. We formulate an optimization problem to minimize AoI under the constraint of system covertness. The closed-form expression of the average AoI and the expected probability of error detection are derived. Then, the number of maximum re-transmission time slots is optimized to minimize the average AoI. Finally, numerical results demonstrate that the optimal choice of the re-transmission times is the upper bound value of the consecutive transmission time slots that satisfies the covertness constraint. Proposed retransmission strategy can guarantee the information freshness under a given covertness constraint.",

keywords = "AoI, component, Covert communication, Internet of Things, Rayleigh fading",

author = "Danyang Wang and Huimin Qin and Zan Li and Peihan Qi and Ning Zhang and Xianfu Chen and Keping Yu",

year = "2021",

month = nov,

day = "12",

doi = "10.1109/ICFTIC54370.2021.9647130",

language = "English",

isbn = "978-1-6654-0606-2",

pages = "694--700",

booktitle = "2021 IEEE 3rd International Conference on Frontiers Technology of Information and Computer (ICFTIC)",

publisher = "IEEE Institute of Electrical and Electronic Engineers",

address = "United States",

note = "IEEE 3rd International Conference on Frontiers Technology of Information and Computer, ICFTIC 2021 ; Conference date: 12-11-2021 Through 14-11-2021",

}

Wang, D, Qin, H, Li, Z, Qi, P, Zhang, N, Chen, X & Yu, K 2021, Minimizing AoI under Covertness Constraints in Internet of Things Networks. in 2021 IEEE 3rd International Conference on Frontiers Technology of Information and Computer (ICFTIC). IEEE Institute of Electrical and Electronic Engineers, pp. 694-700, IEEE 3rd International Conference on Frontiers Technology of Information and Computer, ICFTIC 2021, 12/11/21. https://doi.org/10.1109/ICFTIC54370.2021.9647130

Minimizing AoI under Covertness Constraints in Internet of Things Networks. / Wang, Danyang; Qin, Huimin; Li, Zan et al.
2021 IEEE 3rd International Conference on Frontiers Technology of Information and Computer (ICFTIC). IEEE Institute of Electrical and Electronic Engineers, 2021. p. 694-700.

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Minimizing AoI under Covertness Constraints in Internet of Things Networks

AU - Wang, Danyang

AU - Qin, Huimin

AU - Li, Zan

AU - Qi, Peihan

AU - Zhang, Ning

AU - Chen, Xianfu

AU - Yu, Keping

PY - 2021/11/12

Y1 - 2021/11/12

N2 - Covertly collecting the latest status information is great crucial for the controller to make decision in Internet of Things (IoT) networks. In this paper, age of information (AoI) is leveraged to evaluate the information freshness. To improve the information freshness, packet re-transmission is exploited at the transmitter, while the re-transmission increases the probability that the transmission behavior is being detected by the adversaries. Hence, we propose a time constrained re-transmission strategy to make a trade-off between the AoI and transmission covertness. Specifically, the maximum allowable re-transmission times have different effects on the AoI and transmission covertness. We formulate an optimization problem to minimize AoI under the constraint of system covertness. The closed-form expression of the average AoI and the expected probability of error detection are derived. Then, the number of maximum re-transmission time slots is optimized to minimize the average AoI. Finally, numerical results demonstrate that the optimal choice of the re-transmission times is the upper bound value of the consecutive transmission time slots that satisfies the covertness constraint. Proposed retransmission strategy can guarantee the information freshness under a given covertness constraint.

AB - Covertly collecting the latest status information is great crucial for the controller to make decision in Internet of Things (IoT) networks. In this paper, age of information (AoI) is leveraged to evaluate the information freshness. To improve the information freshness, packet re-transmission is exploited at the transmitter, while the re-transmission increases the probability that the transmission behavior is being detected by the adversaries. Hence, we propose a time constrained re-transmission strategy to make a trade-off between the AoI and transmission covertness. Specifically, the maximum allowable re-transmission times have different effects on the AoI and transmission covertness. We formulate an optimization problem to minimize AoI under the constraint of system covertness. The closed-form expression of the average AoI and the expected probability of error detection are derived. Then, the number of maximum re-transmission time slots is optimized to minimize the average AoI. Finally, numerical results demonstrate that the optimal choice of the re-transmission times is the upper bound value of the consecutive transmission time slots that satisfies the covertness constraint. Proposed retransmission strategy can guarantee the information freshness under a given covertness constraint.

KW - AoI

KW - component

KW - Covert communication

KW - Internet of Things

KW - Rayleigh fading

UR - http://www.scopus.com/inward/record.url?scp=85124338041&partnerID=8YFLogxK

U2 - 10.1109/ICFTIC54370.2021.9647130

DO - 10.1109/ICFTIC54370.2021.9647130

M3 - Conference article in proceedings

SN - 978-1-6654-0606-2

SP - 694

EP - 700

BT - 2021 IEEE 3rd International Conference on Frontiers Technology of Information and Computer (ICFTIC)

PB - IEEE Institute of Electrical and Electronic Engineers

T2 - IEEE 3rd International Conference on Frontiers Technology of Information and Computer, ICFTIC 2021

Y2 - 12 November 2021 through 14 November 2021

ER -

Minimizing AoI under Covertness Constraints in Internet of Things Networks

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Best Paper Award at IEEE ICFTIC 2021 Conference

Cite this

Minimizing AoI under Covertness Constraints in Internet of Things Networks

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Prizes

Best Paper Award at IEEE ICFTIC 2021 Conference

Cite this