{"title":"Greedy spectrum sharing for cognitive MIMO networks","authors":"Elmahdi Driouch, W. Ajib","doi":"10.1109/ICCITECHNOL.2012.6285777","DOIUrl":null,"url":null,"abstract":"Cognitive radio is regarded as an emerging technique developed to enhance the efficiency of spectrum usage. In this paper, we consider a point-to-multipoint secondary network sharing frequency bands with several primary transmitters and receivers. Assuming a cognitive base station equipped with multiple transmit antennas and single antenna receivers, we propose a greedy spectrum sharing algorithm in order to approach the maximum achievable sum rate of the secondary network. First, we model the overall studied system as a weighted graph, and then we formulate the spectrum sharing as a vertex coloring problem. Second, we show that the two problems are similar and we design a greedy algorithm to solve both problems using two selection criteria. We show through computer simulations that the proposed algorithm is able to achieve near-optimal performances with very low computational complexity.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Communications and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHNOL.2012.6285777","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Cognitive radio is regarded as an emerging technique developed to enhance the efficiency of spectrum usage. In this paper, we consider a point-to-multipoint secondary network sharing frequency bands with several primary transmitters and receivers. Assuming a cognitive base station equipped with multiple transmit antennas and single antenna receivers, we propose a greedy spectrum sharing algorithm in order to approach the maximum achievable sum rate of the secondary network. First, we model the overall studied system as a weighted graph, and then we formulate the spectrum sharing as a vertex coloring problem. Second, we show that the two problems are similar and we design a greedy algorithm to solve both problems using two selection criteria. We show through computer simulations that the proposed algorithm is able to achieve near-optimal performances with very low computational complexity.