Optimizing Task-Specific Timeliness With Edge-Assisted Scheduling for Status Update

Jingzhou Sun;Lehan Wang;Zhaojun Nan;Yuxuan Sun;Sheng Zhou;Zhisheng Niu
{"title":"Optimizing Task-Specific Timeliness With Edge-Assisted Scheduling for Status Update","authors":"Jingzhou Sun;Lehan Wang;Zhaojun Nan;Yuxuan Sun;Sheng Zhou;Zhisheng Niu","doi":"10.1109/JSAIT.2023.3329017","DOIUrl":null,"url":null,"abstract":"Intelligent real-time applications, such as video surveillance, demand intensive computation to extract status information from raw sensing data. This poses a substantial challenge in orchestrating computation and communication resources to provide fresh status information. In this paper, we consider a scenario where multiple energy-constrained devices served by an edge server. To extract status information, each device can either do the computation locally or offload it to the edge server. A scheduling policy is needed to determine when and where to compute for each device, taking into account communication and computation capabilities, as well as task-specific timeliness requirements. To that end, we first model the timeliness requirements as general penalty functions of Age of Information (AoI). A convex optimization problem is formulated to provide a lower bound of the minimum AoI penalty given system parameters. Using KKT conditions, we proposed a novel scheduling policy which evaluates status update priorities based on communication and computation delays and task-specific timeliness requirements. The proposed policy is applied to an object tracking application and carried out on a large video dataset. Simulation results show that our policy improves tracking accuracy compared with scheduling policies based on video content information.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"624-638"},"PeriodicalIF":0.0000,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE journal on selected areas in information theory","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10306279/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Intelligent real-time applications, such as video surveillance, demand intensive computation to extract status information from raw sensing data. This poses a substantial challenge in orchestrating computation and communication resources to provide fresh status information. In this paper, we consider a scenario where multiple energy-constrained devices served by an edge server. To extract status information, each device can either do the computation locally or offload it to the edge server. A scheduling policy is needed to determine when and where to compute for each device, taking into account communication and computation capabilities, as well as task-specific timeliness requirements. To that end, we first model the timeliness requirements as general penalty functions of Age of Information (AoI). A convex optimization problem is formulated to provide a lower bound of the minimum AoI penalty given system parameters. Using KKT conditions, we proposed a novel scheduling policy which evaluates status update priorities based on communication and computation delays and task-specific timeliness requirements. The proposed policy is applied to an object tracking application and carried out on a large video dataset. Simulation results show that our policy improves tracking accuracy compared with scheduling policies based on video content information.
利用边缘辅助状态更新调度优化特定任务的及时性
视频监控等智能实时应用需要进行密集计算,才能从原始传感数据中提取状态信息。这对协调计算和通信资源以提供最新状态信息提出了巨大挑战。在本文中,我们考虑了由边缘服务器为多个能源受限设备提供服务的场景。为了提取状态信息,每个设备既可以在本地进行计算,也可以将计算卸载到边缘服务器。考虑到通信和计算能力以及特定任务的及时性要求,需要一种调度策略来确定每个设备何时何地进行计算。为此,我们首先将及时性要求建模为信息年龄(AoI)的一般惩罚函数。我们提出了一个凸优化问题,以提供给定系统参数的最小 AoI 惩罚下限。利用 KKT 条件,我们提出了一种新的调度策略,该策略根据通信和计算延迟以及特定任务的及时性要求来评估状态更新的优先级。我们将提出的策略应用于物体跟踪应用,并在大型视频数据集上进行了验证。仿真结果表明,与基于视频内容信息的调度策略相比,我们的策略提高了跟踪精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
8.20
自引率
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学术官方微信