清晨好,您是今天最早来到科研通的研友!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您科研之路漫漫前行!

Average AoI Minimization With Directional Charging for Wireless-Powered Network Edge

计算机科学 调度(生产过程) 无线传感器网络 缩小 地铁列车时刻表 无线 有界函数 计算 区间(图论) 实时计算 算法 数学优化 计算机网络 数学 电信 操作系统 组合数学 数学分析 程序设计语言
作者
Quan Chen,Song Guo,Wenchao Xu,Jing Li,Tuo Shi,Hong Gao,Zhipeng Cai
出处
期刊:IEEE Transactions on Mobile Computing [IEEE Computer Society]
卷期号:: 1-17 被引量:2
标识
DOI:10.1109/tmc.2025.3527559
摘要

Age of Information (AoI) has been proposed as a new performance metric to capture the freshness of data. At wireless-powered network edge, the source nodes first need to be charged ready for update transmissions, which means the system AoI is not only decided by the scheduling of update transmissions but also by the designing of charging plan. However, the existing works either only focused on the point of scheduling update transmissions or have a rigid assumption that only one source node can be charged per time. Aiming at making the work more practical and general, we investigate the average AoI optimization problem at wireless-powered network edge with directional charging. Firstly, the theoretical bound of the weighted sum of average AoI of the entire network with a directional charger is analyzed, which is proved to be related to nodes' maximum transmitting interval and the charging strategy. An optimal charging time computation algorithm is proposed to obtain the maximum transmitting interval of each source node by considering the overlapped areas of different charging orientations. After then, an AoI-aware periodical charging scheduling algorithm is proposed to compute a periodical charging schedule while the average AoI is bounded, including a charging period $T$ and the charging orientations assigned to each time slot within $T$. The proposed algorithm is proved to have an approximation ratio of up to 1.5625. Furthermore, several approximate algorithms are also proposed for average AoI optimization with multiple chargers and network bandwidth constraint. Finally, the extensive simulations demonstrate the high performance of the proposed algorithm in terms of AoI.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
痴情的又亦完成签到,获得积分10
1秒前
1秒前
Tsitsipas应助ling361采纳,获得10
4秒前
小蘑菇应助连爱琴采纳,获得10
6秒前
8秒前
单纯水桃完成签到,获得积分10
17秒前
直率的大门完成签到,获得积分10
29秒前
30秒前
可靠的公爵熊完成签到,获得积分10
36秒前
40秒前
房天川完成签到 ,获得积分10
44秒前
48秒前
54秒前
Tsitsipas应助ping采纳,获得10
1分钟前
柔弱藏花完成签到,获得积分10
1分钟前
美满的幻波完成签到,获得积分10
1分钟前
1分钟前
Tsitsipas应助ling361采纳,获得10
1分钟前
超帅的若剑完成签到,获得积分10
1分钟前
雪山飞龙发布了新的文献求助10
1分钟前
1分钟前
2分钟前
威武的又琴完成签到,获得积分10
2分钟前
雪山飞龙发布了新的文献求助10
2分钟前
2分钟前
失眠的保温杯完成签到,获得积分10
2分钟前
科研通AI6.4应助苗天采纳,获得10
2分钟前
2分钟前
英俊的鞅完成签到,获得积分10
2分钟前
2分钟前
2分钟前
复杂曼荷完成签到,获得积分10
2分钟前
苗天发布了新的文献求助10
3分钟前
按时毕业的小王完成签到,获得积分10
3分钟前
JUN完成签到,获得积分10
3分钟前
瞿人雄完成签到,获得积分10
3分钟前
GingerF应助draguide采纳,获得50
3分钟前
没心没肺完成签到,获得积分10
3分钟前
烂漫的慕卉完成签到,获得积分10
3分钟前
沉静问芙完成签到,获得积分10
3分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Nine new races of Peronospora manshurica found on soybeans in the Midwest 1000
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 600
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Eudora Welty and Modern Media 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7772500
求助须知:如何正确求助?哪些是违规求助? 9314784
关于积分的说明 20339928
捐赠科研通 7357908
什么是DOI,文献DOI怎么找? 3316947
关于科研通互助平台的介绍 2465486
邀请新用户注册赠送积分活动 2331956