Show simple item record

dc.contributor.authorQuek, Tony Q. S.
dc.contributor.authorWin, Moe Z.
dc.contributor.authorChiani, Marco
dc.date.accessioned2011-10-04T22:06:13Z
dc.date.available2011-10-04T22:06:13Z
dc.date.issued2010-07
dc.date.submitted2009-10
dc.identifier.issn0090-6778
dc.identifier.urihttp://hdl.handle.net/1721.1/66183
dc.description.abstractResource allocation promises significant benefits in wireless networks. In order to fully reap these benefits, it is important to design efficient resource allocation algorithms. Here, we develop relay power allocation (RPA) algorithms for coherent and noncoherent amplify-and-forward (AF) relay networks. The goal is to maximize the output signal-to-noise ratio under individual as well as aggregate relay power constraints. We show that these RPA problems, in the presence of perfect global channel state information (CSI), can be formulated as quasiconvex optimization problems. In such settings, the optimal solutions can be efficiently obtained via a sequence of convex feasibility problems, in the form of second-order cone programs. The benefits of our RPA algorithms, however, depend on the quality of the global CSI, which is rarely perfect in practice. To address this issue, we introduce the robust optimization methodology that accounts for uncertainties in the global CSI. We show that the robust counterparts of our convex feasibility problems with ellipsoidal uncertainty sets are semi-definite programs. Our results reveal that ignoring uncertainties associated with global CSI often leads to poor performance, highlighting the importance of robust algorithm designs in practical wireless networks.en_US
dc.description.sponsorshipUnited States. Office of Naval Research (Young Investigator Award N000140610064)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant no. ANI-0335256)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant no. ECS-0636519)en_US
dc.description.sponsorshipDoCoMoen_US
dc.description.sponsorshipCharles Stark Draper Laboratoryen_US
dc.description.sponsorshipInstitute of Advanced Study. Natural Science and Technology Fellowshipen_US
dc.description.sponsorshipFP7 European Project EUWBen_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers / IEEE Communications Societyen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/tcomm.2010.07.080277en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceIEEEen_US
dc.titleRobust Power Allocation Algorithms for Wireless Relay Networksen_US
dc.typeArticleen_US
dc.identifier.citationQuek, Tony Q.S., Moe Z. Win, and Marco Chiani. “Robust Power Allocation Algorithms for Wireless Relay Networks.” Communications, IEEE Transactions on 58.7 (2010): 1931-1938. Copyright © 2010, IEEEen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Laboratory for Information and Decision Systemsen_US
dc.contributor.approverWin, Moe Z.
dc.contributor.mitauthorWin, Moe Z.
dc.relation.journalIEEE transaction on communicationsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsQuek, Tony Q.S.; Win, Moe Z.; Chiani, Marcoen
dc.identifier.orcidhttps://orcid.org/0000-0002-8573-0488
mit.licensePUBLISHER_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record