ITSC 2024 Paper Abstract

Close

Paper WeAT11.6

Lobo, Silas (Technische Hochschule Ingolstadt), Festag, Andreas (Technische Hochschule Ingolstadt), Facchi, Christian (Technische Hochschule Ingolstadt)

Adaptive Message Prioritization: How to Prioritize VRU Awareness Messages in a Congested V2X Network

Scheduled for presentation during the Regular Session "Communications and Protocols in ITS" (WeAT11), Wednesday, September 25, 2024, 12:10−12:30, Salon 19/20

2024 IEEE 27th International Conference on Intelligent Transportation Systems (ITSC), September 24- 27, 2024, Edmonton, Canada

This information is tentative and subject to change. Compiled on October 3, 2024

Keywords Communications and Protocols in ITS, Simulation and Modeling, Modeling, Simulation, and Control of Pedestrians and Cyclists

Abstract

The safety of Vulnerable Road Users (VRUs) can be enhanced through the utilization of Vehicle-to-Everything (V2X) communication, enabling the exchange of the VRUs' position and kinematic data. In the European V2X system, the dissemination relies on a dedicated message type, the VRU Awareness Message (VAM), which integrates VRUs into the V2X network as active transceivers. However, in the long term, the high number of V2X nodes transmitting messages poses challenges in the wireless resource allocation, which may result in safety-critical situations. To mitigate this issue, the current standardization of VRU awareness services in Europe, considers clustering VRUs with similar kinematic pattern. Nevertheless, the VRU process for joining a cluster may encounter errors, resulting in high channel load due to multiple requests. In this paper, an adaptive message prioritization is proposed to reduce this impact. This method is triggered only under heavy network load and takes into account the number of potential V2X senders. Via simulations based on a crossing scenario, improvements in network performance are observed, as well as an increase in VRU awareness measured by vehicles, i.e. more VRUs being detected.

 

 

All Content © PaperCept, Inc.


This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2024 PaperCept, Inc.
Page generated 2024-10-03  03:41:39 PST  Terms of use