利用干扰阈值违反来应对共存中的不确定性

Shaoran Li, Yan-ping Huang, Chengzhang Li, Brian Jalaian, Y. T. Hou, W. Lou
{"title":"利用干扰阈值违反来应对共存中的不确定性","authors":"Shaoran Li, Yan-ping Huang, Chengzhang Li, Brian Jalaian, Y. T. Hou, W. Lou","doi":"10.1145/3323679.3326505","DOIUrl":null,"url":null,"abstract":"In underlay coexistence, secondary users (SUs) attempt to keep their interference to the primary users (PUs) under a threshold. Due to the absence of cooperation from the PUs, there exists much uncertainty at the SUs in terms of channel state information (CSI). An effective approach to cope such uncertainty is to introduce occasional interference threshold violation by the SUs, as long as such occasional violation can be tolerated by the PUs. This paper exploits this idea through a chance constrained programming (CCP) formulation, where the knowledge of uncertain CSI is limited to only the first and second order statistics rather than its complete distribution information. Our main contribution is the introduction of a novel and powerful technique, called Exact Conic Reformulation (ECR), to reformulate the intractable chance constraints. ECR guarantees an equivalent reformulation for linear chance constraints into deterministic conic constraints and does not suffer from the limitations associated with the state-of-the-art approach -- Bernstein Approximation. Simulation results confirm that ECR offers significant performance improvement over Bernstein Approximation in uncorrelated channels and a competitive solution in correlated channels (where Bernstein Approximation is no longer applicable).","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Coping Uncertainty in Coexistence via Exploitation of Interference Threshold Violation\",\"authors\":\"Shaoran Li, Yan-ping Huang, Chengzhang Li, Brian Jalaian, Y. T. Hou, W. Lou\",\"doi\":\"10.1145/3323679.3326505\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In underlay coexistence, secondary users (SUs) attempt to keep their interference to the primary users (PUs) under a threshold. Due to the absence of cooperation from the PUs, there exists much uncertainty at the SUs in terms of channel state information (CSI). An effective approach to cope such uncertainty is to introduce occasional interference threshold violation by the SUs, as long as such occasional violation can be tolerated by the PUs. This paper exploits this idea through a chance constrained programming (CCP) formulation, where the knowledge of uncertain CSI is limited to only the first and second order statistics rather than its complete distribution information. Our main contribution is the introduction of a novel and powerful technique, called Exact Conic Reformulation (ECR), to reformulate the intractable chance constraints. ECR guarantees an equivalent reformulation for linear chance constraints into deterministic conic constraints and does not suffer from the limitations associated with the state-of-the-art approach -- Bernstein Approximation. Simulation results confirm that ECR offers significant performance improvement over Bernstein Approximation in uncorrelated channels and a competitive solution in correlated channels (where Bernstein Approximation is no longer applicable).\",\"PeriodicalId\":205641,\"journal\":{\"name\":\"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3323679.3326505\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3323679.3326505","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在底层共存中,辅助用户(su)试图将其对主用户(pu)的干扰保持在一个阈值以下。由于pu之间缺乏合作,因此su在信道状态信息(CSI)方面存在很大的不确定性。应对这种不确定性的一种有效方法是引入单个单元偶尔违反干扰阈值的情况,只要这种偶尔违反可以被单个单元容忍。本文通过机会约束规划(CCP)公式利用了这一思想,其中不确定CSI的知识仅限于一阶和二阶统计量,而不是其完整的分布信息。我们的主要贡献是引入了一种新颖而强大的技术,称为精确二次曲线重新表述(ECR),以重新表述棘手的机会约束。ECR保证将线性机会约束等效地重新表述为确定性的二次约束,并且不会受到与最先进的方法(伯恩斯坦近似)相关的限制。仿真结果证实,ECR在不相关信道中提供了比Bernstein近似显著的性能改进,在相关信道(伯恩斯坦近似不再适用)中提供了竞争性解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Coping Uncertainty in Coexistence via Exploitation of Interference Threshold Violation
In underlay coexistence, secondary users (SUs) attempt to keep their interference to the primary users (PUs) under a threshold. Due to the absence of cooperation from the PUs, there exists much uncertainty at the SUs in terms of channel state information (CSI). An effective approach to cope such uncertainty is to introduce occasional interference threshold violation by the SUs, as long as such occasional violation can be tolerated by the PUs. This paper exploits this idea through a chance constrained programming (CCP) formulation, where the knowledge of uncertain CSI is limited to only the first and second order statistics rather than its complete distribution information. Our main contribution is the introduction of a novel and powerful technique, called Exact Conic Reformulation (ECR), to reformulate the intractable chance constraints. ECR guarantees an equivalent reformulation for linear chance constraints into deterministic conic constraints and does not suffer from the limitations associated with the state-of-the-art approach -- Bernstein Approximation. Simulation results confirm that ECR offers significant performance improvement over Bernstein Approximation in uncorrelated channels and a competitive solution in correlated channels (where Bernstein Approximation is no longer applicable).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信