Priority Based Reliable Adaptive Relay Selection and Cooperative Multi-Hop Clustering for Vehicular Networks

Due to the inherent mobility of each node in a Vehicular Network, routing is the primary concern.The mobility enhances the dynamic character of the vehicular networks, which is reflected in controlling traffic overhead.Consequently, attaining steady end-to-end communication connections is crucial to the success of routing strategy and a kind of mobility of node data.An P-EARCR (priority-based neighbour-following Enhanced Adaptive Reliable Cooperative Routing) technique based on velocity, distance, and connection quality was offered to solve these issues.This method determines the optimum network settings that balance Quality of Service (QoS) requirements with mobility restrictions.Choosing cluster heads and Multi-Point Relays (MPR) while taking mobility restrictions and quality-of-service requirements into account increases the scalability of routing.Each pair of nodes' connection quality is calculated using the suggested method's combination of strength of signal and distance characteristics.To guarantee the steadiness, dependability, and longevity of the route, we choose the relay cars using the greatest possible QoS value.To improve the Packet Delivery Ratio (PDR) of a multi-hop network with acceptable End-to-End transmission latency, heuristic limits of the multi-point relay selection approach by taking into the cluster-head coverage area, link quality, and distance from the source vehicle are taken into account.The proposed algorithm can improve cluster stability and reliability passively based on a priority neighbour-following technique to select the ideal neighbour nodes to join the same cluster during the cluster head selection phase.From the simulation results, it is observed that the proposed algorithm gives better performance in terms of network throughput, packet delivery ratio and end-to-end energy consumption compared to Cluster-based Adept Cooperative Algorithm (CACA), Reliable Cluster-based Multi-Hop Cooperative Routing (RCCR), Channel Gain (CG) based relay selection and Reliable Cluster-based Multi-Hop Cooperative Routing (RCCR) algorithm.It improves the aggregate throughput of the network by 139% and end-toend energy consumption by 42.7% compared to Cluster-based Adept Cooperative Algorithm (CACA).

Publication Details

Journal
International journal of intelligent engineering and systems
Published
2025-02-26
DOI
https://doi.org/10.22266/ijies2025.0331.20
Primary Topic
Vehicular Ad Hoc Networks (VANETs)
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Priority Based Reliable Adaptive Relay Selection and Cooperative Multi-Hop Clustering for Vehicular Networks

International journal of intelligent engineering and systems
Vehicular Ad Hoc Networks (VANETs)
article

Priority Based Reliable Adaptive Relay Selection and Cooperative Multi-Hop Clustering for Vehicular Networks

article en

Abstract

Due to the inherent mobility of each node in a Vehicular Network, routing is the primary concern.The mobility enhances the dynamic character of the vehicular networks, which is reflected in controlling traffic overhead.Consequently, attaining steady end-to-end communication connections is crucial to the success of routing strategy and a kind of mobility of node data.An P-EARCR (priority-based neighbour-following Enhanced Adaptive Reliable Cooperative Routing) technique based on velocity, distance, and connection quality was offered to solve these issues.This method determines the optimum network settings that balance Quality of Service (QoS) requirements with mobility restrictions.Choosing cluster heads and Multi-Point Relays (MPR) while taking mobility restrictions and quality-of-service requirements into account increases the scalability of routing.Each pair of nodes' connection quality is calculated using the suggested method's combination of strength of signal and distance characteristics.To guarantee the steadiness, dependability, and longevity of the route, we choose the relay cars using the greatest possible QoS value.To improve the Packet Delivery Ratio (PDR) of a multi-hop network with acceptable End-to-End transmission latency, heuristic limits of the multi-point relay selection approach by taking into the cluster-head coverage area, link quality, and distance from the source vehicle are taken into account.The proposed algorithm can improve cluster stability and reliability passively based on a priority neighbour-following technique to select the ideal neighbour nodes to join the same cluster during the cluster head selection phase.From the simulation results, it is observed that the proposed algorithm gives better performance in terms of network throughput, packet delivery ratio and end-to-end energy consumption compared to Cluster-based Adept Cooperative Algorithm (CACA), Reliable Cluster-based Multi-Hop Cooperative Routing (RCCR), Channel Gain (CG) based relay selection and Reliable Cluster-based Multi-Hop Cooperative Routing (RCCR) algorithm.It improves the aggregate throughput of the network by 139% and end-toend energy consumption by 42.7% compared to Cluster-based Adept Cooperative Algorithm (CACA).

International journal of intelligent engineering and systemsVol. 18(2)
Openalex Percentile: Top 97%
Vehicular Ad Hoc Networks (VANETs)
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Priority Based Reliable Adaptive Relay Selection and Cooperative Multi-Hop Clustering for Vehicular Networks · International journal of intelligent engineering and systems (2025) | TGRS Research Map | TGRS