Opportunistic relaying in multiuser cooperative networks with proportional rate constraints

Funian Li, Haiming Du, Chao Zhang, Xinda Ke
{"title":"Opportunistic relaying in multiuser cooperative networks with proportional rate constraints","authors":"Funian Li, Haiming Du, Chao Zhang, Xinda Ke","doi":"10.1109/YCICT.2009.5382427","DOIUrl":null,"url":null,"abstract":"Cooperative communication is an efficient solution to combat wireless channel fading and to increase system throughput in future board communication. In this paper, we consider the uplink scenario of multi-user cooperative network, in which the resource is allocated to the users with the consideration of both fairness guarantee and throughput enhancement. The system uplink throughput is optimized by using decode-and-forward (DF) opportunistic relaying. We show that the optimization problem is formulated as a mixed binary integer programming problem, which is hard to find the global optimum in terms of computational complexity. Thus we decomposed the optimization problem into two sub-problems of opportunistic relaying strategy and power allocation. First, the opportunistic relaying strategy is given by making use of the equivalent channel power gain. Second, a low-complexity power allocation scheme is proposed. The simulation result shows that the proposed scheme can both improve the system throughput and ensure the fairness.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","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.5382427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Cooperative communication is an efficient solution to combat wireless channel fading and to increase system throughput in future board communication. In this paper, we consider the uplink scenario of multi-user cooperative network, in which the resource is allocated to the users with the consideration of both fairness guarantee and throughput enhancement. The system uplink throughput is optimized by using decode-and-forward (DF) opportunistic relaying. We show that the optimization problem is formulated as a mixed binary integer programming problem, which is hard to find the global optimum in terms of computational complexity. Thus we decomposed the optimization problem into two sub-problems of opportunistic relaying strategy and power allocation. First, the opportunistic relaying strategy is given by making use of the equivalent channel power gain. Second, a low-complexity power allocation scheme is proposed. The simulation result shows that the proposed scheme can both improve the system throughput and ensure the fairness.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
比例速率约束下多用户合作网络中的机会中继
在未来的板通信中,协同通信是对抗无线信道衰落和提高系统吞吐量的有效解决方案。本文考虑了多用户协作网络的上行场景,在此场景下,资源分配既要保证公平性,又要提高吞吐量。系统上行链路吞吐量通过使用DF(译码转发)机会中继进行优化。我们证明了优化问题是一个混合二进制整数规划问题,在计算复杂度方面很难找到全局最优。将优化问题分解为机会中继策略和功率分配两个子问题。首先,利用等效信道功率增益给出了机会中继策略。其次,提出了一种低复杂度的功率分配方案。仿真结果表明,该方案既能提高系统吞吐量,又能保证公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
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