共享频谱合作网络:基于线性规划的方法

Z. Mohammadi;M. Soleimanpour Moghadam;S. Talebi;H. Ahmadi
{"title":"共享频谱合作网络:基于线性规划的方法","authors":"Z. Mohammadi;M. Soleimanpour Moghadam;S. Talebi;H. Ahmadi","doi":"10.1109/LNET.2024.3350434","DOIUrl":null,"url":null,"abstract":"This letter investigates a desirable power allocation scheme for shared spectrum networks and formulate it as a constrained optimization model that falls into the nonlinear class fractional programming problems. The investigation focuses on different solutions for the problem under consideration. The first investigated approach utilizes the convex optimization problem (COP) equivalent from of the problem by employing the Charnes-Cooper transformation. This approach finds the optimal solution and thus is the most appropriate from a viewpoint of optimality. The second approach employs the approximate linear programming (LP). From the complexity point of view, the LP problem can be cast as the benchmark. Our proposed linear model has lower complexity with an acceptable accuracy leading to decreasing the time delay to make the final decision on the availability. Simulation results indicate a higher coherence between the two latter approaches and the superior performance than the state-of-the-art literature in different system parameter.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"77-81"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Shared Spectrum Cooperative Networks: A Linear Programming-Based Approach\",\"authors\":\"Z. Mohammadi;M. Soleimanpour Moghadam;S. Talebi;H. Ahmadi\",\"doi\":\"10.1109/LNET.2024.3350434\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This letter investigates a desirable power allocation scheme for shared spectrum networks and formulate it as a constrained optimization model that falls into the nonlinear class fractional programming problems. The investigation focuses on different solutions for the problem under consideration. The first investigated approach utilizes the convex optimization problem (COP) equivalent from of the problem by employing the Charnes-Cooper transformation. This approach finds the optimal solution and thus is the most appropriate from a viewpoint of optimality. The second approach employs the approximate linear programming (LP). From the complexity point of view, the LP problem can be cast as the benchmark. Our proposed linear model has lower complexity with an acceptable accuracy leading to decreasing the time delay to make the final decision on the availability. Simulation results indicate a higher coherence between the two latter approaches and the superior performance than the state-of-the-art literature in different system parameter.\",\"PeriodicalId\":100628,\"journal\":{\"name\":\"IEEE Networking Letters\",\"volume\":\"6 2\",\"pages\":\"77-81\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Networking Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10382184/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Networking Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10382184/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

这封信研究了共享频谱网络的理想功率分配方案,并将其表述为一个约束优化模型,属于非线性类分数编程问题。研究重点是所考虑问题的不同解决方案。第一种研究方法通过采用 Charnes-Cooper 变换,利用问题的凸优化问题(COP)等价。这种方法能找到最优解,因此从最优性的角度来看是最合适的。第二种方法采用近似线性规划(LP)。从复杂性的角度来看,LP 问题可以作为基准。我们提出的线性模型具有较低的复杂性和可接受的准确性,从而减少了做出可用性最终决策的时间延迟。仿真结果表明,后两种方法具有更高的一致性,在不同系统参数下的性能优于最先进的文献。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Shared Spectrum Cooperative Networks: A Linear Programming-Based Approach
This letter investigates a desirable power allocation scheme for shared spectrum networks and formulate it as a constrained optimization model that falls into the nonlinear class fractional programming problems. The investigation focuses on different solutions for the problem under consideration. The first investigated approach utilizes the convex optimization problem (COP) equivalent from of the problem by employing the Charnes-Cooper transformation. This approach finds the optimal solution and thus is the most appropriate from a viewpoint of optimality. The second approach employs the approximate linear programming (LP). From the complexity point of view, the LP problem can be cast as the benchmark. Our proposed linear model has lower complexity with an acceptable accuracy leading to decreasing the time delay to make the final decision on the availability. Simulation results indicate a higher coherence between the two latter approaches and the superior performance than the state-of-the-art literature in different system parameter.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信