On User Scheduling for Fixed Wireless Access via Channel Statistics

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Xin Guan;Zhixing Chen;Yibin Kang;Qi Yan;Qingjiang Shi
{"title":"On User Scheduling for Fixed Wireless Access via Channel Statistics","authors":"Xin Guan;Zhixing Chen;Yibin Kang;Qi Yan;Qingjiang Shi","doi":"10.1109/TMC.2024.3524565","DOIUrl":null,"url":null,"abstract":"Conventional multi-user scheduling in cellular networks are required to make a decision every transmission time interval (TTI) of at most several milliseconds. Only quite simple schemes can be implemented under the stringent time constraint, resulting in far-from-optimum performance. In this paper, we focus on the case of scheduling multiple users in a fixed wireless access (FWA) network with stable channel characteristics. We propose a scheduling approach by which a high-quality scheduling decision based on statistical channel state information (CSI) is made across all TTIs instead of making simple TTI-level decisions. The proposed design is essentially a mixed-integer non-smooth non-convex stochastic problem. We first replace the indicator functions in the formulation by smooth sigmoid functions to tackle nonsmoothness. By leveraging deterministic equivalents (D.E.), we then convert the original stochastic problem into an approximated deterministic one, followed by linear relaxation of the integer constraints. However, the converted problem is still nonconvex due to implicit equation constraints formerly introduced by D.E. Therefore, we employ implicit optimization technique to compute the gradient explicitly, with which we further propose an algorithm design based on a modified version of Frank–Wolfe method. Numerical results verify the effectiveness of our proposed scheme.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 5","pages":"4040-4052"},"PeriodicalIF":7.7000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10819615/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Conventional multi-user scheduling in cellular networks are required to make a decision every transmission time interval (TTI) of at most several milliseconds. Only quite simple schemes can be implemented under the stringent time constraint, resulting in far-from-optimum performance. In this paper, we focus on the case of scheduling multiple users in a fixed wireless access (FWA) network with stable channel characteristics. We propose a scheduling approach by which a high-quality scheduling decision based on statistical channel state information (CSI) is made across all TTIs instead of making simple TTI-level decisions. The proposed design is essentially a mixed-integer non-smooth non-convex stochastic problem. We first replace the indicator functions in the formulation by smooth sigmoid functions to tackle nonsmoothness. By leveraging deterministic equivalents (D.E.), we then convert the original stochastic problem into an approximated deterministic one, followed by linear relaxation of the integer constraints. However, the converted problem is still nonconvex due to implicit equation constraints formerly introduced by D.E. Therefore, we employ implicit optimization technique to compute the gradient explicitly, with which we further propose an algorithm design based on a modified version of Frank–Wolfe method. Numerical results verify the effectiveness of our proposed scheme.
基于信道统计的固定无线接入用户调度研究
蜂窝网络中传统的多用户调度要求每传输时间间隔(TTI)最多为几毫秒做出一个决策。在严格的时间约束下,只能实现非常简单的方案,导致性能远非最优。本文主要研究信道特性稳定的固定无线接入(FWA)网络中多用户调度问题。我们提出了一种调度方法,该方法基于统计通道状态信息(CSI)在所有tti中做出高质量的调度决策,而不是做出简单的tti级决策。所提出的设计本质上是一个混合整数非光滑非凸随机问题。我们首先用光滑s型函数代替公式中的指标函数来解决非光滑问题。通过利用确定性等价(D.E.),我们将原始的随机问题转换为近似的确定性问题,然后对整数约束进行线性松弛。然而,由于D.E.先前引入的隐式方程约束,转换后的问题仍然是非凸的。因此,我们采用隐式优化技术显式地计算梯度,并在此基础上提出了一种基于改进版Frank-Wolfe方法的算法设计。数值结果验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
×
引用
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学术官方微信