Interference Aware Optimal Resource Allocation on V2X Networks

Uygar Demir, Baris Yuksekkaya, C. Toker
{"title":"Interference Aware Optimal Resource Allocation on V2X Networks","authors":"Uygar Demir, Baris Yuksekkaya, C. Toker","doi":"10.1109/SIU.2019.8806607","DOIUrl":null,"url":null,"abstract":"In this work, optimum transmit power allocation in V2X networks to maximize the aggregate data rate in the V2I network without violating individual peak transmit power constraints on the V2I users and the interference power constraints on the V2V users is considered. In the proposed model, V2I users form a multiple-access channel to the roadside unit and cause interference in the V2V network. Under this setup, it is first shown that the data rate maximizing optimum power allocation vector lies at one of the vertices of the feasible set of all transmit power vectors. The structure derived for the optimum power allocation vectors simplifies the solution of the power optimization problem significantly. That is, calculating and comparing the data rates at the vertices of the feasible power set, the optimum power allocation vector can be derived for each channel state. Furthermore, with the entry of each new V2V user to the system, the number of vertices increases at most by 3. Time division multiple access solution as a special case appears by a subset of our solution. In the final part of the paper, the theoretical results obtained are utilized to give numerical performance figures for V2X networks.","PeriodicalId":326275,"journal":{"name":"2019 27th Signal Processing and Communications Applications Conference (SIU)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 27th Signal Processing and Communications Applications Conference (SIU)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2019.8806607","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this work, optimum transmit power allocation in V2X networks to maximize the aggregate data rate in the V2I network without violating individual peak transmit power constraints on the V2I users and the interference power constraints on the V2V users is considered. In the proposed model, V2I users form a multiple-access channel to the roadside unit and cause interference in the V2V network. Under this setup, it is first shown that the data rate maximizing optimum power allocation vector lies at one of the vertices of the feasible set of all transmit power vectors. The structure derived for the optimum power allocation vectors simplifies the solution of the power optimization problem significantly. That is, calculating and comparing the data rates at the vertices of the feasible power set, the optimum power allocation vector can be derived for each channel state. Furthermore, with the entry of each new V2V user to the system, the number of vertices increases at most by 3. Time division multiple access solution as a special case appears by a subset of our solution. In the final part of the paper, the theoretical results obtained are utilized to give numerical performance figures for V2X networks.
基于干扰感知的V2X网络资源优化分配
本文考虑了在不违反V2I用户的峰值发射功率约束和V2V用户的干扰功率约束的前提下,使V2I网络的总数据速率最大化的V2X网络发射功率优化分配问题。在提出的模型中,V2I用户与路边单元形成多址通道,并对V2V网络造成干扰。在此设置下,首先证明了数据速率最大化的最优功率分配向量位于所有发射功率向量可行集的一个顶点。所导出的最优功率分配向量的结构大大简化了功率优化问题的求解。即通过计算和比较可行功率集各顶点的数据速率,得出各信道状态下的最优功率分配向量。此外,随着每个新的V2V用户进入系统,顶点的数量最多增加3个。时分多址解决方案作为一种特殊情况,由我们的解决方案的一个子集出现。在论文的最后一部分,利用得到的理论结果给出了V2X网络的数值性能数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信