Virtual Node-Driven Cloud-Edge Collaborative Resource Scheduling for Surveillance with Visual Sensors.

IF 3.5 3区 综合性期刊 Q2 CHEMISTRY, ANALYTICAL Sensors Pub Date : 2025-01-17 DOI:10.3390/s25020535
Xinyang Gu, Zhansheng Duan, Guangyuan Ye, Zhenjun Chang
{"title":"Virtual Node-Driven Cloud-Edge Collaborative Resource Scheduling for Surveillance with Visual Sensors.","authors":"Xinyang Gu, Zhansheng Duan, Guangyuan Ye, Zhenjun Chang","doi":"10.3390/s25020535","DOIUrl":null,"url":null,"abstract":"<p><p>For public security purposes, distributed surveillance systems are widely deployed in key areas. These systems comprise visual sensors, edge computing boxes, and cloud servers. Resource scheduling algorithms are critical to ensure such systems' robustness and efficiency. They balance workloads and need to meet real-time monitoring and emergency response requirements. Existing works have primarily focused on optimizing Quality of Service (QoS), latency, and energy consumption in edge computing under resource constraints. However, the issue of task congestion due to insufficient physical resources has been rarely investigated. In this paper, we tackle the challenges posed by large workloads and limited resources in the context of surveillance with visual sensors. First, we introduce the concept of virtual nodes for managing resource shortages, referred to as virtual node-driven resource scheduling. Then, we propose a convex-objective integer linear programming (ILP) model based on this concept and demonstrate its efficiency. Additionally, we propose three alternative virtual node-driven scheduling algorithms, the extension of a random algorithm, a genetic algorithm, and a heuristic algorithm, respectively. These algorithms serve as benchmarks for comparison with the proposed ILP model. Experimental results show that all the scheduling algorithms can effectively address the challenge of offloading multiple priority tasks under resource constraints. Furthermore, the ILP model shows the best scheduling performance among them.</p>","PeriodicalId":21698,"journal":{"name":"Sensors","volume":"25 2","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11768989/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sensors","FirstCategoryId":"103","ListUrlMain":"https://doi.org/10.3390/s25020535","RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, ANALYTICAL","Score":null,"Total":0}
引用次数: 0

Abstract

For public security purposes, distributed surveillance systems are widely deployed in key areas. These systems comprise visual sensors, edge computing boxes, and cloud servers. Resource scheduling algorithms are critical to ensure such systems' robustness and efficiency. They balance workloads and need to meet real-time monitoring and emergency response requirements. Existing works have primarily focused on optimizing Quality of Service (QoS), latency, and energy consumption in edge computing under resource constraints. However, the issue of task congestion due to insufficient physical resources has been rarely investigated. In this paper, we tackle the challenges posed by large workloads and limited resources in the context of surveillance with visual sensors. First, we introduce the concept of virtual nodes for managing resource shortages, referred to as virtual node-driven resource scheduling. Then, we propose a convex-objective integer linear programming (ILP) model based on this concept and demonstrate its efficiency. Additionally, we propose three alternative virtual node-driven scheduling algorithms, the extension of a random algorithm, a genetic algorithm, and a heuristic algorithm, respectively. These algorithms serve as benchmarks for comparison with the proposed ILP model. Experimental results show that all the scheduling algorithms can effectively address the challenge of offloading multiple priority tasks under resource constraints. Furthermore, the ILP model shows the best scheduling performance among them.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于视觉传感器监控的虚拟节点驱动云边缘协同资源调度。
出于公共安全目的,分布式监控系统被广泛部署在关键区域。这些系统包括视觉传感器、边缘计算盒和云服务器。资源调度算法是保证系统鲁棒性和高效性的关键。它们平衡工作负载,需要满足实时监测和应急响应要求。现有的工作主要集中在资源约束下优化边缘计算的服务质量(QoS)、延迟和能耗。然而,由于物理资源不足导致的任务拥塞问题很少被研究。在本文中,我们解决了在视觉传感器监控的背景下,大工作量和有限资源所带来的挑战。首先,我们引入用于管理资源短缺的虚拟节点的概念,称为虚拟节点驱动的资源调度。在此基础上提出了凸目标整数线性规划(ILP)模型,并验证了其有效性。此外,我们还提出了三种虚拟节点驱动调度算法,分别是随机算法的扩展、遗传算法和启发式算法。这些算法可作为与所提出的ILP模型进行比较的基准。实验结果表明,所有调度算法都能有效地解决资源约束下的多优先级任务卸载问题。其中,ILP模型的调度性能最好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Sensors
Sensors 工程技术-电化学
CiteScore
7.30
自引率
12.80%
发文量
8430
审稿时长
1.7 months
期刊介绍: Sensors (ISSN 1424-8220) provides an advanced forum for the science and technology of sensors and biosensors. It publishes reviews (including comprehensive reviews on the complete sensors products), regular research papers and short notes. Our aim is to encourage scientists to publish their experimental and theoretical results in as much detail as possible. There is no restriction on the length of the papers. The full experimental details must be provided so that the results can be reproduced.
期刊最新文献
Explicit Features Versus Implicit Spatial Relations in Geomorphometry: A Comparative Analysis for DEM Error Correction in Complex Geomorphological Regions. Multipath Credibility Selection for Robust UWB Angle-of-Arrival Estimation in Narrow Underground Corridors. Multimodal Shared Autonomy for Heavy-Load UAV Operations with Physics-Aware Cooperative Control. An Unscented Kalman Filter Based on the Adams-Bashforth Method with Applications to the State Estimation of Osprey-Type Drones Composed of Tiltable Rotor Mechanisms. Multi-Sensor Measurement of Cylindrical Illuminance.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1