2016
DOI: 10.1109/lcomm.2016.2539158
|View full text |Cite
|
Sign up to set email alerts
|

Probability of Packet Loss in Energy Harvesting Nodes With Cognitive Radio Capabilities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…After solving, the steady-state probability of the busy channel is obtained as Pr(H 1 ) = (1 − p 0 )/(2 − p 1 − p 0 ), and the steady-state probability of the idle channel is achieved 12 by Pr(H 0 ) = 1 − Pr (H 1 ) . Figure 5 illustrates Markov model for channel state in cognitive radio system.…”
Section: The Proposed Three-dimensional Continuous-time Markov Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…After solving, the steady-state probability of the busy channel is obtained as Pr(H 1 ) = (1 − p 0 )/(2 − p 1 − p 0 ), and the steady-state probability of the idle channel is achieved 12 by Pr(H 0 ) = 1 − Pr (H 1 ) . Figure 5 illustrates Markov model for channel state in cognitive radio system.…”
Section: The Proposed Three-dimensional Continuous-time Markov Modelmentioning
confidence: 99%
“…10,11 In another study, Markov model was proposed to obtain the energy states of the SU equipped with a capacity-fixed battery in an energy harvesting cognitive radio network. 12 The probability of packet loss was derived to maximize the total throughput. In addition, a twodimensional sensing method was developed to optimize the PU performance based on hidden input in the Markov model.…”
mentioning
confidence: 99%
“…where g p is the SU measured value of the PU SNR, λ is the received signal strength at cognitive SU from PU, and s w 2 is the noise power [18]. The access probability is the transition probability from concurrent state l to the next state l þ 1.…”
Section: Theoretical Analysismentioning
confidence: 99%
“…The optimization problem is solved numerically using MALAB Genetic Algorithm. The results are compared with the results of Monte Carlo simulations in [18] that are based on mathematical iterations. Genetic algorithms are evolutionary search techniques used to identify approximate solutions for optimization problems.…”
Section: Derivation Of the Throughputmentioning
confidence: 99%
See 1 more Smart Citation