Incentive mechanisms for non-proprietary vehicles in vehicular crowdsensing with budget constraints

IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Computer Communications Pub Date : 2025-02-14 DOI:10.1016/j.comcom.2025.108083
Zhirui Feng, Yantao Yu, Guojin Liu, Yang Jiang, TianCong Huang
{"title":"Incentive mechanisms for non-proprietary vehicles in vehicular crowdsensing with budget constraints","authors":"Zhirui Feng,&nbsp;Yantao Yu,&nbsp;Guojin Liu,&nbsp;Yang Jiang,&nbsp;TianCong Huang","doi":"10.1016/j.comcom.2025.108083","DOIUrl":null,"url":null,"abstract":"<div><div>Vehicular crowdsensing (VCS) utilizes the onboard sensors and computational capabilities of smart vehicles to collect data across diverse regions. Non-dedicated vehicles, due to their lower cost and broad distribution, have emerged as a central focus in VCS research. However, their trajectories are often concentrated in urban areas, resulting in uneven data coverage. Existing incentive mechanisms primarily rely on platforms to dynamically adjust task allocation based on vehicle trajectory predictions. Yet, they frequently neglect the influence of geographic locations on vehicle routing choices and fail to incentivize proactive route planning. To address this, we propose a novel two-phase incentive mechanism that, for the first time, incorporates a <em><strong>willingness to traverse</strong></em> factor. This mechanism aims to maximize spatial coverage within a limited budget by encouraging vehicles to voluntarily traverse remote areas to complete tasks. In the initial phase, a multi-agent deep reinforcement learning algorithm dynamically adjusts each vehicle’s route and quote price, which is then reported to the platform. In the second phase, the platform allocates tasks and adjusts compensation based on the provided routes and quotes to optimize overall platform benefits. Experimental results show that our mechanism effectively balances platform and vehicle benefits, achieving optimal outcomes even under budget constraints.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"235 ","pages":"Article 108083"},"PeriodicalIF":4.5000,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366425000404","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Vehicular crowdsensing (VCS) utilizes the onboard sensors and computational capabilities of smart vehicles to collect data across diverse regions. Non-dedicated vehicles, due to their lower cost and broad distribution, have emerged as a central focus in VCS research. However, their trajectories are often concentrated in urban areas, resulting in uneven data coverage. Existing incentive mechanisms primarily rely on platforms to dynamically adjust task allocation based on vehicle trajectory predictions. Yet, they frequently neglect the influence of geographic locations on vehicle routing choices and fail to incentivize proactive route planning. To address this, we propose a novel two-phase incentive mechanism that, for the first time, incorporates a willingness to traverse factor. This mechanism aims to maximize spatial coverage within a limited budget by encouraging vehicles to voluntarily traverse remote areas to complete tasks. In the initial phase, a multi-agent deep reinforcement learning algorithm dynamically adjusts each vehicle’s route and quote price, which is then reported to the platform. In the second phase, the platform allocates tasks and adjusts compensation based on the provided routes and quotes to optimize overall platform benefits. Experimental results show that our mechanism effectively balances platform and vehicle benefits, achieving optimal outcomes even under budget constraints.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
有预算限制的车辆众包中的非专有车辆激励机制
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Communications
Computer Communications 工程技术-电信学
CiteScore
14.10
自引率
5.00%
发文量
397
审稿时长
66 days
期刊介绍: Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms. Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.
期刊最新文献
Secrecy performance optimization for UAV-based relay NOMA systems with friendly jamming DFFL: A dual fairness framework for federated learning Incentive mechanisms for non-proprietary vehicles in vehicular crowdsensing with budget constraints Cloud-edge-end integrated Artificial intelligence based on ensemble learning Load-balanced multi-user mobility-aware task offloading in multi-access edge computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1