WO2003079703A1

WO2003079703A1 - Method and system for performing call admission control in the uplink for third generation wireless communication systems

Info

Publication number: WO2003079703A1
Application number: PCT/US2003/007191
Authority: WO
Inventors: Guodong Zhang
Original assignee: Interdigital Technology Corporation
Priority date: 2002-03-14
Filing date: 2003-03-11
Publication date: 2003-09-25
Also published as: EP1486082A1; TW200420149A; KR20080029014A; TWI260179B; NO20044340L; ATE347777T1; US6842618B2; EP1486082B1; EP1486082A4; KR20040101308A; DE60310209T2; TW200708129A; JP2005520443A; KR20050090478A; JP4047285B2; US20050068920A1; KR100715709B1; JP2007306628A; ES2278161T3; TW200304333A

Abstract

A method and system for performing call admission control in wireless communication systems is disclosed. Resource units required by a new user are assigned based on an outage probability of each uplink timeslot. The outage probability (20) of each timeslot is updated as the resource units are assigned so that each resource unit assignment results in the lowest possible contribution to total outage probability. Once all of the resource units are assigned, the total outage probability is computed based on the resource allocation. If the total outage probability is below a predetermined value, the new user is admitted. If the total outage probability (32) is above the predetermined value, the new user is rejected.

Description

* _

[0001] METHOD AND SYSTEM FOR PERFORMING CALL

ADMISSION CONTROL IN THE UPLINK FOR THIRD GENERATION WIRELESS COMMUNICATION SYSTEMS

[O002] BACKGROUND

[0003] The present invention relates to the field of communications, specifically wireless communications. More specifically, the present invention relates to call admission control in third generation wireless systems.

[0004] Third generation wireless communications, such as wideband code division multiple access time division duplex (WCDMA-TDD) systems, will support not only voice service, but also a wide range of broadband services, such as video and Internet traffic. In such a system, the goal of call admission control is to guarantee that the quality of service (QoS) is met for all users admitted into the system. Call admission control directly affects the QoS of mobile users, and the stability and capacity of the system. Therefore, call admission control is very important for the design of WCDMA-TDD systems.

[0005] In recent years, there have been some advances regarding call admission control in WCDMA-FDD systems but few in WCDMA-TDD systems.

One such system addresses the problem by making resource allocation based on a fixed required signal to interference ratio (SIR). In WCDMA-TDD systems, however, the required SIR of a user is not fixed and, in contrast, changes with time because of imperfect power control. In WCDMA-FDD systems, there are no timeslots whereas in WCDMA-TDD systems a user can use more than one timeslot.

[0006] A need therefore exists for providing call admission control for TDD systems.

[0007] SUMMARY

[0008] The present invention is a system and method for performing call admission control where admission decisions are based on a dynamic SIR requirement and the assumption that a user can use multiple timeslots. The present invention is implemented without using online measurement, thereby avoiding software and hardware implementation costs attributed thereto.

[0009] BRIEF DESCRIPTION OF THE DRAWING(S)

[0010] Figure 1 is a method for performing call admission control in the uplink for third generation wireless communication systems in accordance with the preferred embodiment of the invention.

[0011] Figure 2 is a call admission control system in accordance with the preferred embodiment of the invention.

[0012] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S) [0013] In accordance with the present invention, call admission control is performed in WCDMA-TDD systems (where users can use multiple timeslots) while taking into account the fact that each user's required signal to interference ratio (SIR) is a random variable. Resource allocation is optimized so as to yield the lowest total outage probability (P_out__tola, ) for a new user and to ensure P_ou,__lolal is below a predetermined value.

[0014] The present invention is preferably implemented using the following assumptions. First, as specified by the Third Generation Partnership Project (3GPP) standards, each frame is divided into 15 timeslots. Second, the chip rate of a WCDMA-TDD system is 3.84Mcps making the equivalent chip rate in one timeslot 256kcps (i.e. 3.84Mcps/15 = 256kcps). Third, a multi-user detection (MUD) receiver is used at the base station (BS).

[0015] In each timeslot, Orthogonal Variable Spreading Factor (OVSF) codes are used for channelization codes. The spreading factor of a channelization code can take a value of 2, 4, 8, and 16 in the uplink. For purposes of describing the present invention, a resource unit (RU) corresponds to a particular physical channel and is defined as a channelization code having spreading factor 16 in a particular time slot. RUs therefore correspond to physical channels in a particular timeslot. [0016] For a new user seeking admission to a cell, the primary goal of call admission control is to properly allocate RUs (i.e. physical channels) so that QoS requirements are guaranteed, for both the new user and any users already in the cell. The number of RUs required by a new user depends on the type of call the new user has placed. For example, a new user placing a voice call requires two RUs while a new user placing a 64k data call requires five RUs. [0017] Decisions made by a call admission control system are based on whether RUs can be allocated successfully for the new user. Whether a RU can be allocated successfully for a new user depends on the individual outage probabilities (P_out ) for all of the timeslots in which RUs have been assigned.

Therefore, P_out is the probability that, in a particular timeslot, a user's required

SIR will be below a certain predetermined value. In WCDMA-TDD systems, however, the required SIR of each user is not fixed, but follows a certain distribution thereby making P_mt difficult to calculate. That is, even though the distribution of the SIR is known, the computation of P_out is still very complex, and cannot be done in real time.

[0018] The Gaussian approximation, in contrast, provides a sufficiently approximate result and has relatively low computation complexity. Therefore, the Gaussian approximation approach is used to allow the RNC (Radio Network Controller) to compute P_mt for each timeslot and make resource allocation decisions in real time.

[0019] The P_out of every timeslot assigned to a new user may be combined to compute P_out→tai f°^r *^{ne new user}- Assuming a new user is allocated RUs in a particular number of timeslots, the P_mt__total of a new user is defined as the probability that an outage will occur in at least one of those timeslots. The P_out-_totai ^πιa* ^De computed as desired. By way of example, P_out__total may be

computed according to P_ow,__totø/ =1-]^ (1-P_ou, (zj) , where Ω is the set of timeslots in

^••=Ω which RUs have been allocated to the user. [0020] Referring now to Figure 1, a method 10 is shown wherein call admission control is performed in the uplink for third generation wireless communication systems. Assuming, purely for purposes of describing the invention, that a new user requires two RUs (i.e. the new user has placed a voice call), the method 10 begins in step 12 by computing the current P_0M of each uplink timeslot. Again, P_out is the probability that a new user's SIR is below a predetermined value in a particular timeslot and is computed for each uplink timeslot. Therefore, in step 12, the probability of the new user's SIR being below the predetermined value is computed for each timeslot. As explained, P_out accounts for the fact that the user's SIR changes with time and is computed by the RNC using the Gaussian approximation to reduce computation complexity. [0021] Once P_mt has been computed for each timeslot, the timeslot having the lowest P_mt , say timeslot i, is selected in step 14. Since timeslot i is the timeslot with the lowest P , the P_out in timeslot i is denoted P_out(i) . In step 16, one RU is assigned to timeslot i and P_out(i) is updated accordingly. Once the first RU has been assigned, the method proceeds to step 18. In step 18, the method determines whether additional RUs need to be assigned. As mentioned, for purposes of describing the invention, it can be assumed that the new user requires two RUs. Therefore, the determination in step 18 will be positive and the method will proceed to step 20. [0022] In step 20, the method determines whether P_out(i) is still the lowest

P_out (i.e. the method determines whether, despite being assigned a RU, timeslot i still has the lowest P_out ). If P_mt (i) is still the lowest P_mt , the method goes back to step 16 and the second RU is assigned to timeslot i and continues as indicated. If, in contrast, P_out(ϊ) is no longer the lowest P_out , the method proceeds to step 22.

In step 22, P_c ^' _ontributim is computed. The P_contribution is the contribution to P_out__tolal assuming the next RU (i.e. the second RU according to the assumption noted above) is accepted to timeslot i despite the fact that P_oul (i) is no longer the lowest P_BUt . The P_contri_buti_on is the same value as the new P_out of timeslot i. That is, _contri_buti_on is equal to P_mt (ij .

[0023] In step 24, P_contribution is computed. The P_contribution is the contribution to

P_out-_totai assuming the next RU (i.e. the second RU according to the assumption noted above) is accepted to the timeslot having the lowest P_oul , say timeslot j.

The P_contribution is given by _co„_/π._tø; ^. _o„ = l - (l- _Ott/( ) - (l -P_o„₍ ^')) - Once P_contribMim and P_contri_buti_on have been computed, the method proceeds to step 26 where it determines whether P_contribution is greater than or equal to P_c ^' _ontribution (i.e. P_mt(tj). If P_contribulion is greater than or equal to P_c ^' _ontribution , the method proceeds to step 16 wherein the next RU will be assigned to timeslot i despite the fact that timeslot i no longer has the lowest P_out . That is, even though timeslot i no longer has the lowest P_out , assigning the next RU to timeslot i will result in a lower P_out__lotal than assigning the next RU to timeslot j, which actually has the lowest P_out . If, in contrast, _contri_buti_on is l^ess than P_c ^' _ontribution , i is set equal to j in step 28 and the method proceeds to step 16. The method sets i equal to j so that, in step 16, the next RU is assigned to timeslot j because assigning the next RU to timeslot will result in the lowest P_out__mal .

[0024] From step 16, the method again proceeds to step 18. Note, steps 20 through 28 would not have been necessary where the new user only needed one RU. But, because in the assumption of the example the user needed two RUs, one run through steps 20 through 28 was necessary in order to determine the optimal allocation of the second RU. Steps 20 through 28 are performed, as needed, for every RU required by the user. Once all of the RUs have been assigned, the method proceeds to step 30. In step 30, P_out__total is computed to determine the outage probability of the new user based on the allocation of RU(s), as allocated in steps 12 through 28.

[0025] In step 32, the method determines whether P_out__mal is less than or equal to a predetermined value, say θ. The predetermined value θ is an operator dependent parameter and may be any value, as desired, depending on the desired level of network stability. If P_out__totaι is less than θ, the new user is admitted (step

34). If not, the new user is rejected (step 36).

[0026] Pursuant to the present invention, P_out__total increases as the number of users increases and saturates around the predetermined value θ thereby dramatically improving system stability (i.e. the number of dropped calls). Due to the stringent admission standards, the present invention also results in a dramatic increase in blocking probability (which also increases as the number of users) in comparison to static sequential and random call admission control methods. The combination of increased stability and blocking probability significantly improves users QoS as, from a user's perspective, having a call blocked is much more preferable than having a call dropped. [0027] Referring now to Figure 2, a system 100 is shown for implementing call admission control according to the present invention. The system 100 comprises a RNC 102, a BS or Node-B 104 and user equipment (UE) 106 wherein the BS and UE each have a multi-user detection (MUD) receiver 103, 108, respectively.

[0028] When the UE 106 is used by a user to place a call, the RNC 102 will perform call admission control and allocate RUs required by that new call to appropriate timeslots so as to ensure the lowest possible P_rø/__toto/ and to ensure that P_out__total remains below the predetermined threshold θ.

[0029] To perform call admission control, the RNC 102 computes P_out for every uplink timeslot and assigns a RU to the timeslot with the lowest P_oM . If there are additional RUs required by the new user that need to be allocated, the RNC 102 will assign subsequent RUs to the same timeslot the previous RU was assigned to, so long as that timeslot still has the lowest P_out . If that timeslot no longer has the lowest P_oul , the RNC 102 will determine whether it still should assign subsequent RUs to that timeslot or to the timeslot now having the lowest P_out . To make that determination the RNC 103 determines which timeslot results in the lowest contribution to P_out__total ■ The RNC repeats this analysis for every RU required by the new call.

[0030] Once all of the RUs that are required by the new user have been allocated to particular timeslots, the RNC 103 determines whether the allocation results in P_out__total being below the predetermined θ. If P __lolal is below θ, the new user is admitted. If not, the new user is rejected.

[0031] Although the present invention has been described in detail, it is to be understood that the invention is not limited thereto, and that various changes can be made therein without departing from the spirit and scope of the invention, which is defined by the attached claims.

Claims

CLAIMS What is claimed is:

1. A method for performing call admission control comprising: assigning resource units required by a new user to timeslots based on outage probability of each individual timeslot; computing a total outage probability for the new user; determining whether the total outage probability is below a predetermined value; and admitting the new user where the determination is positive.

2. A method as in claim 1 wherein the step of assigning resource units is performed by: computing an outage probability for each timeslot; assigning a first resource unit to the timeslot having the lowest outage probability; and assigning subsequent resource units to timeslots that will result in the lowest total outage probability for the new user.

3. A method as in claim 2 wherein the timeslots that will result in the lowest total outage probability are selected based on each of their individual contributions to total outage probability.

4. A method for performing call admission control comprising: computing an outage probability for each uplink timeslot; assigning a first resource unit required by a new user to the timeslot having the lowest outage probability; assigning subsequent resource units required by the new user to timeslots that will result in the lowest total outage probability for the new user; computing a total outage probability based on which timeslots have been assigned resource units; and admitting the new user if the total outage probability is below a predetermined value.

5. A method as in claim 4 wherein the timeslots that will result in the lowest total outage probability for the new user are identified by identifying the timeslots that contribute the least to the total outage probability of the user.

6. A method for performing call admission control comprising: computing an outage probability for each timeslot; identifying a timeslot having the lowest outage probability; assigning a first resource unit required by a new user to the identified timeslot; assigning subsequent resource units required by the new user to a group of timeslots that minimizes total outage probability of the new user; computing a total outage probability based on which timeslots have been assigned resource units; and admitting the new user if total outage probability is less than a predetermined value.

7. A method as in claim 6 wherein each timeslot in the group of timeslots is selected based on its individual contribution to total outage probability.

8. A method as in claim 6 wherein the step of assigning subsequent resources further comprises: computing a first value indicative of the contribution to the total outage probability if a subsequent resource unit is assigned to the identified timeslot; computing a second value indicative of the contribution to the total outage probability if a subsequent resource unit is assigned to a timeslot other than the identified timeslot; continuing to assign subsequent resource units to the identified timeslot as long as the second value is not greater than or equal to the first value; and assigning subsequent resource units to a timeslot other than the identified timeslot if the second value is greater than or equal to the first value.

9. A call admission control system comprising: user equipment; a base station; and a radio network controller wherein the radio network controller is adapted to: assign resource units required by a new user to a plurality of timeslots based on each timeslots individual contribution to total outage probability of the new user; and admit the new user where the total outage probability of the new user is below a predetermined value.

10. A call admission control system as in claim 9 wherein the radio network controller is adapted to: compute an outage probability for each uplink timeslot each time a new user seeks admission; assign a first resource unit required by the new user to the timeslot having the lowest outage probability; assign subsequent resource units required by the new user to a group of timeslots that will result in the lowest total outage probability for the new user; and admit the new user if total outage probability is below a predetermined value.

11. A call admission control system as in claim 10 wherein each timeslot in the group of timeslots is selected based on its individual contribution to total outage probability.

12. A call admission control system as in claim 10 wherein the radio network controller is configured to select the group of timeslots by: computing a first value indicative of the contribution to the total outage probability if a subsequent resource unit is assigned to the identified timeslot; computing a second value indicative of the contribution to the total outage probability if a subsequent resource unit is assigned to a timeslot other than the identified timeslot; continuing to assign subsequent resource units to the identified timeslot as long as the second value is not greater than or equal to the first value; and assigning subsequent resource units to a timeslot other than the identified timeslot if the second value is greater than or equal to the first value.