naa a22 4500 510798845 CHVBK 20180411083346.0 cr unu---uuuuu 180411e20130901xx s 000 0 eng 10.1007/s11277-013-1076-1 doi (NATIONALLICENCE)springer-10.1007/s11277-013-1076-1 Auction-Based Throughput Maximization in Cognitive Radio Networks Under Interference Constraint [Elektronische Daten] [Hakan Karaca, Tolga Kurt, Salih Zafer Dicle, Emin Anarim] Cognitive radio is an emerging technique to improve the utilization of radio frequency spectrum in wireless communication networks. That is, spectrum efficiency can be increased significantly by giving opportunistic access of the frequency bands to a group of cognitive users to whom the band has not been licensed. In this paper, as a cross layer application (MAC and physical layers) of graph theory, we consider the problem of throughput maximization of spectrum allocation in cognitive radio networks under interference constraint. We propose a novel auction-based channel allocation mechanism which tries to maximize both total and primary users' utilities while satisfying signal to interference ratio constraint on primary receivers so that transmitted packets will be successfully received, without controlling secondary user powers. For comparison we discuss a greedy algorithm as well, however, one that does not handle interference issue. In order to compare results of proposed and greedy algorithms, we propose net throughput by taking into account outage probability of primary receiver. Simulation results show that exposing higher SINR (outage) threshold not only decreases total gain and primary users' utilities but also worsens channel distribution performance. On the other hand adding auction mechanism significantly increases total gain throughput and primary user' s utility. Particularly, up to SINR threshold values of 20dBs, auction provides outstanding performance and proposed algorithm has total throughput results close to those of the greedy one even though no interference constraint is applied in the greedy algorithm. Another noticeable point of simulation results is crossover of net throughputs of proposed and greedy algorithms at a SINR threshold level after which results of ABSA-UNIC and NASA-UNIC are much better. This clearly shows superiority of proposed mechanism. Springer Science+Business Media New York, 2013 Graph theory nationallicence OSI cross layer applications nationallicence Channel assignment nationallicence Cognitive radio nationallicence Interference constraint nationallicence Auction nationallicence Karaca Hakan Department of Electrical and Electronics Engineering, Dokuz Eylul University, Tinaztepe Kampusu, 35160, Buca, İzmir, Turkey aut Kurt Tolga PlusOneMinusOne, KOSGEB TEKMER, Bogazici University, Bebek, Istanbul, Turkey aut Zafer Dicle Salih Department of Electrical and Electronics Engineering, Dokuz Eylul University, Tinaztepe Kampusu, 35160, Buca, İzmir, Turkey aut Anarim Emin Department of Electrical and Electronics Engineering, Bogazici University, 34342, Bebek, Istanbul, Turkey aut Wireless Personal Communications Springer US; http://www.springer-ny.com 72/2(2013-09-01), 1259-1275 0929-6212 72:2<1259 2013 72 11277 https://doi.org/10.1007/s11277-013-1076-1 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s11277-013-1076-1 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Karaca Hakan Department of Electrical and Electronics Engineering, Dokuz Eylul University, Tinaztepe Kampusu, 35160, Buca, İzmir, Turkey aut NATIONALLICENCE 700 1- Kurt Tolga PlusOneMinusOne, KOSGEB TEKMER, Bogazici University, Bebek, Istanbul, Turkey aut NATIONALLICENCE 700 1- Zafer Dicle Salih Department of Electrical and Electronics Engineering, Dokuz Eylul University, Tinaztepe Kampusu, 35160, Buca, İzmir, Turkey aut NATIONALLICENCE 700 1- Anarim Emin Department of Electrical and Electronics Engineering, Bogazici University, 34342, Bebek, Istanbul, Turkey aut NATIONALLICENCE 773 0- Wireless Personal Communications Springer US; http://www.springer-ny.com 72/2(2013-09-01), 1259-1275 0929-6212 72:2<1259 2013 72 11277 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer