无线供电网络边缘AoI最小化充电

Q. Chen, Song Guo, Wenchao Xu, Zhipeng Cai, Lianglun Cheng, Hongyang Gao
{"title":"无线供电网络边缘AoI最小化充电","authors":"Q. Chen, Song Guo, Wenchao Xu, Zhipeng Cai, Lianglun Cheng, Hongyang Gao","doi":"10.1109/ICDCS54860.2022.00074","DOIUrl":null,"url":null,"abstract":"Age of Information (AoI) has emerged as a new metric to measure data freshness from the destination’s perspective. The problem of optimizing AoI has been attracting extensive interests recently. However, existing works mainly focused on scheduling data transmission for AoI optimization. While at wireless-powered network edge, the charging plan of source nodes also requires to be computed in advance, which means the system AoI is determined by not only the data transmission decision but also the charging plan. Thus, in this paper, we investigate the first work to optimize the weighted peak AoI from the point of charging at wireless-powered network edge with a directional charger. Firstly, to minimize the weighted sum of average peak AoI, the AoI minimization problem is transformed to a charging time optimization problem with respect to the overlapped charging areas and average peak AoI, and an approximate algorithm is proposed to obtain the required charging time for each source node. Then, an age-based scheduling algorithm is proposed to compute the charging and data transmission decisions for each source node simultaneously, which can not only optimize the weighted sum of average peak AoI but also guarantee the maximum peak AoI for each source node. The proposed algorithm is proved to have an approximation ratio of up to (1+φ), where φ is a much smaller value related to the weight of each source node. Finally, the simulation results verify the high performance of proposed algorithms in terms of average and maximum peak AoI.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"AoI Minimization Charging at Wireless-Powered Network Edge\",\"authors\":\"Q. Chen, Song Guo, Wenchao Xu, Zhipeng Cai, Lianglun Cheng, Hongyang Gao\",\"doi\":\"10.1109/ICDCS54860.2022.00074\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Age of Information (AoI) has emerged as a new metric to measure data freshness from the destination’s perspective. The problem of optimizing AoI has been attracting extensive interests recently. However, existing works mainly focused on scheduling data transmission for AoI optimization. While at wireless-powered network edge, the charging plan of source nodes also requires to be computed in advance, which means the system AoI is determined by not only the data transmission decision but also the charging plan. Thus, in this paper, we investigate the first work to optimize the weighted peak AoI from the point of charging at wireless-powered network edge with a directional charger. Firstly, to minimize the weighted sum of average peak AoI, the AoI minimization problem is transformed to a charging time optimization problem with respect to the overlapped charging areas and average peak AoI, and an approximate algorithm is proposed to obtain the required charging time for each source node. Then, an age-based scheduling algorithm is proposed to compute the charging and data transmission decisions for each source node simultaneously, which can not only optimize the weighted sum of average peak AoI but also guarantee the maximum peak AoI for each source node. The proposed algorithm is proved to have an approximation ratio of up to (1+φ), where φ is a much smaller value related to the weight of each source node. Finally, the simulation results verify the high performance of proposed algorithms in terms of average and maximum peak AoI.\",\"PeriodicalId\":225883,\"journal\":{\"name\":\"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS54860.2022.00074\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS54860.2022.00074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

信息时代(AoI)已经成为从目的地角度衡量数据新鲜度的新指标。AoI的优化问题近年来引起了人们的广泛关注。然而,现有的工作主要集中在AoI优化的数据传输调度上。而在无线供电的网络边缘,源节点的充电计划也需要提前计算,这意味着系统的AoI不仅取决于数据传输决策,还取决于充电计划。因此,在本文中,我们研究了从无线供电网络边缘使用定向充电器充电点优化加权峰值AoI的第一项工作。首先,为了使平均峰值AoI的加权和最小,将AoI最小化问题转化为关于重叠充电区域和平均峰值AoI的充电时间优化问题,并提出了一种近似算法来获得每个源节点所需的充电时间;然后,提出了一种基于年龄的调度算法,同时计算各源节点的充电和数据传输决策,既能优化平均峰值AoI的加权和,又能保证各源节点的峰值AoI最大。该算法被证明具有高达(1+φ)的近似比,其中φ是与每个源节点的权重相关的小得多的值。最后,仿真结果验证了所提算法在平均和最大峰值AoI方面的高性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
AoI Minimization Charging at Wireless-Powered Network Edge
Age of Information (AoI) has emerged as a new metric to measure data freshness from the destination’s perspective. The problem of optimizing AoI has been attracting extensive interests recently. However, existing works mainly focused on scheduling data transmission for AoI optimization. While at wireless-powered network edge, the charging plan of source nodes also requires to be computed in advance, which means the system AoI is determined by not only the data transmission decision but also the charging plan. Thus, in this paper, we investigate the first work to optimize the weighted peak AoI from the point of charging at wireless-powered network edge with a directional charger. Firstly, to minimize the weighted sum of average peak AoI, the AoI minimization problem is transformed to a charging time optimization problem with respect to the overlapped charging areas and average peak AoI, and an approximate algorithm is proposed to obtain the required charging time for each source node. Then, an age-based scheduling algorithm is proposed to compute the charging and data transmission decisions for each source node simultaneously, which can not only optimize the weighted sum of average peak AoI but also guarantee the maximum peak AoI for each source node. The proposed algorithm is proved to have an approximation ratio of up to (1+φ), where φ is a much smaller value related to the weight of each source node. Finally, the simulation results verify the high performance of proposed algorithms in terms of average and maximum peak AoI.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信