协作OFDM网络中提高吞吐量和公平性的自适应资源分配

Xinda Ke, Funian Li, Wencheng Gao
{"title":"协作OFDM网络中提高吞吐量和公平性的自适应资源分配","authors":"Xinda Ke, Funian Li, Wencheng Gao","doi":"10.1109/YCICT.2009.5382398","DOIUrl":null,"url":null,"abstract":"Cooperative communication in multi-user orthogonal frequency division multiplexing (MU-OFDM) networks is a promising solution to combat wireless channel fading and to increase system throughput. In this paper, with the instantaneous channel state information (CSI) available at base station, the optimal resource allocation strategy is considered in MU-OFDM networks, which is to maximize throughput and ensure fairness in entire network. We show that this problem is formulated as a mixed binary integer programming problem. Thus we decompose this optimization problem into four sub-optimal problems. First, the dynamic user choosing strategy is proposed. Second, a subcarrier choosing strategy is given by making use of the equivalent channel power gain. And the adaptive power allocation scheme in base station and in relay station is given at last. The simulation results show that our proposed algorithm can greatly increase throughput and ensure fairness.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adaptive resource allocation in cooperative OFDM networks for throughput and fairness improvement\",\"authors\":\"Xinda Ke, Funian Li, Wencheng Gao\",\"doi\":\"10.1109/YCICT.2009.5382398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cooperative communication in multi-user orthogonal frequency division multiplexing (MU-OFDM) networks is a promising solution to combat wireless channel fading and to increase system throughput. In this paper, with the instantaneous channel state information (CSI) available at base station, the optimal resource allocation strategy is considered in MU-OFDM networks, which is to maximize throughput and ensure fairness in entire network. We show that this problem is formulated as a mixed binary integer programming problem. Thus we decompose this optimization problem into four sub-optimal problems. First, the dynamic user choosing strategy is proposed. Second, a subcarrier choosing strategy is given by making use of the equivalent channel power gain. And the adaptive power allocation scheme in base station and in relay station is given at last. The simulation results show that our proposed algorithm can greatly increase throughput and ensure fairness.\",\"PeriodicalId\":138803,\"journal\":{\"name\":\"2009 IEEE Youth Conference on Information, Computing and Telecommunication\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Youth Conference on Information, Computing and Telecommunication\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/YCICT.2009.5382398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YCICT.2009.5382398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多用户正交频分复用(MU-OFDM)网络中的协同通信是对抗无线信道衰落和提高系统吞吐量的一种很有前途的解决方案。本文在基站可获得瞬时信道状态信息(CSI)的情况下,考虑了MU-OFDM网络的最优资源分配策略,即使整个网络的吞吐量最大化并保证公平性。我们证明了这个问题是一个混合二进制整数规划问题。因此,我们将该优化问题分解为四个次优化问题。首先,提出了动态用户选择策略。其次,利用等效信道功率增益给出了一种子载波选择策略。最后给出了基站和中继站的自适应功率分配方案。仿真结果表明,该算法在保证公平性的同时,大大提高了吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Adaptive resource allocation in cooperative OFDM networks for throughput and fairness improvement
Cooperative communication in multi-user orthogonal frequency division multiplexing (MU-OFDM) networks is a promising solution to combat wireless channel fading and to increase system throughput. In this paper, with the instantaneous channel state information (CSI) available at base station, the optimal resource allocation strategy is considered in MU-OFDM networks, which is to maximize throughput and ensure fairness in entire network. We show that this problem is formulated as a mixed binary integer programming problem. Thus we decompose this optimization problem into four sub-optimal problems. First, the dynamic user choosing strategy is proposed. Second, a subcarrier choosing strategy is given by making use of the equivalent channel power gain. And the adaptive power allocation scheme in base station and in relay station is given at last. The simulation results show that our proposed algorithm can greatly increase throughput and ensure fairness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Simulation study of queues' length balance in CICQ switching fabrics Stereo-motion estimation for visual object tracking Regularization of orthogonal neural networks using fractional derivatives System identifiability for sparse and nonuniform samples via spectral analysis A probabilistic filter protocol for Continuous Nearest-Neighbor Query
×
引用
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