Channel assignment with QoS guarantees for a multiclass multicode CDMA system
Cited 0 times inCited 0 times in
- Channel assignment with QoS guarantees for a multiclass multicode CDMA system
- Do, Mi-Sun; Park, Yongjun; Lee, Jaiyong
- Issue Date
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, v.51, no.5, pp.935 - 948
- In a wireless system that supports multimedia services, each traffic requires different quality of service (QoS) at both communication on radio links and connection admission. In this paper, we initially derive the uplink capacity satisfying the QoS constraint on radio links in a multiclass multicode code-division multiple-access (CDMA) system. Based on the derived capacity, the number of channel elements, which is one of the system resources, is determined. Then, we define the QoS parameters associated with connection processes. To guarantee the defined QoS at connection level, under given channel elements, we propose a channel-assignment scheme with dynamic priority adjustment (DPA). The proposed scheme gives multipriority to different traffic classes. Real-time classes can preempt non-real-time classes with restricted preemptive priority, Such restriction is regulated by preemption-free code channels and a buffer threshold for non-real-time classes. Among real-time classes, different priorities are assigned to each traffic class by code reservation parameters. These multipriority parameters are dynamically adjusted in order to guarantee different QoS requirements. We analyze the DPA scheme by the matrix-geometric method, and evaluate the performance of each traffic class. The results show that the proposed scheme flexibly guarantees QoS depending on traffic loading condition and achieves high channel, utilization.
- Appears in Collections:
- ECE_Journal Papers
- Files in This Item:
- There are no files associated with this item.
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.