Close category search window
 

Real-Time QoS in Enhanced 3G Cellular Packet Systems of a Shared Downlink Channel

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
$31 $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

3 Author(s)
Sang, A. ; NEC Lab. America, Princeton, NJ ; Xiaodong Wang ; Madihian, M.

We propose a call (user) admission control (CAC) algorithm and a scheduling framework for real-time services in the enhanced third-generation (3G) cellular systems, e.g., WCDMA HSDPA or cdma2000 HDR systems, where multiple IP users share a time-slotted downlink packet channel in each cell. At the user or flow level, the CAC algorithm maximizes user accommodations under the QoS constraint, e.g., per-user expectation of profile rate, and the constraint of location-dependent resource availability. At the packet level, our scheduling framework, named maximum cost deduction (MCD), derives two algorithms - both are QoS-aware and channel-dependent: One is called real-time MCD (rt-MCD), which minimizes a delay-derived cost function of backlogged packets at the smallest timescale; the other is called non-real-time MCD (nrt-MCD), which balances between the real-time delay deduction and the non-real-time (i.e., large-timescale) per-user fairness. The cross-layer designed CAC and MCD algorithms exploit multi-user diversity based on online measured radio resource allocation. Together they provide high system efficiency and a balance between flow-level QoS (e.g. the aggregate goodput and the blocking rate of newly arrived users) and packet-level QoS (e.g., the packet queueing delay or loss). Extensive simulations and comparisons with the prior art show that our algorithms can deliver efficient real-time services and remain robust to different load scenarios that vary according to system dynamics and/or user mobility

Published in:
Wireless Communications, IEEE Transactions on  (Volume:6 ,  Issue: 5 )

Date of Publication: May 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.