Computer Science – Information Theory
Scientific paper
2008-12-18
Computer Science
Information Theory
16 pages, 7 figures
Scientific paper
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 is minimized by optimally allocating the users' transmission power subject to their respective power constraints. At all ranges of SINR, completion time minimization can be formulated as a convex optimization problem and hence can be efficiently solved. In particular, although the feasible rate region of the wireless network is non-convex, its corresponding completion time region is shown to be convex. 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. Applying the optimization frameworks in a wireless cellular network, the average completion time is significantly reduced as compared to full power transmission.
Medard Muriel
Ng Chris T. K.
Ozdaglar Asuman
No associations
LandOfFree
Completion Time Minimization and Robust Power Control in Wireless Packet Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Completion Time Minimization and Robust Power Control in Wireless Packet Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Completion Time Minimization and Robust Power Control in Wireless Packet Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-172689