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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	2014 9th International Symposium on Communication Systems, Networks & Digital Sign (CSNDSP) s. 754 - 757
Hlavní autoři:	Nunez, Belarmino, Adasme, Pablo, Soto, Ismael, Jianqiang Cheng, Letournel, Marc, Lisser, Abdel
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.07.2014
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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