Derives the optimal single selection policy minimizing ETTR for fast time-varying channels and provides majorization-based lower/upper ETTR bounds plus approximations for slow time-varying channels with exchangeable states in cognitive radio networks.
Adjustable rendezvous in multi-radio cognitive radio networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
ETTR Bounds and Approximation Solutions of Blind Rendezvous Policies in Cognitive Radio Networks with Random Channel States
Derives the optimal single selection policy minimizing ETTR for fast time-varying channels and provides majorization-based lower/upper ETTR bounds plus approximations for slow time-varying channels with exchangeable states in cognitive radio networks.