Na Li, Xiaofeng Tao, Qimei Cui, Juan Bai, Yujia Hu
{"title":"Secrecy rate balancing for the downlink multiuser MISO system with independent confidential messages","authors":"Na Li, Xiaofeng Tao, Qimei Cui, Juan Bai, Yujia Hu","doi":"10.1109/WCNC.2014.6952646","DOIUrl":null,"url":null,"abstract":"Consider secure transmissions over the downlink of a multiuser MISO system with independent confidential messages, each of which is intended for one of the users and should keep secret from others. We are interested in a scenario where users have individual secrecy rate requirements. This scenario is practical but has drawn little attention in the literature so far. In this paper, we propose a secrecy rate balancing algorithm which tries to fulfill the secrecy rate requirements of users, and maximizes the minimum margin which is defined as the difference between the available secrecy rate and the required rate for each user. This algorithm balances out all the secrecy rate margins until an equilibrium is reached. We derive a necessary condition for the optimal solution. Finally, theoretical results are illustrated by numerical simulations.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2014.6952646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Consider secure transmissions over the downlink of a multiuser MISO system with independent confidential messages, each of which is intended for one of the users and should keep secret from others. We are interested in a scenario where users have individual secrecy rate requirements. This scenario is practical but has drawn little attention in the literature so far. In this paper, we propose a secrecy rate balancing algorithm which tries to fulfill the secrecy rate requirements of users, and maximizes the minimum margin which is defined as the difference between the available secrecy rate and the required rate for each user. This algorithm balances out all the secrecy rate margins until an equilibrium is reached. We derive a necessary condition for the optimal solution. Finally, theoretical results are illustrated by numerical simulations.