CN1801999A - Wireless resource occupation algorithm for wireless communication system - Google Patents

Wireless resource occupation algorithm for wireless communication system Download PDF

Info

Publication number
CN1801999A
CN1801999A CN 200410082398 CN200410082398A CN1801999A CN 1801999 A CN1801999 A CN 1801999A CN 200410082398 CN200410082398 CN 200410082398 CN 200410082398 A CN200410082398 A CN 200410082398A CN 1801999 A CN1801999 A CN 1801999A
Authority
CN
China
Prior art keywords
msub
service
mrow
domain
basic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN 200410082398
Other languages
Chinese (zh)
Other versions
CN100391302C (en
Inventor
张淑伟
马华兴
高鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing P & T Consulting & Design Institute Co Ltd
Original Assignee
Beijing P & T Consulting & Design Institute Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing P & T Consulting & Design Institute Co Ltd filed Critical Beijing P & T Consulting & Design Institute Co Ltd
Priority to CNB2004100823984A priority Critical patent/CN100391302C/en
Publication of CN1801999A publication Critical patent/CN1801999A/en
Application granted granted Critical
Publication of CN100391302C publication Critical patent/CN100391302C/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

Said invention refers to wireless resource occupying algorithm of data grouping service. It contains selecting one service from data grouping service as basic service, calculating each service relatively wireless resource intensity, based on based on selected basic service utilizing each service resource intensity doing weighted average to each service volume, mixing to one virtual mixed service, to obtain virtual mixed service total amount, then utilizing Erlang C method to satisfy certain of QoS required virtual channel number, and then to obtain grouped data service required occupied channel number. Utilizing similar method, said invention can obtain occupied channel number for satisfying certain of blocking rate circuit switching service required. Thereby, it can proceed evaluation to wireless communication systematical wireless resource occupied status including circuit switching domain and grouping exchange domain. Said invention has advantages of leading-in virtual mixed service total amount, thereby in consideration of data grouping service delay and retransmission.

Description

Wireless resource occupation algorithm of wireless communication system
Technical Field
The invention relates to the field of wireless communication systems, in particular to an algorithm for occupying wireless resources by various services in a wireless communication system.
Background
In the network planning of the wireless communication system, the analysis of the occupation of the wireless resources is an important prerequisite for the whole network planning. Until now, we only have a clear understanding of the behavior of voice traffic in the network, and have little knowledge of the demand of data traffic on network resources and the behavior of data traffic in the mobile network. In such a situation, the occupation situation of different services in the wireless communication network on the wireless resources needs to be specifically analyzed, and the switching and base station system capacity is accurately known, which plays a fundamental guiding role in reasonably designing the network structure and deploying the network in the future.
The allocation of data traffic radio resources is based on a comparison of the current network per user busy hour throughput rate and the predicted data user single cell busy hour throughput rate. With the operation of 3G, a large amount of broadband data services and voice services can be implemented in WCDMA networks, and the transfer of GPRS data services to WCDMA networks is a big trend. However, data and voice are always a contradiction in terms of efficient utilization of limited bandwidth resources. At different times and locations, there may be different emphasis on the contradiction, and different configuration schemes may be provided. So-called "efficient use" is how to more reasonably reconcile the contradiction between data and voice. The operation of 3G brings new bandwidth and high frequency utilization rate, and also brings new problems to the adjustment of the 2G data service bearer platform.
In 2G wireless networks, especially for networks that provide predominantly single voice services, such as GSM networks, the number of voice channels provided by a single base station can simply be considered constant. Looking at the irish B table, given the call loss rate, can derive the number of irises that a single sector provides at that call loss rate. For a wireless communication network that can provide both voice services and data services, the situation may be different when performing resource occupancy analysis. In the estimation, the general method is to convert the data service into the corresponding number of voice channels according to the occupied resource, and then look up the Ireland B table to obtain the relationship between call loss and capacity. However, for 3G systems, for example, in WCDMA systems providing multiple services to users, not only basic voice services but also PS services with multiple bearer rates, such as Email service, WWW browsing, etc., can be provided. Because data services have the characteristics of time delay, retransmission and the like, some wireless communication systems are systems with limited interference, such as WCDMA systems, and the signal-to-noise ratios required by different services are different, the occupation of wireless resources by different data services has respective characteristics, and the intensity of the occupied service resources is different. Therefore, when a cell provides multiple services, how to scientifically and reasonably estimate the number of users that the cell can support under certain load and certain user QoS requirements (CS service is embodied as blocking probability requirement; PS service is embodied as throughput rate and delay requirement) becomes a problem. This requires analysis and study of the capacity of multiple services. This has been analyzed by many vendors and by a large body of literature regarding cell capacity estimation in multi-service scenarios. However, the opinions of each other are not very uniform. The main idea is as follows: virtual traffic capacity estimation, independent estimation of various traffic loads, a Stochastic Knapack algorithm, and the like are adopted.
The basic principle of traditional mixed service (including PS service) capacity estimation is to equate all kinds of services to a virtual service, and then obtain the capacity estimation result of the mixed service by adopting a single CS service capacity analysis method; this algorithm equates the capacity estimate for PS traffic to the capacity estimate for CS traffic, both of which are identical. Therefore, in the fundamental, the traditional mixed service capacity estimation cannot reflect the characteristics of the PS data service delay and retransmission. Other traditional algorithms for calculating service resources, such as the Erlang B method, come from a multi-server loss system, that is, a user leaves immediately after discovering that a line is busy, which is suitable for capacity calculation of the traditional CS domain service, can only reflect the characteristics of blocking, has no capacity for the characteristics of data service delay and retransmission, and cannot be completely suitable for the situation of multi-service and multi-QoS requirements of wireless communication networks such as WCDMA and the like.
For data services, the Erlang C method is mostly adopted to calculate the service resources. Erlang C is based on a wait-system, which comes from a multi-server wait-system, i.e., a user waits until the service is complete after entering the system before leaving. If only the data volume (bits) of the data service is considered, Erlang C calculation is used, and the constraint condition of the Erlang C method can completely reflect the expectation of the user; the Erlang C method is only partially used to some extent if the bandwidth (bps) requirement of the data traffic is taken into account, because the relative value of the service time is also reflected in the constraints of the Erlang C method. For data traffic, the same Ireland number represents a different amount of data because of the different channel bandwidths. If all service data packets are treated uniformly in a wireless transmission network, the time delay of each service is distributed identically, and although the requirement of each service on the independent bandwidth cannot be realized, if a user knows and approves the current situation, an Erlang C method can be used under the condition of the expected relative time delay of the user. However, if the bandwidth requirements of users are different, the Erlang C method is not fully suitable for WCDMA cell capacity calculation. In addition, in the prior art, the data service resources are calculated by using the Erlang C method, and services with different data rates are separately calculated, so that channels cannot be fully utilized, and the relay efficiency is low.
Disclosure of Invention
The invention aims to provide a wireless resource occupation algorithm of packet service and a wireless resource occupation algorithm of a wireless communication system, thereby knowing and calculating the strength of wireless resources actually occupied by data service, exploring the potential of the existing wireless resource bearing data service and more clearly knowing the current data service volume and bandwidth requirements.
The basic principle of the invention is to equate all kinds of services to a virtual mixed service, and then analyze the wireless resource occupation of the virtual mixed service to obtain the capacity estimation result of the virtual mixed service. The method embodies the difference of the occupation intensity of different services to resources and also embodies the QoS requirement of the packet domain data service delay.
To achieve the above objects, in one aspect, the present invention provides a radio resource occupying algorithm for a packet data service, comprising the steps of:
the method comprises the following steps: selecting a service from the packet data services as a basic service;
step two: calculating the service resource intensity a of each servicei
Step three: calculating a virtual channel c of the packet switched domain by (the meaning of the virtual channel is to be given in the corresponding places in the description, as defined);
<math> <mrow> <mi>c</mi> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mn>2</mn> </msubsup> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msub> <mi>a</mi> <mi>i</mi> </msub> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> </mfrac> </mrow> </math>
where i represents the ith service, γiCall arrival rate for service i, biAverage call hold time, N, for service iiThe number of users of the cell service i;
step four: based on the selected basic service, the service quantity of each service is weighted and averaged by using the service resource intensity of each service to be mixed into a virtual mixed service, and the total quantity of the virtual mixed service is calculated by the following formula;
virtual mixed traffic total (∑ N)i·γi·bi·ai)/c
Step five: according to the obtained total amount of the virtual mixed services, the number of virtual channels meeting certain QoS requirements is obtained by an Erlang C method;
step six: converting the obtained number of virtual channels into the number of basic traffic channels by using the relative radio resource strengths as follows:
basic service channel number (virtual channel number) c + service resource intensity of basic service channel
Thereby obtaining the number of channels required to be occupied by the packet data service.
According to the above method of the present invention, in the sixth step, the service resource strength of the basic service is taken as 1, and the obtained number of basic service channels is converted into the number of voice service channels by the following formula:
wherein,
R0which represents the bearer rate of the voice traffic,
(Eb/No)0indicating E required for voice servicesb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of voice traffic,
v0which represents the activation factor of the voice service,
R0'indicating the bearer rate of the PS domain basic service,
(Eb/No)0'e required for representing PS Domain basic serviceb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of the basic service,
v0'an activation factor representing a PS domain basic service;
the number of channels that the packet data service needs to occupy is represented by the number of channels for voice service.
According to the above method of the present invention, in the second step, the service resource strength of each service is characterized by the parameters of the bearing rate, the activation factor and the signal-to-noise ratio, that is:
<math> <mrow> <msub> <mi>a</mi> <mi>j</mi> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>R</mi> <mi>j</mi> </msub> <mo>&CenterDot;</mo> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mi>j</mi> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mi>j</mi> </msub> </mrow> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mn>0</mn> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mn>0</mn> </msub> </mrow> </mfrac> </mrow> </math>
wherein,
j represents the jth service;
R0representing the bearer rate of the basic service;
(Eb/No)0e required for representing basic serviceb/NoI.e. the signal-to-noise ratio requirement for correct demodulation of the basic service;
v0representing an activation factor of a basic service;
aiindicating the traffic resource strength of the traffic j with respect to the basic traffic channel,
Rjrepresenting the bearer rate of service j;
(Eb/No)je required to represent service jb/NoI.e. the signal-to-noise ratio requirement for correct demodulation of service j;
Virepresenting the activation factor of service j.
According to the above method of the present invention, in the second step, the service resource strength of the uplink service of the wireless communication system is:
a i = 1 + W ( E b / N o ) 0 v 0 R 0 1 + W ( E b / N o ) i v i R i
the relative resource strength of the downlink service is:
<math> <mrow> <msub> <mi>a</mi> <mi>i</mi> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mi>i</mi> </msub> </mrow> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mn>0</mn> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mn>0</mn> </msub> </mrow> </mfrac> <mtext></mtext> </mrow> </math>
wherein:
i denotes the ith service and the ith service,
R0representing the bearer rate of the basic service;
(Eb/No)0e required for representing basic serviceb/NoI.e. the signal-to-noise ratio requirement for correct demodulation of the basic service;
V0an activation factor representing a basic service;
(Eb/No)i-industryE required for business ib/NoI.e. the signal-to-noise ratio requirement for correct demodulation of service j;
w-chip rate;
Vi-an activation factor for service j;
Ri-bit rate of service j.
In another aspect, the present invention further provides a radio resource occupation algorithm of a wireless communication system, which includes the following steps:
the method comprises the following steps: dividing a service area of a wireless communication system into a circuit switching domain and a packet switching domain;
step two: selecting a service as a basic service for a circuit switching domain and a packet switching domain respectively;
step three: calculating the relative resource occupation intensity a of each servicei
Step four: respectively calculating virtual channels c of a circuit switching domain and a packet switching domain by the following formula;
<math> <mrow> <mi>c</mi> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mn>2</mn> </msubsup> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msub> <mi>a</mi> <mi>i</mi> </msub> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> </mfrac> </mrow> </math>
where i represents the ith service, γiCall arrival rate for service i, biAverage call hold time, N, for service iiThe number of users of the cell service i;
step five: for the circuit switching domain and the packet switching domain, respectively based on the selected basic service, using the service resource intensity of each service to make weighted average for the service volume of each service, respectively mixing each service in the circuit switching domain and the packet switching domain into a virtual mixed service, and respectively calculating the total virtual mixed service volume of the circuit switching domain and the packet switching domain by the following formula:
virtual mixed traffic total (∑ N)i·γi·bi·ai)/c
Step six: obtaining the number of virtual channels meeting the requirement of a certain blocking rate for the virtual mixed service of the circuit switching domain by using an Erlang B method; obtaining the number of virtual channels meeting certain QoS requirements for the virtual mixed service of the packet switching domain by using an Erlang C method;
converting the virtual channel numbers of the circuit switching domain and the packet switching domain into corresponding basic service channel numbers respectively by using the service resource intensity according to the following formula:
the number of basic service channels is the virtual channel number c + the service resource intensity of the basic service channels;
step seven: and obtaining the number of channels occupied by the cell of the wireless communication system according to the obtained basic service channels of the circuit switching domain and the packet switching domain respectively.
The method according to the present invention further comprises, between the sixth step and the seventh step: converting one of the basic service channel numbers of the circuit switching domain and the packet switching domain into another basic service channel number by the following formula:
wherein,
R0which represents the bearer rate of a basic service,
(Eb/No)0e required for representing a basic serviceb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of the basic service,
v0represents the activation factor of a basic service,
R0′which represents the bearer rate of another basic service,
(Eb/No)0'e required for representing another basic serviceb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of the basic service,
v0′an activation factor representing another basic service;
and step seven, adding the basic service channel numbers of the circuit switching domain and the packet switching domain to obtain the channel number occupied by the wireless communication system cell.
According to the above method of the present invention, in the second step, the basic service selected for the circuit switched domain is a voice service;
in the sixth step, if the service resource strength of the basic service channel is 1, the obtained virtual channel number of the circuit-switched domain is directly converted into the voice service channel number, and the obtained virtual channel number of the packet-switched domain is converted into the basic service channel number by the following formula:
the number of basic service channels is the number of virtual channels c + 1;
in said step seven, the resulting number of elementary traffic channels of the packet-switched domain is converted into the number of voice traffic channels:
wherein,
R0which represents the bearer rate of the voice traffic,
(Eb/No)0indicating E required for voice servicesb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of voice traffic,
v0which represents the activation factor of the voice service,
R0′indicating the bearer rate of the PS domain basic service,
(Eb/No)0′e required for representing PS Domain basic serviceb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of the basic service,
v0′an activation factor representing a PS domain basic service;
and in the step eight, summing the voice service channel numbers of the circuit switching domain and the packet switching domain to obtain the channel number occupied by the cell of the wireless communication system.
According to the above method of the present invention, in the third step, the service resource strength of each service is characterized by parameters such as a bearer rate, an activation factor, a signal-to-noise ratio, and the like, and can be simply expressed as:
<math> <mrow> <msub> <mi>a</mi> <mi>i</mi> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mi>i</mi> </msub> </mrow> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mn>0</mn> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mn>0</mn> </msub> </mrow> </mfrac> </mrow> </math>
wherein,
i denotes a different service or services which are different,
aiindicating the traffic resource strength of the traffic i with respect to the basic traffic channel,
Rirepresenting the bearing rate of the service i;
(Eb/No)ie required for representing service ib/NoI.e. the signal-to-noise ratio requirement for correct demodulation of service j;
Vian activation factor representing a service i;
R0representing the bearer rate of the basic service;
(Eb/No)0e required for representing basic serviceb/NoI.e. the signal-to-noise ratio requirement for correct demodulation of the basic service;
v0representing the activation factor of the basic service.
According to the above method of the present invention, in the second step, for the circuit switched domain and the packet switched domain, the service resource strength of each uplink service is:
a i = 1 + W ( E b / N o ) 0 v 0 R 0 1 + W ( E b / N o ) i v i R i
the service resource intensity of each downlink service is as follows:
<math> <mrow> <msub> <mi>a</mi> <mi>i</mi> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mi>i</mi> </msub> </mrow> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mn>0</mn> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mn>0</mn> </msub> </mrow> </mfrac> </mrow> </math>
wherein:
(Eb/No)ie required for service ib/NoI.e. the signal-to-noise ratio requirement for correct demodulation of service j;
w-chip rate;
Vi-an activation factor for service j;
Ri-bit rate of service j.
According to the above method of the present invention, in the fifth step, in case of soft handover for the circuit switched domain, the total traffic of the cell will increase, and then the total amount of the virtual mixed traffic is calculated by the following formula:
virtual mixed traffic total (1+ SHO) (∑ N)i·γi·bi·ai)/c
SHO is a soft handover factor, and corresponds to a proportion of traffic increase due to soft handover.
The above method according to the present invention is used in a WCDMA or CDMA system.
Compared with the traditional Erlang method, the method for estimating the wireless resource occupation by the virtual mixed service capacity is more reasonable, and particularly, the EC method is used for reflecting the characteristics of time delay and retransmission of the data service; in addition, through the analysis of the WCDMA self-interference system, the contribution of different services of the WCDMA system to the system interference is reflected to a certain extent.
It should be noted that, because of the soft handover in the CS domain of some wireless communication systems, the increase of the traffic volume of the base station (NodeB) will cause the channel resource allocation of the base station to increase, and the consideration of this factor is as follows:
considering that soft handoff will eventually reflect an increase in traffic volume, there is no difference between handling the extra traffic volume due to soft handoff and handling the traffic volume in a normal non-soft handoff state for physical resources such as channels. Since the two methods occupy the channel resource indiscriminately, in other words, the channel resource is shared by the traffic generated by soft handover and the traffic generated by non-soft handover, in the aspect of channel resource configuration, the total amount of virtual mixed services required by the CS domain resource configuration algorithm can be obtained only by multiplying the traffic predicted by the CS domain by the soft handover factor:
Figure A20041008239800161
SHO is a soft handover factor, and can be simply understood as the proportion of the UE (user handheld device, such as a mobile phone) in the soft handover state, which is finally reflected in the increase of the traffic volume caused by the increase of the radio link of the UE in the soft handover state. Then, based on the above, the CS domain wireless resource occupation algorithm is used to calculate and obtain the Node B channel resource allocation. The method for processing soft switching traffic saves resources and is more reasonable than the method for configuring channels for soft switching independently.
Drawings
Fig. 1 shows a flow chart of the WCDMA system radio resource occupation algorithm of the present invention.
Detailed Description
For virtual hybrid services, companies have proposed a Campbell-based method. The method considers all the services together and constructs an equivalent service, and calculates the total traffic volume of the equivalent service which can be provided by the system according to the equivalent service, and then obtains the capacity calculation of the mixed service. The method finally utilizes Erlang B to calculate the corresponding channel number, and the method is used for calculating the virtual mixed service of the CS domain at home and abroad at present.
The algorithm of the invention is to carry out the accounting on the services with different rates uniformly, thereby leading the channel reuse rate of the base station to be high, overcoming the defects that the system capacity can not be fully utilized and the relay efficiency is low in the prior art, and leading the pre-calculated value of the cell capacity in the algorithm to be moderate.
In the following, before a method for calculating the channel budget of the CS domain and the PS domain of a cell by using a virtual hybrid service is given, several concepts to be used are given:
1. service resource strength
Different services in a cell occupy different wireless resources, high-speed services occupy more resources, and low-speed services occupy less resources. The Campbell method defines the service resource strength to reflect the occupation of wireless resources by different services.
Under the ideal power control state, the formula of the uplink signal-to-noise ratio is as follows:
( E b / N o ) j = W v j R j P j I total - P j
wherein:
(Eb/No)jrepresenting the signal-to-noise ratio required for service j;
w represents the chip rate;
Vjan activation factor representing j;
Rjrepresents the bearer rate of j;
Pjrepresents the received signal power of j;
Itotalrepresenting total received power of a wideband including thermal noise at a base station
It follows from this that, as a result,
P j = 1 1 + W ( E b / N o ) j v j R j I total
it can be seen that the uplink received power of a service or the interference to other active services is related to not only the received signal-to-noise ratio, rate, and activation factor required by the service, but also the total power received by the base station at that time, including thermal noise, which results in that the uplink received power of a service increases as the total received power of the base station increases, i.e. the received power required to access the same service is different under different uplink system loads.
Although the uplink received power required by each service has a direct relationship with the load of the system, under certain load conditions, the ratio of the uplink received power required by different services is independent of the total received power, that is, the following conditions are satisfied:
P i P j = 1 + W ( E b / N o ) j v j R j 1 + W ( E b / N o ) i v i R i - - - ( 1 )
thus, the relation that each service occupies the wireless resource in the uplink can be obtained.
Similarly, by analyzing the cell downlink load, the single-user downlink load factor can be obtained:
<math> <mrow> <msub> <mi>&eta;</mi> <mi>i</mi> </msub> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>a</mi> <mi>i</mi> </msub> <mo>+</mo> <msub> <mi>i</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>*</mo> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>o</mi> </msub> <mo>)</mo> </mrow> <mi>i</mi> </msub> <mo>*</mo> <mfrac> <msub> <mi>R</mi> <mi>i</mi> </msub> <mi>W</mi> </mfrac> <mo>*</mo> <msub> <mi>v</mi> <mi>i</mi> </msub> </mrow> </math>
= ( 1 - a i + i i ) * v i * ( E b / N o ) i W / R i
therefore, if it is assumed that the orthogonalization factor and the interference factor of the neighboring cell are the same for all users in the cell, the relationship that each service occupies radio resources in the downlink can be summarized as follows:
<math> <mrow> <mfrac> <msub> <mi>&eta;</mi> <mi>j</mi> </msub> <msub> <mi>&eta;</mi> <mi>i</mi> </msub> </mfrac> <mo>=</mo> <mfrac> <mrow> <mfrac> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>o</mi> </msub> <mo>)</mo> </mrow> <mi>j</mi> </msub> <mrow> <mi>W</mi> <mo>/</mo> <msub> <mi>R</mi> <mi>j</mi> </msub> </mrow> </mfrac> <mo>*</mo> <msub> <mi>v</mi> <mi>j</mi> </msub> </mrow> <mrow> <mfrac> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>o</mi> </msub> <mo>)</mo> </mrow> <mi>i</mi> </msub> <mrow> <mi>W</mi> <mo>/</mo> <msub> <mi>R</mi> <mi>i</mi> </msub> </mrow> </mfrac> <mo>*</mo> <msub> <mi>v</mi> <mi>i</mi> </msub> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow> </math>
from the above equations (1), (2), the service resource strength a of the service i relative to the basic service 0 can be obtainediFor the uplink, the uplink is the set of codes,
a i = 1 + W ( E b / N o ) 0 v 0 R 0 1 + W ( E b / N o ) i v i R i - - - ( 3 )
for the downlink, the mobile station is,
a i = ( E b / N o ) i W / R i * v i ( E b / N o ) 0 W / R 0 * v 0 - - - ( 4 )
when used only for simple engineering estimation, the factors are considered W ( E b / N o ) i * v i * R i When much larger than 1, the above equation (1) can be simplified as the following equation:
<math> <mrow> <msub> <mi>a</mi> <mi>i</mi> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mi>i</mi> </msub> </mrow> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mn>0</mn> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mn>0</mn> </msub> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow> </math>
wherein,
i denotes a different service or services which are different,
R0representing the bearer rate of the basic service;
(Eb/No)0e required for representing basic serviceb/NoI.e. the signal-to-noise ratio requirement for correct demodulation of the basic service;
V0represents a radicalThe activation factor of the service.
From the above, the traffic resource strength aiIs a relative quantity that represents the resource occupancy attribute for a service, which is generally characterized by factors such as the signal-to-noise ratio requirement for the service, the bearer rate for the service, and the activation factor for the service. However, whether the traffic resource strength is calculated using equations (3) and/or (4) (generally, only equation (3) is used for the CS domain, and equations (3) and (4) are used for the PS domain) or equation (5) depends on the actual conditions and accuracy requirements in the field.
2. Virtual channel
For a virtual mixed service, i.e. a mixed service composed of specific services, the channel served by the mixed service is a virtual channel, which is the essence of the virtual channel in the radio resource occupation algorithm of the virtual mixed service.
The virtual channel is a concept that must have quantitative channel properties for virtual mixed service. The Campbell theory gives an accounting formula of the virtual channel, which is as follows:
<math> <mrow> <mi>c</mi> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mn>2</mn> </msubsup> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msub> <mi>a</mi> <mi>i</mi> </msub> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </math>
wherein,
c denotes a virtual channel which is a virtual channel,
i denotes a different service or services which are different,
γiindicating the call arrival rate of service i,
airepresents the traffic resource strength of the relatively basic traffic of the traffic i,
birepresents the average call hold time for service i,
Niindicating the number of users of the cell service i,
in which the call arrival rate gammaiAnd average call hold time biIndicating the call strength attribute of cell service i. The value of the virtual channel is quantitatively expressed as the number of basic traffic channels according to the definition of the parameter c.
3. Virtual mixed traffic volume
The virtual mixed service of the CS domain of the cell can be completely expressed by a virtual channel c and the total amount of the virtual mixed service. The total amount of the virtual mixed service is as follows:
virtual mixed traffic total (∑ N)i·γi·bi·ai)/c (7)
4. Number of virtual channels
According to the definition of the virtual channel, the number of virtual channels provided by the cell can be expressed as:
Figure A20041008239800192
(8)
method for occupying radio resource of (first) cell CS domain
The channel budget method of the CS domain of the cell described by the service resource strength, the total amount of the virtual mixed service, and the virtual channel is given below.
1) Firstly, selecting voice service as basic service of cell CS domain, calculating service resource intensity a of other services in cell CS domain relative to voice servicei. Wherein whether to use formula (3) or formula (4) is determined based on actual conditions and accuracy requirements at the site, generally, formula (3) is used when only simplified estimation is performed, and formula (4) is used when accuracy is required.
2) Utilizing traffic resource intensity aiAnd the traffic volume (N) of each service in the celliAnd bi、γiThe product of the three is the traffic of the service i) calculates the virtual channel of the virtual mixed service:
<math> <mrow> <mi>c</mi> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mn>2</mn> </msubsup> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msub> <mi>a</mi> <mi>i</mi> </msub> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> </mfrac> </mrow> </math>
3) calculating the total virtual mixed service amount of the cell according to the following formula:
virtual mixed traffic total (∑ N)i·γi·bi·ai)/c
The capacity of physical resources such as channels is fixed, when soft handoff occurs, the capacity is equivalent to the number of users increasing the channel resources, and the physical channels do not have any difference in processing of extra traffic caused by soft handoff and traffic caused by normal non-soft handoff. And the traffic volume of the soft handover and the traffic volume of the non-soft handover occupy the channel resource without distinction, namely the channel resource is shared by the soft handover and the non-soft handover. For this reason, considering that a soft handover will eventually be reflected in an increase in traffic, a soft handover factor SHO is multiplied on the basis of the above equation, thus
Virtual mixed traffic total (1+ SHO) (∑ N)i·γi·bi·ai)/c。
SHO is a soft handover factor, and can be simply understood as the proportion of UEs in soft handover state, which is finally reflected in the increase of traffic volume caused by the increase of wireless connections of mobile terminals in soft handover state.
4) And calculating the number of virtual channels required to be provided by the cell under the condition of meeting the requirement of 2% of blocking probability by using an Erlang B method according to the obtained total amount of the virtual mixed services.
5) When the resource occupation intensity of the voice service is 1, calculating the number of voice service channels required by the CS domain cell according to the obtained virtual channel number:
the number of voice traffic channels is the number of virtual channels c + 1.
(II) cell PS domain wireless resource occupation algorithm
It is generally accepted that the arrival of sessions in packet traffic conforms to a poisson distribution. And supposing that the transmission bandwidth of the wired part of the WCDMA system is far larger than that of the wireless part, the system bandwidth is equal to the wireless channel bandwidth, the limitation of the WCDMA mobile terminal equipment on the channel using capability is not considered, and the limitation of the RLC/MAC address on the access capability is not considered, the WCDMA system is considered to be in accordance with a Markov queuing model, so that the wireless resource occupation condition can be analyzed by using an Erlang method.
Since the Erlang C method has limitations when calculating radio resources, in order to more reasonably express the intensity of occupation of resources by data services at different rates and characterize the delay characteristics of the data services, a virtual mixed service of data services at multiple rates in the PS domain is first calculated, and then the Erlang C is used to calculate the occupation of radio resources in the PS domain, which is specifically as follows:
1) selecting a service as the basic service of the PS domain, and calculating the service resource intensity a of other services in the PS domain relative to the basic servicei. In this case, whether the above equations (3) and (4) or (5) are used is determined according to the actual conditions and accuracy requirements of the site. In general, when only simplified estimation is performed, the above formula (5) is used, and when high accuracy is required, the above formulas (3) and (4) are used.
2) Utilizing traffic resource intensity aiAnd the traffic volume (N) of each service in the celliAnd bi、γiThe product of the three is the traffic of the service i) calculates the virtual channel of the virtual mixed service:
<math> <mrow> <mi>c</mi> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mn>2</mn> </msubsup> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msub> <mi>a</mi> <mi>i</mi> </msub> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> </mfrac> </mrow> </math>
3) calculating the total virtual mixed service amount of the cell according to the following formula:
virtual mixed traffic total (∑ N)i·γi·bi·ai)/c;
4) Calculating the number of virtual channels required to be provided by the cell under the QoS requirement by using an Erlang C method according to the obtained total amount of the virtual mixed services;
5) calculating the number of basic service channels required by the PS domain cell according to the obtained number of virtual channels:
the number of basic service channels is the number of virtual channels c + 1;
here, the service resource strength of the basic service takes a value of 1.
The resource strength of the PS domain selected basic service relative to the voice service is then used to convert the number of basic service channels to the number of voice service channels.
The calculation of the number of PS domain virtual channels can be basically calculated according to the CS domain radio resource occupation method described herein, but the difference lies in the selection of the basic service and the selection of the Erlang method, and in addition, the soft handover factor existing in some wireless communication systems does not need to be considered. Selecting a certain data service of the PS domain as a basic service, and calculating the total amount of the virtual mixed services of the PS domain; then, on the premise of meeting a certain constraint condition of waiting call loss, the number of virtual channels of the cell can be obtained by looking up the Erlang C table, and further the number of basic service channels required by the PS domain can be obtained. Of course, the number of basic service channels obtained by the PS domain can be finally converted into the number of voice service channels by multiplying the former by the service resource strength between the PS domain basic service channels and the voice channels, thereby obtaining the number of equivalent voice service channels required by the PS domain.
(III) radio resource occupation algorithm of wireless communication system comprising CS domain and PS domain
For a wireless communication system, it may include multiple services, such as both the CS domain and the PS domain. For this, the service area of the wireless communication system may be divided into the CS domain and the PS domain, and then the channel capacity requirement may be calculated for the CS domain and the PS domain by using the virtual hybrid service estimation method according to the analysis of the radio resources occupied by the mobile services of the CS domain and the PS domain introduced in the above (a) and (b). Finally, the number of the equivalent voice service channels obtained by the CS domain and the PS domain is added to obtain the total channel configuration required by the base station.
The following is a detailed description of a cell of a WCDMA system. The estimation method of the wireless resource occupied by the WCDMA system comprises the following steps:
the method comprises the following steps: dividing a service area of a wireless communication system into a circuit switching domain and a packet switching domain;
step two: selecting voice service as basic service of circuit switching domain, and selecting one service as basic service in packet switching domain;
step three: calculating the relative resource occupation intensity a of each servicei
Step four: respectively calculating virtual channels c of a circuit switching domain and a packet switching domain by the following formula;
<math> <mrow> <mi>c</mi> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mn>2</mn> </msubsup> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msub> <mi>a</mi> <mi>i</mi> </msub> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> </mfrac> </mrow> </math>
where i represents the ith service, γiCall arrival rate for service i, biAverage call hold time, N, for service iiThe number of users of the cell service i;
step five: for the circuit switching domain and the packet switching domain, respectively, based on the selected basic service, the service resource intensity a of each service is utilizediWeighted average is carried out on the service volume of each service, each service in the circuit switching domain and the packet switching domain is mixed into a virtual mixed service, and the total amount of the virtual mixed service in the circuit switching domain and the packet switching domain is calculated by the following formula:
virtual mixed traffic total (∑ N)i·γi·bi·ai)/c
Step six: obtaining the number of virtual channels meeting the requirement of a certain blocking rate for the virtual mixed service of the circuit switching domain by using an Erlang B method; the number of virtual channels meeting certain QoS requirements is obtained for the virtual mixed service of the packet switching domain by using an Erlang C method,
utilizing traffic resource intensity aiConverting the virtual channel numbers of the circuit switching domain and the packet switching domain into corresponding basic service channel numbers according to the following formula:
the number of basic service channels is the number of virtual channels c + 1;
here, the service resource strength of the basic service takes a value of 1;
step seven: converting the obtained basic service channel number of the packet switching domain into a voice service channel number by using the service resource intensity;
step eight: summing the final voice service channel numbers obtained in the circuit switching domain and the packet switching domain to obtain the channel number occupied by the WCDMA system cell.

Claims (12)

1. A radio resource occupation algorithm for packet data services, comprising the steps of:
the method comprises the following steps: selecting a service from the packet data services as a basic service;
step two: calculating the service resource intensity a of each servicei
Step three: calculating a virtual channel c of the packet switched domain by (the meaning of the virtual channel is to be given in the corresponding places in the description, as defined);
<math> <mrow> <mi>c</mi> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mn>2</mn> </msubsup> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msub> <mi>a</mi> <mi>i</mi> </msub> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> </mfrac> </mrow> </math>
where i represents the ith service, γiCall arrival rate for service i, biAverage call hold time, N, for service iiThe number of users of the cell service i;
step four: based on the selected basic service, the service quantity of each service is weighted and averaged by using the service resource intensity of each service to be mixed into a virtual mixed service, and the total quantity of the virtual mixed service is calculated by the following formula;
virtual mixed traffic total (∑ N)i·γi·bi·ai)/c
Step five: according to the obtained total amount of the virtual mixed services, the number of virtual channels meeting certain QoS requirements is obtained by an Erlang C method;
step six: converting the obtained number of virtual channels into the number of basic traffic channels by using the relative radio resource strengths as follows:
basic service channel number (virtual channel number) c + service resource intensity of basic service channel
Thereby obtaining the number of channels required to be occupied by the packet data service.
2. The algorithm of occupying radio resources for packet data services according to claim 1, wherein in the sixth step, the service resource strength of the basic service is set to 1, and the obtained number of basic service channels is converted into the number of voice service channels by the following formula:
Figure A2004100823980002C2
wherein,
R0which represents the bearer rate of the voice traffic,
(Eb/No)0indicating E required for voice servicesb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of voice traffic,
v0which represents the activation factor of the voice service,
R0′indicating the bearer rate of the PS domain basic service,
(Eb/No)0′e required for representing PS Domain basic serviceb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of the basic service,
v0′an activation factor representing a PS domain basic service;
the number of channels that the packet data service needs to occupy is represented by the number of channels for voice service.
3. The packet data service radio resource occupation algorithm according to claim 1, wherein in the second step, the service resource strength of each service is characterized by the bearer rate, the activation factor, and the snr parameter, that is:
<math> <mrow> <msub> <mi>a</mi> <mi>j</mi> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>R</mi> <mi>j</mi> </msub> <mo>&CenterDot;</mo> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mi>j</mi> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mi>j</mi> </msub> </mrow> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mn>0</mn> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mn>0</mn> </msub> </mrow> </mfrac> </mrow> </math>
wherein,
j represents the jth service;
R0representing the bearer rate of the basic service;
(Eb/No)0e required for representing basic serviceb/NoI.e. the signal-to-noise ratio requirement for correct demodulation of the basic service;
v0an activation factor representing a basic service;
aiindicating the traffic resource strength of the traffic j with respect to the basic traffic channel,
Rjrepresenting the bearer rate of service j;
(Eb/No)je required to represent service jb/NoI.e. the signal-to-noise ratio requirement for correct demodulation of service j;
vjrepresenting the activation factor of service j.
4. The radio resource occupying algorithm of claim 1,
in the second step, the service resource strength of the uplink service of the wireless communication system is:
a i = 1 + W ( E b / N o ) 0 v 0 R 0 1 + W ( E b / N o ) i v i R i
the relative resource strength of the downlink service is:
<math> <mrow> <msub> <mi>a</mi> <mi>i</mi> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mi>i</mi> </msub> </mrow> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mn>0</mn> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mn>0</mn> </msub> </mrow> </mfrac> </mrow> </math>
wherein:
i denotes the ith service and the ith service,
R0representing the bearer rate of the basic service;
(Eb/No)0e required for representing basic serviceb/NoI.e. the signal-to-noise ratio requirement for correct demodulation of the basic service;
v0an activation factor representing a basic service;
(Eb/No)ie required for service ib/NoI.e. the signal-to-noise ratio requirement for correct demodulation of service j;
w-chip rate;
vi-an activation factor for service j;
Ri-bit rate of service j.
5. A radio resource occupation algorithm for a wireless communication system, comprising the steps of:
the method comprises the following steps: dividing a service area of a wireless communication system into a circuit switching domain and a packet switching domain;
step two: selecting a service as a basic service for a circuit switching domain and a packet switching domain respectively;
step three: meterCalculating the relative resource occupation intensity a of each servicei
Step four: respectively calculating virtual channels c of a circuit switching domain and a packet switching domain by the following formula;
<math> <mrow> <mi>c</mi> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mn>2</mn> </msubsup> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> <mrow> <munder> <mi>&Sigma;</mi> <mi>i</mi> </munder> <msub> <mi>N</mi> <mi>i</mi> </msub> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> <msub> <mi>a</mi> <mi>i</mi> </msub> <msub> <mi>b</mi> <mi>i</mi> </msub> </mrow> </mfrac> </mrow> </math>
where i represents the ith service, γiCall arrival rate for service i, biAverage call hold time, N, for service iiThe number of users of the cell service i;
step five: for the circuit switching domain and the packet switching domain, respectively based on the selected basic service, using the service resource intensity of each service to make weighted average for the service volume of each service, respectively mixing each service in the circuit switching domain and the packet switching domain into a virtual mixed service, and respectively calculating the total virtual mixed service volume of the circuit switching domain and the packet switching domain by the following formula:
virtual mixed traffic total (∑ N)i·γi·bi·ai)/c
Step six: obtaining the number of virtual channels meeting the requirement of a certain blocking rate for the virtual mixed service of the circuit switching domain by using an Erlang B method; obtaining the number of virtual channels meeting certain QoS requirements for the virtual mixed service of the packet switching domain by using an Erlang C method;
converting the virtual channel numbers of the circuit switching domain and the packet switching domain into corresponding basic service channel numbers respectively by using the service resource intensity according to the following formula:
the number of basic service channels is the virtual channel number c + the service resource intensity of the basic service channels;
step seven: and obtaining the number of channels occupied by the cell of the wireless communication system according to the obtained basic service channels of the circuit switching domain and the packet switching domain respectively.
6. The radio resource occupying algorithm in the radio communication system according to claim 5, further comprising a step between the sixth step and the seventh step of: converting one of the basic service channel numbers of the circuit switching domain and the packet switching domain into another basic service channel number by the following formula:
Figure A2004100823980005C1
wherein,
R0which represents the bearer rate of a basic service,
(Eb/No)0e required for representing a basic serviceb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of the basic service,
v0represents the activation factor of a basic service,
R0′which represents the bearer rate of another basic service,
(Eb/No)0′e required for representing another basic serviceb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of the basic service,
v0′an activation factor representing another basic service;
and step seven, adding the basic service channel numbers of the circuit switching domain and the packet switching domain to obtain the channel number occupied by the wireless communication system cell.
7. The radio resource occupying algorithm in the radio communication system according to claim 6,
in the second step, the basic service selected for the circuit switching domain is a voice service;
in the sixth step, if the service resource strength of the basic service channel is 1, the obtained virtual channel number of the circuit-switched domain is directly converted into the voice service channel number, and the obtained virtual channel number of the packet-switched domain is converted into the basic service channel number by the following formula:
the number of basic service channels is the number of virtual channels c + 1;
in said step seven, the resulting number of elementary traffic channels of the packet-switched domain is converted into the number of voice traffic channels:
wherein,
R0which represents the bearer rate of the voice traffic,
(Eb/No)0indicating E required for voice servicesb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of voice traffic,
v0which represents the activation factor of the voice service,
R0′indicating the bearer rate of the PS domain basic service,
(Eb/No)0′e required for representing PS Domain basic serviceb/NoI.e., the signal-to-noise ratio requirement for proper demodulation of the basic service,
v0′an activation factor representing a PS domain basic service;
and in the step eight, summing the voice service channel numbers of the circuit switching domain and the packet switching domain to obtain the channel number occupied by the cell of the wireless communication system.
8. The algorithm of claim 5, wherein in the third step, the service resource strength of each service is characterized by parameters such as bearer rate, activation factor, signal-to-noise ratio, and can be simply expressed as:
<math> <mrow> <msub> <mi>a</mi> <mi>i</mi> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mi>i</mi> </msub> </mrow> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mn>0</mn> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mn>0</mn> </msub> </mrow> </mfrac> </mrow> </math>
wherein,
i denotes a different service or services which are different,
aiindicating the traffic resource strength of the traffic i with respect to the basic traffic channel,
Rirepresenting the bearing rate of the service i;
(Eb/No)ie required for representing service ib/NoI.e. the signal-to-noise ratio requirement for correct demodulation of service j;
vian activation factor representing a service i;
R0representing the bearer rate of the basic service;
(Eb/No)0e required for representing basic serviceb/NoI.e. the signal-to-noise ratio requirement for correct demodulation of the basic service;
v0representing the activation factor of the basic service.
9. The radio resource occupying algorithm of the radio communication system according to claim 5,
in the second step, for the circuit switched domain and the packet switched domain, the service resource strength of each uplink service is:
a i = 1 + W ( E b / N o ) 0 v 0 R 0 1 + W ( E b / N o ) i v i R i
the service resource intensity of each downlink service is as follows:
<math> <mrow> <msub> <mi>a</mi> <mi>i</mi> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mi>i</mi> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mi>i</mi> </msub> </mrow> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <msub> <mrow> <mo>(</mo> <msub> <mi>E</mi> <mi>b</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo>)</mo> </mrow> <mn>0</mn> </msub> <mo>&CenterDot;</mo> <msub> <mi>v</mi> <mn>0</mn> </msub> </mrow> </mfrac> </mrow> </math>
wherein:
(Eb/No)ie required for service ib/NoI.e. the signal-to-noise ratio requirement for correct demodulation of service j;
w-chip rate;
vi-an activation factor for service j;
Ri-bit rate of service j.
10. The radio resource occupation algorithm in a wireless communication system according to any of claims 5-9, wherein in said step five, the total traffic of the cell is increased in case of soft handover in the circuit switched domain, and the total amount of virtual mixed traffic is calculated by the following formula:
virtual mixed traffic total (1+ SHO) (∑ N)i·γi·bi·ai)/c
SHO is a soft handover factor, and corresponds to a proportion of traffic increase due to soft handover.
11. The radio resource occupying algorithm in a wireless communication system according to one of claims 5 to 9, wherein the algorithm is used in a WCDMA or CDMA system.
12. The wireless resource occupation algorithm in wireless communication system according to claim 10, wherein the algorithm is used in WCDMA or CDMA system.
CNB2004100823984A 2004-12-31 2004-12-31 Wireless resource occupation algorithm for wireless communication system Active CN100391302C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2004100823984A CN100391302C (en) 2004-12-31 2004-12-31 Wireless resource occupation algorithm for wireless communication system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2004100823984A CN100391302C (en) 2004-12-31 2004-12-31 Wireless resource occupation algorithm for wireless communication system

Publications (2)

Publication Number Publication Date
CN1801999A true CN1801999A (en) 2006-07-12
CN100391302C CN100391302C (en) 2008-05-28

Family

ID=36811692

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2004100823984A Active CN100391302C (en) 2004-12-31 2004-12-31 Wireless resource occupation algorithm for wireless communication system

Country Status (1)

Country Link
CN (1) CN100391302C (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101984699A (en) * 2010-11-05 2011-03-09 中兴通讯股份有限公司 Statistical method of telephone traffic of CDMA system and device thereof
CN102083214A (en) * 2009-11-30 2011-06-01 中国移动通信集团北京有限公司 Method and device for allocating radio resources in TD-SCDMA (time division-synchronous code division multiple access) system
CN102083106A (en) * 2009-11-30 2011-06-01 中国移动通信集团广东有限公司 Method and device for optimizing wireless volumes of cells
CN101304612B (en) * 2008-04-14 2011-06-29 中国联合网络通信集团有限公司 Method and apparatus for allocating district-series resource
CN102202329A (en) * 2011-04-28 2011-09-28 中国联合网络通信集团有限公司 Acquisition method of wireless network utilization of global system for mobile communication
CN103327527A (en) * 2012-03-22 2013-09-25 电信科学技术研究院 Method and device determining service capacity
CN116307755A (en) * 2023-02-07 2023-06-23 沈阳市规划设计研究院有限公司 Territorial space planning management and control level early warning system based on GIS

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1184763C (en) * 2001-12-05 2005-01-12 华为技术有限公司 Method for optimizing transmission resource in CDMA system
CN1173505C (en) * 2001-12-27 2004-10-27 华为技术有限公司 Method for base station load recombination in universal land radio access web
DE60210455T2 (en) * 2002-09-23 2006-08-24 Telefonaktiebolaget Lm Ericsson (Publ) Method and arrangement for power regulation in a mobile radio system

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101304612B (en) * 2008-04-14 2011-06-29 中国联合网络通信集团有限公司 Method and apparatus for allocating district-series resource
CN102083214A (en) * 2009-11-30 2011-06-01 中国移动通信集团北京有限公司 Method and device for allocating radio resources in TD-SCDMA (time division-synchronous code division multiple access) system
CN102083106A (en) * 2009-11-30 2011-06-01 中国移动通信集团广东有限公司 Method and device for optimizing wireless volumes of cells
CN102083214B (en) * 2009-11-30 2013-08-07 中国移动通信集团北京有限公司 Method and device for allocating radio resources in TD-SCDMA (time division-synchronous code division multiple access) system
CN102083106B (en) * 2009-11-30 2014-07-02 中国移动通信集团广东有限公司 Method and device for optimizing wireless volumes of cells
CN101984699A (en) * 2010-11-05 2011-03-09 中兴通讯股份有限公司 Statistical method of telephone traffic of CDMA system and device thereof
WO2012058846A1 (en) * 2010-11-05 2012-05-10 中兴通讯股份有限公司 Method and apparatus for traffic statistics in cdma system
CN102202329A (en) * 2011-04-28 2011-09-28 中国联合网络通信集团有限公司 Acquisition method of wireless network utilization of global system for mobile communication
CN102202329B (en) * 2011-04-28 2013-09-11 中国联合网络通信集团有限公司 Acquisition method of wireless network utilization of global system for mobile communication
CN103327527A (en) * 2012-03-22 2013-09-25 电信科学技术研究院 Method and device determining service capacity
CN103327527B (en) * 2012-03-22 2016-02-17 电信科学技术研究院 A kind of method and apparatus determining volume of business
CN116307755A (en) * 2023-02-07 2023-06-23 沈阳市规划设计研究院有限公司 Territorial space planning management and control level early warning system based on GIS

Also Published As

Publication number Publication date
CN100391302C (en) 2008-05-28

Similar Documents

Publication Publication Date Title
CN1196373C (en) Method for coding mode selection
CN1226892C (en) Base station, control device, communication system and communication method
CN101044721A (en) Method and system for managing radio resources in mobile communication networks, related network and computer program product therefor
CN1173528C (en) Connection reception control plane through obtaining usable quality value
CN1820465A (en) Resource reservation in wireless network with distributed medium access control
CN2652069Y (en) Calling permitting controlling unit
CN1853385A (en) Method for scheduling uplink transmissions from user equipments by a base station determining a measure of a quality of service, and corresponding base station, user equipment and communication system
CN1791274A (en) Method, device, and system for wireless communication
CN1825782A (en) Radio resource control method, radio base station and radio network controller
CN1373580A (en) Radio channel setting method, radio network controlling device and base station, and mobile communication system
CN1771752A (en) Base station device and mobile communication system
CN1829121A (en) Packet transmission control device and packet transmission control method
CN1856970A (en) Method for adjusting a transmitting power in a wire-less communications network
CN1949899A (en) Wireless communication system and base station
CN101053221A (en) Error ratio measurement in the radio link control layer for quality of service control in a wireless communication system
CN1666444A (en) Packet communication system, packet communication method, base station, mobile station, controller and packet communication program
CN1643825A (en) Base station apparatus and communication terminal apparatus
CN1736072A (en) Method, station and medium storing a program for a priority based scheduler with variable scheduling periods and variable scheduled periods
CN1853437A (en) Soft handover
CN1647421A (en) Mobile communication system, mobile station, base station, communication path quality estimation method used for the same
CN1902844A (en) Mobile communication terminal and radio communication system
CN1662074A (en) Method and apparatus for scheduling packet
CN1499760A (en) Method for supporting services in multimedia broadcast and multicast by carrying connection through signaling in Lu interface
CN1905738A (en) Mobile communication system, radio base station and radio mobile station
CN1674705A (en) Channel assigning method and communication apparatus

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant