QoS Enhancement using Intelligent Cluster Head Selection Routing Technique in Vehicular Ad Hoc Networks in case of RSU failure

Raut, C. M.; Devane, Satish

doi:10.1109/ants.2018.8710102

Cited by 4 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To provide quality of service during RSU failure, a concept of intelligent CH is introduced in density-based scheme [80] where density of the vehicles is considered along with distance and speed to select the intelligent CH. This concept could be used in any RSU-based clustering algorithms during RSU failure; however, experimental result is not presented to justify the improvement of QoS parameters.…”

Section: Qos Algorithmsmentioning

confidence: 99%

Stable dynamic feedback-based predictive clustering protocol for vehicular Ad hoc networks

Mukhtaruzzaman,

Atiquzzaman

2023

Computer Networks

View full text Add to dashboard Cite

Section: Qos Algorithmsmentioning

confidence: 99%

Stable dynamic feedback-based predictive clustering protocol for vehicular Ad hoc networks

Mukhtaruzzaman,

Atiquzzaman

2023

Computer Networks

View full text Add to dashboard Cite

“…The system achieved the objectives of improving the packet delivery rate, thereby reducing data distortion. Intelligent cluster head routing protocol (ICHR) [45] is designed to enhance network connectivity in the case of RSUs failure. They recommended alternate paths by introducing Chain-based Ant Colony Optimization (C-ACO).…”

Section: Approachesmentioning

confidence: 99%

A Self-Adaptable Angular Based K-Medoid Clustering Scheme (SAACS) for Dynamic VANETs

et al. 2022

View full text Add to dashboard Cite

Prior study suggests that VANET has two types of communications: Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) communications. V2V is very important and ensures cooperative communications between vehicles and safety measures. It is also defined as Inter-Vehicle Communication (IVC).The communication is based on clustering the nodes to transmit the data from vehicle to vehicle. The overhead and stability are considered as main challenges that need to be addressed during vehicle intersections. In this paper, a novel self-adaptable Angular based k-medoid Clustering Scheme (SAACS) is proposed to form flexible clusters. The clusters are formed by estimating the road length and transmission ranges to minimize the network delay. And the Cluster Head (CH) is elected from a novel performance metric, ‘cosine-based node uncoupling frequency,’ that finds the best nodes irrespective of their current network statistics. The parametric analysis varies according to the number of vehicular nodes with the transmission range. The experimental results have proven that the proposed technique serves better in comparison to existing approaches such as Cluster Head Lifetime (CHL), Cluster Member Lifetime (CML), Cluster Number (CL), Cluster Overhead (CO), Packet Loss Ratio (PLR) and Average Packet Delay (APD). CHL is enhanced 40% as compare to Real-Time Vehicular Communication (RTVC), Efficient Cluster Head Selection (ECHS) whereas CML is 50% better than RTVC and ECHS. Packet loss ratio and overhead is 45% better in our proposed algorithm than RTVC and ECHS. It is observed from the results that the incorporation of cosine-based node uncoupling frequency has minimized the incongruity between vehicular nodes placed in dense and sparse zones of highways.

show abstract

“…Here v k , v j means, the Velocity of vehicles "k" and "j". AC k -average of compatibility of the interests between vehicle "k" and each of its neighbor "j" [9] [14]. The result should be maximum for maximum CHE value, calculated by Equation 6:…”

Section: Process Of Clustering and Selection Of The Cluster Headmentioning

confidence: 99%

Destination Based Stable Clustering Algorithm and Routing for VANET

Azat¹,

Tang²

2020

JCC

View full text Add to dashboard Cite

Now in modern telecommunication, one of the big topic research is a Vehicle Ad-hoc Network "VANET" (V2V). This topic is one of an "issues of the day" because research has problematic topic due to its many application-questions, what we need to solve: avoid collisions, any accidents on a way, and notifications about congestions on the road, available car parking, roadside commercial-business ads, and etcetera. These like application forms creating big delay constraining's i.e. the instant data should reach the destination within certain time limits. Therefore, we need a really efficient stable clustering method and routing in vehicle ad-hoc network which will be resistant to network delays and meets network requirements. The methods are proposed in the paper for optimization VANETs data traffic as well as to minimizing delay. First, here is presented, a stable clustering algorithm based on the destination, contextually take into consideration various physical parameters for cluster formation such as location of the vehicle and its direction, vehicle speed and destination, as well as a possible list of interests of the vehicle. And also the next main process is to depend on these "five parameters" we can calculate the "Cluster Head Eligibility" of each car. Second, based on this "Cluster Head Eligibility", described cluster head selection method. Third, for efficient communication between clusters, present a routing protocol based on the "destination", which considered an efficient selecting method of next forwarding nodes, which is calculated by using "FE" metric.

show abstract

QoS Enhancement using Intelligent Cluster Head Selection Routing Technique in Vehicular Ad Hoc Networks in case of RSU failure

Cited by 4 publications

References 12 publications

Stable dynamic feedback-based predictive clustering protocol for vehicular Ad hoc networks

Stable dynamic feedback-based predictive clustering protocol for vehicular Ad hoc networks

A Self-Adaptable Angular Based K-Medoid Clustering Scheme (SAACS) for Dynamic VANETs

Destination Based Stable Clustering Algorithm and Routing for VANET

Contact Info

Product

Resources

About