郑豪,,
崔亚平
1.重庆邮电大学通信与信息工程学院 重庆 400065
2.重庆高校市级光通信与网络重点实验室 重庆 400065
3.泛在感知与互联重庆市重点实验室 重庆 400065
基金项目:国家自然科学基金(61871062, 61771082, 61801065)，重庆市高校创新团队建设计划资助项目(CXTDX201601020)
详细信息
作者简介:吴大鹏：男，1979年生，教授，研究方向为泛在无线网络、社会计算、无线网络服务质量控制等
郑豪：1995年生，硕士生，研究方向为车联网、网络切片与虚拟化
崔亚平：1986年生，讲师，研究方向为毫米波通信、多天线技术、车联网等
通讯作者:郑豪 547721540@qq.com
中图分类号:TN915; TP393计量
文章访问数:2019
HTML全文浏览量:840
PDF下载量:52
被引次数:0
出版历程
收稿日期:2019-08-26
修回日期:2020-03-10
网络出版日期:2020-04-21
刊出日期:2020-08-18
Service-oriented Coordination agent Design for Network Slicing in Vehicular Networks
Dapeng WU,Hao ZHENG,,
Yaping CUI
1. School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications,Chongqing 400065, China
2. Optical Communication and Networks Key Laboratory of Chongqing, Chongqing 400065, China
3. Ubiquitous Sensing and Networking Key Laboratory of Chongqing, Chongqing 400065, China
Funds:The National Natural Science Foundation of China (61871062, 61771082, 61801065), The Program for Innovation Team Building at Institutions of Higher Education in Chongqing (CXTDX201601020)
摘要
摘要:针对现有研究中缺乏对车辆网络切片的部署和管理，该文设计了车辆网络切片架构中的切片协调智能体。首先基于K-means++聚类算法将车联网通信业务根据相似度进行聚类并映射到对应的切片中。其次，在考虑应用场景间的时空差异导致的无线资源利用不均衡现象，提出了共享比例公平方案以实现对无线资源的高效及差异化利用。最后，为了保证切片服务需求，采用线性规划障碍方法求解最优的切片权重分配，使切片负载变化容忍度最大化。仿真结果表明，共享比例公平方案相比于静态切片方案平均比特传输时延(BTD)更小，在每切片用户数为30的情况下均匀分布用户负载场景中二者的BTD增益为1.4038，且在不同的用户负载分布场景下都能求出最优的切片权重分配。
关键词:车联网/
5G网络切片/
聚类/
资源分配
Abstract:In view of the lack of deployment and management of slicing in vehicular network, a slice coordination agent of vehicular network slicing structure is designed. Firstly, based on the K-means++ clustering algorithm, the vehicle network communication services are clustered according to the similarity and then mapped into different slices. Secondly, considering the imbalance of radio resource utilization caused by the space-time characteristic among application scenarios, a shared proportional fairness scheme is proposed to utilize radio resources efficiently and differently. Finally, in order to ensure the requirements of slicing service, linear programming obstacle method is used to solve the optimal slice weight distribution to maximize the slice load variation tolerance. Simulation results show that the shared proportional fairness scheme has smaller average Bit Transmission Delay (BTD) than the static slicing scheme, and the optimal slice weight distribution can be obtained under different user load distribution scenarios. The BTD gain achieves 1.4038 in the uniform user load scenario with 30 users per slice.
Key words:Vehicular networks/
5G network slicing/
Clustering/
Resource allocation
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=5247d767-325c-43f3-844e-8ec03de900ea
