dc.contributor.author | Quek, Tony Q. S. | |
dc.contributor.author | Win, Moe Z. | |
dc.contributor.author | Chiani, Marco | |
dc.date.accessioned | 2011-10-04T22:06:13Z | |
dc.date.available | 2011-10-04T22:06:13Z | |
dc.date.issued | 2010-07 | |
dc.date.submitted | 2009-10 | |
dc.identifier.issn | 0090-6778 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/66183 | |
dc.description.abstract | Resource 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.sponsorship | United States. Office of Naval Research (Young Investigator Award N000140610064) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant no. ANI-0335256) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant no. ECS-0636519) | en_US |
dc.description.sponsorship | DoCoMo | en_US |
dc.description.sponsorship | Charles Stark Draper Laboratory | en_US |
dc.description.sponsorship | Institute of Advanced Study. Natural Science and Technology Fellowship | en_US |
dc.description.sponsorship | FP7 European Project EUWB | en_US |
dc.language.iso | en_US | |
dc.publisher | Institute of Electrical and Electronics Engineers / IEEE Communications Society | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/tcomm.2010.07.080277 | en_US |
dc.rights | Article 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.source | IEEE | en_US |
dc.title | Robust Power Allocation Algorithms for Wireless Relay Networks | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Quek, 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, IEEE | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems | en_US |
dc.contributor.approver | Win, Moe Z. | |
dc.contributor.mitauthor | Win, Moe Z. | |
dc.relation.journal | IEEE transaction on communications | en_US |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Quek, Tony Q.S.; Win, Moe Z.; Chiani, Marco | en |
dc.identifier.orcid | https://orcid.org/0000-0002-8573-0488 | |
mit.license | PUBLISHER_POLICY | en_US |
mit.metadata.status | Complete | |