Non-Negotiated Implicit ETSI VAM Clustering
🤖 AI Summary
In C-ITS, massive VRU (Vulnerable Road User) access causes severe channel congestion and limited capacity; existing ETSI clustering schemes rely on negotiation mechanisms and assume reliable channels, rendering them vulnerable to high packet loss and poor signaling robustness. Method: This paper proposes a non-negotiated, implicit VAM-based clustering mechanism: cluster heads passively cover surrounding VRUs without explicit signaling; lightweight state inference, distributed cluster-head bootstrapping, and redundancy-aware fault-tolerant coding enable autonomous cluster recovery under packet loss. Contribution/Results: Compared to ETSI’s approach, message generation is reduced by 50%, VRU perception coverage remains at 100%, and stable operation is maintained even under 30% packet loss. This work introduces the first negotiation-free, maintenance-signaling-free, and highly fault-tolerant implicit clustering paradigm, significantly enhancing communication scalability and robustness of C-ITS in large-scale VRU deployments.
Application Category
📝 Abstract
Including Vulnerable Road User (VRU) in Cooperative Intelligent Transport Systems (C-ITS) framework aims to increase road safety. However, this approach implies a massive increase of network nodes and thus is vulnerable to medium capacity issues, e.g., contention, congestion, resource scheduling. Implementing cluster schemes -to reduce the number of nodes but represent the same number of VRUs- is a direct way to address the issue. One of them is suggested by European Telecommunications Standards Institute (ETSI) and consists of nodes (connected pedestrians and cyclists) sending vicarious messages to enable a leader node to cover for a cluster of VRUs. However, the proposed scheme includes negotiation to establish a cluster, and in-cluster communication to maintain it, requiring extra messages of variable sizes and thus does not fully resolve the original medium capacity issues. Furthermore, these exchanges assume network reliability (i.e. a lossless channel and low latency to meet time constraints). We propose a method for VRU Awareness Message (VAM) clustering where 1) all cluster operations are performed without negotiation, 2) cluster leaders do not require sending additional messages or meet deadlines, and 3) assumes a lossy communication channel and offers a mechanism for cluster resilience. Our results show the feasibility of the concept by halving message generations compared to individual messages while keeping the awareness levels (i.e., that VRUs are accounted for).
Problem
Research questions and friction points this paper is trying to address.
Enhance VRU safety in C-ITS
Reduce network node congestion
Implement lossy channel clustering
Innovation
Methods, ideas, or system contributions that make the work stand out.
Non-negotiated VAM clustering
Lossy channel resilience
Reduced message generation
🔎 Similar Papers
No similar papers found.
