Resource Allocation Algorithms with Reduced Complexity in MIMO Multi-Hop Fading Channels

Feng Li, H. Jafarkhani
{"title":"Resource Allocation Algorithms with Reduced Complexity in MIMO Multi-Hop Fading Channels","authors":"Feng Li, H. Jafarkhani","doi":"10.1109/WCNC.2009.4917945","DOIUrl":null,"url":null,"abstract":"MIMO multi-hop channel plays an important role in wireless ad hoc networks. In this paper, we investigate the resource allocation optimization problem in order to achieve throughput maximization with given resource constraints. We propose algorithms with low complexity to achieve maximum capacity. The main idea is to determine the rank of the optimal transmit covariance matrix and the optimal power allocation of each node separately using our low-complexity algorithm. Further, we reduce the complexity of our algorithm by adding another pre-processing algorithm. Using our algorithms, we find that while dynamical allocation of time and power could increase channel capacity, equal time and power allocation among different nodes may not cause much capacity loss.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Wireless Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2009.4917945","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

MIMO multi-hop channel plays an important role in wireless ad hoc networks. In this paper, we investigate the resource allocation optimization problem in order to achieve throughput maximization with given resource constraints. We propose algorithms with low complexity to achieve maximum capacity. The main idea is to determine the rank of the optimal transmit covariance matrix and the optimal power allocation of each node separately using our low-complexity algorithm. Further, we reduce the complexity of our algorithm by adding another pre-processing algorithm. Using our algorithms, we find that while dynamical allocation of time and power could increase channel capacity, equal time and power allocation among different nodes may not cause much capacity loss.
降低MIMO多跳衰落信道复杂度的资源分配算法
MIMO多跳信道在无线自组网中起着重要的作用。本文研究了在给定资源约束下,以实现吞吐量最大化为目标的资源分配优化问题。我们提出了低复杂度的算法来实现最大容量。主要思想是使用我们的低复杂度算法分别确定最优传输协方差矩阵的秩和每个节点的最优功率分配。此外,我们通过添加另一个预处理算法来降低算法的复杂性。使用我们的算法,我们发现,虽然动态分配时间和功率可以增加信道容量,但在不同节点之间平均分配时间和功率可能不会造成太多的容量损失。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信