基于ofdm的下行认知无线网络资源公平分配

Xu Wang, S. Ekin, K. Qaraqe, E. Serpedin
{"title":"基于ofdm的下行认知无线网络资源公平分配","authors":"Xu Wang, S. Ekin, K. Qaraqe, E. Serpedin","doi":"10.1109/ISSCS.2017.8034871","DOIUrl":null,"url":null,"abstract":"This work investigates the downlink resource allocation (RA) problem in orthogonal frequency division multiplexing (OFDM)-based cognitive radio networks. The objective of this work is to develop a fair RA-algorithm that maximizes the capacity of secondary users (SUs) and in the same time limits the interference caused to the primary users. The fairness condition is formulated as a minimal data condition at SUs. A relaxed version of the RA-problem is first reviewed without adopting the fairness and then a heuristic algorithm is proposed based on the results obtained for the relaxed problem. Computer simulation results illustrate that the proposed heuristic algorithm can achieve near-optimal performance.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fair resource allocation in downlink OFDM-based cognitive radio networks\",\"authors\":\"Xu Wang, S. Ekin, K. Qaraqe, E. Serpedin\",\"doi\":\"10.1109/ISSCS.2017.8034871\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work investigates the downlink resource allocation (RA) problem in orthogonal frequency division multiplexing (OFDM)-based cognitive radio networks. The objective of this work is to develop a fair RA-algorithm that maximizes the capacity of secondary users (SUs) and in the same time limits the interference caused to the primary users. The fairness condition is formulated as a minimal data condition at SUs. A relaxed version of the RA-problem is first reviewed without adopting the fairness and then a heuristic algorithm is proposed based on the results obtained for the relaxed problem. Computer simulation results illustrate that the proposed heuristic algorithm can achieve near-optimal performance.\",\"PeriodicalId\":338255,\"journal\":{\"name\":\"2017 International Symposium on Signals, Circuits and Systems (ISSCS)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Symposium on Signals, Circuits and Systems (ISSCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSCS.2017.8034871\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSCS.2017.8034871","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了基于正交频分复用(OFDM)的认知无线网络中的下行链路资源分配问题。本工作的目标是开发一种公平的ra算法,使辅助用户(su)的容量最大化,并在同一时间内限制对主用户的干扰。公平性条件被表述为SUs的最小数据条件。首先回顾了一种不采用公平性的放宽版ra问题,然后在此基础上提出了一种启发式算法。计算机仿真结果表明,所提出的启发式算法可以达到接近最优的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fair resource allocation in downlink OFDM-based cognitive radio networks
This work investigates the downlink resource allocation (RA) problem in orthogonal frequency division multiplexing (OFDM)-based cognitive radio networks. The objective of this work is to develop a fair RA-algorithm that maximizes the capacity of secondary users (SUs) and in the same time limits the interference caused to the primary users. The fairness condition is formulated as a minimal data condition at SUs. A relaxed version of the RA-problem is first reviewed without adopting the fairness and then a heuristic algorithm is proposed based on the results obtained for the relaxed problem. Computer simulation results illustrate that the proposed heuristic algorithm can achieve near-optimal performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信