{"title":"RIS 辅助 RSMA 系统的风险规避停机概率最小化方法","authors":"Yousef N. Shnaiwer;Megumi Kaneko","doi":"10.1109/LNET.2024.3430313","DOIUrl":null,"url":null,"abstract":"This letter presents a novel method for optimizing the outage performance of Reconfigurable Intelligent Surfaces (RIS)-assisted Rate-Splitting Multiple Access (RSMA) systems. The objective is to minimize the maximum outage probability for all messages to improve fairness. A new formulation based on minimizing the Entropic Value-at-Risk (EVaR) of the perceived minimum rate among all messages in the system is proposed to simplify the objective. We show that this formulation is equivalent to minimizing an upper bound on the maximum outage probability, then we transform it into a tractable smooth problem by devising a twice-differentiable approximation to it. In addition to its lower complexity, our method is shown by numerical results to outperform two benchmarks, namely, Discrete Exhaustive Search (DES) and Sequential Quadratic Programming (SQP)-based search methods.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 3","pages":"173-178"},"PeriodicalIF":0.0000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Risk-Averse Outage Probability Minimization Method for RIS-Aided RSMA Systems\",\"authors\":\"Yousef N. Shnaiwer;Megumi Kaneko\",\"doi\":\"10.1109/LNET.2024.3430313\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This letter presents a novel method for optimizing the outage performance of Reconfigurable Intelligent Surfaces (RIS)-assisted Rate-Splitting Multiple Access (RSMA) systems. The objective is to minimize the maximum outage probability for all messages to improve fairness. A new formulation based on minimizing the Entropic Value-at-Risk (EVaR) of the perceived minimum rate among all messages in the system is proposed to simplify the objective. We show that this formulation is equivalent to minimizing an upper bound on the maximum outage probability, then we transform it into a tractable smooth problem by devising a twice-differentiable approximation to it. In addition to its lower complexity, our method is shown by numerical results to outperform two benchmarks, namely, Discrete Exhaustive Search (DES) and Sequential Quadratic Programming (SQP)-based search methods.\",\"PeriodicalId\":100628,\"journal\":{\"name\":\"IEEE Networking Letters\",\"volume\":\"6 3\",\"pages\":\"173-178\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Networking Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10601706/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Networking Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10601706/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Risk-Averse Outage Probability Minimization Method for RIS-Aided RSMA Systems
This letter presents a novel method for optimizing the outage performance of Reconfigurable Intelligent Surfaces (RIS)-assisted Rate-Splitting Multiple Access (RSMA) systems. The objective is to minimize the maximum outage probability for all messages to improve fairness. A new formulation based on minimizing the Entropic Value-at-Risk (EVaR) of the perceived minimum rate among all messages in the system is proposed to simplify the objective. We show that this formulation is equivalent to minimizing an upper bound on the maximum outage probability, then we transform it into a tractable smooth problem by devising a twice-differentiable approximation to it. In addition to its lower complexity, our method is shown by numerical results to outperform two benchmarks, namely, Discrete Exhaustive Search (DES) and Sequential Quadratic Programming (SQP)-based search methods.