NDLI: VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim clustering algorithm

Content Provider	IEEE Xplore Digital Library
Author	Kponyo, J.J. Yujun Kuang Enzhan Zhang Domenic, K.
Copyright Year	2013
Description	Author affiliation: Mobilelink Lab., Univ. of Electron. Sci. & Technol. of China, Chengdu, China (Kponyo, J.J.; Yujun Kuang; Enzhan Zhang; Domenic, K.)
Abstract	Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-on-Demand (CoD) Minimum Spanning Tree (MST) Prim algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the algorithm applied to real traffic data has shown the algorithm's ability to successfully form clusters with good QoS. The algorithm has also been shown to compare very well with Dijkstra's algorithm which is one of the best clustering algorithms.
Starting Page	101
Ending Page	104
File Size	217177
Page Count	4
File Format	PDF
ISBN	9781479921508
DOI	10.1109/ICCPS.2013.6893585
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-10-26
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Roads Minimum spanning tree (MST) Clustering algorithms Vehicular ad hoc networks Prim algorithm Quality of service Vehicular ad hoc networks (VANETs) Dijkstra's algorithm Junctions Vehicles
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Adaptive K-Harmonic Means clustering algorithm for VANETs

Cluster head selection algorithm in vehicular Ad Hoc networks

Using road IDs to enhance clustering in vehicular ad hoc networks

A survey on clustering algorithms for vehicular ad-hoc networks

A new stability based clustering algorithm (SBCA) for VANETs

Game theoretical approach for ad dissemination in cluster based VANETs

An approach to avoid traffic congestion using VANET

An intelligent clustering algorithm for VANETs

Reliable Data Delivery in Vehicular Ad Hoc Networks

VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim clustering algorithm

Similar Documents

Adaptive K-Harmonic Means clustering algorithm for VANETs

Cluster head selection algorithm in vehicular Ad Hoc networks

Using road IDs to enhance clustering in vehicular ad hoc networks

A survey on clustering algorithms for vehicular ad-hoc networks

A new stability based clustering algorithm (SBCA) for VANETs

Game theoretical approach for ad dissemination in cluster based VANETs

An approach to avoid traffic congestion using VANET

An intelligent clustering algorithm for VANETs

Reliable Data Delivery in Vehicular Ad Hoc Networks

VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim clustering algorithm