New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks

Zhang, D; Ge, H; Zhang, T; Cui, YY; Liu, X; Mao, G

New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks

Zhang, D Ge, H Zhang, T Cui, YY Liu, X Mao, G

Permalink

Publisher:: Institute of Electrical and Electronics Engineers
Publication Type:: Journal Article
Citation:: IEEE Transactions on Intelligent Transportation Systems, 2019, 20, (4), pp. 1517-1530
Issue Date:: 2019

Closed Access

	Filename	Description	Size
	08437169.pdf	Published version	3.11 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, D
dc.contributor.author	Ge, H
dc.contributor.author	Zhang, T
dc.contributor.author	Cui, YY
dc.contributor.author	Liu, X
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949
dc.date.accessioned	2020-05-04T03:33:50Z
dc.date.available	2020-05-04T03:33:50Z
dc.date.issued	2019
dc.identifier.citation	IEEE Transactions on Intelligent Transportation Systems, 2019, 20, (4), pp. 1517-1530
dc.identifier.issn	1524-9050
dc.identifier.issn	1558-0016
dc.identifier.uri	http://hdl.handle.net/10453/140450
dc.description.abstract	IEEE As a hierarchical network architecture, the cluster architecture can improve the routing performance greatly for vehicular ad hoc networks (VANETs) by grouping the vehicle nodes. However, the existing clustering algorithms only consider the mobility of a vehicle when selecting the cluster head. The rapid mobility of vehicles makes the link between nodes less reliable in cluster. A slight change in the speed of cluster head nodes has a great influence on the cluster members and even causes the cluster head to switch frequently. These problems make the traditional clustering algorithms perform poorly in the stability and reliability of the VANET. A novel passive multi-hop clustering algorithm (PMC) is proposed to solve these problems in this paper. The PMC algorithm is based on the idea of a multi-hop clustering algorithm that ensures the coverage and stability of cluster. In the cluster head selection phase, a priority-based neighbor-following strategy is proposed to select the optimal neighbor nodes to join the same cluster. This strategy makes the inter-cluster nodes have high reliability and stability. By ensuring the stability of the cluster members and selecting the most stable node as the cluster head in the N-hop range, the stability of the clustering is greatly improved. In the cluster maintenance phase, by introducing the cluster merging mechanism, the reliability and robustness of the cluster are further improved. In order to validate the performance of the PMC algorithm, we do many detailed comparison experiments with the algorithms of N-HOP, VMaSC, and DMCNF in the NS2 environment.
dc.language	English
dc.publisher	Institute of Electrical and Electronics Engineers
dc.relation	National ICT Australia
dc.relation.ispartof	IEEE Transactions on Intelligent Transportation Systems
dc.relation.isbasedon	10.1109/TITS.2018.2853165
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0801 Artificial Intelligence and Image Processing, 0905 Civil Engineering, 1507 Transportation and Freight Services
dc.subject.classification	Logistics & Transportation
dc.title	New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks
dc.type	Journal Article
utslib.citation.volume	20
utslib.for	0801 Artificial Intelligence and Image Processing
utslib.for	0905 Civil Engineering
utslib.for	1507 Transportation and Freight Services
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false
dc.date.updated	2020-05-04T03:33:48Z
pubs.issue	4
pubs.publication-status	Accepted
pubs.volume	20
utslib.start-page	1517
utslib.citation.issue	4

Abstract:

IEEE As a hierarchical network architecture, the cluster architecture can improve the routing performance greatly for vehicular ad hoc networks (VANETs) by grouping the vehicle nodes. However, the existing clustering algorithms only consider the mobility of a vehicle when selecting the cluster head. The rapid mobility of vehicles makes the link between nodes less reliable in cluster. A slight change in the speed of cluster head nodes has a great influence on the cluster members and even causes the cluster head to switch frequently. These problems make the traditional clustering algorithms perform poorly in the stability and reliability of the VANET. A novel passive multi-hop clustering algorithm (PMC) is proposed to solve these problems in this paper. The PMC algorithm is based on the idea of a multi-hop clustering algorithm that ensures the coverage and stability of cluster. In the cluster head selection phase, a priority-based neighbor-following strategy is proposed to select the optimal neighbor nodes to join the same cluster. This strategy makes the inter-cluster nodes have high reliability and stability. By ensuring the stability of the cluster members and selecting the most stable node as the cluster head in the N-hop range, the stability of the clustering is greatly improved. In the cluster maintenance phase, by introducing the cluster merging mechanism, the reliability and robustness of the cluster are further improved. In order to validate the performance of the PMC algorithm, we do many detailed comparison experiments with the algorithms of N-HOP, VMaSC, and DMCNF in the NS2 environment.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/140450