基于用户意愿感知的云端协同众测系统任务分配

IF 4.8 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Junru Hei, Lin Cong, Huansheng Xue, Yongji Sun, Haozhou Liu, Honglong Chen
{"title":"基于用户意愿感知的云端协同众测系统任务分配","authors":"Junru Hei,&nbsp;Lin Cong,&nbsp;Huansheng Xue,&nbsp;Yongji Sun,&nbsp;Haozhou Liu,&nbsp;Honglong Chen","doi":"10.1016/j.adhoc.2025.104028","DOIUrl":null,"url":null,"abstract":"<div><div>Cloud–Edge–Terminal Collaborative Crowdsensing (CETCS) has emerged as a novel research paradigm in the field of Mobile Crowdsensing (MCS). By leveraging edge servers for task computation, CETCS effectively mitigates communication delays and request congestion caused by the increasing scale of sensing tasks and growing data complexity. However, in real-world deployments, edge servers are characterized by resource and service heterogeneity. The Heterogeneous Edge Servers based Task Allocation (HESTA) problem has been formally formulated and proven to be NP-hard. Previous studies have largely overlooked two critical aspects: users’ willingness to execute tasks and the complexity involved in task offloading decisions. To address these limitations, we propose a unified framework that integrates Willingness-Aware Repair with a Probability Genetic Algorithm and Proximal Policy Optimization with the Dynamically Masked Action Space to jointly optimize task allocation, offloading, and computation during the task execution process. Our work differs from previous works in the following aspects: (1) We develop a comprehensive optimization framework that explicitly incorporates user willingness into the task allocation process to maximize overall platform utility; (2) We systematically categorize potential scenarios arising during task offloading and design corresponding utility functions to guide decision-making; (3) We propose a novel task offloading and computation selection algorithm aimed at maximizing the average remaining time of all tasks, thereby enhancing system responsiveness and efficiency. The extensive simulations are conducted on both synthetic and real-world datasets to demonstrate the effectiveness and superiority of the proposed approach.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"179 ","pages":"Article 104028"},"PeriodicalIF":4.8000,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"User willingness aware task allocation for cloud–edge–terminal collaborative crowdsensing system\",\"authors\":\"Junru Hei,&nbsp;Lin Cong,&nbsp;Huansheng Xue,&nbsp;Yongji Sun,&nbsp;Haozhou Liu,&nbsp;Honglong Chen\",\"doi\":\"10.1016/j.adhoc.2025.104028\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Cloud–Edge–Terminal Collaborative Crowdsensing (CETCS) has emerged as a novel research paradigm in the field of Mobile Crowdsensing (MCS). By leveraging edge servers for task computation, CETCS effectively mitigates communication delays and request congestion caused by the increasing scale of sensing tasks and growing data complexity. However, in real-world deployments, edge servers are characterized by resource and service heterogeneity. The Heterogeneous Edge Servers based Task Allocation (HESTA) problem has been formally formulated and proven to be NP-hard. Previous studies have largely overlooked two critical aspects: users’ willingness to execute tasks and the complexity involved in task offloading decisions. To address these limitations, we propose a unified framework that integrates Willingness-Aware Repair with a Probability Genetic Algorithm and Proximal Policy Optimization with the Dynamically Masked Action Space to jointly optimize task allocation, offloading, and computation during the task execution process. Our work differs from previous works in the following aspects: (1) We develop a comprehensive optimization framework that explicitly incorporates user willingness into the task allocation process to maximize overall platform utility; (2) We systematically categorize potential scenarios arising during task offloading and design corresponding utility functions to guide decision-making; (3) We propose a novel task offloading and computation selection algorithm aimed at maximizing the average remaining time of all tasks, thereby enhancing system responsiveness and efficiency. The extensive simulations are conducted on both synthetic and real-world datasets to demonstrate the effectiveness and superiority of the proposed approach.</div></div>\",\"PeriodicalId\":55555,\"journal\":{\"name\":\"Ad Hoc Networks\",\"volume\":\"179 \",\"pages\":\"Article 104028\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2025-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ad Hoc Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1570870525002768\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870525002768","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

云-边缘-终端协同众测(CETCS)是移动众测(MCS)领域的一种新的研究范式。通过利用边缘服务器进行任务计算,CETCS有效地缓解了由于感知任务规模的增加和数据复杂性的增加而导致的通信延迟和请求拥塞。然而,在实际部署中,边缘服务器的特点是资源和服务的异构性。基于异构边缘服务器的任务分配(HESTA)问题已被正式提出并证明是np困难问题。之前的研究在很大程度上忽略了两个关键方面:用户执行任务的意愿和任务卸载决策所涉及的复杂性。为了解决这些限制,我们提出了一个统一的框架,该框架将意愿感知修复与概率遗传算法和近端策略优化与动态掩蔽动作空间相结合,以共同优化任务执行过程中的任务分配,卸载和计算。我们的工作与以往的工作有以下几个方面的不同:(1)我们开发了一个全面的优化框架,明确地将用户意愿纳入任务分配过程,以最大化整体平台效用;(2)系统分类任务卸载过程中可能出现的情景,设计相应的效用函数,指导决策;(3)提出了一种新的任务卸载和计算选择算法,旨在最大化所有任务的平均剩余时间,从而提高系统的响应能力和效率。在合成数据集和真实数据集上进行了大量的仿真,以证明所提出方法的有效性和优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
User willingness aware task allocation for cloud–edge–terminal collaborative crowdsensing system
Cloud–Edge–Terminal Collaborative Crowdsensing (CETCS) has emerged as a novel research paradigm in the field of Mobile Crowdsensing (MCS). By leveraging edge servers for task computation, CETCS effectively mitigates communication delays and request congestion caused by the increasing scale of sensing tasks and growing data complexity. However, in real-world deployments, edge servers are characterized by resource and service heterogeneity. The Heterogeneous Edge Servers based Task Allocation (HESTA) problem has been formally formulated and proven to be NP-hard. Previous studies have largely overlooked two critical aspects: users’ willingness to execute tasks and the complexity involved in task offloading decisions. To address these limitations, we propose a unified framework that integrates Willingness-Aware Repair with a Probability Genetic Algorithm and Proximal Policy Optimization with the Dynamically Masked Action Space to jointly optimize task allocation, offloading, and computation during the task execution process. Our work differs from previous works in the following aspects: (1) We develop a comprehensive optimization framework that explicitly incorporates user willingness into the task allocation process to maximize overall platform utility; (2) We systematically categorize potential scenarios arising during task offloading and design corresponding utility functions to guide decision-making; (3) We propose a novel task offloading and computation selection algorithm aimed at maximizing the average remaining time of all tasks, thereby enhancing system responsiveness and efficiency. The extensive simulations are conducted on both synthetic and real-world datasets to demonstrate the effectiveness and superiority of the proposed approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信