基于OFDMA的协作中继网络资源分配

D. Zhang, Youzheng Wang, Jianhua Lu
{"title":"基于OFDMA的协作中继网络资源分配","authors":"D. Zhang, Youzheng Wang, Jianhua Lu","doi":"10.1109/GLOCOMW.2008.ECP.95","DOIUrl":null,"url":null,"abstract":"In this paper, we focus on resource allocation in OFDMA based cooperative cellular networks with multiple sources, multiple relays and a single destination. Four typical relay schemes are discussed, namely, Amplify-and-Forward (AF) and Decode-and-Forward (DF) both with or without diversity. We formulate two general optimization problems incorporating single-carrier allocation and multi-carrier allocation respectively. Since the formulated problem is a Binary Integer Problem (BIP), an innovative evolutional based algorithm is proposed for solving the relay selection and subcarrier allocation problem. The new algorithm is low in complexity, efficient in performance illustrated by both analytical and numerical results.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Resource Allocation in OFDMA Based Cooperative Relay Networks\",\"authors\":\"D. Zhang, Youzheng Wang, Jianhua Lu\",\"doi\":\"10.1109/GLOCOMW.2008.ECP.95\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we focus on resource allocation in OFDMA based cooperative cellular networks with multiple sources, multiple relays and a single destination. Four typical relay schemes are discussed, namely, Amplify-and-Forward (AF) and Decode-and-Forward (DF) both with or without diversity. We formulate two general optimization problems incorporating single-carrier allocation and multi-carrier allocation respectively. Since the formulated problem is a Binary Integer Problem (BIP), an innovative evolutional based algorithm is proposed for solving the relay selection and subcarrier allocation problem. The new algorithm is low in complexity, efficient in performance illustrated by both analytical and numerical results.\",\"PeriodicalId\":410930,\"journal\":{\"name\":\"2008 IEEE Globecom Workshops\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE Globecom Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOMW.2008.ECP.95\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Globecom Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2008.ECP.95","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

本文主要研究基于OFDMA的多源、多中继、单目的协同蜂窝网络中的资源分配问题。讨论了四种典型的中继方案,即带分集或不带分集的放大转发(AF)和译码转发(DF)。我们分别提出了单载波分配和多载波分配的两种一般优化问题。由于该问题是二进制整数问题(BIP),提出了一种创新的基于进化的中继选择和子载波分配算法。分析和数值结果表明,该算法具有复杂度低、性能好等优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Resource Allocation in OFDMA Based Cooperative Relay Networks
In this paper, we focus on resource allocation in OFDMA based cooperative cellular networks with multiple sources, multiple relays and a single destination. Four typical relay schemes are discussed, namely, Amplify-and-Forward (AF) and Decode-and-Forward (DF) both with or without diversity. We formulate two general optimization problems incorporating single-carrier allocation and multi-carrier allocation respectively. Since the formulated problem is a Binary Integer Problem (BIP), an innovative evolutional based algorithm is proposed for solving the relay selection and subcarrier allocation problem. The new algorithm is low in complexity, efficient in performance illustrated by both analytical and numerical results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信