一种增强的VANET控制开销消息减少算法

Ahmad Abuashour, M. Kadoch
{"title":"一种增强的VANET控制开销消息减少算法","authors":"Ahmad Abuashour, M. Kadoch","doi":"10.1109/FiCloud.2018.00047","DOIUrl":null,"url":null,"abstract":"The mobility in Vehicular Ad-Hoc NETworks (VANETs) causes high topology changes and in turn leads to excessive control overhead messages and frequent link communication failures. Traditionally, clustering techniques have been used as the main solution to improve the stability of the clustered topology and to minimize the routing overhead messages generated due to the routing protocols. In the clustering techniques, the network is divided into multiple clusters and selecting one of the Cluster Members (CMs) as a Cluster Head (CH). Still, a problem occurs when the CMs periodically forwards of CM HELLO (CMHELLO) messages to the CH. Also, when the CH periodically broadcasts an CH ADvertiSement (CHADS) messages to announce itself to the CMs. Hence, minimizing control overhead messages in any cluster environment is an essential goal to efficiently use the network resources. In this paper, we propose an Enhanced Control Overhead messages Reduction Algorithm (ECORA) with the goal to reduce the CHADS messages that broadcasted by the CHs. Finally, we evaluate the performance of our proposed algorithm by comparing with other similar contributions.","PeriodicalId":174838,"journal":{"name":"2018 IEEE 6th International Conference on Future Internet of Things and Cloud (FiCloud)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Enhanced Control Overhead Messages Reduction Algorithm in VANET\",\"authors\":\"Ahmad Abuashour, M. Kadoch\",\"doi\":\"10.1109/FiCloud.2018.00047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The mobility in Vehicular Ad-Hoc NETworks (VANETs) causes high topology changes and in turn leads to excessive control overhead messages and frequent link communication failures. Traditionally, clustering techniques have been used as the main solution to improve the stability of the clustered topology and to minimize the routing overhead messages generated due to the routing protocols. In the clustering techniques, the network is divided into multiple clusters and selecting one of the Cluster Members (CMs) as a Cluster Head (CH). Still, a problem occurs when the CMs periodically forwards of CM HELLO (CMHELLO) messages to the CH. Also, when the CH periodically broadcasts an CH ADvertiSement (CHADS) messages to announce itself to the CMs. Hence, minimizing control overhead messages in any cluster environment is an essential goal to efficiently use the network resources. In this paper, we propose an Enhanced Control Overhead messages Reduction Algorithm (ECORA) with the goal to reduce the CHADS messages that broadcasted by the CHs. Finally, we evaluate the performance of our proposed algorithm by comparing with other similar contributions.\",\"PeriodicalId\":174838,\"journal\":{\"name\":\"2018 IEEE 6th International Conference on Future Internet of Things and Cloud (FiCloud)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 6th International Conference on Future Internet of Things and Cloud (FiCloud)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FiCloud.2018.00047\",\"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 IEEE 6th International Conference on Future Internet of Things and Cloud (FiCloud)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FiCloud.2018.00047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

车辆自组织网络(VANETs)的移动性导致拓扑变化大,从而导致控制开销消息过多,链路通信故障频繁。传统上,集群技术一直被用作提高集群拓扑稳定性和最小化路由协议产生的路由开销消息的主要解决方案。在聚类技术中,将网络划分为多个簇,并选择其中一个簇成员(CMs)作为簇头(CH)。但是,当CMs周期性地将CMHELLO (CMHELLO)消息转发给CH时,以及当CH周期性地广播CH广告(CHADS)消息向CMs宣布自己时,会出现问题。因此,在任何集群环境中,最小化控制开销消息是有效使用网络资源的基本目标。在本文中,我们提出了一种增强型控制开销消息减少算法(ECORA),其目标是减少CHs广播的CHADS消息。最后,我们通过与其他类似贡献进行比较来评估我们提出的算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Enhanced Control Overhead Messages Reduction Algorithm in VANET
The mobility in Vehicular Ad-Hoc NETworks (VANETs) causes high topology changes and in turn leads to excessive control overhead messages and frequent link communication failures. Traditionally, clustering techniques have been used as the main solution to improve the stability of the clustered topology and to minimize the routing overhead messages generated due to the routing protocols. In the clustering techniques, the network is divided into multiple clusters and selecting one of the Cluster Members (CMs) as a Cluster Head (CH). Still, a problem occurs when the CMs periodically forwards of CM HELLO (CMHELLO) messages to the CH. Also, when the CH periodically broadcasts an CH ADvertiSement (CHADS) messages to announce itself to the CMs. Hence, minimizing control overhead messages in any cluster environment is an essential goal to efficiently use the network resources. In this paper, we propose an Enhanced Control Overhead messages Reduction Algorithm (ECORA) with the goal to reduce the CHADS messages that broadcasted by the CHs. Finally, we evaluate the performance of our proposed algorithm by comparing with other similar contributions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信