2018 IEEE 88th Vehicular Technology Conference (VTC-Fall) 2018
DOI: 10.1109/vtcfall.2018.8690706
|View full text |Cite
|
Sign up to set email alerts
|

On the Asymptotic Throughput of the $k$-th Best Secondary User Selection in Cognitive Radio Systems

Abstract: We analyze the asymptotic average and effective throughputs of a multiuser diversity scheme for a secondary multiuser network consisting of multiple secondary users (transmitters) and one secondary receiver. Considering a transmit power adaptation strategy at the secondary users to satisfy the instantaneous interference constraint at the primary receiver, the secondary receiver selects the k-th best secondary user for transmission, namely, the one with the k-th highest signal-tonoise ratio (SNR). We use extrem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 22 publications
(29 reference statements)
0
9
0
Order By: Relevance
“…3, we plot the SOP of the k-th best user as a function of the number of receive antennas, L, for k = 1, 2, R s = 1/2 bit/s/Hz and for different values of N . We verify the accuracy of the asymptotic SOP expressions derived in (12) and (19) by comparing them with the exact SOP result. As expected, we observe that for N = 20, the SOP increases as L increases.…”
Section: Ergodic Secrecy Capacity (Esc)mentioning
confidence: 91%
See 1 more Smart Citation
“…3, we plot the SOP of the k-th best user as a function of the number of receive antennas, L, for k = 1, 2, R s = 1/2 bit/s/Hz and for different values of N . We verify the accuracy of the asymptotic SOP expressions derived in (12) and (19) by comparing them with the exact SOP result. As expected, we observe that for N = 20, the SOP increases as L increases.…”
Section: Ergodic Secrecy Capacity (Esc)mentioning
confidence: 91%
“…where b N = C M (N − 1) and U (a; d; z) is the Tricomi hypergeometric function [18]. Proof: As shown in Proposition 2 of [19], if the random variable Z i has a CDF F (z) as in (2), then for a fixed k and N → ∞,…”
Section: Secrecy Outage Probability (Sop)mentioning
confidence: 95%
“…Noting that b is an increasing function of N , we have ln(1 + bP z) ≈ ln(bP z) in (21) for large N . Using this and variable transformation of u = (bP z) −1 , E R (N −k+1) |P can be further approximated as…”
Section: Average and Effective Throughputsmentioning
confidence: 93%
“…This is different from [19], where the k-th highest SNR converges to a Log-Gamma random variable. 3 A portion of this work was accepted for publication in 2018 IEEE Vehicular Technology Conference (VTC) [21]. In [21], we only studied the asymptotic average and effective throughputs of the k-th best secondary user selection in uplink multiuser cognitive radio systems under unlimited transmit power.…”
Section: System Modelmentioning
confidence: 99%
See 1 more Smart Citation