Добавил:
Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:

Advanced Wireless Networks - 4G Technologies

.pdf
Скачиваний:
60
Добавлен:
17.08.2013
Размер:
21.94 Mб
Скачать

418 ADAPTIVE RESOURCE MANAGEMENT

a data-only system and Viterbi [48] proposed a 1-bit feedback scheme in an integrated voice/data system. The implementations might vary from one to another, but they all agreed that the feedback schemes should be simple and effective. Based on the results from the previous subsection, TPP and optimized bit-rate for packet transmissions in the next timeslot can be predicted. In the case of QoS differentiation, TTI or packet-length can be changed as well. These parameters can be transmitted in the content of feedback information. For instance, let the service criteria be to serve as many users simultaneously as possible with optimal throughput-delay tradeoff and no QoS differentiation. The number of active data users in next time-slot, D = N , and load state c* of the RT traffic at the end of current time-slot are supposed to be known. Based on Equations (12.65) and (12.66) together with assumption (4a), a bit-rate can be chosen so that the S(c*)/D factor is as close to 1 as possible. TPP for users attempting to transmit their packet in next time-slot is set equal to min[1, S(c*)/D]. Thus, the maximum number of users can be served with optimum UL throughput and reasonable average packet-delay of S/D, where S is given by Equation (12.67). However, one can notice that, if a terminal has a packet to send, it needs to wait until next time-slot to attempt its transmission. Therefore, access delay to the first attempt per packet can be up to 1 time-slot. A packet transmission can be synchronized to the beginning of a mini-slot (e.g. a 10 ms radio frame can be further divided into 15 mini-slots as in 3GPP standards) to reduce the delay. This results in a spread-slotted asynchronous multiple access system with feedback control, which is similar to the schemes reported in References [71, 75–79] for a data-only CDMA radio system. DFIMA can be extended to provide flexible means of QoS differentiation. This can be done through setting different TPP or/and TTI or/and bit-rate for different user classes in feedback information depending on load state of the RT traffic and offered load of the NRT traffic. DFIMA can be expected to outperform the well-known ALOHA and CSMA in throughput-delay tradeoff to the same extend as shown in Rappaport [71]. Also, this approach should overcome the hidden terminal problem using feedback, and be simpler and more flexible than PRMA.

12.4.15 Performance examples

A number of numerical and simulation results are presented in this section in order:

to quantify the system performance and the benefits of using the described SCAC and the QoS differentiation;

to study the effects and tradeoffs of the design parameters in the access control on the system behaviors and the performance characteristics through various system scenarios;

to demonstrate the flexibility and the accuracy of the analytical methods used to evaluate the teletraffic performance of WCDMA cellular systems in this section.

The results are presented for a cellular system supporting three RT service classes: class 1 is 12.2 kbs voice, class 2 is 64 kbs video and class 3 is 144 kbs multimedia calls. The parameters are given in Table 12.4, which are in agreement with Ariyavisitakul [53]. Owing to limited space, we present results for offered traffic intensities of the three service classes in following proportions: 7:2:1, 5:4:1 and 4:3:3 of class 1, class 2 and class 3, respectively. These proportions are called multimedia traffic intensity profiles, MTIP. In words, let λ be a so-called common divisor of the three-class offered traffic; 7:2:1 MTIP, for instance, means

CDMA CELLULAR MULTIMEDIA WIRELESS NETWORKS

419

 

100

 

 

 

 

 

 

 

 

10-1

 

 

 

 

 

 

 

 

10-2

 

 

 

 

 

MsCAC-B1

 

probabilities

 

 

 

 

 

 

MsCAC-B2

 

10-3

 

 

 

 

 

MsCAC-B3

 

 

 

 

 

 

MdCAC-B1

 

 

 

 

 

 

 

MdCAC-B2

 

10-4

 

 

 

 

 

MdCAC-B3

 

Blocking

 

 

 

 

 

 

 

 

 

 

 

 

 

10-5

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

10-6

Offered traffic of the three service classes in 4:3:3 MTIP

 

 

10-7

 

 

 

 

 

 

 

 

0.5

1

1.5

2

2.5

3

3.5

4

 

 

 

Common divisor of the offered traffic

 

 

Figure 12.11 MdCAC vs MsCAC.

Blocking probabilities

100

 

 

 

 

 

 

10-1

 

 

 

 

 

 

 

 

 

 

 

MEM-B1

 

 

 

 

 

 

MEM-B2

 

 

 

 

 

 

MEM-B3

 

10-2

 

 

 

 

MLESS-B1

 

 

 

 

 

 

MLESS-B2

 

 

 

 

 

 

MLESS-B3

 

10-3

 

 

 

 

 

 

 

Offered traffic of the three service classes in 4:3:3 MTIP

 

 

MEM: memory(auto-regressive) MsCAC

 

 

 

 

MLESS: memory less MsCAC

 

 

 

 

10-4

 

 

 

 

 

 

1

1.5

2

2.5

3

3.5

4

 

 

Common divisor of the offered traffic

 

 

Figure 12.12 Memory vs memoryless MsCAC systems.

that the offered traffic of class 1 is 7λ Erlangs, class 2 is 2λ Erlangs and class 3 is λ Erlangs. Thus, the total offered traffic is 10 Erlangs if λ = 1.

Figure 12.11 presents the new-call blocking as well as the handoff failure probability of each service class in MdCAC and MsCAC systems vs the common divisor of the offered traffic intensities of the service classes in 4:3:3 MTIP. This figure confirms that there is no capacity gain using MsCAC for serving CBR services. Figure 12.12 shows the need for stable and reliable measurements in MsCAC systems. The performance characteristics of a memoryless measurement-based and a memory (auto-regressive) measurement-based system are presented also for 4:3:3 MTIP. Estimations with the help of auto-regressive filters may results in better performance, but more complex hardware/software is needed. Figures 12.13–12.15 present the handoff failure and new-call blocking probabilities of the

420 ADAPTIVE RESOURCE MANAGEMENT

 

100

 

 

 

 

 

 

 

 

10-2

 

 

 

 

 

 

 

probabilities

10-4

 

 

 

 

B1&F1-MdCAC

 

 

 

 

 

 

B2&F2-MdCAC

 

 

 

 

 

 

B3&F3-MdCAC

 

 

 

 

 

 

B1-SCAC

 

Blocking

 

 

 

 

 

 

-6

 

 

 

 

B2-SCAC

 

10

 

 

 

 

B3-SCAC

 

 

 

 

 

 

 

 

 

 

 

 

F1-SCAC

 

 

 

 

 

 

 

 

F2-SCAC

 

 

 

10-8

 

 

 

 

F3-SCAC

 

 

 

Offered traffic of the three service classes in 4:3:3 MTIP

 

 

 

10-10

 

 

 

 

 

 

 

 

0.5

1

1.5

2

2.5

3

3.5

4

 

 

 

Common divisor of the offered traffic

 

 

Figure 12.13 SCAC vs MdCAC in 4:3:3 MTIP.

 

100

 

 

 

 

 

 

 

 

10-2

 

 

 

 

 

 

 

 

10-4

 

 

 

 

 

 

 

s

 

 

 

 

 

 

 

 

ie

 

 

 

 

 

 

B1&F1-MdCAC

 

lit

10-6

 

 

 

 

 

 

 

 

 

 

 

 

 

babi

 

 

 

 

 

B2&F2-MdCAC

 

 

 

 

 

 

 

B3&F3-MdCAC

 

o

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

r

 

 

 

 

 

 

B1-SCAC

 

p

 

 

 

 

 

 

 

ng

-8

 

 

 

 

 

B2-SCAC

 

i

10

 

 

 

 

 

B3-SCAC

 

k

 

 

 

 

 

 

 

c

 

 

 

 

 

 

 

o

 

 

 

 

 

 

F1-SCAC

 

l

 

 

 

 

 

 

 

B

 

 

 

 

 

 

 

-10

 

 

 

 

 

F2-SCAC

 

 

 

 

 

 

 

 

 

10

 

 

 

 

 

F3-SCAC

 

 

 

 

 

 

 

 

 

 

10-12

 

 

 

 

 

 

 

 

 

Offered traffic of the three service classes in 5:4:1 MTIP

 

 

10-14

 

 

 

 

 

 

 

 

0.5

1

1.5

2

2.5

3

3.5

4

 

 

 

Common divisor of the offered traffic

 

Figure 12.14 SCAC vs MdCAC in 5:4:1 MTIP.

SCAC system in comparison with the MdCAC system for 4:3:3, 5:4:1 and 7:2:1 MTIPs respectively. Figure 12.16 demonstrates that the SCAC system with the incomplete Gamma decision function offers better average communication quality, but slightly worse equilibrium blocking and dropping characteristics compared with the Gaussian function. The freedom of choosing such decision functions to fulfill the performance requirements increases the flexibility of the SCAC policy. The 4:3:3 MTIP is used in Figure 12.16. The QoS loss probability vs the offered traffic in 7:2:1 MTIP are listed in Table 12.6 for different

 

100

 

 

 

 

 

 

 

s

10-5

 

 

 

 

 

 

 

ilitie

 

 

 

 

 

 

B1&F1-MdCAC

 

 

 

 

 

 

 

B2&F2-MdCAC

 

probab

 

 

 

 

 

 

 

 

 

 

 

 

 

B3&F3-MdCAC

 

 

 

 

 

 

 

B1-SCAC

 

ng

 

 

 

 

 

 

 

 

 

 

 

 

 

B2-SCAC

 

i

 

 

 

 

 

 

 

ock

10-10

 

 

 

 

 

B3-SCAC

 

 

 

 

 

 

F1-SCAC

 

Bl

 

 

 

 

 

 

 

 

 

 

 

 

 

F2-SCAC

 

 

 

 

 

 

 

 

F3-SCAC

 

 

 

Offered traffic of the three service classes in 7:2:1 MTIP

 

 

10-15

1

1.5

2

2.5

3

3.5

4

 

0.5

 

 

 

Common divisor of the offered traffic

 

Figure 12.15 SCAC vs MdCAC in 7:2:1 MTIP.

 

100

 

 

 

 

 

 

 

 

10-2

 

 

 

 

 

 

 

probabilities

 

 

 

 

 

B1-GaussianSCAC

 

10

-4

 

 

 

B2-GaussianSCAC

 

 

 

 

 

B3-GaussianSCAC

 

 

 

 

 

 

 

 

 

 

 

 

Ploss-GaussianSCAC

 

 

 

 

 

 

B1-IncGammaSCAC

 

10-6

 

 

 

B2-IncGammaSCAC

 

Loss

 

 

 

 

 

 

 

 

 

B3-IncGammaSCAC

 

 

 

 

 

 

Ploss-IncGammaSCAC

 

 

 

 

 

 

 

 

 

10-8

 

 

 

 

 

 

 

 

 

 

Offered traffic of the three service classes in 4:3:3 MTIP

 

 

10-10

 

 

 

 

 

 

 

 

 

0.5

1

1.5

2

2.5

3

3.5

4

 

 

 

 

Common divisor of the offered traffic

 

 

Figure 12.16 Flexibility of choosing decision function in the SCAC system.

Table 12.6 QoS loss probability in comparison

The three-class RT offered traffic, e.g. in 7:2:1 MTIP

 

 

 

Common divisor

 

 

 

 

 

 

 

Traffic

1

1.5

2

2.5

3

 

 

 

 

 

 

MdCAC

0

0

0

0.0001

0.0007

MsCAC

0

0.0002

0.0024

0.0114

0.0315

GaussianSCAC

0

0

0.0001

0.0020

0.0119

IncGammaSCAC

0

0

0.0001

0.0013

0.0072

SCAC with threshold QoSDiff

0

0

0

0.0001

0.0005

SCAC with fracturing QoSDiff

0

0

0

0.0003

0.0021

 

 

 

 

 

 

422 ADAPTIVE RESOURCE MANAGEMENT

 

100

 

 

 

 

 

 

10-2

 

 

 

 

 

probabilities

10-4

 

 

 

 

 

10-6

 

 

 

 

 

 

 

 

 

 

 

Blocking

10-8

 

 

 

 

 

 

10-10

BxCS: SCAC system without QoS differentiation

 

 

 

 

 

 

BxxQT and FxQT: with threshold QoS differentiation

 

10-12

Offered traffic of the three service classes in 4:3:3 MTIP

 

 

 

 

 

 

 

0.5

1

1.5

2

2.5

3

Common divisor of the offered traffic

B1CS

B2CS

B3CS

B21QT

B22QT

B23QT

B11QT

B12QT

B13QT

F1QT

F2QT

F3QT

3.54

Figure 12.17 SCAC system with threshold hard blocking QoS differentiation.

CAC systems. Although the SCAC system suffers slight degradation of the communication quality, it yields significant improvements in the handoff failure probability and in the call blocking probability. The traffic shaping gain of the SCAC is clearly illustrated in Figure 12.15, where the traffic intensity of the voice calls is really high. For a predefined performance requirements, e.g. less than 0.1 and 0.5 % handoff failure probability for voice and other calls respectively, less than 1, 5 and 10 % new-call blocking probability for class 1, class 2 and class 3, respectively, and 10 % allowable equilibrium outage probability, the SCAC system overall offers much better Erlang capacity. Moreover, there is no need for redesign of the capacity thresholds in the SCAC system as long as the range of allowable uncertainty is maintained with the help of other control mechanisms such as TPC, linkadaptation, etc. Thus, the robustness is also well improved over the MdCAC system. SCAC has demonstrated an efficient RRU and capacity enhancement.

With QoS differentiation, operators can customize the operation of serving networks. Figure 12.17 presents the performance characteristics of the following simple scenario. Users are divided into two user classes: business ( j = 1) and economy class ( j = 2). Requests of the business users for any RT services are served immediately as long as there are enough resources for accommodating them. On the other hand, requests of the economy users are served only if less than 70 % of effective resources are occupied by RT traffic, i.e. system load state c less than 0.5. Assume that demands for services of user classes are equal. Thus, arrival rates of new call requests from user classes for each service class are equal. Invoke assumption (3b) with λl,1k = λl,2k for k = 1, 2, 3. The offered traffic of e.g. 4:3:3 MTIP above can be split for each user class resulting in 2:2:1.5:1.5:1.5:1.5 MTIP of six traffic classes. The factor a0 jk (c) of admission probability in (12.56) can be determined by (12.49), where the blocking threshold of business class l1k is Cu and of economic class l2k is 0.5 for all k. This numerical example clearly demonstrates the effects of QoS differentiation on performance characteristics. The business class not only experiences much better GoS, but also better communication quality during the calls.

CDMA CELLULAR MULTIMEDIA WIRELESS NETWORKS

423

Figure 12.18 illustrates the QoS differentiation with load-based fracturing factors for softblocking of new calls of the economic class. This is based on a simple scenario as follows. Again we assume handoff calls have the highest priority regardless of associated user class. The business class is served as long as resources are available. The economy class can share the resources equally with the business class if less than 65 % of effective resources are occupied, i.e. c is less than 0.47. Otherwise, if c is less than Cl , invoke (12.56) with:

a0 21(c) = 0.8, a0 22(c) = a0 23(c) = 0.6. If c is less than Cu, a0 21(c) = 0.4, a0 22(c) = a0 23(c) = 0.3. Otherwise, a0 21(c) = a0 22(c) = a0 23(c) = 0.

The offered traffic is the same as in the previous scenario. Figures 12.17 and 12.18 show that the performance characteristics of the system can easily be tuned by using either threshold-based hard blocking or fracturing factor-based soft blocking paradigms. For NRT packet radio access, additional parameters are given in Table 12.7.

The average upper-limit UL data throughput for packet transmissions with 64 kbs and 10 ms TTI is presented in Figure 12.19 vs different offered traffic intensities of the three RT service classes, which are in 7:2:1, 5:4:1 and 4:3:3 MTIPs. The impacts of bit-rates on average upper-limit throughput with constant Tp duration of 10 ms are presented in Figure 12.20. Figure 12.21 illustrates the effects of Tp with a constant bit-rate of 64 kbs. Table 12.8 summarizes the mean values of aggregate RT traffic and quasi-stationary free

 

100

 

 

10-2

B1CS

 

 

 

 

B2CS

probabilities

 

B3CS

10-4

B21QF

B22QF

 

B23QF

 

B11QF

 

B12QF

Blocking

10-6

B13QF

 

 

10-8

Offered traffic of the three service classes in 4:3:3 MTIP

 

 

BxCS: SCAC system without QoS differentiation

 

 

 

BxxQF: with fracturing QoS differentiation

 

 

 

10-10

 

 

 

 

 

 

 

0.5

1

1.5

2

2.5

3

3.5

4

Common divisor of the offered traffic

Figure 12.18 SCAC system with fracturing soft blocking QoS differentiation.

Table 12.7 Parameter summary for packet radio access

 

Definition

Values

 

 

 

Tp

Packet transmit duration

10, 20, 30 or 40ms

R

Bit-rate for packet transmissions

32, 64, 144 or 384 kbs

γp

SIR target

3, 2, 1.5 or 1 dB for the above

 

 

bit-rates, respectively

 

 

 

424 ADAPTIVE RESOURCE MANAGEMENT

 

25

 

 

 

 

 

 

 

 

20

 

Tp=10ms, Rp=64kbps

 

 

7:2:1 MTIP

 

 

 

 

 

4:3:3 MTIP

 

 

 

 

 

 

 

 

5:4:1 MTIP

 

Limit of Throughput

15

 

 

 

 

 

 

 

10

 

 

 

 

 

 

 

Upper

 

 

 

 

 

 

 

 

 

5

 

 

 

 

 

 

 

 

0

 

 

 

 

 

 

 

 

0.5

1

1.5

2

2.5

3

3.5

4

 

 

 

Common divisor of the RT offered traffic

 

Figure 12.19 Average upper-limit UL data throughput in different RT MTIPs.

 

35

 

 

 

 

30

 

 

 

throughputof

25

 

20

 

limitUpper

15

 

 

 

 

10

 

 

 

 

 

 

5

 

 

0

 

 

 

 

0.5

RT offered traffic in 7:2:1 MTIP

Tp = 10 ms

32 kb/s

64 kb/s

144 kb/s 384 kb/s

1

1.5

2

2.5

3

3.5

4

 

Common divisor of the RT offered traffic

 

 

Figure 12.20 Effects of the bit-rates to the throughput.

capacity over Tp time-interval of 10 ms. Figure 12.20 and 12.21 and Table 12.8 are for 7:2:1 MTIP. One can see that throughput characteristics are affected significantly by the dynamic of RT traffic as well as the packet-transmission parameters. The results give valuable quantitative merits for studying the design parameters and the performance tradeoffs of packet access control schemes. This explains the motivations of using DFIMA scheme presented above, where content of feedback information provides 1:1 mapping of optimal transport format combination (including TPP, bit-rate, packet-length or TTI) for packet transmission in the next time-slot based on feasible free resource predictions. For example, assume 50 % cell capacity is occupied by the RT traffic of the 7:2:1 MTIP at the end of a given time slot of 10 ms. The possible bit-rates for packet transmissions are 32, 64 and 144 kbs. Consider

CDMA CELLULAR MULTIMEDIA WIRELESS NETWORKS

425

 

22

 

 

 

 

 

 

 

 

20

 

 

RT offered traffic in 7:2:1 MTIP

 

 

 

 

 

 

 

 

 

18

 

 

Rp= 64 kb/s

 

 

 

 

 

 

 

+Line: Tp=10 ms

 

 

 

 

 

 

 

 

 

 

 

16

 

 

xLine: Tp=20 ms

 

 

 

throughput

 

 

*Line: Tp=30 ms

 

 

 

14

 

 

oLine: Tp=40 ms

 

 

 

 

 

 

 

 

 

 

12

 

 

 

 

 

 

 

limit of

 

 

 

 

 

 

 

10

 

 

 

 

 

 

 

Upper

8

 

 

 

 

 

 

 

 

6

 

 

 

 

 

 

 

 

4

 

 

 

 

 

 

 

 

2

1

1.5

2

2.5

3

3.5

4

 

0.5

 

 

 

Common divisor of the RT offered traffic

 

 

Figure 12.21 Effects of the packet transmission durations.

Table 12.8 Means of stationary RT aggregate traffic and quasi-stationary NRT resource availability

The three-class RT offered traffic, e.g. in 7:2:1 MTIP

 

 

 

Common divisor

 

 

 

 

 

 

 

 

Traffic

1

1.5

2

2.5

3

 

 

 

 

 

 

E[c]

0.1500

0.2249

0.2988

0.3690

0.4305

E[(z; Tp = 10 ms)]

0.4609

0.3793

0.3032

0.2347

0.1772

two cases of the NRT offered traffic: 10 or 50 active data users in the next time-slot. Using Equation (12.65) and (12.66), one can predict the maximum numbers of successful packet transmissions for each possible bit-rate, e.g. in our examples 16.91 packets of 32 kbs, 10.76 packets of 64 kbs and 5.53 packets of 144 kbs. Therefore, in the case of having 10 active users in the next time slot, the feedback information should tell them to transmit their packet immediately with bit-rate of 64 kbs. If 50 users want to transmit their packet, they have to attempt with TPP of 16/50 and bit-rate of 32 kbs at the beginning of the next time slot. The expected throughput in this case is about eight packets since the free capacity is successfully utilized for packet transmissions with the probability of 1/2. The performance of DFIMA can be optimized with respects to TPP, bit-rate, TTI and QoS differentiation paradigms, which is flexible and effective.

12.4.16 Implementation issues

Although the MdCAC and the SCAC policies are simple to implement without need for any special software and hardware, they may face a problem because the modeling parameters are required a priori. Owing to the diverse nature of different traffic sources and their

426 ADAPTIVE RESOURCE MANAGEMENT

often-complex statistics, some of the parameters may be hard to determine without which the modeling-based CAC policies cannot operate. The soft-decision solutions are believed to give more flexibility in determining the modeling parameters, and thus are quite suited to achieving good multiplexing gain and robustness. On the other hand, implementations of the MsCAC policy require advanced hardware and software to ensure the reliability of measurements. For this reason, it is not cost-effective. Moreover, estimation errors in some circumstances may cause significant degradations of the system performance. However, the advantage of MsCAC is that it seems ‘insensitive’ to the traffic nature and the operation is robust. The network can learn and adapt to the statistics of traffic even when the burstiness of traffic is considered as out of control for the modeling-based systems. To gain tradeoff of all design criteria, a hybrid soft-decision/measurement-based implementation is a reasonable choice. Parameters needed for soft-decision functions, i.e. means and variances, can rely on auto-regressive measurements. For such solution, parameters and constraints can simply be thresholds of the UL interference level of cell and connection basis, an allowable outage probability, estimates of the current total received interference level with its mean and variance, etc. These are anyhow needed for the TPC mechanism of CDMA systems. For implementations of the DFIMA scheme, measurements or estimations of RT system load state for CAC can be reused. The NRT offered traffic needs to be measured or estimated for prediction of optimal parameters (e.g. TPP, bit-rate, TTI) that are used as the content of feedback information. Look-up tables for transport format combinations of UL packet transmission can be implemented or configured in both mobile and access network sides in order to minimize the size of feedback information. Eight bit feedback is enough to ensure sufficient exchange of control information in DFIMA, even with QoS differentiation.

12.5 JOINT DATA RATE AND POWER MANAGEMENT

As already seen from the previous discussion the radio resource manager (RRM) contains a number of sub-blocks like the connection admission controller, the traffic classifier, the radio resource scheduler and the interference and noise measurements. The main role of the RRM is to manage the different available resources to achieve a list of target QoS. The radio resource scheduler (RRS) is an essential part of the RRM. The RRS has two important radio resources to control: MS transmitting power and transmitted data rate. The RRS uses those two resources to achieve different objectives like maximizing the number of simultaneous users, reducing the total transmitting power, or increasing the total throughput. The conventional way to achieve these objectives is to select one of them as a target to optimize and use other objectives as constraints. More sophisticated algorithms based on multiobjective (MO) optimization and Kalman filter techniques have been also proposed. Here we address the problem of how to combine the power and rate in an optimum way.

Even Shannon’s equation shows that the achievable information rate in a radio channel is an increasing function of the signal-to-interference and noise ratio. Increasing the information rate in data communication systems is restricted by the SINR. Increasing the SINR can be done in two ways. The first way is by reducing the total interference and noise affecting that user. This depends on some characteristics of the noise and the interference. For example, if the structure of the interference from other users is known at

JOINT DATA RATE AND POWER MANAGEMENT

427

the receiver then, by applying one of the multi-user detection methods, that interference can be reduced. Also if the users are spatially distributed then the interference can be reduced by using a multi-antenna system (see Section 12.1). If the users concurrently use the channel (as in DS-CDMA) then the interference can be reduced using power control techniques. From previous studies we can see that some characteristics of the interference are assumed to be known or can be controlled. There are many sources of interference and noises that cannot be reduced by the first way such as thermal noise, interference from other cells etc. The second way of increasing the SINR is simply by increasing the transmitted power. In a single user communication (point-to-point) or in broadcasting, this can be an acceptable solution and the main disadvantages are the cost and the nonlinearities in the power amplifiers. However, in a multiuser communication environment, increasing the transmitted power means more co-channel and cross-channel interference problems.

Therefore, a joint control of data rate as well as the transmitted power is an important topic in modem communication systems. The modern communication systems (3G or 4G) are supporting the multirate data communication because they are designed not only for voice communication but also for data and multimedia communication.

An efficient combining algorithm for the power control and the rate control is required for these systems. The term ‘efficient’ here refers to optimization of the transmitted power and data rate to meet the required specifications. There are many proposed combining algorithms for power and rate control in the literature. The objectives of those algorithms are quite varied. Some algorithms suggest maximizing the throughput; others minimizing the packet delay or minimizing the total power consumption.

The 3G/4G mobile communication systems based on WCDMA support the multirate transmission. There are mainly two methods to achieve the multi-rate transmission, the multicode (MC) scheme and the variable-spreading length (VSL) scheme. In the MC-CDMA system, all the data signals over the radio channel are transmitted at a basic rate, Rb. Any connection can only transmit at rates m Rb, referred to as m-rate, where m is a positive integer. When a terminal needs to transmit at m-rate, it converts its data stream, serial-to-parallel, into m basic-rate streams. Then each stream is spread using different and orthogonal codes. In a VSL-CDMA system, the chip rate is fixed at a specified value (3.84 Mb/s for UMTS) and the data rate can take different values. This means that the processing gain (PG) is variable. The processing gain can be defined as the number of chips per symbol.

12.5.1 Centralized minimum total transmitted power (CMTTP) algorithm

The mathematical formulation of the CMTTP problem is find the power vector P =

[P1, . . ., PQ ]T and the rate vector R = [R1, . . ., RQ ]T minimizing the cost function:

J (P) = 1TP =

Q

 

Pi

(12.68)

 

i=1

 

given that the required signal-to-noise ratio is guaranteed to each user

Rs

 

 

Pi Gki

δi*,

i = 1, . . ., Q

(12.69)

Ri Q

Pj Gk j + Ni

 

 

 

 

 

 

j=1 j=i