Weighted rank constrained rank minimization interference alignment for 3-tier downlink heterogeneous networks

A. M. Benaya, M. Elsabrouty
{"title":"Weighted rank constrained rank minimization interference alignment for 3-tier downlink heterogeneous networks","authors":"A. M. Benaya, M. Elsabrouty","doi":"10.1109/WD.2017.7918120","DOIUrl":null,"url":null,"abstract":"In this paper, interference alignment (IA) in 3-tier heterogeneous networks (HetNets) is addressed. The rank constrained rank minimization (RCRM) approach is modified to deal with the nature of tiers with different quality-of-service (QoS) requirements. In the proposed approach, which we name weighted RCRM (WRCRM), different tiers are treated with different weighting factors to reflect their tolerance to interference. We first study the achievable degrees of freedom (DoFs) for the 3-user mutually interfering broadcast channels (MIBCs) and derive an inner and a loose outer bound on the achievable DoFs. Then, using the derived expressions and the condition of IA feasibility, we show that, by choosing the appropriate weighting factors, the proposed WRCRM-IA solution can outperform the RCRM-IA approach in terms of the average sum rate and the average number of DoFs. Moreover, the WRCRM-IA solution comes closer to the perfect IA DoFs outer bound.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Wireless Days","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WD.2017.7918120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, interference alignment (IA) in 3-tier heterogeneous networks (HetNets) is addressed. The rank constrained rank minimization (RCRM) approach is modified to deal with the nature of tiers with different quality-of-service (QoS) requirements. In the proposed approach, which we name weighted RCRM (WRCRM), different tiers are treated with different weighting factors to reflect their tolerance to interference. We first study the achievable degrees of freedom (DoFs) for the 3-user mutually interfering broadcast channels (MIBCs) and derive an inner and a loose outer bound on the achievable DoFs. Then, using the derived expressions and the condition of IA feasibility, we show that, by choosing the appropriate weighting factors, the proposed WRCRM-IA solution can outperform the RCRM-IA approach in terms of the average sum rate and the average number of DoFs. Moreover, the WRCRM-IA solution comes closer to the perfect IA DoFs outer bound.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
三层下行异构网络加权秩约束秩最小化干扰对准
本文研究了三层异构网络(HetNets)中的干扰对准问题。对秩约束秩最小化(RCRM)方法进行了改进,以处理具有不同服务质量要求的层的性质。在我们提出的方法中,我们将其命名为加权RCRM (WRCRM),对不同的层使用不同的加权因子来反映其对干扰的容忍度。本文首先研究了三用户互干扰广播信道的可实现自由度,并推导了可实现自由度的内边界和松散的外边界。然后,利用导出的表达式和IA可行性条件,通过选择适当的加权因子,我们证明了所提出的wrcr -IA解决方案在平均和速率和平均dof数方面优于rcr -IA方法。此外,wrcr -IA解决方案更接近完美的IA DoFs外部边界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance evaluation of Receiver Directed Transmission protocol with a single transceiver in MANETs Joint channel sensing and power control scheme for cognitive radio wireless sensor networks Self-similarity of data traffic in a Delay Tolerant Network Give me a hint: An ID-free small data transmission protocol for dense IoT devices 5G massive MIMO with digital beamforming and two-stage channel estimation for low SHF band
×
引用
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