车辆网络的公平分散拥塞和感知控制

Matthias Sander Frigau
{"title":"车辆网络的公平分散拥塞和感知控制","authors":"Matthias Sander Frigau","doi":"10.1109/ICPADS.2015.30","DOIUrl":null,"url":null,"abstract":"Challenges surrounding 802.11p vehicular networks have become more apparent in recent years within the research community. The exchange of periodical beacons on the control channel is mandatory to support higher layer applications such as active safety applications. However, the nature of such wireless vehicular networks imposes a lot of serious problems, especially the risk that the radio channel becomes quickly saturated. Thus, congestion control and awareness control are crucial mechanisms to control the load and ensure that each vehicle is able to communicate with its most relevant neighbours respectively. In this paper, we tackle jointly congestion and awareness control by taking into consideration 2-hops influence, hidden-terminals, SINR, received power, and a fair bandwidth indicator measuring the performance distribution among a coalition of vehicles in a highly volatile vehicular network. A two-steps proactive distributed algorithm called TPA+IAB is proposed to improve the fair bandwidth utilization. Each step of the algorithm achieves a distinct goal: Intelligent Adaptive Beaconing (IAB) is in charge of controlling the congestion while the Transmit Power Adaptation (TPA) is in charge of controlling which neighbour should be part of a coalition with respect to down-link channel qualities. Different from awareness control algorithms which assume an optimal channel model, here a more realistic model is used to estimate dynamically the best communication range based on a non-deterministic propagation model. Realistic simulations with NS-3 show that the solution presented outperforms the well-known D-FPAV algorithm in non-homogeneous graphs.","PeriodicalId":231517,"journal":{"name":"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Fair Decentralized Congestion and Awareness Control for Vehicular Networks\",\"authors\":\"Matthias Sander Frigau\",\"doi\":\"10.1109/ICPADS.2015.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Challenges surrounding 802.11p vehicular networks have become more apparent in recent years within the research community. The exchange of periodical beacons on the control channel is mandatory to support higher layer applications such as active safety applications. However, the nature of such wireless vehicular networks imposes a lot of serious problems, especially the risk that the radio channel becomes quickly saturated. Thus, congestion control and awareness control are crucial mechanisms to control the load and ensure that each vehicle is able to communicate with its most relevant neighbours respectively. In this paper, we tackle jointly congestion and awareness control by taking into consideration 2-hops influence, hidden-terminals, SINR, received power, and a fair bandwidth indicator measuring the performance distribution among a coalition of vehicles in a highly volatile vehicular network. A two-steps proactive distributed algorithm called TPA+IAB is proposed to improve the fair bandwidth utilization. Each step of the algorithm achieves a distinct goal: Intelligent Adaptive Beaconing (IAB) is in charge of controlling the congestion while the Transmit Power Adaptation (TPA) is in charge of controlling which neighbour should be part of a coalition with respect to down-link channel qualities. Different from awareness control algorithms which assume an optimal channel model, here a more realistic model is used to estimate dynamically the best communication range based on a non-deterministic propagation model. Realistic simulations with NS-3 show that the solution presented outperforms the well-known D-FPAV algorithm in non-homogeneous graphs.\",\"PeriodicalId\":231517,\"journal\":{\"name\":\"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.2015.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.2015.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

近年来,围绕802.11p车载网络的挑战在研究领域变得越来越明显。控制通道上周期性信标的交换是强制性的,以支持更高层的应用,如主动安全应用。然而,这种无线车载网络的性质带来了许多严重的问题,特别是无线电频道迅速饱和的风险。因此,拥塞控制和感知控制是控制负载的关键机制,并确保每辆车能够分别与最相关的邻居进行通信。在本文中,我们通过考虑2跳影响、隐藏终端、SINR、接收功率以及衡量高度不稳定的车辆网络中车辆联盟之间性能分布的公平带宽指标,共同解决拥塞和感知控制问题。为了提高公平的带宽利用率,提出了一种两步主动分布式算法TPA&plus IAB。算法的每一步都实现了一个明确的目标:智能自适应信标(IAB)负责控制拥塞,而发射功率自适应(TPA)负责根据下行信道质量控制哪个邻居应该成为联盟的一部分。与感知控制算法假设最优信道模型不同,本文采用一种基于非确定性传播模型的更现实的模型来动态估计最佳通信距离。NS-3的仿真结果表明,该算法在非齐次图中的性能优于著名的D-FPAV算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fair Decentralized Congestion and Awareness Control for Vehicular Networks
Challenges surrounding 802.11p vehicular networks have become more apparent in recent years within the research community. The exchange of periodical beacons on the control channel is mandatory to support higher layer applications such as active safety applications. However, the nature of such wireless vehicular networks imposes a lot of serious problems, especially the risk that the radio channel becomes quickly saturated. Thus, congestion control and awareness control are crucial mechanisms to control the load and ensure that each vehicle is able to communicate with its most relevant neighbours respectively. In this paper, we tackle jointly congestion and awareness control by taking into consideration 2-hops influence, hidden-terminals, SINR, received power, and a fair bandwidth indicator measuring the performance distribution among a coalition of vehicles in a highly volatile vehicular network. A two-steps proactive distributed algorithm called TPA+IAB is proposed to improve the fair bandwidth utilization. Each step of the algorithm achieves a distinct goal: Intelligent Adaptive Beaconing (IAB) is in charge of controlling the congestion while the Transmit Power Adaptation (TPA) is in charge of controlling which neighbour should be part of a coalition with respect to down-link channel qualities. Different from awareness control algorithms which assume an optimal channel model, here a more realistic model is used to estimate dynamically the best communication range based on a non-deterministic propagation model. Realistic simulations with NS-3 show that the solution presented outperforms the well-known D-FPAV algorithm in non-homogeneous graphs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信