Completion time minimization and robust power control in wireless packet networks
Author(s)
Ng, Chris T. K.; Medard, Muriel; Ozdaglar, Asuman E.
DownloadNg-2009-Completion time minimization and robust power control in wireless packet networks.pdf (159.4Kb)
PUBLISHER_POLICY
Publisher Policy
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.
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2009-08Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
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
Other identifiers
INSPEC Accession Number: 10815295
ISBN
978-1-4244-3435-0
ISSN
1938-1883