虚拟化5G蜂窝网络中的用户匹配博弈

T. Le, Nguyen H. Tran, Tuan LeAnh, C. Hong
{"title":"虚拟化5G蜂窝网络中的用户匹配博弈","authors":"T. Le, Nguyen H. Tran, Tuan LeAnh, C. Hong","doi":"10.1109/APNOMS.2016.7737278","DOIUrl":null,"url":null,"abstract":"Recently, wireless virtualization has attracted more and more attentions from research communities. With virtualization, resource utilization is higher, system performance is improved and the investment capital is lower. However, there are remaining challenges to be addressed before wireless virtualization is widespread deployed. One challenge is user association which has great influence on the performance of the wireless virtualization network. Traditionally, user associates to the base station (BS) who provides the highest signal to interference plus noise ratio (max-SINR). However, this scheme may not guarantee the quality of service (QoS) of users and backhaul constraint of infrastructure providers (InPs). This motivates us to investigate the user association problem in virtualized cellular networks in this paper. We formulate the user-BS association as a matching game. We show that the preferences used to rank one another are independent and affected by the existing matching. Therefore, this game can be classified as the one-to-many matching game with externalities. In addition, we present a distributed algorithm to find the stable outcome of this game. Simulation results show that the presented association scheme is better than traditional scheme.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"User matching game in virtualized 5G cellular networks\",\"authors\":\"T. Le, Nguyen H. Tran, Tuan LeAnh, C. Hong\",\"doi\":\"10.1109/APNOMS.2016.7737278\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, wireless virtualization has attracted more and more attentions from research communities. With virtualization, resource utilization is higher, system performance is improved and the investment capital is lower. However, there are remaining challenges to be addressed before wireless virtualization is widespread deployed. One challenge is user association which has great influence on the performance of the wireless virtualization network. Traditionally, user associates to the base station (BS) who provides the highest signal to interference plus noise ratio (max-SINR). However, this scheme may not guarantee the quality of service (QoS) of users and backhaul constraint of infrastructure providers (InPs). This motivates us to investigate the user association problem in virtualized cellular networks in this paper. We formulate the user-BS association as a matching game. We show that the preferences used to rank one another are independent and affected by the existing matching. Therefore, this game can be classified as the one-to-many matching game with externalities. In addition, we present a distributed algorithm to find the stable outcome of this game. Simulation results show that the presented association scheme is better than traditional scheme.\",\"PeriodicalId\":194123,\"journal\":{\"name\":\"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APNOMS.2016.7737278\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APNOMS.2016.7737278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

近年来,无线虚拟化技术越来越受到学术界的关注。虚拟化可以提高资源利用率,提高系统性能,降低投资成本。然而,在广泛部署无线虚拟化之前,仍有一些挑战需要解决。其中一个挑战是用户关联,它对无线虚拟化网络的性能有很大的影响。传统上,用户与提供最高信噪比(max-SINR)的基站(BS)联系。但该方案不能保证用户的服务质量(QoS)和基础设施提供商(inp)的回程约束。这促使我们对虚拟蜂窝网络中的用户关联问题进行研究。我们将用户- bs关联定义为匹配博弈。我们证明了用于排序的偏好是独立的,并且受现有匹配的影响。因此,该博弈可以归类为具有外部性的一对多匹配博弈。此外,我们还提出了一种分布式算法来寻找该博弈的稳定结果。仿真结果表明,所提出的关联方案优于传统的关联方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
User matching game in virtualized 5G cellular networks
Recently, wireless virtualization has attracted more and more attentions from research communities. With virtualization, resource utilization is higher, system performance is improved and the investment capital is lower. However, there are remaining challenges to be addressed before wireless virtualization is widespread deployed. One challenge is user association which has great influence on the performance of the wireless virtualization network. Traditionally, user associates to the base station (BS) who provides the highest signal to interference plus noise ratio (max-SINR). However, this scheme may not guarantee the quality of service (QoS) of users and backhaul constraint of infrastructure providers (InPs). This motivates us to investigate the user association problem in virtualized cellular networks in this paper. We formulate the user-BS association as a matching game. We show that the preferences used to rank one another are independent and affected by the existing matching. Therefore, this game can be classified as the one-to-many matching game with externalities. In addition, we present a distributed algorithm to find the stable outcome of this game. Simulation results show that the presented association scheme is better than traditional scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信