2012
DOI: 10.1002/dac.2462
|View full text |Cite
|
Sign up to set email alerts
|

Resource allocation for heterogeneous services in multiuser cognitive radio networks

Abstract: SUMMARYThis paper considers a downlink cognitive radio network consisting of one cognitive base station and multiple secondary users (SUs) that shares spectrum with a primary network. Unlike most of previous studies that focus on the SUs that carry only one type of service, in this paper, the SUs that carry heterogeneous services are considered. Specifically, the SUs are classified by service types, that is, the SUs that carry nonreal‐time services and the SUs that carry real‐time services. The QoS of the nonr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
7
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 24 publications
1
7
0
Order By: Relevance
“…The computational complexity of Algorithm 1 is analysed briefly as follows: for fixed and , calculating and p requires O.G 2 N/ and O.G/ operations, respectively. It has been shown in [13,14] that the subgradient method converges in a small number 4 of iterations as long as appropriate step sizes are chosen, which we will also show in our simulation results in Section 5. Thus, the total complexity of Algorithm 1 is O.G 2 N4/.…”
Section: Group Outage Probability Minimisationsupporting
confidence: 58%
See 1 more Smart Citation
“…The computational complexity of Algorithm 1 is analysed briefly as follows: for fixed and , calculating and p requires O.G 2 N/ and O.G/ operations, respectively. It has been shown in [13,14] that the subgradient method converges in a small number 4 of iterations as long as appropriate step sizes are chosen, which we will also show in our simulation results in Section 5. Thus, the total complexity of Algorithm 1 is O.G 2 N4/.…”
Section: Group Outage Probability Minimisationsupporting
confidence: 58%
“…where D 0 g . , / is given by (14). To solve (15), the exhaustive search method can be employed to determine the optimal .…”
Section: Group Outage Probability Minimisationmentioning
confidence: 99%
“…Optimal RA solutions for heterogeneous CRN were investigated in [6,7] and the works were further strengthened in [8] to include QoS provisioning. The concept of cooperative diversity was introduced in [9] to address the problem of interference mitigation, thereby achieving even better results.…”
Section: Related Literaturementioning
confidence: 99%
“…In overlay CR networks, the SUs acquire transmission opportunities by improving the PUs' transmission. This paper focuses on the underlay CR networks, in which various problems such as resource allocation [4][5][6][7] have been studied widely in existing literature.…”
Section: Introductionmentioning
confidence: 99%