Role of Roadside Units in Cluster Head Election and Coverage Maximization for Vehicle Emergency Services
Efficient clustering algorithms are critical for enabling the timely dissemination of emergency messages across maximum coverage areas in vehicular networks. While existing clustering approaches demonstrate stability and scalability, there has been a limited amount of work focused on leveraging road...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Computers |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-431X/14/4/152 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Efficient clustering algorithms are critical for enabling the timely dissemination of emergency messages across maximum coverage areas in vehicular networks. While existing clustering approaches demonstrate stability and scalability, there has been a limited amount of work focused on leveraging roadside units (RSUs) for cluster head selection. This research proposes a novel framework that utilizes RSUs to facilitate cluster head election, mitigating the cluster head selection process, clustering overhead, and broadcast storm problem. The proposed scheme mandates selecting an optimal number of cluster heads to maximize information coverage and prevent traffic congestion, thereby enhancing the quality of service through improved cluster head duration, reduced cluster formation time, expanded coverage area, and decreased overhead. The framework comprises three key components: (I) an acknowledgment-based system for legitimate vehicle entry into the RSU for cluster head selection; (II) an authoritative node behavior mechanism for choosing cluster heads from received notifications; and (III) the role of bridge nodes in maximizing the coverage of the established network. The comparative analysis evaluates the clustering framework’s performance under uniform and non-uniform vehicle speed scenarios for time-barrier-based emergency message dissemination in vehicular ad hoc networks. The results demonstrate that the proposed model’s effectiveness for uniform highway speed scenarios is 100% whereas for non-uniform scenarios 99.55% information coverage is obtained. Furthermore, the clustering process accelerates by over 50%, decreasing overhead and reducing cluster head election time using RSUs. The proposed approach outperforms existing methods for the number of cluster heads, cluster head election time, total cluster formation time, and maximum information coverage across varying vehicle densities. |
|---|---|
| ISSN: | 2073-431X |