Destination-aware context-based routing protocol with hybrid soft computing cluster algorithm for VANET

Aravindhan, K.; Dhas, C. Suresh Gnana

doi:10.1007/s00500-018-03685-7

Cited by 44 publications

(47 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Through the analysis of Formula (10), it can be seen that, for a vehicle, the smaller the value of the position scaling function is, the smaller the effect on the cluster stability is.…”

Section: Cluster Formationmentioning

confidence: 99%

A New Affinity Propagation Clustering Algorithm for V2V-Supported VANETs

Baishun

Shi

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Clustering is an efficient method for improving the communication performance of Vehicular Ad hoc NETworks (VANETs) that adopt Vehicle to Vehicle (V2V) communications. However, how to maximize the cluster stability while accounting for the high mobility of vehicles remains a challenging problem. In this paper, we first reconstruct the similarity function of the Affinity Propagation (AP) clustering algorithm by introducing communication-related parameters, so the vehicles with low relative mobility and good communication performance can easily be selected as cluster heads. Then, by formally defining three scaling functions, a weighted mechanism is designed to quantitatively assess the effect on the cluster stability when a vehicle joins it. Base on them, from the perspective of global balance, a new AP clustering algorithm for the whole clustering process is proposed. To ensure the validity of simulations, we use the vehicular mobility data generated on the realistic map of Cologne, Germany, and perform a series of simulations for eleven metrics commonly adopted in similar works. The results show that our proposed algorithm performs better than other algorithms in terms of the cluster stability, and it also effectively improves throughput and reduces packet loss rate of VANETs over the classical APROVE algorithm and the NMDP-APC algorithm. INDEX TERMS VANETs, V2V, clustering, affinity propagation. NOTATIONS CR One-hop communication radius of a vehicle V i Vehicle i, i is the ID of the vehicle az i Azimuth angle of V i Th az Threshold value for the difference of two azimuth angles v i Velocity of V i (x i , y i) Position of V i Th v Threshold value for the difference of two velocities v max Maximum velocity limit for the current road OCR i Owned communication rate of V i RCR i Required communication rate of V i NN L i Normal neighbor list of V i NN L i,j The jth list item of NN L i The associate editor coordinating the review of this manuscript and approving it for publication was Muhammad Alam. ER One-hop effective range of a vehicle d i,j Distance between V i and V j s (i, j) Similarity function between V i and V j r (i, j) Responsibility sent from V i to V j R i Responsibility list sent from V i to its onehop neighbor vehicles a (i, j) Availability sent from V j to V i A j Availability list sent from V j to its one-hop neighbor vehicles CH i Cluster head of V i ID (CH i) ID of V i 's cluster head CCH L i Candidate cluster head list of V i C i Cluster i whose cluster head is V i CM N C i Number of cluster members of C i CM N max Maximum number of cluster members of a cluster CM L i Cluster member list of V i whose state is Cluster Head (CH)

show abstract

“…Through the analysis of Formula (10), it can be seen that, for a vehicle, the smaller the value of the position scaling function is, the smaller the effect on the cluster stability is.…”

Section: Cluster Formationmentioning

confidence: 99%

A New Affinity Propagation Clustering Algorithm for V2V-Supported VANETs

Baishun

Shi

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Thus, consideration of throughput for CH election was not optimal in vehicular communication. To construct stable clusters, a hybrid clustering protocol was proposed that combines geographic and context-based clustering approaches [12]. The CH in each segment was selected by determining its location, direction, velocity, destination, point of interest, and residual lifetime.…”

Section: Related Workmentioning

confidence: 99%

Stabilized Clustering Enabled V2V Communication in an NDN-SDVN Environment for Content Retrieval

et al. 2020

View full text Add to dashboard Cite

Content retrieval is becoming an emerging application on an integrated network structure referred to as Software Defined Network and Vehicular Ad hoc Network (SDVN). The SDVN is expected to flexibly provide efficient packet routing without deploying road side units. In such the infrastructure-less environment, however, it is challenging to retrieve contents from dynamic networks clustered with vehicles on roadways. As a solution to the problem, we propose a new network design by conjoining Named Data Network (NDN) with SDVN (NDN-SDVN). The new NDN-SDVN is designed as to improve stableness of the cluster formation and hence enables to efficiently perform the content retrieval over Vehicle-to-Vehicle (V2V) communications. Note that one of the most important problems in the V2V is how to select a cluster head. The proposed NDN-SDN adaptively determines the cluster head by using the SDN controller under the maximum Quality of Service (QoS) criterion, while reserving an assistance head based on a Moth Flame Optimization (MFO) algorithm to immediately recompose a new cluster with the back-off time. Moreover, the content retrieval in the NDN-SDVN can be performed over both intra-and inter-cluster communications. To this end, a Kalman filter with Neural Network (KF-NN) is applied for selecting a certain number of preferable vehicles in 1-hop in order to mitigate the broadcast storm problem that often occurs in an NDN. Content retrieval is initiated by sending interest packets including two additional fields of the timestamp and the target MAC address. The head vehicle of the SDN controller maintains ontology regarding the content information cashed by other vehicles, which significantly improves the packet delivery ratio. This NDN-SDVN design is developed on the OMNeT++ simulator and their advantageous results are evaluated in terms of the head lifetime, the cluster lifetime, the satisfactory rate, the latency and the packet delivery ratio.

show abstract

“…Routing protocols based on the strategy of route discovery are classified into three categories, namely, proactive, reactive and hybrid (Aravindhan and Dhas, 2019). Proactive routing protocols try to keep routing details consistent and modified from each node to any other node in the network.…”

Section: Routing Protocolmentioning

confidence: 99%

The Reliability of Routing Protocols as an Important Factor for Road Safety Applications in VANET-based Autonomous Cars

Sasongko¹,

Jati²,

Hardian³

et al. 2020

Journal of Computer Science

View full text Add to dashboard Cite

The autonomous cars are considered as a tremendous disruptive innovation in the coming years. They enable a driving automation system to replace human drivers to control the vehicle with better recognition, decision and driving skills and ultimately enhance the road users' experience and traffic safety. They can communicate with other cars as they are ready with the Vehicle to Vehicle (V2V) communication technology based on Vehicular Ad hoc Networks (VANETs). One of the objectives of V2V communication is for the safety of all road users. Adequate reliability of routing protocol is subject of concern and must be taken into account to reach an immense standard of road safety accurately and timely. Having no reliability the critical road safety messages will be useless; consequently, the accident that might happen is unable to prevent or avoid. The purpose of this research is to investigate and analyze the quantitative measure of reliability. The reliabilities of a reactive single-path AODV and a multipath AOMDV routing protocols that comply with road safety requirements in various traffic conditions are studied. The traffic conditions that may impact the internetworking of autonomous cars include node density, size of road area and speed of the nodes. The methods used in this study are based on simulations by using Network Simulator version-2 (NS2) as a network simulator and Simulation of Urban Mobility (SUMO) as a mobility simulator. The simulation results show that both routing protocols, a single-path AODV and a multi-path AOMDV, satisfy the road safety requirements in some conditions. AODV is better in packet delivery, whereas AOMDV has a better performance on average end to end delay. This study is expected to contribute to the determination of the appropriate protocol for use in road safety applications under certain traffic conditions. In conclusion, the reliability of routing protocol is an essential factor to consider in the operation of VANET-based autonomous cars so that the safety and comfort of road users can be guaranteed.

show abstract

Destination-aware context-based routing protocol with hybrid soft computing cluster algorithm for VANET

Cited by 44 publications

References 19 publications

A New Affinity Propagation Clustering Algorithm for V2V-Supported VANETs

A New Affinity Propagation Clustering Algorithm for V2V-Supported VANETs

Stabilized Clustering Enabled V2V Communication in an NDN-SDVN Environment for Content Retrieval

The Reliability of Routing Protocols as an Important Factor for Road Safety Applications in VANET-based Autonomous Cars

Contact Info

Product

Resources

About