Resource assignments algorithm based on energy efficiency optimization in OFDM relay networks

In cooperative orthogonal frequency division multiplexing (OFDM) systems, the resource allocation rationally is significant to enhance the system performance. Aiming at maximizing the total system energy efficiency, the joint assignment problem of relay, sub-carrier and power among users is modeled....

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Tongxin Xuebao Ročník 36; číslo 3; s. 2015078
Hlavní autori: Li, Yun, Duan, Hai-Xia, Su, Kai-Rong, Cao, Bin
Médium: Journal Article
Jazyk:Chinese
Vydavateľské údaje: Editorial Department of Journal on Communications 01.03.2015
Predmet:
Algorithms
Energy management
Energy use
Mathematical models
Operations research
Optimization
Orthogonal Frequency Division Multiplexing
Relay
Resource allocation
resource allocation;energy efficiency;maximum weight independent set;conflict graph;OFDM
ISSN:1000-436X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In cooperative orthogonal frequency division multiplexing (OFDM) systems, the resource allocation rationally is significant to enhance the system performance. Aiming at maximizing the total system energy efficiency, the joint assignment problem of relay, sub-carrier and power among users is modeled. Since the joint assignment issue subject to each user's maximal energy efficiency under minimal capacity constraints can be modeled as a NP-hard problem, a suboptimal algorithm is proposed to solve this problem. The proposed algorithm uses the conflict graph (CG) to denote the possible resource conflict relations. Then, the resource is assigned using maximal weight independent set (MWIS) algorithm. Numerical results demonstrate that the proposed algorithm (JRAA) can improve the system energy efficiency by joint assignment of relay, sub-carrier and power.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1000-436X
DOI:10.11959/j.issn.1000-436x.2015078