Joint Resource Optimization for Secure Cooperative Perception in Vehicular Networks

IF 6.6 1区 计算机科学 Q1 Multidisciplinary
Ya Kang;Qingyang Song;Jing Song;Lei Guo;Abbas Jamalipour
{"title":"Joint Resource Optimization for Secure Cooperative Perception in Vehicular Networks","authors":"Ya Kang;Qingyang Song;Jing Song;Lei Guo;Abbas Jamalipour","doi":"10.26599/TST.2024.9010068","DOIUrl":null,"url":null,"abstract":"In the realm of autonomous driving, cooperative perception serves as a crucial technology for mitigating the inherent constraints of individual vehicle's perception. To enable cooperative perception, vehicle-to-vehicle (V2V) communication plays an indispensable role. Unfortunately, owing to weak virus protection in V2V networks, the emergence and widespread adoption of V2V communications have also created fertile soil for the breeding and rapid spreading of worms. To stimulate vehicles to participate in cooperative perception while blocking the spreading of worms through V2V communications, we design an incentive mechanism, in which the utility of each sensory data requester and that of each sensory data provider are defined, respectively, to maximize the total utility of all the vehicles. To deal with the highly non-convex problem, we propose a pairing and resource allocation (PRA) scheme based on the Stackelberg game theory. Specifically, we decompose the problem into two subproblems. The subproblem of maximizing the utility of the requester is solved via a two-stage iterative algorithm, while the subproblem of maximizing the utility of the provider is addressed using the linear search method. The results demonstrate that our proposed PRA approach addresses the challenges of cooperative perception and worm spreading while efficiently converging to the Stackelberg equilibrium point, jointly maximizing the utilities for both the requester and the provider.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 3","pages":"1044-1059"},"PeriodicalIF":6.6000,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10817771","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10817771/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Multidisciplinary","Score":null,"Total":0}
引用次数: 0

Abstract

In the realm of autonomous driving, cooperative perception serves as a crucial technology for mitigating the inherent constraints of individual vehicle's perception. To enable cooperative perception, vehicle-to-vehicle (V2V) communication plays an indispensable role. Unfortunately, owing to weak virus protection in V2V networks, the emergence and widespread adoption of V2V communications have also created fertile soil for the breeding and rapid spreading of worms. To stimulate vehicles to participate in cooperative perception while blocking the spreading of worms through V2V communications, we design an incentive mechanism, in which the utility of each sensory data requester and that of each sensory data provider are defined, respectively, to maximize the total utility of all the vehicles. To deal with the highly non-convex problem, we propose a pairing and resource allocation (PRA) scheme based on the Stackelberg game theory. Specifically, we decompose the problem into two subproblems. The subproblem of maximizing the utility of the requester is solved via a two-stage iterative algorithm, while the subproblem of maximizing the utility of the provider is addressed using the linear search method. The results demonstrate that our proposed PRA approach addresses the challenges of cooperative perception and worm spreading while efficiently converging to the Stackelberg equilibrium point, jointly maximizing the utilities for both the requester and the provider.
面向车辆网络安全协同感知的联合资源优化
在自动驾驶领域,协作感知是缓解单个车辆感知固有约束的关键技术。为了实现协同感知,车对车(V2V)通信起着不可或缺的作用。不幸的是,由于V2V网络的病毒防护能力较弱,V2V通信的出现和广泛采用也为蠕虫的滋生和迅速传播创造了肥沃的土壤。为了刺激车辆参与合作感知,同时通过V2V通信阻止蠕虫的传播,我们设计了一种激励机制,该机制分别定义每个感官数据请求者的效用和每个感官数据提供者的效用,以最大化所有车辆的总效用。为了解决高度非凸问题,我们提出了一种基于Stackelberg博弈论的配对和资源分配(PRA)方案。具体来说,我们将问题分解为两个子问题。通过两阶段迭代算法解决请求方效用最大化子问题,采用线性搜索方法解决提供方效用最大化子问题。结果表明,我们提出的PRA方法解决了合作感知和蠕虫传播的挑战,同时有效地收敛到Stackelberg平衡点,共同最大化了请求方和提供方的效用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Tsinghua Science and Technology
Tsinghua Science and Technology COMPUTER SCIENCE, INFORMATION SYSTEMSCOMPU-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
10.20
自引率
10.60%
发文量
2340
期刊介绍: Tsinghua Science and Technology (Tsinghua Sci Technol) started publication in 1996. It is an international academic journal sponsored by Tsinghua University and is published bimonthly. This journal aims at presenting the up-to-date scientific achievements in computer science, electronic engineering, and other IT fields. Contributions all over the world are welcome.
×
引用
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学术官方微信