Completion time minimization and robust power control in wireless packet networks
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 t...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2010
|
| Online Access: | http://hdl.handle.net/1721.1/60031 https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-4059-407X |
| _version_ | 1826192863646449664 |
|---|---|
| author | Ng, Chris T. K. Medard, Muriel Ozdaglar, Asuman E. |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Ng, Chris T. K. Medard, Muriel Ozdaglar, Asuman E. |
| author_sort | Ng, Chris T. K. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T09:30:20Z |
| format | Article |
| id | mit-1721.1/60031 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T09:30:20Z |
| publishDate | 2010 |
| publisher | Institute of Electrical and Electronics Engineers |
| record_format | dspace |
| spelling | mit-1721.1/600312022-09-26T11:51:37Z Completion time minimization and robust power control in wireless packet networks Ng, Chris T. K. Medard, Muriel Ozdaglar, Asuman E. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Ozdaglar, Asuman E. Ng, Chris T. K. Medard, Muriel Ozdaglar, Asuman E. 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. Space and Naval Warfare System Center (SPAWARSYSCEN) and DARPA (Contract No. N66001-06-C-2020 and N66001-08-C-2013) (subcontract #069145 and #060786) 2010-11-23T16:50:36Z 2010-11-23T16:50:36Z 2009-08 2009-06 Article http://purl.org/eprint/type/ConferencePaper 978-1-4244-3435-0 1938-1883 INSPEC Accession Number: 10815295 http://hdl.handle.net/1721.1/60031 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 https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1109/ICC.2009.5198837 IEEE International Conference on Communications, 2009. ICC '09. 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. application/pdf Institute of Electrical and Electronics Engineers IEEE |
| spellingShingle | Ng, Chris T. K. Medard, Muriel Ozdaglar, Asuman E. Completion time minimization and robust power control in wireless packet networks |
| title | Completion time minimization and robust power control in wireless packet networks |
| title_full | Completion time minimization and robust power control in wireless packet networks |
| title_fullStr | Completion time minimization and robust power control in wireless packet networks |
| title_full_unstemmed | Completion time minimization and robust power control in wireless packet networks |
| title_short | Completion time minimization and robust power control in wireless packet networks |
| title_sort | completion time minimization and robust power control in wireless packet networks |
| url | http://hdl.handle.net/1721.1/60031 https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-4059-407X |
| work_keys_str_mv | AT ngchristk completiontimeminimizationandrobustpowercontrolinwirelesspacketnetworks AT medardmuriel completiontimeminimizationandrobustpowercontrolinwirelesspacketnetworks AT ozdaglarasumane completiontimeminimizationandrobustpowercontrolinwirelesspacketnetworks |