基于机动性的动态VANET双头聚类算法

Ghada H. Alsuhli, Ahmed K. F. Khattab, Y. Fahmy
{"title":"基于机动性的动态VANET双头聚类算法","authors":"Ghada H. Alsuhli, Ahmed K. F. Khattab, Y. Fahmy","doi":"10.1109/JEC-ECC.2018.8679569","DOIUrl":null,"url":null,"abstract":"Vehicular Ad Hoc Network (VANET) is a promising technology that still faces many challenges such as scalability and the highly dynamic topology. An effective VANET clustering algorithm significantly relieves the effect of these challenges. In this paper, we propose a double-head clustering (DHC) algorithm for VANETs. Our proposed approach is a mobility-based clustering algorithm that exploits the most relevant mobility metrics such as vehicles' speed, position and direction, in addition to other metrics related to the communication link quality in order to achieve stable clusters. We compare the proposed algorithm against existing clustering algorithms using different evaluation metrics under dynamic and static mobility scenarios. The proposed algorithm proves its stability and efficiency under different mobility scenarios.","PeriodicalId":197824,"journal":{"name":"2018 International Japan-Africa Conference on Electronics, Communications and Computations (JAC-ECC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Mobility-Based Double-Head Clustering Algorithm for Dynamic VANET\",\"authors\":\"Ghada H. Alsuhli, Ahmed K. F. Khattab, Y. Fahmy\",\"doi\":\"10.1109/JEC-ECC.2018.8679569\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicular Ad Hoc Network (VANET) is a promising technology that still faces many challenges such as scalability and the highly dynamic topology. An effective VANET clustering algorithm significantly relieves the effect of these challenges. In this paper, we propose a double-head clustering (DHC) algorithm for VANETs. Our proposed approach is a mobility-based clustering algorithm that exploits the most relevant mobility metrics such as vehicles' speed, position and direction, in addition to other metrics related to the communication link quality in order to achieve stable clusters. We compare the proposed algorithm against existing clustering algorithms using different evaluation metrics under dynamic and static mobility scenarios. The proposed algorithm proves its stability and efficiency under different mobility scenarios.\",\"PeriodicalId\":197824,\"journal\":{\"name\":\"2018 International Japan-Africa Conference on Electronics, Communications and Computations (JAC-ECC)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Japan-Africa Conference on Electronics, Communications and Computations (JAC-ECC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JEC-ECC.2018.8679569\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Japan-Africa Conference on Electronics, Communications and Computations (JAC-ECC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JEC-ECC.2018.8679569","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

车载自组织网络(VANET)是一项很有前途的技术,但仍面临着可扩展性和高度动态拓扑等诸多挑战。一种有效的VANET聚类算法可以有效地缓解这些挑战的影响。本文提出了一种用于VANETs的双头聚类(DHC)算法。我们提出的方法是一种基于移动性的聚类算法,该算法利用最相关的移动性指标,如车辆的速度、位置和方向,以及与通信链路质量相关的其他指标,以实现稳定的聚类。在动态和静态移动场景下,我们使用不同的评估指标将所提出的算法与现有的聚类算法进行了比较。在不同的移动场景下,证明了该算法的稳定性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Mobility-Based Double-Head Clustering Algorithm for Dynamic VANET
Vehicular Ad Hoc Network (VANET) is a promising technology that still faces many challenges such as scalability and the highly dynamic topology. An effective VANET clustering algorithm significantly relieves the effect of these challenges. In this paper, we propose a double-head clustering (DHC) algorithm for VANETs. Our proposed approach is a mobility-based clustering algorithm that exploits the most relevant mobility metrics such as vehicles' speed, position and direction, in addition to other metrics related to the communication link quality in order to achieve stable clusters. We compare the proposed algorithm against existing clustering algorithms using different evaluation metrics under dynamic and static mobility scenarios. The proposed algorithm proves its stability and efficiency under different mobility scenarios.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信