基于传输功率的车联网公平分布式拥塞控制

E. Egea-López
{"title":"基于传输功率的车联网公平分布式拥塞控制","authors":"E. Egea-López","doi":"10.1109/WoWMoM.2016.7523571","DOIUrl":null,"url":null,"abstract":"We model the problem of beaconing congestion control as a Network Utility Maximization (NUM) transmit power allocation problem. We propose a distributed congestion control algorithm by transmit power adaptation called FCCP, which allows to dynamically select the appropriate fairness notion. Our results show that FCCP converges to the close proximity of the optimal value both in static and dynamic multihop scenarios while keeping the channel load at the desired level.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Fair distributed Congestion Control with transmit power for vehicular networks\",\"authors\":\"E. Egea-López\",\"doi\":\"10.1109/WoWMoM.2016.7523571\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We model the problem of beaconing congestion control as a Network Utility Maximization (NUM) transmit power allocation problem. We propose a distributed congestion control algorithm by transmit power adaptation called FCCP, which allows to dynamically select the appropriate fairness notion. Our results show that FCCP converges to the close proximity of the optimal value both in static and dynamic multihop scenarios while keeping the channel load at the desired level.\",\"PeriodicalId\":187747,\"journal\":{\"name\":\"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WoWMoM.2016.7523571\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WoWMoM.2016.7523571","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

我们将信标拥塞控制问题建模为网络效用最大化(NUM)发送功率分配问题。提出了一种基于发送功率自适应的分布式拥塞控制算法FCCP,该算法可以动态选择合适的公平性概念。结果表明,在静态和动态多跳情况下,FCCP收敛到最优值的附近,同时保持信道负载在期望的水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fair distributed Congestion Control with transmit power for vehicular networks
We model the problem of beaconing congestion control as a Network Utility Maximization (NUM) transmit power allocation problem. We propose a distributed congestion control algorithm by transmit power adaptation called FCCP, which allows to dynamically select the appropriate fairness notion. Our results show that FCCP converges to the close proximity of the optimal value both in static and dynamic multihop scenarios while keeping the channel load at the desired level.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信