2019
DOI: 10.1016/j.comcom.2019.05.003
|View full text |Cite
|
Sign up to set email alerts
|

A delay-aware spectrum handoff scheme for prioritized time-critical industrial applications with channel selection strategy

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 43 publications
0
6
0
Order By: Relevance
“…Based on a PU traffic model prediction a CR user is able to select a target channel for spectrum handoff before it commences spectrum mobility by correctly predicting when a PU will be available on or vacate a channel. 111 As a result, a CR user can reconfiguration its RF front-end and execute spectrum switching before a PU appears on the channel. 112 The major disadvantage is that the performance of this technique depends on accurate prediction of PU traffic model.…”
Section: Pure Proactive Spectrum Handoff Strategymentioning
confidence: 99%
See 1 more Smart Citation
“…Based on a PU traffic model prediction a CR user is able to select a target channel for spectrum handoff before it commences spectrum mobility by correctly predicting when a PU will be available on or vacate a channel. 111 As a result, a CR user can reconfiguration its RF front-end and execute spectrum switching before a PU appears on the channel. 112 The major disadvantage is that the performance of this technique depends on accurate prediction of PU traffic model.…”
Section: Pure Proactive Spectrum Handoff Strategymentioning
confidence: 99%
“…TA B L E 3 Summary of different spectrum handoff strategies 85,105,[107][108][109][111][112][113][114]…”
Section: Comparison Of Different Spectrum Handoff Strategiesmentioning
confidence: 99%
“…The steady‐state probability π g that a PPN g packet will arrive at the server which is in a state j where j ∈ {0, α , g , β } (using the earlier described delay cycles and the assumption that packet arrival follows a Poisson) can be denoted as 17,18 π0=1ρ,1emπα=ρα()1ρ/()1ρgρα,0.75emπg=ρg()1ρ/1ρgραfalse),0.75emπβ=ρβ/()1ρgρα. The utilization factor of the PPNs ρ = λ g E [ S eg ] where S eg is the effective service time of PPN g packets. Also, note that we assume that the server is in state 0 when the server is empty.…”
Section: Queuing Delay Analysismentioning
confidence: 99%
“…The steady-state probability π g that a PPN g packet will arrive at the server which is in a state j where j {0, α, g, β} (using the earlier described delay cycles and the assumption that packet arrival follows a Poisson) can be denoted as 17,18…”
Section: Analysis Of the Queuing Timementioning
confidence: 99%
See 1 more Smart Citation