REVIEW
Performance of Cooperative Detection in Joint Communication-Sensing Vehicular Network: A Data Analytic and Stochastic Geometry Approach
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Performance of Cooperative Detection in Joint Communication-Sensing Vehicular Network: A Data Analytic and Stochastic Geometry Approach
read the original abstract
The increasing complexity of urban environments introduces additional uncertainty to the deployment of the autonomous vehicular network. A novel road infrastructure cooperative detection model using Joint Communication and Sensing (JCS) technology is proposed in this article to simultaneously achieve high-efficient communication and obstacle detection for urban autonomous vehicles. To suppress the performance fluctuation caused by shadowing and obstruction to the JCS signals, we first derive the statistic of road obstacles from the Geographic Information System (GIS). Then, the analysis of JCS channel characteristics and shadowing factors are presented using Line-of-Sight and Non-Line-of-Sight (LoS and NLoS) channel models under the complex urban scenario. A stochastic geometry approach is applied to analyze the interference factors and the probability distribution of successful JCS detection and communication. Simulations have been made to verify the cooperative detection model by probability analysis based on LoS and NLoS channels, and the numerical results demonstrate several different optimization methods for the deployment of JCS road infrastructures. Finally, we simulated and analyzed a deployment optimization method for JCS road infrastructures that complied with the standard of urban traffic-spot structure placement.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.