VWCA: An efficient clustering algorithm in vehicular ad hoc networks

Daeinabi, A.; Rahbar, Akbar Ghaffarpour; Khademzadeh, Ahmad

doi:10.1016/j.jnca.2010.07.016

Cited by 164 publications

(83 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We compare our proposed cluster formation and cluster head selection technique by using K-Means and FloydWarshall algorithm (KMFW) algorithm with Cluster-based traffic information generalization (CTIG) [22] and clustering algorithm in vehicular ad hoc networks (VWCA) [23]. Fig.…”

Section: -40 M/secmentioning

confidence: 99%

Cluster Formation and Cluster Head Selection Approach for Vehicle Ad-Hoc Network (VANETs) using K-Means and Floyd-Warshall Technique

Hussain¹,

Chen²

2017

ijacsa

View full text Add to dashboard Cite

Abstract-Vehicular Ad-hoc Network (VANETs) is the specific form of Mobile ad-hoc networking (MANETs) in which high dynamic nodes are utilized in carrying out the operations. They are mainly used in urban areas for safety traveling. Clustering algorithms are used for clustering the vehicles that are in the range of the network as VANET consists of a great amount of traffic. A clustering head node is used specified through a procedure to collect all information from the surroundings. This study introduced a new method for cluster head selection by using the K-Mean and Floyd-Warshall algorithms. The proposed technique first divided the points for vehicle groups while the Floyd-Warshall algorithm calculated all pairs of shortest distance for every vehicle within the defined cluster. A vehicle with the smallest average distance among a cluster is chosen as the cluster head. The Floyd-Warshall algorithm overall selects a centralized vehicle as a cluster head, hence its stability time will improve significantly.

show abstract

Section: -40 M/secmentioning

confidence: 99%

Cluster Formation and Cluster Head Selection Approach for Vehicle Ad-Hoc Network (VANETs) using K-Means and Floyd-Warshall Technique

Hussain¹,

Chen²

2017

ijacsa

View full text Add to dashboard Cite

show abstract

“…An efficient clustering algorithm for clustering in VANETs is proposed in [22]. The authors considered different factors such as entropy, the direction of vehicle and the number of neighbors to perform the clustering of vehicles in an exact area.…”

Section: Related Workmentioning

confidence: 99%

A Novel Clustering Algorithm Based on Agent Technology for VANET

Harrabi

Jaâfar

Ghédira

2016

NPA

View full text Add to dashboard Cite

Vehicular Ad-hoc Network (VANET) is a sub-family of Mobile Ad-hoc Network (MANET).The means goal of VANET is to provide communications between nearby nodes or between nodes and fixed infrastructure. Despite that VANET is considered as a subclass of MANET, it has for particularity the high mobility of vehicles producing the frequent changes of network topology that involve changing of road, varying node density and locations of vehicles existing in this road. That's why, the most proposed clustering algorithms for MANET are unsuitable for VANET. Various searches have been recently published deal with clustering for VANETs. But most of them are focused on minimizing network overhead value, number of created clusters and had not considered the vehicles interests which defined as any related data used to differentiate vehicle from another (such as traffic congestion, looking for free parking space, etc.). In this paper, we propose a novel clustering algorithm based on agent technology to solve the problems mentioned above and improve routing in VANET. Experimental part show promising results regarding the adoption of the proposed approach.www.macrothink.org/npa 1 Network Protocols and Algorithms

show abstract

“…In [19] three suitable scenarios that are mainly for highway traffic were discussed. The first was that was used for choosing the cluster heads giving different parameters which could improve stability, connectivity and security of VANETS.…”

Section: K Vehicular Clustering Based On Weighted Clusteringmentioning

confidence: 99%

“…In [19] three algorithms were introduced; the first one was the vehicular clustering based on weighted clustering. Some parameters were needed to be set while deploying this technique.…”

Section: Comparative Analysismentioning

confidence: 99%

Secure Clustering in Vehicular Ad Hoc Networks

Nayyar¹,

Khattak²,

Saqib³

et al. 2015

ijacsa

View full text Add to dashboard Cite

Abstract-A vehicular Ad-hoc network is composed of moving cars as nodes without any infrastructure. Nodes selforganize to form a network over radio links. Security issues are commonly observed in vehicular ad hoc networks; like authentication and authorization issues. Secure Clustering plays a significant role in VANETs. In recent years, various secure clustering techniques with distinguishing feature have been newly proposed. In order to provide a comprehensive understanding of these techniques are designed for VANETs and pave the way for the further research, a survey of the secure clustering techniques is discussed in detail in this paper. Qualitatively, as a result of highlighting various techniques of secure clustering certain conclusions are drawn which will enhance the availability and security of vehicular ad hoc networks. Nodes present in the clusters will work more efficiently and the message passing within the nodes will also get more authenticated from the cluster heads.

show abstract

VWCA: An efficient clustering algorithm in vehicular ad hoc networks

Cited by 164 publications

References 28 publications

Cluster Formation and Cluster Head Selection Approach for Vehicle Ad-Hoc Network (VANETs) using K-Means and Floyd-Warshall Technique

Cluster Formation and Cluster Head Selection Approach for Vehicle Ad-Hoc Network (VANETs) using K-Means and Floyd-Warshall Technique

A Novel Clustering Algorithm Based on Agent Technology for VANET

Secure Clustering in Vehicular Ad Hoc Networks

Contact Info

Product

Resources

About