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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2014 9th International Symposium on Communication Systems, Networks & Digital Sign (CSNDSP) S. 754 - 757
Hauptverfasser: Nunez, Belarmino, Adasme, Pablo, Soto, Ismael, Jianqiang Cheng, Letournel, Marc, Lisser, Abdel
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.07.2014
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract 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.
AbstractList 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.
Author Jianqiang Cheng
Adasme, Pablo
Soto, Ismael
Letournel, Marc
Lisser, Abdel
Nunez, Belarmino
Author_xml – sequence: 1
  givenname: Belarmino
  surname: Nunez
  fullname: Nunez, Belarmino
  email: belarmino.nunez@usach.cl
  organization: Dept. of Electr. Eng., Univ. of Santiago de Chile, Santiago, Chile
– sequence: 2
  givenname: Pablo
  surname: Adasme
  fullname: Adasme, Pablo
  email: pablo.adasme@usach.cl
  organization: Dept. of Electr. Eng., Univ. of Santiago de Chile, Santiago, Chile
– sequence: 3
  givenname: Ismael
  surname: Soto
  fullname: Soto, Ismael
  email: ismael.soto@usach.cl
  organization: Dept. of Electr. Eng., Univ. of Santiago de Chile, Santiago, Chile
– sequence: 4
  surname: Jianqiang Cheng
  fullname: Jianqiang Cheng
  email: jianqiang.cheng@lri.fr
  organization: Lab. de Rech. en Inf., Univ. Paris-Sud XI, Orsay, France
– sequence: 5
  givenname: Marc
  surname: Letournel
  fullname: Letournel, Marc
  email: marc.letournel@lri.fr
  organization: Lab. de Rech. en Inf., Univ. Paris-Sud XI, Orsay, France
– sequence: 6
  givenname: Abdel
  surname: Lisser
  fullname: Lisser, Abdel
  email: abdel.lisser@lri.fr
  organization: Lab. de Rech. en Inf., Univ. Paris-Sud XI, Orsay, France
BookMark eNotj9FKwzAYRiPohZs-wW7yAq1JmjTNnaVzTpjbYHo9kvQPDatpSSrDt3firj4OBw58M3QbhgAILSjJKSXqqTlsl4d9zgjlealYoZi8QTPKpVJMVJTco-ca204HC9gOIU1R-wAt1uMYB2077IaIv8fehxM--wg9pIR3q-V7jQNM5yGe0gO6c7pP8HjdOfpcvXw062yze31r6k3WUcanDBxUAKC5lraqDBEEJJSiZcIwp0vDXcmJMH_-AqIgxHBwrRBEghTKFXO0-O_6S-Y4Rv-l48_xeqr4BQB-RxU
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CSNDSP.2014.6923927
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1479925810
9781479925810
EndPage 757
ExternalDocumentID 6923927
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-h124t-efe8eeea4a7c88b050e7e65d25b2fa6b4f6405ba4a76b45300b4efd5507e759f3
IEDL.DBID RIE
IngestDate Thu Jun 29 18:36:50 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-h124t-efe8eeea4a7c88b050e7e65d25b2fa6b4f6405ba4a76b45300b4efd5507e759f3
PageCount 4
ParticipantIDs ieee_primary_6923927
PublicationCentury 2000
PublicationDate 2014-July
PublicationDateYYYYMMDD 2014-07-01
PublicationDate_xml – month: 07
  year: 2014
  text: 2014-July
PublicationDecade 2010
PublicationTitle 2014 9th International Symposium on Communication Systems, Networks & Digital Sign (CSNDSP)
PublicationTitleAbbrev CSNDSP
PublicationYear 2014
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.5523993
Snippet In this paper, we compare individual and joint probabilistic constraints for a resource allocation problem in an uplink (UL) wireless OFDMA network. For this...
SourceID ieee
SourceType Publisher
StartPage 754
SubjectTerms 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
Title A chance constrained approach for uplink wireless OFDMA networks
URI https://ieeexplore.ieee.org/document/6923927
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEA1t8eBJpRW_ycGjadNNssneLK3Fg9ZCVXorm2QWRdlKu_X3m9ldK4IXb_mCZBLIDMl7bwi55CIVIvKWRX3nmUxBM5s4zVxwDiJDdZcSm_N8pycTM58n0wa52nJhAKAEn0EXi-Vfvl-6DT6V9eIQjSSRbpKm1nHF1aqFhPo86Q1nk9Fsimgt2a1H_kqZUnqM8d7_5tonnR_qHZ1uncoBaUDeJtcDigTd0OUwnMOsDuDptxw4DXEn3SCz9o2i8vB7uLzow3h0P6B5BfJed8jT-OZxeMvq1AfsJTjcgkEGJiwplal2xliuOGiIlY-UjbI0tjKLQ6RlsT9UlODcSsg8ipOBVkkmDkkrX-ZwRKjpx15rSETKvVRgUIiWWwdGIiLGqmPSRusXH5W6xaI2_OTv5lOyixtcAVbPSKtYbeCc7LjP4nW9uiiP5Au9hY8U
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61CnpSacW3OXg0bbqbbHZvltZSsV0LrdJb2SSzKMpW-vD3m9ldK4IXb3lBMglkhuT7viHkmvuJ73tWM69lLBMJKKYjo5hxzsFPUd0lx-Y8D1Qch9NpNKqQmw0XBgBy8Bk0sJj_5du5WeNTWTNw0UjkqS2yLYXweMHWKqWEWjxqdsZxdzxCvJZolGN_JU3JfUZv_3-zHZD6D_mOjjZu5ZBUIKuR2zZFiq7rMhjQYV4HsPRbEJy6yJOukVv7RlF7-N1dX_Sx1x22aVbAvJd18tS7m3T6rEx-wF6cy10xSCF0S0pEokwYai45KAik9aT20iTQIg1crKWx31Wkz7kWkFqUJwMlo9Q_ItVsnsExoWErsEpB5CfcCgkhStFybSAUiInR8oTU0PrZR6FvMSsNP_27-Yrs9ifDwWxwHz-ckT3c7AK-ek6qq8UaLsiO-Vy9LheX-fF8AV8gkls
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2014+9th+International+Symposium+on+Communication+Systems%2C+Networks+%26+Digital+Sign+%28CSNDSP%29&rft.atitle=A+chance+constrained+approach+for+uplink+wireless+OFDMA+networks&rft.au=Nunez%2C+Belarmino&rft.au=Adasme%2C+Pablo&rft.au=Soto%2C+Ismael&rft.au=Jianqiang+Cheng&rft.date=2014-07-01&rft.pub=IEEE&rft.spage=754&rft.epage=757&rft_id=info:doi/10.1109%2FCSNDSP.2014.6923927&rft.externalDocID=6923927