Optimal precoder designs for energy-efficiency maximization in secure MIMO systems

Thanh Tung Vu, H. H. Kha
{"title":"Optimal precoder designs for energy-efficiency maximization in secure MIMO systems","authors":"Thanh Tung Vu, H. H. Kha","doi":"10.1109/NICS.2016.7725666","DOIUrl":null,"url":null,"abstract":"In this paper, precoding techniques are investigated for secure energy-efficient multiple-input multiple-output (MIMO) systems in the presence of an eavesdropper. To tackle the non-convexity of the secure energy efficiency maximization (SEEM) problem, we employ branch-and-reduce-and-bound (BRB) approach to obtain the globally optimal solution. It is observed that the BRB algorithm suffers from highly computational cost, its globally optimal solution is importantly served as a benchmark for the performance evaluation of the suboptimal algorithms. This motivates us to develop a low-complexity approach using the well-known zero-forcing (ZF) technique to cancel the wiretapped signal. In ZF based method, the SEEM problem can be transformed to a concave-convex fractional one and, then, be solved by the combination of the Dinkelbach and bisection search algorithm. Simulation results reveal that the ZF based method can converge fast and obtain a sub-optimal performance in compared with the optimal solution of the BRB method. The ZF based scheme also outperforms the conventional secrecy rate maximization precoder design in terms of the energy efficiency.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NICS.2016.7725666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, precoding techniques are investigated for secure energy-efficient multiple-input multiple-output (MIMO) systems in the presence of an eavesdropper. To tackle the non-convexity of the secure energy efficiency maximization (SEEM) problem, we employ branch-and-reduce-and-bound (BRB) approach to obtain the globally optimal solution. It is observed that the BRB algorithm suffers from highly computational cost, its globally optimal solution is importantly served as a benchmark for the performance evaluation of the suboptimal algorithms. This motivates us to develop a low-complexity approach using the well-known zero-forcing (ZF) technique to cancel the wiretapped signal. In ZF based method, the SEEM problem can be transformed to a concave-convex fractional one and, then, be solved by the combination of the Dinkelbach and bisection search algorithm. Simulation results reveal that the ZF based method can converge fast and obtain a sub-optimal performance in compared with the optimal solution of the BRB method. The ZF based scheme also outperforms the conventional secrecy rate maximization precoder design in terms of the energy efficiency.
安全MIMO系统中能源效率最大化的最优预编码器设计
本文研究了存在窃听器的安全高效多输入多输出(MIMO)系统的预编码技术。为了解决安全能效最大化问题的非凸性问题,我们采用分支约界方法获得全局最优解。BRB算法具有较高的计算量,其全局最优解是评价次优算法性能的重要基准。这促使我们开发一种低复杂性的方法,使用众所周知的零强迫(ZF)技术来取消窃听信号。在基于ZF的方法中,可以将SEEM问题转化为凹凸分数阶问题,然后结合Dinkelbach和二分搜索算法求解。仿真结果表明,与BRB方法的最优解相比,基于ZF的方法收敛速度快,且具有次优性能。基于ZF的方案在能源效率方面也优于传统的保密率最大化预编码器设计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信