Clustering Algorithm in Vehicular Ad-hoc Networks: A Brief Summary

Kang Tan, J. Kernec, M. Imran, D. Bremner
{"title":"Clustering Algorithm in Vehicular Ad-hoc Networks: A Brief Summary","authors":"Kang Tan, J. Kernec, M. Imran, D. Bremner","doi":"10.1109/UCET.2019.8881833","DOIUrl":null,"url":null,"abstract":"An Intelligent Transportation System (ITS) application requires vehicles to be connected to each other and to roadside units to share information, thus reducing fatalities and improving traffic congestion. Vehicular Ad hoc Networks (VANETs) is one of the main forms of network designed for ITS in which information is broadcasted amongst vehicular nodes. However, the broadcast reliability in VANETs face a number of challenges - dynamic routing being one of the major issues. Clustering, a technique used to group nodes based on certain criteria, has been suggested as a solution to this problem. This paper gives a summary of the core criteria of some of the clustering algorithms issues along with a performance comparison and a development evolution roadmap, in an attempt to understand and differentiate different aspects of the current research and suggest future research insights.","PeriodicalId":169373,"journal":{"name":"2019 UK/ China Emerging Technologies (UCET)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 UK/ China Emerging Technologies (UCET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UCET.2019.8881833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

An Intelligent Transportation System (ITS) application requires vehicles to be connected to each other and to roadside units to share information, thus reducing fatalities and improving traffic congestion. Vehicular Ad hoc Networks (VANETs) is one of the main forms of network designed for ITS in which information is broadcasted amongst vehicular nodes. However, the broadcast reliability in VANETs face a number of challenges - dynamic routing being one of the major issues. Clustering, a technique used to group nodes based on certain criteria, has been suggested as a solution to this problem. This paper gives a summary of the core criteria of some of the clustering algorithms issues along with a performance comparison and a development evolution roadmap, in an attempt to understand and differentiate different aspects of the current research and suggest future research insights.
车载Ad-hoc网络中的聚类算法综述
智能交通系统(ITS)的应用要求车辆相互连接,并与路边单位共享信息,从而减少死亡人数,改善交通拥堵。车辆自组织网络(VANETs)是为ITS设计的主要网络形式之一,其中信息在车辆节点之间广播。然而,vanet的广播可靠性面临着许多挑战,动态路由是其中的主要问题之一。聚类是一种用于根据特定标准对节点进行分组的技术,已被建议作为解决此问题的方法。本文总结了一些聚类算法问题的核心标准,并进行了性能比较和发展演变路线图,试图理解和区分当前研究的不同方面,并提出未来的研究见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信