Completion time minimization and robust power control in wireless packet networks
Name
Ng-2009-Completion time minimization and robust power control in wireless packet networks.pdf
Size
159.49 KB
Format
Adobe PDF
Checksum (MD5)
3cf24f91eddd67149eca2989db82c19c
Author(s)
Ng, Chris T. K.
Medard, Muriel
Ozdaglar, Asuman E.
Date Issued
August 2009
Journal
IEEE International Conference on Communications, 2009. ICC '09.
Publisher
Institute of Electrical and Electronics Engineers
Citation
Ng, C.T.K., M. Medard, and A. Ozdaglar. “Completion Time Minimization and Robust Power Control in Wireless Packet Networks.” Communications, 2009. ICC '09. IEEE International Conference on. 2009. 1-6. © Copyright 2009 IEEE
Version
Final published version
Abstract
A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of all other users. A convex cost function of the completion times of the user packets are minimized by optimally allocating the users' transmission power subject to their respective power constraints. It is shown that, at all ranges of SINR, completion time minimization can be formulated as a convex optimization problem and hence can be efficiently solved. When channel knowledge is imperfect, robust power control is considered based on the channel fading distribution subject to outage probability constraints. The problem is shown to be convex when the fading distribution is log-concave in exponentiated channel power gains; e.g., when each user is under independent Rayleigh, Nakagami, or log-normal fading.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ICC.2009.5198837
