Direct derivation of the gradient method for network utility maximization in broadcast channels and its application

Heejin Joung, Cheol Mun, Jae Yun Ko, Jong Gwan Yook

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In broadcast channels, network utility maximization formulates a scheduling problem in order to maximize a sum of given utility functions. It is known that the network utility maximization is achieved if a gradient method is used. In this paper, however, we show that the network utility maximization is achieved only if a gradient method is used. That proves the equivalence between a problem formulated by the network utility maximization and a problem with a gradient method. The gradient method simplifies the object function of a scheduling problem by modifying utility functions to a gradient form, so that it makes easy to deal with the problem. We apply the gradient method to a problem with utility functions given by generalized proportional fairness. It is revealed that using the gradient method for the generalized proportional fairness is equivalent to applying a binomial approximation. Simulation results are presented with various scheduling parameters.

Original languageEnglish
Title of host publication2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings
DOIs
Publication statusPublished - 2011 Aug 29
Event2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Budapest, Hungary
Duration: 2011 May 152011 May 18

Other

Other2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring
CountryHungary
CityBudapest
Period11/5/1511/5/18

Fingerprint

Utility Maximization
Broadcast Channel
Gradient methods
Gradient Method
Utility Function
Proportional Fairness
Scheduling
Scheduling Problem
Simplify
Maximise
Equivalence
Gradient
Approximation
Simulation

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Joung, H., Mun, C., Ko, J. Y., & Yook, J. G. (2011). Direct derivation of the gradient method for network utility maximization in broadcast channels and its application. In 2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings [5956391] https://doi.org/10.1109/VETECS.2011.5956391
Joung, Heejin ; Mun, Cheol ; Ko, Jae Yun ; Yook, Jong Gwan. / Direct derivation of the gradient method for network utility maximization in broadcast channels and its application. 2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings. 2011.
@inproceedings{cf9e9edb5637422ebfe2825b6c22421e,
title = "Direct derivation of the gradient method for network utility maximization in broadcast channels and its application",
abstract = "In broadcast channels, network utility maximization formulates a scheduling problem in order to maximize a sum of given utility functions. It is known that the network utility maximization is achieved if a gradient method is used. In this paper, however, we show that the network utility maximization is achieved only if a gradient method is used. That proves the equivalence between a problem formulated by the network utility maximization and a problem with a gradient method. The gradient method simplifies the object function of a scheduling problem by modifying utility functions to a gradient form, so that it makes easy to deal with the problem. We apply the gradient method to a problem with utility functions given by generalized proportional fairness. It is revealed that using the gradient method for the generalized proportional fairness is equivalent to applying a binomial approximation. Simulation results are presented with various scheduling parameters.",
author = "Heejin Joung and Cheol Mun and Ko, {Jae Yun} and Yook, {Jong Gwan}",
year = "2011",
month = "8",
day = "29",
doi = "10.1109/VETECS.2011.5956391",
language = "English",
isbn = "9781424483310",
booktitle = "2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings",

}

Joung, H, Mun, C, Ko, JY & Yook, JG 2011, Direct derivation of the gradient method for network utility maximization in broadcast channels and its application. in 2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings., 5956391, 2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring, Budapest, Hungary, 11/5/15. https://doi.org/10.1109/VETECS.2011.5956391

Direct derivation of the gradient method for network utility maximization in broadcast channels and its application. / Joung, Heejin; Mun, Cheol; Ko, Jae Yun; Yook, Jong Gwan.

2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings. 2011. 5956391.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Direct derivation of the gradient method for network utility maximization in broadcast channels and its application

AU - Joung, Heejin

AU - Mun, Cheol

AU - Ko, Jae Yun

AU - Yook, Jong Gwan

PY - 2011/8/29

Y1 - 2011/8/29

N2 - In broadcast channels, network utility maximization formulates a scheduling problem in order to maximize a sum of given utility functions. It is known that the network utility maximization is achieved if a gradient method is used. In this paper, however, we show that the network utility maximization is achieved only if a gradient method is used. That proves the equivalence between a problem formulated by the network utility maximization and a problem with a gradient method. The gradient method simplifies the object function of a scheduling problem by modifying utility functions to a gradient form, so that it makes easy to deal with the problem. We apply the gradient method to a problem with utility functions given by generalized proportional fairness. It is revealed that using the gradient method for the generalized proportional fairness is equivalent to applying a binomial approximation. Simulation results are presented with various scheduling parameters.

AB - In broadcast channels, network utility maximization formulates a scheduling problem in order to maximize a sum of given utility functions. It is known that the network utility maximization is achieved if a gradient method is used. In this paper, however, we show that the network utility maximization is achieved only if a gradient method is used. That proves the equivalence between a problem formulated by the network utility maximization and a problem with a gradient method. The gradient method simplifies the object function of a scheduling problem by modifying utility functions to a gradient form, so that it makes easy to deal with the problem. We apply the gradient method to a problem with utility functions given by generalized proportional fairness. It is revealed that using the gradient method for the generalized proportional fairness is equivalent to applying a binomial approximation. Simulation results are presented with various scheduling parameters.

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

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

U2 - 10.1109/VETECS.2011.5956391

DO - 10.1109/VETECS.2011.5956391

M3 - Conference contribution

AN - SCOPUS:80051968182

SN - 9781424483310

BT - 2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings

ER -

Joung H, Mun C, Ko JY, Yook JG. Direct derivation of the gradient method for network utility maximization in broadcast channels and its application. In 2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings. 2011. 5956391 https://doi.org/10.1109/VETECS.2011.5956391