On Rate Fairness Maximization of Vehicular Networks: A Deep Reinforcement Learning Approach

Shenghui Zhao, Bao Gui, Guilin Chen, Bin Yang
{"title":"On Rate Fairness Maximization of Vehicular Networks: A Deep Reinforcement Learning Approach","authors":"Shenghui Zhao, Bao Gui, Guilin Chen, Bin Yang","doi":"10.1109/NaNA56854.2022.00027","DOIUrl":null,"url":null,"abstract":"This paper investigates the rate fairness maximization (FM) in a vehicular network consisting of multiple vehicle-to-vehicle(V2V) pairs and vehicle-to-infrastructure (V2I) pairs. To this end, we formulate the FM as an optimal problem subject to the constraints of the quality of service (QoS) requirements, spectrum and power resources. It is usually challenging to solve this nonlinear and nonconvex optimization problem. To tackle with this challenge, we further model the spectrum sharing between V2V and V2I links, and the transmit powers of V2V and V2I users as a Markov decision process. Then, a deep reinforcement learning-based algorithm is proposed to maximize the rate fairness while meeting the constraints of the QoS requirements by jointly optimizing the allocations of spectrum and power resources. Finally, simulation results are presented to illustrate our findings.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA56854.2022.00027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper investigates the rate fairness maximization (FM) in a vehicular network consisting of multiple vehicle-to-vehicle(V2V) pairs and vehicle-to-infrastructure (V2I) pairs. To this end, we formulate the FM as an optimal problem subject to the constraints of the quality of service (QoS) requirements, spectrum and power resources. It is usually challenging to solve this nonlinear and nonconvex optimization problem. To tackle with this challenge, we further model the spectrum sharing between V2V and V2I links, and the transmit powers of V2V and V2I users as a Markov decision process. Then, a deep reinforcement learning-based algorithm is proposed to maximize the rate fairness while meeting the constraints of the QoS requirements by jointly optimizing the allocations of spectrum and power resources. Finally, simulation results are presented to illustrate our findings.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于深度强化学习的车辆网络公平性最大化研究
本文研究了由多个车对车(V2V)对和车对基础设施(V2I)对组成的车辆网络中的速率公平最大化问题。为此,我们将调频描述为受服务质量(QoS)要求、频谱和功率资源约束的最优问题。求解这种非线性非凸优化问题通常具有挑战性。为了应对这一挑战,我们进一步将V2V和V2I链路之间的频谱共享以及V2V和V2I用户的发射功率建模为马尔可夫决策过程。然后,提出了一种基于深度强化学习的算法,通过联合优化频谱和功率资源的分配,在满足QoS要求的约束条件下,最大限度地提高速率公平性。最后,给出了仿真结果来说明我们的发现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Load balancing strategy for wireless multi-hotspot networks based on improved NSGA-II algorithm Link-ability: A Prediction Method of Web Service Compatibility based on Markov Process User-centric Service System for Network beyond IMT-2020 (5G) Identifying Those Who Really Need Subsidies: A Data-Driven Approach TCS Security Analysis in Intel SGX Enclave MultiThreading
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1