2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) 2010
DOI: 10.1109/spawc.2010.5670885
|View full text |Cite
|
Sign up to set email alerts
|

Optimal resource allocation techniques for MIMO-OFDMA based cognitive radio networks using integer linear programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(25 citation statements)
references
References 13 publications
0
25
0
Order By: Relevance
“…Other classical optimisation tools used for solving well-defined linear or convex programming RA problems are mostly off-shots of either the simplex or the interior point methods. Some of the most common methods and the corresponding references where they have been employed in obtaining solutions to RA problems in CRN are as follows: branch-and-bound (BnB) [19,45], branchand-cut (BnC) [46], lift-and-shift (LnS) [47], iterative and double-loop iterative methods [21,23], dual decomposition [21,48], Lagrangian duality [48,49], barrier method [50,51], gradient decent approach [52], column generation [53,54] etc. In general, these methods, because of their advantage of obtaining optimal solutions, are highly significant.…”
Section: Solutions Using Classical Optimisationmentioning
confidence: 99%
See 2 more Smart Citations
“…Other classical optimisation tools used for solving well-defined linear or convex programming RA problems are mostly off-shots of either the simplex or the interior point methods. Some of the most common methods and the corresponding references where they have been employed in obtaining solutions to RA problems in CRN are as follows: branch-and-bound (BnB) [19,45], branchand-cut (BnC) [46], lift-and-shift (LnS) [47], iterative and double-loop iterative methods [21,23], dual decomposition [21,48], Lagrangian duality [48,49], barrier method [50,51], gradient decent approach [52], column generation [53,54] etc. In general, these methods, because of their advantage of obtaining optimal solutions, are highly significant.…”
Section: Solutions Using Classical Optimisationmentioning
confidence: 99%
“…The new or reformulated problem is, in most cases, an easier version of the original problem, and such that classical optimisation tools may be employed in arriving at viable solutions. This method has been applied in a number of RA problems in CRN, examples are in references [22,45,56,[60][61][62][63]. In [56], the authors, in an attempt to solve the utility maximisation problem for spectrum sharing in CRN, due to its non-convexity and tight coupling between power and interference, had to reformulate.…”
Section: Solution By Linearisationmentioning
confidence: 99%
See 1 more Smart Citation
“…Another group of papers that had linear objective functions include ( [18], [19], [20], [21]). The work of Rahulamathavan et al [18] is an extension of their previous work [11] which was on OFDMA to MIMO-OFDMA. In their paper, Guo and Huang [19] considered opportunistic spectrum access in a cell covering environment.…”
Section: A Linear Objective Functionmentioning
confidence: 99%
“…With the fixed c = [c 1 , c 2 , …, c g , …, c G ] substituting (11) into (13) and searching among all users, joint sub-carrier assignment and power allocation can be done simultaneously, according to (14).…”
Section: Subject Tomentioning
confidence: 99%