R. Andreotti, I. Stupia, F. Giannetti, V. Lottici, L. Vandendorpe
{"title":"基于蚁群优化的OFDMA底层认知无线电系统资源分配","authors":"R. Andreotti, I. Stupia, F. Giannetti, V. Lottici, L. Vandendorpe","doi":"10.1109/SPAWC.2010.5671014","DOIUrl":null,"url":null,"abstract":"This paper1 deals with dynamic resource allocation problem for OFDMA-based cognitive radio systems. The proposed solution is specifically tailored for a secondary base stations (SBS) transmitting to secondary users (SUs) over the same bands of the licensed primary users (PUs) in underlay fashion. The downlink transmission goodput is thereby maximized while keeping the interference on the PUs within a tolerable range. The NP-hard goodput maximization problem is tackled resorting to an efficient meta-heuristic algorithm based on Ant Colony Optimization (ACO) framework.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Resource allocation in OFDMA underlay cognitive radio systems based on Ant Colony Optimization\",\"authors\":\"R. Andreotti, I. Stupia, F. Giannetti, V. Lottici, L. Vandendorpe\",\"doi\":\"10.1109/SPAWC.2010.5671014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper1 deals with dynamic resource allocation problem for OFDMA-based cognitive radio systems. The proposed solution is specifically tailored for a secondary base stations (SBS) transmitting to secondary users (SUs) over the same bands of the licensed primary users (PUs) in underlay fashion. The downlink transmission goodput is thereby maximized while keeping the interference on the PUs within a tolerable range. The NP-hard goodput maximization problem is tackled resorting to an efficient meta-heuristic algorithm based on Ant Colony Optimization (ACO) framework.\",\"PeriodicalId\":436215,\"journal\":{\"name\":\"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2010.5671014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2010.5671014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
摘要
本文研究了基于ofdma的认知无线电系统的动态资源分配问题。所提出的解决方案是专门为辅助基站(SBS)量身定制的,该辅助基站(SBS)通过授权的主用户(pu)的相同频带以底层方式向辅助用户(su)传输数据。从而使下行链路传输增益最大化,同时使对pu的干扰保持在可容忍范围内。采用基于蚁群优化(ACO)框架的高效元启发式算法解决NP-hard good - put最大化问题。
Resource allocation in OFDMA underlay cognitive radio systems based on Ant Colony Optimization
This paper1 deals with dynamic resource allocation problem for OFDMA-based cognitive radio systems. The proposed solution is specifically tailored for a secondary base stations (SBS) transmitting to secondary users (SUs) over the same bands of the licensed primary users (PUs) in underlay fashion. The downlink transmission goodput is thereby maximized while keeping the interference on the PUs within a tolerable range. The NP-hard goodput maximization problem is tackled resorting to an efficient meta-heuristic algorithm based on Ant Colony Optimization (ACO) framework.