Minghao Fang, Xijun Wang, Chao Xu, H. Yang, Tony Q. S. Quek
{"title":"基于计算的物联网信息更新","authors":"Minghao Fang, Xijun Wang, Chao Xu, H. Yang, Tony Q. S. Quek","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484521","DOIUrl":null,"url":null,"abstract":"Age of information (AoI), a notion that measures the information freshness, is an important performance metric for real-time applications in Internet of Things (IoT). With the surge of computing resources at the IoT devices, it is possible to preprocess the information packets that contain the status update before sending them to the destination so as to lighten the transmission burden. However, the additional time and energy expenditure induced by computing also make the optimal updating a non-trivial problem. In this paper, we consider a real-time IoT monitoring system, where the computing-aided IoT device is capable of preprocessing the status update. A joint preprocessing and transmission policy is devised to minimize the average AoI at the destination and the energy consumption at the IoT device. Due to the difference in the processing rate and the transmission rate and the difference in the idle duration and the active duration, this problem is formulated as an average cost semi-Markov decision process (SMDP) and then transformed into a discrete-time Markov decision process (MDP). We show that the optimal policy is of threshold type with respect to the AoI. Equipped with this, a low-complexity relative policy iteration algorithm is proposed to obtain the optimal policy of the SMDP. Finally, simulation results demonstrate the optimal policy structure in different cases and show that the proposed policy outperforms two baseline policies.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Computing-aided Update for Information Freshness in the Internet of Things\",\"authors\":\"Minghao Fang, Xijun Wang, Chao Xu, H. Yang, Tony Q. S. Quek\",\"doi\":\"10.1109/INFOCOMWKSHPS51825.2021.9484521\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Age of information (AoI), a notion that measures the information freshness, is an important performance metric for real-time applications in Internet of Things (IoT). With the surge of computing resources at the IoT devices, it is possible to preprocess the information packets that contain the status update before sending them to the destination so as to lighten the transmission burden. However, the additional time and energy expenditure induced by computing also make the optimal updating a non-trivial problem. In this paper, we consider a real-time IoT monitoring system, where the computing-aided IoT device is capable of preprocessing the status update. A joint preprocessing and transmission policy is devised to minimize the average AoI at the destination and the energy consumption at the IoT device. Due to the difference in the processing rate and the transmission rate and the difference in the idle duration and the active duration, this problem is formulated as an average cost semi-Markov decision process (SMDP) and then transformed into a discrete-time Markov decision process (MDP). We show that the optimal policy is of threshold type with respect to the AoI. Equipped with this, a low-complexity relative policy iteration algorithm is proposed to obtain the optimal policy of the SMDP. Finally, simulation results demonstrate the optimal policy structure in different cases and show that the proposed policy outperforms two baseline policies.\",\"PeriodicalId\":109588,\"journal\":{\"name\":\"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484521\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484521","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computing-aided Update for Information Freshness in the Internet of Things
Age of information (AoI), a notion that measures the information freshness, is an important performance metric for real-time applications in Internet of Things (IoT). With the surge of computing resources at the IoT devices, it is possible to preprocess the information packets that contain the status update before sending them to the destination so as to lighten the transmission burden. However, the additional time and energy expenditure induced by computing also make the optimal updating a non-trivial problem. In this paper, we consider a real-time IoT monitoring system, where the computing-aided IoT device is capable of preprocessing the status update. A joint preprocessing and transmission policy is devised to minimize the average AoI at the destination and the energy consumption at the IoT device. Due to the difference in the processing rate and the transmission rate and the difference in the idle duration and the active duration, this problem is formulated as an average cost semi-Markov decision process (SMDP) and then transformed into a discrete-time Markov decision process (MDP). We show that the optimal policy is of threshold type with respect to the AoI. Equipped with this, a low-complexity relative policy iteration algorithm is proposed to obtain the optimal policy of the SMDP. Finally, simulation results demonstrate the optimal policy structure in different cases and show that the proposed policy outperforms two baseline policies.