Maximizing Stable Throughput in Age of Information-Based Cognitive Radio

Ali Gaber Mohamed, Mahmoud Gamal
{"title":"Maximizing Stable Throughput in Age of Information-Based Cognitive Radio","authors":"Ali Gaber Mohamed, Mahmoud Gamal","doi":"10.1109/RTC56148.2022.9945059","DOIUrl":null,"url":null,"abstract":"Cognitive radio can be considered as a viable frequency access framework that overcomes the disadvantages of the licensed-based transmission procedure by allowing the secondary users to access the spectrum to transmit their data. However, due to the evolution of latency-sensitive real-time communication applications such as gaming and extended reality, it becomes more vital that cognitive radio networks should be studied with latency requirements on the data transmission. Recently, Age of Information has introduced itself as a important metric for evaluating the freshness of the transmitted data. In this paper, we investigate the latency and stability analysis of a two-user cognitive radio network that consists of one primary user, one secondary user and their destinations. The latency requirements of the transmitted data packets are taken into consideration by imposing Age of Information constraints on the data transmission of the users. We present two optimization problems, in the first problem, the secondary user stable throughput is maximized under an Age of Information constraint imposed on the data transmission of the secondary user. While, in the second problem, we maximize the stable throughput of the secondary user with respect to Age of Information constraints set on the data transmission of both the primary and secondary users. The resultant problems are found to be non-linear programming optimization problems. An appropriate algorithm is used to solve the problems and provide the numerical solutions. Our results characterize the impact of setting Age of Information constraints on the stability region of the network; we demonstrate that the stability region, in certain cases, is reduced by only 11% with strict Age of Information restrictions if compared to the scenario where no latency requirements is considered. Our results also show the potential accuracy of the algorithm adopted in this paper to solve the formulated optimization problems.","PeriodicalId":437897,"journal":{"name":"2022 IEEE International Conference and Expo on Real Time Communications at IIT (RTC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference and Expo on Real Time Communications at IIT (RTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTC56148.2022.9945059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Cognitive radio can be considered as a viable frequency access framework that overcomes the disadvantages of the licensed-based transmission procedure by allowing the secondary users to access the spectrum to transmit their data. However, due to the evolution of latency-sensitive real-time communication applications such as gaming and extended reality, it becomes more vital that cognitive radio networks should be studied with latency requirements on the data transmission. Recently, Age of Information has introduced itself as a important metric for evaluating the freshness of the transmitted data. In this paper, we investigate the latency and stability analysis of a two-user cognitive radio network that consists of one primary user, one secondary user and their destinations. The latency requirements of the transmitted data packets are taken into consideration by imposing Age of Information constraints on the data transmission of the users. We present two optimization problems, in the first problem, the secondary user stable throughput is maximized under an Age of Information constraint imposed on the data transmission of the secondary user. While, in the second problem, we maximize the stable throughput of the secondary user with respect to Age of Information constraints set on the data transmission of both the primary and secondary users. The resultant problems are found to be non-linear programming optimization problems. An appropriate algorithm is used to solve the problems and provide the numerical solutions. Our results characterize the impact of setting Age of Information constraints on the stability region of the network; we demonstrate that the stability region, in certain cases, is reduced by only 11% with strict Age of Information restrictions if compared to the scenario where no latency requirements is considered. Our results also show the potential accuracy of the algorithm adopted in this paper to solve the formulated optimization problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
信息认知无线电时代的稳定吞吐量最大化
认知无线电可以被认为是一种可行的频率接入框架,它允许二次用户访问频谱以传输其数据,从而克服了基于许可的传输过程的缺点。然而,由于游戏和扩展现实等对延迟敏感的实时通信应用的发展,对具有数据传输延迟要求的认知无线网络进行研究变得更加重要。最近,信息时代作为评估传输数据新鲜度的一个重要指标被引入。本文研究了由一个主用户、一个辅助用户及其目的地组成的双用户认知无线网络的延迟和稳定性分析。通过对用户的数据传输施加信息时代的约束,考虑了传输数据包的延迟要求。本文提出了两个优化问题,第一个问题是在信息时代对二次用户的数据传输施加约束的情况下,使二次用户的稳定吞吐量最大化。而在第二个问题中,我们在对主用户和从用户的数据传输设置信息时代约束的情况下,使辅助用户的稳定吞吐量最大化。由此得到的问题是非线性规划优化问题。采用合适的算法对问题进行求解,并给出了数值解。我们的研究结果表征了信息时代约束对网络稳定区域的影响;我们证明,在某些情况下,与不考虑延迟需求的场景相比,在严格的信息年龄限制下,稳定区域仅减少了11%。我们的结果还表明,本文所采用的算法在解决公式优化问题时具有潜在的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Image Processing for Detecting Botnet Attacks: A Novel Approach for Flexibility and Scalability Edge Computing for Real Time Botnet Propagation Detection Maximizing Stable Throughput in Age of Information-Based Cognitive Radio
×
引用
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