A chance constrained approach for uplink wireless OFDMA networks

In this paper, we compare individual and joint probabilistic constraints for a resource allocation problem in an uplink (UL) wireless OFDMA network. For this purpose, we formulate the problem as a stochastic linear programming (SLP) problem. Then, we transform this model into equivalent deterministi...

Full description

Saved in:

Bibliographic Details
Published in:	2014 9th International Symposium on Communication Systems, Networks & Digital Sign (CSNDSP) pp. 754 - 757
Main Authors:	Nunez, Belarmino, Adasme, Pablo, Soto, Ismael, Jianqiang Cheng, Letournel, Marc, Lisser, Abdel
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.07.2014
Subjects:	Approximation methods Joints linear programming Numerical models probabilistic constraints Probabilistic logic Programming resource allocation in orthogonal frequency division multiple access Resource management Second order cone programming Stochastic processes stochastic programming
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In this paper, we compare individual and joint probabilistic constraints for a resource allocation problem in an uplink (UL) wireless OFDMA network. For this purpose, we formulate the problem as a stochastic linear programming (SLP) problem. Then, we transform this model into equivalent deterministic Second-Order Cone Programming (SOCP) problems. All models are intended to maximize the bit rates throughput of the network subject to subcarrier and power user constraints. Our preliminary numerical results show that the joint chance constraint formulation is slightly conservative than the individual probabilistic one. Finally, we show that our approximation of the deterministic joint probabilistic model is very tight.
DOI:	10.1109/CSNDSP.2014.6923927