带网络编码的OFDM多址中继信道资源分配

B. Han, Zhongyuan Zhao, M. Peng, Yong Li, Wenbo Wang
{"title":"带网络编码的OFDM多址中继信道资源分配","authors":"B. Han, Zhongyuan Zhao, M. Peng, Yong Li, Wenbo Wang","doi":"10.1109/GLOCOM.2012.6503861","DOIUrl":null,"url":null,"abstract":"Joint scheduling and resource allocation in uplink orthogonal frequency division multiplexing (OFDM) systems is complicated, and even gets intractable with large subcarrier and user number. This paper investigates the resource allocation for OFDM-based multi-user multiple-access relay channels (MARC) with network coding. We formulate a joint optimization problem considering source pairing, subcarrier assignment, subcarrier pairing and power allocation to maximize the sum-rate under per-user power constraint. The problem is addressed in polynomial time by optimizing three separate subproblems, and afterwards three low-complexity suboptimal algorithms are further proposed. The simulation results demonstrate performance gain of the proposed algorithms versus per-node transmit power and source nodes number, respectively.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"40 1","pages":"4701-4706"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Resource allocation for OFDM multiple-access relay channels with network coding\",\"authors\":\"B. Han, Zhongyuan Zhao, M. Peng, Yong Li, Wenbo Wang\",\"doi\":\"10.1109/GLOCOM.2012.6503861\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Joint scheduling and resource allocation in uplink orthogonal frequency division multiplexing (OFDM) systems is complicated, and even gets intractable with large subcarrier and user number. This paper investigates the resource allocation for OFDM-based multi-user multiple-access relay channels (MARC) with network coding. We formulate a joint optimization problem considering source pairing, subcarrier assignment, subcarrier pairing and power allocation to maximize the sum-rate under per-user power constraint. The problem is addressed in polynomial time by optimizing three separate subproblems, and afterwards three low-complexity suboptimal algorithms are further proposed. The simulation results demonstrate performance gain of the proposed algorithms versus per-node transmit power and source nodes number, respectively.\",\"PeriodicalId\":72021,\"journal\":{\"name\":\"... IEEE Global Communications Conference. IEEE Global Communications Conference\",\"volume\":\"40 1\",\"pages\":\"4701-4706\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"... IEEE Global Communications Conference. IEEE Global Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2012.6503861\",\"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 Global Communications Conference. IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2012.6503861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

上行正交频分复用(OFDM)系统的联合调度和资源分配是一个复杂的问题,在子载波和用户数量较大的情况下更是难以处理。研究了网络编码下基于ofdm的多用户多址中继信道的资源分配问题。在每用户功率约束下,提出了一个考虑源配对、子载波分配、子载波配对和功率分配的联合优化问题。在多项式时间内通过优化三个独立的子问题来解决问题,然后进一步提出了三种低复杂度的次优算法。仿真结果表明,所提算法的性能增益分别与每节点发射功率和源节点数有关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Resource allocation for OFDM multiple-access relay channels with network coding
Joint scheduling and resource allocation in uplink orthogonal frequency division multiplexing (OFDM) systems is complicated, and even gets intractable with large subcarrier and user number. This paper investigates the resource allocation for OFDM-based multi-user multiple-access relay channels (MARC) with network coding. We formulate a joint optimization problem considering source pairing, subcarrier assignment, subcarrier pairing and power allocation to maximize the sum-rate under per-user power constraint. The problem is addressed in polynomial time by optimizing three separate subproblems, and afterwards three low-complexity suboptimal algorithms are further proposed. The simulation results demonstrate performance gain of the proposed algorithms versus per-node transmit power and source nodes number, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
IEEE GLOBECOM 2022 General Chair Welcome Message Message from the Technical Program Committee Chair Operations Committee Adaptive LLR-based APs selection for Grant-Free Random Access in Cell-Free Massive MIMO Lifelong Autonomous Botnet Detection
×
引用
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