Opportunistic Channel Access Using Reinforcement Learning in Tiered CBRS Networks

2018 ◽  
Author(s):  
Matthew Tonnemacher ◽  
Chance Tarver ◽  
Vikram Chandrasekhar ◽  
Hao Chen ◽  
Pengda Huang ◽  
...  
Keyword(s):  
Reinforcement Learning ◽  
Channel Access ◽  
Opportunistic Channel Access

Decentralized Opportunistic Channel Access in CRNs Using Big-Data Driven Learning Algorithm

2021 ◽  
Vol 5 (1) ◽  
pp. 57-69
Author(s):  
Zuohong Xu ◽  
Zhou Zhang ◽  
Shilian Wang ◽  
Alireza Jolfaei ◽  
Ali Kashif Bashir ◽  
...  
Keyword(s):  
Big Data ◽  
Learning Algorithm ◽  
Data Driven ◽  
Channel Access ◽  
Opportunistic Channel Access

An opportunistic channel access scheme for interweave cognitive radio systems

2014 ◽  
Vol 16 (1) ◽  
pp. 56-66 ◽  
Author(s):  
Sivasothy Senthuran ◽  
Alagan Anpalagan ◽  
Hyung Yun Kong ◽  
Ashok Karmokar ◽  
Olivia Das
Keyword(s):  
Cognitive Radio ◽  
Channel Access ◽  
Access Scheme ◽  
Cognitive Radio Systems ◽  
Opportunistic Channel Access ◽  
Radio Systems

Some Useful Approximations for the Availability Function

2015 ◽  
Vol 22 (02) ◽  
pp. 1550008 ◽  
Author(s):  
Viswanathan Arunachalam ◽  
Alvaro Calvache ◽  
Ayşe Tansu
Keyword(s):  
Communication Network ◽  
Integral Equation ◽  
Analytical Solution ◽  
Reliability Analysis ◽  
Test Cases ◽  
Channel Access ◽  
The Third ◽  
Access Scheme ◽  
Opportunistic Channel Access ◽  
Functional Forms

Availability function which forms an important part of reliability analysis is expressed in terms of an integral equation. The analytical solution of such an equation is possible only in very simple cases and hence approximations are the only tools available; very few such approximations are available in the literature. This paper proposes three useful approximations, two of which are based only on the first few moments of the underlying distributions and do not require their functional forms. The third approximation uses the Riemannian sum to approximate the integral equation. Numerical illustrations based on test cases are provided to show the efficacy of the approximations. As an application, the problem of an opportunistic channel access scheme in a communication network is used to test the approximations.

Opportunistic Channel Scheduling for Ad Hoc Networks with Queue Stability

Frequenz ◽  
2015 ◽  
Vol 69 (3-4) ◽  
Author(s):  
Lei Dong ◽  
Yongchao Wang
Keyword(s):  
Ad Hoc ◽  
Real Data ◽  
Channel Access ◽  
Multiple Sources ◽  
Current Channel ◽  
Access Problem ◽  
Channel Scheduling ◽  
Opportunistic Channel Access ◽  
Hoc Networks ◽  
The Stability

AbstractIn this paper, a distributed opportunistic channel access strategy in ad hoc network is proposed. We consider the multiple sources contend for the transmission opportunity, the winner source decides to transmit or restart contention based on the current channel condition. Owing to real data assumption at all links, the decision still needs to consider the stability of the queues. We formulate the channel opportunistic scheduling as a constrained optimization problem which maximizes the system average throughput with the constraints that the queues of all links are stable. The proposed optimization model is solved by Lyapunov stability in queueing theory. The successive channel access problem is decoupled into single optimal stopping problem at every frame and solved with

Sign in / Sign up

Export Citation Format

Share Document