Paper Info
Title
A Distributed D-Hop Cluster Formation For Vanet
Abstract
A major challenge in vehicular ad-hoc networks (VANETs) is the ability to account for resource sharing and location management so that multicasting/routing functions and bandwidth reservations can be organized efficiently. By creating clusters of vehicles we are able to control resource sharing and management functions in VANETs that are highly dynamic. In this paper, a D-hop clustering algorithm, called DHCV is presented which organizes vehicles into non overlapping clusters which have adaptive sizes according to their respective mobility. The D-hop clustering algorithm creates clusters in such a way that each vehicle is at most D hops away from a cluster head. To construct multi-hop clusters, each vehicle chooses its cluster head based on relative mobility calculations within its D-hop neighbours. The algorithm can run at regular intervals or whenever the network formation changes. One of the features of this algorithm is tendency to re-elect the surviving cluster heads whenever the network structure changes. Extensive simulation results have been done under different scenarios to show the performance of our clustering algorithm.
Year
Venue
Keywords
2016
2016 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE
clustering, vehicular ad-hoc networks, cluster stability, multi-hop, vehicular cloud, cloud formation
Field
DocType
ISSN
Network formation,Cluster (physics),Algorithm design,Computer science,Computer network,Optimized Link State Routing Protocol,Multicast,Shared resource,Cluster analysis,Vehicular ad hoc network,Distributed computing
Conference
1525-3511
Citations 
PageRank 
References 
3
0.41
12
Authors
3
Name
Order
Citations
PageRank
Meysam Azizian1162.35
Soumaya Cherkaoui218740.89
Abdelhakim Hafid370887.06