Online participant selection incorporating coverage quality and participant ability for edge-aided vehicular crowdsensing

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Mengge Li , Miao Ma , Liang Wang , Bo Yang
{"title":"Online participant selection incorporating coverage quality and participant ability for edge-aided vehicular crowdsensing","authors":"Mengge Li ,&nbsp;Miao Ma ,&nbsp;Liang Wang ,&nbsp;Bo Yang","doi":"10.1016/j.comnet.2025.111265","DOIUrl":null,"url":null,"abstract":"<div><div>Recently, the edge-aided vehicular crowdsensing (EAVC) system has become a promising data collection mode, which utilizes vehicles to collect sensing data under the guidance of edge servers. Participant selection is a fundamental problem in vehicular crowdsensing. The available relevant schemes are unsuitable for newly arrived participants, ignore the differentiated sensing requirements of different areas, and underestimate heterogeneity among participants, which seriously damages the service quality. To handle these problems, this paper proposes an improved reinforcement learning-based online participant selection scheme incorporating coverage quality and participant ability (PSCQA) in EAVC. Coverage quality considering different spatiotemporal partitions is formulated based on the entropy theory to measure coverage uniformity of all areas and the coverage degree of the hotspot areas. Participant ability is designed by combining data quality, movement predictability, and priorities of passing areas to comprehensively measure performance differences among participants. In PSCQA, the coverage quality and ability of the selected participants are optimized through two separate value functions. In particular, participants are dynamically grouped into vehicle clusters based on the similarity of their trajectories to solve the state explosion problem that plagues traditional Q-learning. Simulation results on a real-world dataset demonstrate that the proposed PSCQA outperforms other reinforcement learning-based online participant selection schemes and traditional offline participant selection schemes.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"264 ","pages":"Article 111265"},"PeriodicalIF":4.4000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625002336","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, the edge-aided vehicular crowdsensing (EAVC) system has become a promising data collection mode, which utilizes vehicles to collect sensing data under the guidance of edge servers. Participant selection is a fundamental problem in vehicular crowdsensing. The available relevant schemes are unsuitable for newly arrived participants, ignore the differentiated sensing requirements of different areas, and underestimate heterogeneity among participants, which seriously damages the service quality. To handle these problems, this paper proposes an improved reinforcement learning-based online participant selection scheme incorporating coverage quality and participant ability (PSCQA) in EAVC. Coverage quality considering different spatiotemporal partitions is formulated based on the entropy theory to measure coverage uniformity of all areas and the coverage degree of the hotspot areas. Participant ability is designed by combining data quality, movement predictability, and priorities of passing areas to comprehensively measure performance differences among participants. In PSCQA, the coverage quality and ability of the selected participants are optimized through two separate value functions. In particular, participants are dynamically grouped into vehicle clusters based on the similarity of their trajectories to solve the state explosion problem that plagues traditional Q-learning. Simulation results on a real-world dataset demonstrate that the proposed PSCQA outperforms other reinforcement learning-based online participant selection schemes and traditional offline participant selection schemes.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信