Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorXu, Chaoen_US
dc.contributor.authorXie, Yipingen_US
dc.contributor.authorWang, Xijunen_US
dc.contributor.authorYang, Howard H.en_US
dc.contributor.authorNiyato, Dusiten_US
dc.contributor.authorQuek, Tony Q. S.en_US
dc.identifier.citationXu, 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.
dc.description.abstractIn 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.en_US
dc.description.sponsorshipMinistry of Education (MOE)en_US
dc.description.sponsorshipNational Research Foundation (NRF)en_US
dc.relation.ispartofIEEE Transactions on Wireless Communicationsen_US
dc.rights© 2021 IEEE. All rights reserved.en_US
dc.subjectEngineering::Computer science and engineeringen_US
dc.titleOptimal status update for caching enabled IoT networks: a dueling deep R-network approachen_US
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Science and Engineeringen_US
dc.subject.keywordsInternet of Thingsen_US
dc.subject.keywordsInternet of Thingsen_US
dc.description.acknowledgementThis 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.en_US
item.fulltextNo Fulltext-
Appears in Collections:SCSE Journal Articles

Citations 20

Updated on Jan 31, 2023

Web of ScienceTM
Citations 50

Updated on Feb 1, 2023

Page view(s)

Updated on Feb 7, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.