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
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
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 - Covert communication
KW - Internet of Things
KW - Rayleigh fading
KW - component
UR - http://www.scopus.com/inward/record.url?scp=85124338041&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85124338041&partnerID=8YFLogxK
U2 - 10.1109/ICFTIC54370.2021.9647130
DO - 10.1109/ICFTIC54370.2021.9647130
M3 - Conference contribution
AN - SCOPUS:85124338041
T3 - 2021 IEEE 3rd International Conference on Frontiers Technology of Information and Computer, ICFTIC 2021
SP - 694
EP - 700
BT - 2021 IEEE 3rd International Conference on Frontiers Technology of Information and Computer, ICFTIC 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd IEEE International Conference on Frontiers Technology of Information and Computer, ICFTIC 2021
Y2 - 12 November 2021 through 14 November 2021
ER -