通过深度强化学习实现联合感知和通信的激励机制 车载人群感知

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Gaoyu Luo , Shanhao Zhan , Chenyi Liang , Zhibin Gao , Yifeng Zhao , Lianfen Huang
{"title":"通过深度强化学习实现联合感知和通信的激励机制 车载人群感知","authors":"Gaoyu Luo ,&nbsp;Shanhao Zhan ,&nbsp;Chenyi Liang ,&nbsp;Zhibin Gao ,&nbsp;Yifeng Zhao ,&nbsp;Lianfen Huang","doi":"10.1016/j.comnet.2025.111099","DOIUrl":null,"url":null,"abstract":"<div><div>Vehicular Crowdsensing (VCS) is a pivotal component in advancing Intelligent Transportation Systems (ITS), facilitating the collection and synthesis of extensive data from distributed vehicular networks. Despite its potential, optimizing participation and data acquisition in VCS is challenged by the self-interested nature of individual participants. In this paper, we propose a novel incentive mechanism for VCS, specifically designed to integrate social benefits within a Vehicle Social Network (VSN). A Small-World (SW) network is introduced to model the VSN, providing a more realistic representation of vehicle interactions and enhancing information propagation. VSN enriches the data utility by sharing data within these networks and acts as a non-monetary incentive that is determined by the strength of connections among participants within the constructed SW networks, sustaining participant engagement even with relatively low monetary rewards. We model the VCS campaign as a Markov Decision Process (MDP) that enables vehicles to independently determine their optimal sensing and communication strategies under the SW networks clustering coefficient <span><math><mi>K</mi></math></span> and the rewiring probability <span><math><mi>p</mi></math></span>. To maximize individual utility under incomplete information, we introduce a multi-agent Deep Reinforcement Learning (DRL) approach called IM-SJSC that utilizes Variational Autoencoder (VAE) and Proximal Policy Optimization (PPO) for accurate decision-making processes. Simulation results in the T-Drive real-world dataset validate the efficacy of the proposed approach, showing that the average utility outperforms other baseline algorithms by 25.00%, 54.07%, 145.25%, and 181.82% under varying numbers of vehicles. The proposed algorithm also achieves significant performance improvements in other scenarios, such as different numbers of tasks and varying task basic prices.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111099"},"PeriodicalIF":4.4000,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An incentive mechanism for joint sensing and communication Vehicular Crowdsensing by Deep Reinforcement Learning\",\"authors\":\"Gaoyu Luo ,&nbsp;Shanhao Zhan ,&nbsp;Chenyi Liang ,&nbsp;Zhibin Gao ,&nbsp;Yifeng Zhao ,&nbsp;Lianfen Huang\",\"doi\":\"10.1016/j.comnet.2025.111099\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Vehicular Crowdsensing (VCS) is a pivotal component in advancing Intelligent Transportation Systems (ITS), facilitating the collection and synthesis of extensive data from distributed vehicular networks. Despite its potential, optimizing participation and data acquisition in VCS is challenged by the self-interested nature of individual participants. In this paper, we propose a novel incentive mechanism for VCS, specifically designed to integrate social benefits within a Vehicle Social Network (VSN). A Small-World (SW) network is introduced to model the VSN, providing a more realistic representation of vehicle interactions and enhancing information propagation. VSN enriches the data utility by sharing data within these networks and acts as a non-monetary incentive that is determined by the strength of connections among participants within the constructed SW networks, sustaining participant engagement even with relatively low monetary rewards. We model the VCS campaign as a Markov Decision Process (MDP) that enables vehicles to independently determine their optimal sensing and communication strategies under the SW networks clustering coefficient <span><math><mi>K</mi></math></span> and the rewiring probability <span><math><mi>p</mi></math></span>. To maximize individual utility under incomplete information, we introduce a multi-agent Deep Reinforcement Learning (DRL) approach called IM-SJSC that utilizes Variational Autoencoder (VAE) and Proximal Policy Optimization (PPO) for accurate decision-making processes. Simulation results in the T-Drive real-world dataset validate the efficacy of the proposed approach, showing that the average utility outperforms other baseline algorithms by 25.00%, 54.07%, 145.25%, and 181.82% under varying numbers of vehicles. The proposed algorithm also achieves significant performance improvements in other scenarios, such as different numbers of tasks and varying task basic prices.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"260 \",\"pages\":\"Article 111099\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2025-02-10\",\"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/S1389128625000672\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625000672","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

本文章由计算机程序翻译,如有差异,请以英文原文为准。
An incentive mechanism for joint sensing and communication Vehicular Crowdsensing by Deep Reinforcement Learning
Vehicular Crowdsensing (VCS) is a pivotal component in advancing Intelligent Transportation Systems (ITS), facilitating the collection and synthesis of extensive data from distributed vehicular networks. Despite its potential, optimizing participation and data acquisition in VCS is challenged by the self-interested nature of individual participants. In this paper, we propose a novel incentive mechanism for VCS, specifically designed to integrate social benefits within a Vehicle Social Network (VSN). A Small-World (SW) network is introduced to model the VSN, providing a more realistic representation of vehicle interactions and enhancing information propagation. VSN enriches the data utility by sharing data within these networks and acts as a non-monetary incentive that is determined by the strength of connections among participants within the constructed SW networks, sustaining participant engagement even with relatively low monetary rewards. We model the VCS campaign as a Markov Decision Process (MDP) that enables vehicles to independently determine their optimal sensing and communication strategies under the SW networks clustering coefficient K and the rewiring probability p. To maximize individual utility under incomplete information, we introduce a multi-agent Deep Reinforcement Learning (DRL) approach called IM-SJSC that utilizes Variational Autoencoder (VAE) and Proximal Policy Optimization (PPO) for accurate decision-making processes. Simulation results in the T-Drive real-world dataset validate the efficacy of the proposed approach, showing that the average utility outperforms other baseline algorithms by 25.00%, 54.07%, 145.25%, and 181.82% under varying numbers of vehicles. The proposed algorithm also achieves significant performance improvements in other scenarios, such as different numbers of tasks and varying task basic prices.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信