Simplified power allocation scheme for cognitive multi-node relay networks

Moonchang Choi; Junggyun Park; Sooyong Choi

doi:10.1109/TWC.2012.050112.111621

Simplified power allocation scheme for cognitive multi-node relay networks

Moonchang Choi, Junggyun Park, Sooyong Choi

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

24 Citations (Scopus)

Abstract

The simplified optimization problem is considered since the power allocation (PA) problem is the nonconvex optimization problem in cognitive multi-node relay networks, which has the interference on the primary user and the maximum transmission power constraint. The maximum transmission power constraint is guaranteed after we obtained the closed-form solution of the simplified optimization problem which has only the interference constraint on the primary user. The proposed PA method with much lower complexity performs close to the suboptimal PA method using interior point method.

Original language	English
Article number	6196270
Pages (from-to)	2008-2012
Number of pages	5
Journal	IEEE Transactions on Wireless Communications
Volume	11
Issue number	6
DOIs	https://doi.org/10.1109/TWC.2012.050112.111621
Publication status	Published - 2012 Jun

Bibliographical note

Funding Information:
This work was financially supported by the KCC (Korea Communications Commission), Korea, under the R&D program supervised by the KCA (Korea Communications Agency) (KCA-2011-11913-04004).

All Science Journal Classification (ASJC) codes

Computer Science Applications
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1109/TWC.2012.050112.111621

Cite this

@article{a0ae673698a84e28aeddac480d02d6ac,

title = "Simplified power allocation scheme for cognitive multi-node relay networks",

abstract = "The simplified optimization problem is considered since the power allocation (PA) problem is the nonconvex optimization problem in cognitive multi-node relay networks, which has the interference on the primary user and the maximum transmission power constraint. The maximum transmission power constraint is guaranteed after we obtained the closed-form solution of the simplified optimization problem which has only the interference constraint on the primary user. The proposed PA method with much lower complexity performs close to the suboptimal PA method using interior point method.",

author = "Moonchang Choi and Junggyun Park and Sooyong Choi",

note = "Funding Information: This work was financially supported by the KCC (Korea Communications Commission), Korea, under the R&D program supervised by the KCA (Korea Communications Agency) (KCA-2011-11913-04004).",

year = "2012",

month = jun,

doi = "10.1109/TWC.2012.050112.111621",

language = "English",

volume = "11",

pages = "2008--2012",

journal = "IEEE Transactions on Wireless Communications",

issn = "1536-1276",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Simplified power allocation scheme for cognitive multi-node relay networks

AU - Choi, Moonchang

AU - Park, Junggyun

AU - Choi, Sooyong

N1 - Funding Information: This work was financially supported by the KCC (Korea Communications Commission), Korea, under the R&D program supervised by the KCA (Korea Communications Agency) (KCA-2011-11913-04004).

PY - 2012/6

Y1 - 2012/6

N2 - The simplified optimization problem is considered since the power allocation (PA) problem is the nonconvex optimization problem in cognitive multi-node relay networks, which has the interference on the primary user and the maximum transmission power constraint. The maximum transmission power constraint is guaranteed after we obtained the closed-form solution of the simplified optimization problem which has only the interference constraint on the primary user. The proposed PA method with much lower complexity performs close to the suboptimal PA method using interior point method.

AB - The simplified optimization problem is considered since the power allocation (PA) problem is the nonconvex optimization problem in cognitive multi-node relay networks, which has the interference on the primary user and the maximum transmission power constraint. The maximum transmission power constraint is guaranteed after we obtained the closed-form solution of the simplified optimization problem which has only the interference constraint on the primary user. The proposed PA method with much lower complexity performs close to the suboptimal PA method using interior point method.

UR - http://www.scopus.com/inward/record.url?scp=84862878913&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862878913&partnerID=8YFLogxK

U2 - 10.1109/TWC.2012.050112.111621

DO - 10.1109/TWC.2012.050112.111621

M3 - Article

AN - SCOPUS:84862878913

SN - 1536-1276

VL - 11

SP - 2008

EP - 2012

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

IS - 6

M1 - 6196270

ER -

Simplified power allocation scheme for cognitive multi-node relay networks

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this