雾无线接入网中联合资源分配与用户关联的匹配博弈方法

Xueyan Cao, Chunjing Hu, Shi Yan
{"title":"雾无线接入网中联合资源分配与用户关联的匹配博弈方法","authors":"Xueyan Cao, Chunjing Hu, Shi Yan","doi":"10.1109/ICCChinaW.2018.8674520","DOIUrl":null,"url":null,"abstract":"Fog computing based radio access network (F-RAN) has been regarded as a paradigm with great promise to provide high spectral and energy efficiency with edge devices, and has recently attracted lots of attention. In this paper, we focus on joint user association and resource allocation to optimize the user average file download delay in a device-to-device (D2D) enabled F-RAN. The optimization problem is formulated as a mixed-integer nonlinear programming problem, which can be proved as a NP-hard problem. To solve the problem efficiently, a matching game based algorithm is proposed, where D2D users and fog access points (F-APs) can adjust wireless resource allocation autonomously according to the condition of swap matching. Simulation results verify the accuracy of our analysis and show that the proposed algorithm can achieve a near optimal performance with a fast convergence speed. Meanwhile, the impacts of the cache size of F-APs, the number of users, and the fairness are demonstrated as well.","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Matching Game Approach for Joint Resource Allocation and User Association in Fog Radio Access Networks\",\"authors\":\"Xueyan Cao, Chunjing Hu, Shi Yan\",\"doi\":\"10.1109/ICCChinaW.2018.8674520\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fog computing based radio access network (F-RAN) has been regarded as a paradigm with great promise to provide high spectral and energy efficiency with edge devices, and has recently attracted lots of attention. In this paper, we focus on joint user association and resource allocation to optimize the user average file download delay in a device-to-device (D2D) enabled F-RAN. The optimization problem is formulated as a mixed-integer nonlinear programming problem, which can be proved as a NP-hard problem. To solve the problem efficiently, a matching game based algorithm is proposed, where D2D users and fog access points (F-APs) can adjust wireless resource allocation autonomously according to the condition of swap matching. Simulation results verify the accuracy of our analysis and show that the proposed algorithm can achieve a near optimal performance with a fast convergence speed. Meanwhile, the impacts of the cache size of F-APs, the number of users, and the fairness are demonstrated as well.\",\"PeriodicalId\":201746,\"journal\":{\"name\":\"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCChinaW.2018.8674520\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCChinaW.2018.8674520","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基于雾计算的无线接入网络(F-RAN)被认为是一种极有希望为边缘设备提供高频谱和高能效的模式,近年来引起了人们的广泛关注。在本文中,我们关注联合用户关联和资源分配,以优化设备到设备(D2D)启用的F-RAN中的用户平均文件下载延迟。将优化问题表述为一个混合整数非线性规划问题,可证明为np困难问题。为了有效地解决这一问题,提出了一种基于匹配博弈的D2D用户和雾接入点(f - ap)可以根据交换匹配的条件自主调整无线资源分配的算法。仿真结果验证了分析的准确性,并表明该算法能够以较快的收敛速度获得接近最优的性能。同时,对f - ap的缓存大小、用户数量和公平性的影响也进行了论证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Matching Game Approach for Joint Resource Allocation and User Association in Fog Radio Access Networks
Fog computing based radio access network (F-RAN) has been regarded as a paradigm with great promise to provide high spectral and energy efficiency with edge devices, and has recently attracted lots of attention. In this paper, we focus on joint user association and resource allocation to optimize the user average file download delay in a device-to-device (D2D) enabled F-RAN. The optimization problem is formulated as a mixed-integer nonlinear programming problem, which can be proved as a NP-hard problem. To solve the problem efficiently, a matching game based algorithm is proposed, where D2D users and fog access points (F-APs) can adjust wireless resource allocation autonomously according to the condition of swap matching. Simulation results verify the accuracy of our analysis and show that the proposed algorithm can achieve a near optimal performance with a fast convergence speed. Meanwhile, the impacts of the cache size of F-APs, the number of users, and the fairness are demonstrated as well.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信