Priority- and Reservation-based Slicing for Future Vehicular Networks

Abdullah A. Al-khatib, Abdelmajid Khelil
{"title":"Priority- and Reservation-based Slicing for Future Vehicular Networks","authors":"Abdullah A. Al-khatib, Abdelmajid Khelil","doi":"10.1109/NetSoft48620.2020.9165489","DOIUrl":null,"url":null,"abstract":"We consider the wireless network utility maximization problem for various vehicular applications with different priorities. Our approach jointly optimizes bandwidth reservation and immediate slicing allocation based on priorities. The basestation-vehicle association happens in a two-tier heterogeneous wireless network. We first determine a sub-optimal network bandwidth reservation ratio and slicing allocation ratio based on sub-optimal basestation association. To this end, we formulate the problem as a biconcave maximization problem which we solve using an alternative concave search algorithm. Intensive simulations demonstrate that the proposed priority-based reservation and slicing allocation scheme outperforms the conventional slicing allocation schemes in terms of efficiency in network resource utilization.","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NetSoft48620.2020.9165489","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

We consider the wireless network utility maximization problem for various vehicular applications with different priorities. Our approach jointly optimizes bandwidth reservation and immediate slicing allocation based on priorities. The basestation-vehicle association happens in a two-tier heterogeneous wireless network. We first determine a sub-optimal network bandwidth reservation ratio and slicing allocation ratio based on sub-optimal basestation association. To this end, we formulate the problem as a biconcave maximization problem which we solve using an alternative concave search algorithm. Intensive simulations demonstrate that the proposed priority-based reservation and slicing allocation scheme outperforms the conventional slicing allocation schemes in terms of efficiency in network resource utilization.
基于优先级和预留的未来车辆网络切片
针对不同优先级的车载应用,研究无线网络效用最大化问题。我们的方法共同优化了带宽预留和基于优先级的即时切片分配。基站与车辆的关联发生在两层异构无线网络中。首先基于次优基站关联确定次优网络带宽保留比和切片分配比。为此,我们将该问题表述为一个双凹最大化问题,并使用另一种凹搜索算法进行求解。仿真结果表明,本文提出的基于优先级的预留和切片分配方案在网络资源利用率方面优于传统的切片分配方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信