基于联盟的减少VANETs饱和和拥塞的方法

Kahina Ouazine, Hachem Slimani, Hassina Nacer, Jugurta Oudia, Nadira Maouche
{"title":"基于联盟的减少VANETs饱和和拥塞的方法","authors":"Kahina Ouazine, Hachem Slimani, Hassina Nacer, Jugurta Oudia, Nadira Maouche","doi":"10.1109/ISPS.2018.8379003","DOIUrl":null,"url":null,"abstract":"Vehicular Ad hoc Networks (VANETs) have received special attention from scientists because of their importance in daily life. In VANETs, we mainly find fixed entities (Road Side Units “RSUs”) and mobile entities (vehicles). In order to exchange information and data relating to the safety and comfort of road users, these different entities must establish communications between them. In these communications, one of the main problems is related to congestion and saturation of RSUs. To solve this problem, we propose in this paper a new approach of cooperation between the RSUs of a VANET in order to reduce its congestion and thus to avoid as much as possible the saturation of these RSUs. This approach, called “D2A2RS” (Defensive Alliance based Approach for Reducing RSUs Saturation), is based on the concept of defensive alliances in graphs that ensures efficient collaboration between the RSUs. Furthermore, we propose two analytical models based on Markov chains to compare our D2A2RS protocol with a concurrent protocol (IAGR). The obtained comparaison results have shown the efficiency and the performance of our approach in terms of packet loss.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Alliance based approach for reducing saturation and congestion in VANETs\",\"authors\":\"Kahina Ouazine, Hachem Slimani, Hassina Nacer, Jugurta Oudia, Nadira Maouche\",\"doi\":\"10.1109/ISPS.2018.8379003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicular Ad hoc Networks (VANETs) have received special attention from scientists because of their importance in daily life. In VANETs, we mainly find fixed entities (Road Side Units “RSUs”) and mobile entities (vehicles). In order to exchange information and data relating to the safety and comfort of road users, these different entities must establish communications between them. In these communications, one of the main problems is related to congestion and saturation of RSUs. To solve this problem, we propose in this paper a new approach of cooperation between the RSUs of a VANET in order to reduce its congestion and thus to avoid as much as possible the saturation of these RSUs. This approach, called “D2A2RS” (Defensive Alliance based Approach for Reducing RSUs Saturation), is based on the concept of defensive alliances in graphs that ensures efficient collaboration between the RSUs. Furthermore, we propose two analytical models based on Markov chains to compare our D2A2RS protocol with a concurrent protocol (IAGR). The obtained comparaison results have shown the efficiency and the performance of our approach in terms of packet loss.\",\"PeriodicalId\":294761,\"journal\":{\"name\":\"2018 International Symposium on Programming and Systems (ISPS)\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Symposium on Programming and Systems (ISPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPS.2018.8379003\",\"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 Symposium on Programming and Systems (ISPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPS.2018.8379003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

车辆自组织网络(VANETs)因其在日常生活中的重要性而受到了科学家们的特别关注。在vanet中,我们主要发现固定实体(路边单位“rsu”)和移动实体(车辆)。为了交换与道路使用者的安全和舒适有关的信息和数据,这些不同的实体必须在它们之间建立通信。在这些通信中,一个主要问题是与rsu的拥塞和饱和有关。为了解决这一问题,本文提出了一种新的路由单元之间的合作方法,以减少其拥塞,从而尽可能避免这些路由单元的饱和。这种方法被称为“D2A2RS”(减少rsu饱和的基于防御联盟的方法),它基于图中的防御联盟概念,确保了rsu之间的有效协作。此外,我们提出了两个基于马尔可夫链的分析模型,将我们的D2A2RS协议与并发协议(IAGR)进行比较。对比结果表明了本文方法在丢包方面的有效性和性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Alliance based approach for reducing saturation and congestion in VANETs
Vehicular Ad hoc Networks (VANETs) have received special attention from scientists because of their importance in daily life. In VANETs, we mainly find fixed entities (Road Side Units “RSUs”) and mobile entities (vehicles). In order to exchange information and data relating to the safety and comfort of road users, these different entities must establish communications between them. In these communications, one of the main problems is related to congestion and saturation of RSUs. To solve this problem, we propose in this paper a new approach of cooperation between the RSUs of a VANET in order to reduce its congestion and thus to avoid as much as possible the saturation of these RSUs. This approach, called “D2A2RS” (Defensive Alliance based Approach for Reducing RSUs Saturation), is based on the concept of defensive alliances in graphs that ensures efficient collaboration between the RSUs. Furthermore, we propose two analytical models based on Markov chains to compare our D2A2RS protocol with a concurrent protocol (IAGR). The obtained comparaison results have shown the efficiency and the performance of our approach in terms of packet loss.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信