Power-efficient spatial multiplexing for multiantenna MANETs

Diep N. Nguyen, M. Krunz
{"title":"Power-efficient spatial multiplexing for multiantenna MANETs","authors":"Diep N. Nguyen, M. Krunz","doi":"10.1109/ICC.2012.6364068","DOIUrl":null,"url":null,"abstract":"We consider the problem of minimizing network's transmit power for given transmission rate demands of all links in a multi-input multi-output (MIMO) ad hoc network. The problem is nonconvex, hence, challenging to be solved, even in a centralized manner. To derive a distributed solution, we reformulate the problem as a noncooperative game. We then propose a network interference function (NIF) that captures the total interference incurred at unintended receivers by all transmitters. The proposed NIF sets the light for designing transmitter-dependent pricing policies for the above game. A price-based iterative water-filling algorithm (PIWF) is proposed to find MIMO precoding matrices, which determines both beam directions and transmission power allocation among antennas (or data streams) at each transmitter. Simulations show that PIWF is more power-efficient than all existing MIMO precoding methods. Additionally, NIF under PIWF is also the least. Simulations also show the fast convergence of PIWF.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2012.6364068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

We consider the problem of minimizing network's transmit power for given transmission rate demands of all links in a multi-input multi-output (MIMO) ad hoc network. The problem is nonconvex, hence, challenging to be solved, even in a centralized manner. To derive a distributed solution, we reformulate the problem as a noncooperative game. We then propose a network interference function (NIF) that captures the total interference incurred at unintended receivers by all transmitters. The proposed NIF sets the light for designing transmitter-dependent pricing policies for the above game. A price-based iterative water-filling algorithm (PIWF) is proposed to find MIMO precoding matrices, which determines both beam directions and transmission power allocation among antennas (or data streams) at each transmitter. Simulations show that PIWF is more power-efficient than all existing MIMO precoding methods. Additionally, NIF under PIWF is also the least. Simulations also show the fast convergence of PIWF.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多天线manet的高能效空间复用
在多输入多输出(MIMO)自组织网络中,考虑在给定传输速率要求的情况下,网络发射功率的最小化问题。这个问题是非凸的,因此,即使以集中的方式解决,也具有挑战性。为了得到一个分布式的解决方案,我们将问题重新表述为一个非合作博弈。然后,我们提出了一个网络干扰函数(NIF),该函数捕获了所有发射机在非预期接收器上产生的总干扰。提议的NIF为设计上述游戏的基于传输方的定价政策提供了依据。提出了一种基于价格的迭代充水算法(PIWF)来寻找MIMO预编码矩阵,该算法确定了每个发射机天线(或数据流)之间的波束方向和发射功率分配。仿真结果表明,PIWF算法比现有的MIMO预编码方法更节能。此外,PIWF下的NIF也是最小的。仿真结果表明,该算法具有较快的收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Achievable rate analysis and feedback design for multiuser relay with imperfect CSI On the energy delay tradeoff of HARQ-IR in wireless multiuser systems Distributed beamforming and subcarrier power allocation for OFDM-based asynchronous two-way relay networks SIP Protector: Defense architecture mitigating DDoS flood attacks against SIP servers Automatic modulation recognition for spectrum sensing using nonuniform compressive samples
×
引用
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