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.
期刊介绍:
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.