Dynamic Code Sharing Algorithms for IP Quality of Service in Wideband CDMA 3G Wireless Networks
This research investigated the efficient utilization of wireless bandwidth in Code Division Multiple Access (CDMA)systems that support multiple data rates with Orthogonal Variable Spreading Factor (OVSF)codes. The specific problem being addressed was that currently proposed public-domain algorithms for assigning OVSF codes make inefficient use of wireless bandwidth for bursty data traffic sources with different Quality of Service (QoS) requirements. The purpose of this research was to develop an algorithm for the assignment of OVSF spreading codes in a Third-Generation (3G)Wideband CDMA (WCDMA)system. The goal of this algorithm was to efficiently utilize limited, wireless resources for bursty data traffic sources with different QoS requirements.
The key contribution of this research was the implementation and testing of two code sharing techniques which are not implemented in existing OVSF code assignment algorithms. These techniques were termed statistical multiplexing and dynamic code sharing. The statistical multiplexing technique used a shared channel to support multiple bursty traffic sources. The dynamic code sharing technique supported multiple data users by temporarily granting access to dedicated channels. These techniques differed in terms of both complexity and performance guarantees.
Advisor:Scott F. Midkiff; Nathaniel J. Davis, IV; Charles W. Bostian; Srinidhi Varadarajan; Timothy Pratt
School:Virginia Polytechnic Institute and State University
School Location:USA - Virginia
Source Type:Master's Thesis
Keywords:electrical and computer engineering
Date of Publication:04/26/2002