基于密度的VANETs聚类算法

S. Kukliński, G. Wolny
{"title":"基于密度的VANETs聚类算法","authors":"S. Kukliński, G. Wolny","doi":"10.1109/TRIDENTCOM.2009.4976256","DOIUrl":null,"url":null,"abstract":"In this paper we present a new multilevel clustering algorithm for Vehicular Ad-Hoc Networks (VANET), which we will call the Density Based Clustering (DBC) algorithm. Our solution is focused on the formation of stable, long living clusters for reliable communication. Cluster formation is based on complex clustering metric which takes into account density of connection graph, link quality and traffic conditions. Tests performed in the simulation environment composed from VanetMobiSim and JiST/SWANS have shown that algorithm performs better than the popular classic approach (the Lowest Id algorithm [1]) - the clusters stability is significantly increased.","PeriodicalId":254380,"journal":{"name":"2009 5th International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities and Workshops","volume":"117 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"79","resultStr":"{\"title\":\"Density based clustering algorithm for VANETs\",\"authors\":\"S. Kukliński, G. Wolny\",\"doi\":\"10.1109/TRIDENTCOM.2009.4976256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a new multilevel clustering algorithm for Vehicular Ad-Hoc Networks (VANET), which we will call the Density Based Clustering (DBC) algorithm. Our solution is focused on the formation of stable, long living clusters for reliable communication. Cluster formation is based on complex clustering metric which takes into account density of connection graph, link quality and traffic conditions. Tests performed in the simulation environment composed from VanetMobiSim and JiST/SWANS have shown that algorithm performs better than the popular classic approach (the Lowest Id algorithm [1]) - the clusters stability is significantly increased.\",\"PeriodicalId\":254380,\"journal\":{\"name\":\"2009 5th International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities and Workshops\",\"volume\":\"117 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"79\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 5th International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities and Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TRIDENTCOM.2009.4976256\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 5th International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities and Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TRIDENTCOM.2009.4976256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 79

摘要

本文提出了一种新的用于车载自组织网络(VANET)的多级聚类算法,我们称之为基于密度的聚类(DBC)算法。我们的解决方案专注于形成稳定、长寿的集群,以实现可靠的通信。聚类的形成基于复杂的聚类度量,该度量综合考虑了连接图密度、链路质量和交通状况。在VanetMobiSim和JiST/SWANS组成的仿真环境中进行的测试表明,该算法的性能优于流行的经典方法(最低Id算法[1])——簇的稳定性显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Density based clustering algorithm for VANETs
In this paper we present a new multilevel clustering algorithm for Vehicular Ad-Hoc Networks (VANET), which we will call the Density Based Clustering (DBC) algorithm. Our solution is focused on the formation of stable, long living clusters for reliable communication. Cluster formation is based on complex clustering metric which takes into account density of connection graph, link quality and traffic conditions. Tests performed in the simulation environment composed from VanetMobiSim and JiST/SWANS have shown that algorithm performs better than the popular classic approach (the Lowest Id algorithm [1]) - the clusters stability is significantly increased.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信