By Topic

Cross layer dynamic resource allocation with targeted throughput for WCDMA data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Peifang Zhang ; is with the Department of Electrical Engineering and Computer Science, University of California, Irvine, CA 92697, USA ( ; Scott Jordan

We consider resource allocation for elastic wireless applications that measure utility by target connection average throughput and achieved throughput. We construct a framework for connection access control and rate scheduling that supports this class of applications by maximizing long term average utility. We present a decomposition of the problem into connection access control and rate scheduling layers. The connection access control layer considers current commitments and decides whether to admit new sessions. For admitted users, the layer sets a target throughput to be achieved of the lifetime of the session. The rate scheduling layer adjusts the instantaneous rates of each connection on the basis of how well it is achieving each performance goal and on the relative strength of each connectionpsilas current channel. We illustrate how commonly used connection access control and rate scheduling techniques can be applied to design these two layers using an exchange of information regarding future target throughputs and achieved throughputs. Through numerical analysis, we show how wireless channel time diversity and multi-user diversity can be exploited to construct a rate scheduling algorithm that is superior to proportional fairness. Finally, this utility-based framework is compared to a method that does not use utility.

Published in:

IEEE Transactions on Wireless Communications  (Volume:7 ,  Issue: 12 )