A novel rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems

Eunsung Oh; Jaemin Han; Hyungsik Ju; Daesik Hong

doi:10.1109/VETECS.2009.5073323

A novel rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems

Eunsung Oh, Jaemin Han, Hyungsik Ju, Daesik Hong

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper proposes a rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems. The throughput maximization problem is formulated to two link data rate balancing problems: global balancing and local balancing. And the rate fairness is converted to data rate balancing of each destinations. Based on this, we construct a feasible rate region (FRR) which is the set of achievable data rates. Since FRR is a polyhedra, rate allocation is performed by searching the intersection points of FRR. In addition, if the system is infeasible, the proposed rate allocation removes the destination for system feasibility. Simulation results reveal that the proposed rate allocation maximizes the throughput with satisfying rate fairness, not only for the feasible case but also for the infeasible case.

Original language	English
Title of host publication	VTC Spring 2009 - IEEE 69th Vehicular Technology Conference
DOIs	https://doi.org/10.1109/VETECS.2009.5073323
Publication status	Published - 2009 Oct 12
Event	VTC Spring 2009 - IEEE 69th Vehicular Technology Conference - Barcelona, Spain Duration: 2009 Apr 26 → 2009 Apr 29

Publication series

Name	IEEE Vehicular Technology Conference
ISSN (Print)	1550-2252

Other

Other	VTC Spring 2009 - IEEE 69th Vehicular Technology Conference
Country	Spain
City	Barcelona
Period	09/4/26 → 09/4/29

All Science Journal Classification (ASJC) codes

Computer Science Applications
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1109/VETECS.2009.5073323

Fingerprint Dive into the research topics of 'A novel rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems'. Together they form a unique fingerprint.

Cite this

Oh, E., Han, J., Ju, H., & Hong, D. (2009). A novel rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems. In VTC Spring 2009 - IEEE 69th Vehicular Technology Conference [5073323] (IEEE Vehicular Technology Conference). https://doi.org/10.1109/VETECS.2009.5073323

@inproceedings{663a008f50684da386be474f76fbd85d,

title = "A novel rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems",

abstract = "This paper proposes a rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems. The throughput maximization problem is formulated to two link data rate balancing problems: global balancing and local balancing. And the rate fairness is converted to data rate balancing of each destinations. Based on this, we construct a feasible rate region (FRR) which is the set of achievable data rates. Since FRR is a polyhedra, rate allocation is performed by searching the intersection points of FRR. In addition, if the system is infeasible, the proposed rate allocation removes the destination for system feasibility. Simulation results reveal that the proposed rate allocation maximizes the throughput with satisfying rate fairness, not only for the feasible case but also for the infeasible case.",

author = "Eunsung Oh and Jaemin Han and Hyungsik Ju and Daesik Hong",

year = "2009",

month = oct,

day = "12",

doi = "10.1109/VETECS.2009.5073323",

language = "English",

isbn = "9781424425174",

series = "IEEE Vehicular Technology Conference",

booktitle = "VTC Spring 2009 - IEEE 69th Vehicular Technology Conference",

note = "VTC Spring 2009 - IEEE 69th Vehicular Technology Conference ; Conference date: 26-04-2009 Through 29-04-2009",

}

Oh, E, Han, J, Ju, H & Hong, D 2009, A novel rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems. in VTC Spring 2009 - IEEE 69th Vehicular Technology Conference., 5073323, IEEE Vehicular Technology Conference, VTC Spring 2009 - IEEE 69th Vehicular Technology Conference, Barcelona, Spain, 09/4/26. https://doi.org/10.1109/VETECS.2009.5073323

A novel rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems. / Oh, Eunsung; Han, Jaemin; Ju, Hyungsik; Hong, Daesik.

VTC Spring 2009 - IEEE 69th Vehicular Technology Conference. 2009. 5073323 (IEEE Vehicular Technology Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A novel rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems

AU - Oh, Eunsung

AU - Han, Jaemin

AU - Ju, Hyungsik

AU - Hong, Daesik

PY - 2009/10/12

Y1 - 2009/10/12

N2 - This paper proposes a rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems. The throughput maximization problem is formulated to two link data rate balancing problems: global balancing and local balancing. And the rate fairness is converted to data rate balancing of each destinations. Based on this, we construct a feasible rate region (FRR) which is the set of achievable data rates. Since FRR is a polyhedra, rate allocation is performed by searching the intersection points of FRR. In addition, if the system is infeasible, the proposed rate allocation removes the destination for system feasibility. Simulation results reveal that the proposed rate allocation maximizes the throughput with satisfying rate fairness, not only for the feasible case but also for the infeasible case.

AB - This paper proposes a rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems. The throughput maximization problem is formulated to two link data rate balancing problems: global balancing and local balancing. And the rate fairness is converted to data rate balancing of each destinations. Based on this, we construct a feasible rate region (FRR) which is the set of achievable data rates. Since FRR is a polyhedra, rate allocation is performed by searching the intersection points of FRR. In addition, if the system is infeasible, the proposed rate allocation removes the destination for system feasibility. Simulation results reveal that the proposed rate allocation maximizes the throughput with satisfying rate fairness, not only for the feasible case but also for the infeasible case.

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

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

U2 - 10.1109/VETECS.2009.5073323

DO - 10.1109/VETECS.2009.5073323

M3 - Conference contribution

AN - SCOPUS:70349706225

SN - 9781424425174

T3 - IEEE Vehicular Technology Conference

BT - VTC Spring 2009 - IEEE 69th Vehicular Technology Conference

T2 - VTC Spring 2009 - IEEE 69th Vehicular Technology Conference

Y2 - 26 April 2009 through 29 April 2009

ER -