Optimal status update for caching enabled IoT networks: a dueling deep R-network approach
In the Internet of Things (IoT) networks, caching is a promising technique to alleviate energy consumption of sensors by responding to users' data requests with the data packets cached in the edge caching node (ECN). However, without an efficient status update strategy, the information obtained...
Saved in:
Main Authors: | , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/162972 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-162972 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1629722022-11-14T04:22:17Z Optimal status update for caching enabled IoT networks: a dueling deep R-network approach Xu, Chao Xie, Yiping Wang, Xijun Yang, Howard H. Niyato, Dusit Quek, Tony Q. S. School of Computer Science and Engineering Engineering::Computer science and engineering Internet of Things Internet of Things In the Internet of Things (IoT) networks, caching is a promising technique to alleviate energy consumption of sensors by responding to users' data requests with the data packets cached in the edge caching node (ECN). However, without an efficient status update strategy, the information obtained by users may be stale, which in return would inevitably deteriorate the accuracy and reliability of derived decisions for real-time applications. In this paper, we focus on striking the balance between the information freshness, in terms of age of information (AoI), experienced by users and energy consumed by sensors, by appropriately activating sensors to update their current status. Particularly, we first depict the evolutions of the AoI with each sensor from different users' perspective with time steps of non-uniform duration, which are determined by both the users' data requests and the ECN's status update decision. Then, we formulate a non-uniform time step based dynamic status update optimization problem to minimize the long-term average cost, jointly considering the average AoI and energy consumption. To this end, a Markov Decision Process is formulated and further, a dueling deep R-network based dynamic status update algorithm is devised by combining dueling deep Q-network and tabular R-learning, with which challenges from the curse of dimensionality and unknown of the environmental dynamics can be addressed. Finally, extensive simulations are conducted to validate the effectiveness of our proposed algorithm by comparing it with five baseline deep reinforcement learning algorithms and policies. Ministry of Education (MOE) National Research Foundation (NRF) This work was supported in part by the National Natural Science Foundation of China under Grant 61701372, in part by the Chinese Universities Scientific Fund under Grant 2452017560, in part by the High-level Talents Fund of Shaanxi Province under Grant F2020221001, in part by the Technological Innovation Fund of Shaanxi Academy of Forestry under Grant SXLK2021-0215, in part by the Guangdong Basic and Applied Basic Research Foundation under Grant 2021A1515012631, in part by the Zhejiang University/University of Illinois at Urbana–Champaign Institute Starting Fund, in part by the ZJU-UIUC Joint Research Center Project under Grant DREMES 202003, in part by the National Research Foundation, Singapore and Infocomm Media Development Authority under its Future Communications Research & Development Programme, and in part by the MOE ARF Tier 2 under Grant T2EP20120-0006. 2022-11-14T04:22:16Z 2022-11-14T04:22:16Z 2021 Journal Article Xu, C., Xie, Y., Wang, X., Yang, H. H., Niyato, D. & Quek, T. Q. S. (2021). Optimal status update for caching enabled IoT networks: a dueling deep R-network approach. IEEE Transactions On Wireless Communications, 20(12), 8438-8454. https://dx.doi.org/10.1109/TWC.2021.3093352 1536-1276 https://hdl.handle.net/10356/162972 10.1109/TWC.2021.3093352 2-s2.0-85106164969 12 20 8438 8454 en T2EP20120-0006 IEEE Transactions on Wireless Communications © 2021 IEEE. 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::Computer science and engineering Internet of Things Internet of Things |
spellingShingle |
Engineering::Computer science and engineering Internet of Things Internet of Things Xu, Chao Xie, Yiping Wang, Xijun Yang, Howard H. Niyato, Dusit Quek, Tony Q. S. Optimal status update for caching enabled IoT networks: a dueling deep R-network approach |
description |
In the Internet of Things (IoT) networks, caching is a promising technique to alleviate energy consumption of sensors by responding to users' data requests with the data packets cached in the edge caching node (ECN). However, without an efficient status update strategy, the information obtained by users may be stale, which in return would inevitably deteriorate the accuracy and reliability of derived decisions for real-time applications. In this paper, we focus on striking the balance between the information freshness, in terms of age of information (AoI), experienced by users and energy consumed by sensors, by appropriately activating sensors to update their current status. Particularly, we first depict the evolutions of the AoI with each sensor from different users' perspective with time steps of non-uniform duration, which are determined by both the users' data requests and the ECN's status update decision. Then, we formulate a non-uniform time step based dynamic status update optimization problem to minimize the long-term average cost, jointly considering the average AoI and energy consumption. To this end, a Markov Decision Process is formulated and further, a dueling deep R-network based dynamic status update algorithm is devised by combining dueling deep Q-network and tabular R-learning, with which challenges from the curse of dimensionality and unknown of the environmental dynamics can be addressed. Finally, extensive simulations are conducted to validate the effectiveness of our proposed algorithm by comparing it with five baseline deep reinforcement learning algorithms and policies. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Xu, Chao Xie, Yiping Wang, Xijun Yang, Howard H. Niyato, Dusit Quek, Tony Q. S. |
format |
Article |
author |
Xu, Chao Xie, Yiping Wang, Xijun Yang, Howard H. Niyato, Dusit Quek, Tony Q. S. |
author_sort |
Xu, Chao |
title |
Optimal status update for caching enabled IoT networks: a dueling deep R-network approach |
title_short |
Optimal status update for caching enabled IoT networks: a dueling deep R-network approach |
title_full |
Optimal status update for caching enabled IoT networks: a dueling deep R-network approach |
title_fullStr |
Optimal status update for caching enabled IoT networks: a dueling deep R-network approach |
title_full_unstemmed |
Optimal status update for caching enabled IoT networks: a dueling deep R-network approach |
title_sort |
optimal status update for caching enabled iot networks: a dueling deep r-network approach |
publishDate |
2022 |
url |
https://hdl.handle.net/10356/162972 |
_version_ |
1751548490776838144 |