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

Efficient Resource Allocation for Multicell Heterogeneous Cognitive Networks With Varying Spectrum Availability

Haythem Bany Salameh
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(7 citation statements)
references
References 21 publications
0
7
0
Order By: Relevance
“…In our simulations, the status of each PR channel i is given by a Markov renewal process alternating between BUSY and IDLE periods in which the IDLE period is exponentially distributed random variable with mean TIfalse(ifalse). This appropriateness of this model in capturing the PR activities has been demonstrated in several previous works (eg, see other works). We set the busy probabilities of the different PR channels to P B .…”
Section: Performance Evaluationmentioning
confidence: 71%
See 1 more Smart Citation
“…In our simulations, the status of each PR channel i is given by a Markov renewal process alternating between BUSY and IDLE periods in which the IDLE period is exponentially distributed random variable with mean TIfalse(ifalse). This appropriateness of this model in capturing the PR activities has been demonstrated in several previous works (eg, see other works). We set the busy probabilities of the different PR channels to P B .…”
Section: Performance Evaluationmentioning
confidence: 71%
“…Since the objective function is linear, b is integer, and the linear‐constraint matrix A is unimodular, the BLP in meets the unimodularity requirement (ie, unimodular BLP). Given the fact that the relaxed LP problem of a unimodular BLP has an integral optimal solution (if the problem is feasible), the optimal solution of our unimodular BLP problem can be optimally determined by solving its corresponding LP relaxation using standard LP methods. Since standard LP methods have polynomial‐time complexity, our problem in can be optimally solved in polynomial time (the BLP in has polynomial‐time complexity).…”
Section: The Proposed Spectrum Access Protocolmentioning
confidence: 99%
“…The maximization problem can be established as a two-stage stochastic binary linear program. It is worth mentioning that the interference is a continuous random variable that is highly-correlated over time [1,[10][11][12][13][14][15]. Thus, our optimization problem has an infinite realizations.…”
Section: (B) Contributionsmentioning
confidence: 99%
“…By placing redundant nodes at appropriate locations in the existing network, the availability of wireless links is improved. The availability of a multi-cell CRN under time varying channels was studied in [14] and accordingly an efficient spectrum allocation mechanism was proposed. In the proposed network model therein, the average number of available channels is determined based on busy probabilities of channels.…”
Section: Related Workmentioning
confidence: 99%