DocumentCode :
3138427
Title :
Greedy spectrum sharing for cognitive MIMO networks
Author :
Driouch, Elmahdi ; Ajib, Wessam
Author_Institution :
Dept. of Comput. Sci., Univ. du Quebec a Montreal, Montreal, QC, Canada
fYear :
2012
fDate :
26-28 June 2012
Firstpage :
139
Lastpage :
143
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.
Keywords :
MIMO communication; antenna arrays; cognitive radio; graph theory; greedy algorithms; receiving antennas; cognitive MIMO networks; cognitive base station; cognitive radio; computational complexity; greedy spectrum sharing algorithm; multiple transmit antenna receiver; near-optimal performance; point-to-multipoint secondary network sharing frequency bands; single antenna receivers; vertex coloring problem; weighted graph; Algorithm design and analysis; Color; Greedy algorithms; MIMO; OFDM; Receivers; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications and Information Technology (ICCIT), 2012 International Conference on
Conference_Location :
Hammamet
Print_ISBN :
978-1-4673-1949-2
Type :
conf
DOI :
10.1109/ICCITechnol.2012.6285777
Filename :
6285777
Link To Document :
بازگشت