User Association in Dense Millimeter Wave Networks With Multi-Channel Access Points Using the Whittle Index

IF 6.3 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Open Journal of the Communications Society Pub Date : 2024-08-21 DOI:10.1109/OJCOMS.2024.3447157
Ravindra S. Tomar;Mandar R. Nalavade;Gaurav S. Kasbekar
{"title":"User Association in Dense Millimeter Wave Networks With Multi-Channel Access Points Using the Whittle Index","authors":"Ravindra S. Tomar;Mandar R. Nalavade;Gaurav S. Kasbekar","doi":"10.1109/OJCOMS.2024.3447157","DOIUrl":null,"url":null,"abstract":"In dense millimeter wave (mmWave) networks, user association, i.e., the task of selecting the access point (AP) that each arriving user should join, significantly impacts the network performance. We consider a dense mmWave network in which each AP has multiple channels and can simultaneously serve different users using different channels. The different channels of an AP are susceptible to both blockage, which is common to all the channels of an AP, and frequency-selective fading, which is, in general, different for different channels. In each time slot, a user arrives with some probability. Our objective is to design a user association scheme for selecting the AP that each arriving user should join, so as to minimize the long-term total average holding cost incurred within the system, and thereby achieve low average delays experienced by users. This problem is an instance of the restless multi-armed bandit problem, and is provably hard to solve. We prove that the problem is Whittle indexable and present a method for calculating the Whittle indices corresponding to the different APs by solving linear systems of equations. We propose a user association policy under which, when a user arrives, it associates with the AP that has the lowest Whittle index in that time slot. Our extensive simulation results demonstrate that our proposed Whittle index-based policy outperforms user association policies proposed in prior research in terms of the average delay, average cost, as well as Jain’s fairness index (JFI).","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3000,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10643173","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of the Communications Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10643173/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

In dense millimeter wave (mmWave) networks, user association, i.e., the task of selecting the access point (AP) that each arriving user should join, significantly impacts the network performance. We consider a dense mmWave network in which each AP has multiple channels and can simultaneously serve different users using different channels. The different channels of an AP are susceptible to both blockage, which is common to all the channels of an AP, and frequency-selective fading, which is, in general, different for different channels. In each time slot, a user arrives with some probability. Our objective is to design a user association scheme for selecting the AP that each arriving user should join, so as to minimize the long-term total average holding cost incurred within the system, and thereby achieve low average delays experienced by users. This problem is an instance of the restless multi-armed bandit problem, and is provably hard to solve. We prove that the problem is Whittle indexable and present a method for calculating the Whittle indices corresponding to the different APs by solving linear systems of equations. We propose a user association policy under which, when a user arrives, it associates with the AP that has the lowest Whittle index in that time slot. Our extensive simulation results demonstrate that our proposed Whittle index-based policy outperforms user association policies proposed in prior research in terms of the average delay, average cost, as well as Jain’s fairness index (JFI).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用惠特尔指数在具有多通道接入点的密集毫米波网络中建立用户关联
在密集毫米波(mmWave)网络中,用户关联(即为每个到达的用户选择应加入的接入点(AP))会对网络性能产生重大影响。我们认为,在密集毫米波网络中,每个接入点都有多个信道,可以同时为使用不同信道的不同用户提供服务。一个接入点的不同信道容易受到阻塞和频率选择性衰落的影响,前者对接入点的所有信道都是共通的,而后者对不同信道一般是不同的。在每个时隙中,用户以一定的概率到达。我们的目标是设计一种用户关联方案,用于选择每个到达用户应加入的接入点,从而使系统内产生的长期总平均持有成本最小,并因此实现用户所经历的低平均延迟。这个问题是不安分的多臂强盗问题的一个实例,证明很难解决。我们证明了该问题的惠特尔指数性,并提出了一种通过求解线性方程组来计算不同接入点对应的惠特尔指数的方法。我们提出了一种用户关联策略,根据该策略,当用户到达时,它会与该时隙中惠特尔指数最低的接入点关联。我们的大量模拟结果表明,我们提出的基于惠特尔指数的策略在平均延迟、平均成本和詹恩公平指数(JFI)方面都优于之前研究中提出的用户关联策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
13.70
自引率
3.80%
发文量
94
审稿时长
10 weeks
期刊介绍: The IEEE Open Journal of the Communications Society (OJ-COMS) is an open access, all-electronic journal that publishes original high-quality manuscripts on advances in the state of the art of telecommunications systems and networks. The papers in IEEE OJ-COMS are included in Scopus. Submissions reporting new theoretical findings (including novel methods, concepts, and studies) and practical contributions (including experiments and development of prototypes) are welcome. Additionally, survey and tutorial articles are considered. The IEEE OJCOMS received its debut impact factor of 7.9 according to the Journal Citation Reports (JCR) 2023. The IEEE Open Journal of the Communications Society covers science, technology, applications and standards for information organization, collection and transfer using electronic, optical and wireless channels and networks. Some specific areas covered include: Systems and network architecture, control and management Protocols, software, and middleware Quality of service, reliability, and security Modulation, detection, coding, and signaling Switching and routing Mobile and portable communications Terminals and other end-user devices Networks for content distribution and distributed computing Communications-based distributed resources control.
期刊最新文献
Applied Federated Model Personalization in the Industrial Domain: A Comparative Study Federated Learning: Challenges, SoTA, Performance Improvements and Application Domains A Worst-Case Latency and Age Analysis of Coded Distributed Computing With Unreliable Workers and Periodic Tasks Sparse Bayesian Learning Using Complex t-Prior for Beam-Domain Massive MIMO Channel Estimation Privacy-Preserving Hierarchical Reinforcement Learning Framework for Task Offloading in Low-Altitude Vehicular Fog Computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1