Close category search window
 

Handoff algorithms in dynamic spreading WCDMA system supporting multimedia traffic

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)
Ju Wang ; Virginia Commonwealth Univ., Richmond, VA, USA ; Liu, J.C.L. ; Yuehao Cen

The undergoing third-generation wireless network needs to support the integration of voice and multimedia data services with varying quality-of-service (QoS) requirements. It is critical that the least bit-error rate (BER) for voice traffic, World Wide Web (WWW) traffic, and streaming video traffic be guaranteed at all time. In this paper, we discussed the integration of soft handoff and dynamic spreading factor in wideband code-division multiple-access system in supporting multimedia traffic. The contribution of our work is twofold. First, the processing time of the handoff request is analyzed. We found that intensive mobile handoff might consume significant amount of access channel time and increase the delay of handoff. We, therefore, proposed a batch mechanism such that multiple handoff requests could be processed simultaneously. The average delay is reduced from 1.12 s to 800 ms at heavy handoff rate. Our second contribution is a new resource allocation algorithm, where the spreading factor and transmission power for the handoff mobiles are jointly considered to maximize the throughput. The BER requirements for the handoff mobiles and the target cell are maintained during the handoff process. The original problem is formulated into a nonlinear programming format. We proposed a procedure to simplify it into a linear constraint problem, which is solved by a revised simplex method. Numerical results show a 25% increase in throughput for WWW traffic and a 26% improvement for the video traffic.

Published in:
Selected Areas in Communications, IEEE Journal on  (Volume:21 ,  Issue: 10 )

Date of Publication: Dec. 2003

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.