METHOD TO REALLOCATE THE TRAFFIC LOAD IN A CELLULAR MOBILE TELEPHONE SYSTEM

Abstract: Procedure at cellular mobile telephone system which makes possible for an operator to re-allocate the traffic load from one cell to another at packet switched connections in said system, and reroute mobiles which have GPRS-functionality, to cells which are less loaded. The throughput of data in GPRS is increased by letting the connections utilise several time-slots within the same time-frame. A netowrk controlled "cell re-selection"- algorithm orders the mobile to make a "cell re-selection" to one by the network specified cell, at which the algorithm can be used both at set-up of the data calls and during the session in progress.

Description: M■ETHOD TO REALLOCATE THE TRAFFIC LOAD IN A CELLULAR MOBILE TELEPHONE SYSTEM TECHNICAL FIELD Procedure at a cellular mobile telephone system which makes possible for an operator to reallocate the traffic load, from one cell to another, at packet switched connections in said system, and reroute mobiles, which have GPRS- functionality, to cells which are less loaded. PRIOR ART General Packet Radio Service (GPRS) is a new service for GSM which makes possible packet switched services. GPRS is a very cost efficient method in the sense that a GPRS mobile utilises the radio channel only when it shall transmit or receive data. GPRS uses to a large extent the same radio network infrastructure (BSS) as GSM and HSCSD . Circuit and packet switched services will therefore to some extent share the same radio resource, which may result in great problems. "Burst -based" data sources which during short periods require high data rates (for instance WWW, file transfer) will call for high demands on the system. Previous investigations have shown that a small number of data users can cause a very high congestion for speech users in a system where speech and data users coexist . TECHNICAL PROBLEM An aim of the present invention therefore is to effect a procedure which gives a high throughput of data in the cellular network. The previously known technology of cell re- selection has focussed on speech traffic and only considered the propagation conditions in the network. By the introduction of GPRS more and more situations will occur where different users need different quantities of resources and then it must also be considered what the resource situation in the network looks like. The present invention with belonging algorithm does just this (in combination with the propagation conditions) , and the invention results in that the data rate for GPRS-mobiles can increase as a consequence of a better channel utilisation (truncing loss will decrease) . A trivial method to increase the throughput of data in GPRS is to make the connections (base station - mobile pair) use several time slots within a frame. This is only possibly to a certain level, namely until all time slots are occupied in a base station. Even when this situation arises in the network, it will be possible to increase the total transmission capacity of the system. The networks of today are designed for "worst-case" situations where, for instance, the frequency allocation must be based on the quality demand of a smallest C/I-value of 9 dB at the cell edge. Further, the number of frequency bands (where each frequency band corresponds to eight time slots) which are allocated to the different base stations must consider the worst case (the traffic peaks) of the load of the system) . This results in a less efficient utilisation of spectrum during "non-busy" -periods . TECHNICAL SOLUTION The technical solution is described in what is specified in patent claim 1. ADVANTAGES By the present invention it will be easier to reroute mobiles to effect a higher security at the transmission, and a higher transmission capacity in the network. Further, the procedure is so general that it can be applied to other cellular packet-oriented systems which have similar requirements as GPRS (for instance UMTS) . It should be observed that cell re-selection is a functionality which the network (i.e. indirectly the operator) decides whether it shall take place. Another advantage which the invention provides is that the throughput of data in the system is not obtained as a consequence of an impaired communication to users who already have their service running. DESCRIPTION OF FIGURES Figure 1 shows a schematic figure which describes the area around a base station where candidates are tried to be found for cell re-selection. DETAILED DESCRIPTION In Figure 1 a picture shows how a part of the algorithm which is an integral part of the procedure works, and describes the area around a base station where one tries to find candidates for cell re-selection. One first investigates the area which is defined by the parameter a k x (light shaded area) . If there are no mobiles, one may search further into the cell specified by the parameter a k 2 (dark shaded area) etc. This is described in detail later in the text . The traffic in a cellular mobile telephone system is such that the cells utilise only a part of their total capacity. When the traffic varies, both in time and room, the load between different base stations will fluctuate. It may be that a base station has all its time slots and frequencies allocated to mobile users in its cell, whereas adjacent base stations to this cell are less loaded. Then it is possible to utilise the free capacity in the adjacent base stations to increase the total throughput of data in the system by connecting some mobiles in the heavily loaded base station to these. According to the specification for GPRS (GSM 03.64 Version 2.02 April 1997), it is the mobile that decides when it is time to make a "cell re-selection" , i.e. change of cell by connecting to another base station. The network, however, has means of giving order the mobile to make a "cell re- selection" to one by the network specified cell. The invention is based on the use of this network controlled "cell re-selection" to reroute mobiles to cells which are less loaded. The invention utilises already existing measurement methods in the mobiles to find out the propagation conditions in the surrounding cells (base stations) . The algorithm which is utilised is based on a classification of the mobiles based on their "distances" from their respective base station. By "distance" here is referred to the value of the attenuation in the radio links to the different base stations. If a mobile has a high attenuation to its present base station (cell) , and has a comparatively small attenuation to adjacent cells, this mobile will be a suitable candidate to be selected for cell re-selection. In the following is presented a detailed description of the algorithm which we utilise, and after that the different steps in the algorithm are explained. When we in the definition of the algorithm talk about mobiles, we refer to mobiles which have GPRS-functionality (can also be in combination with GSM and/or HSCSD) . The algorithm can be used both at establishing of sessions (data calls) and when sessions are in progress. The algorithm can be used in situations where when one or more mobiles in the network want to use more channels than are available in the base station. The algorithm makes use of thresholds to identify areas around the base stations where candidates for cell re-selection shall be found out. Let the total number of base stations in the network be N. One starts by examining mobiles far away from their respective base stations. The first area for base station j is specified (as below) by a parameter ot_ ;1 . If the algorithm has not found a mobile in this first area, areas closer and closer to the base station will be examined. This procedure is performed step by step for all base stations. The areas are specified by the parameters ot -ιm , where the parameters fulfils the following relation α :>1 > α- f2 > α- 3 > o κ - (j=l, ...,N) . The number of parameters for respective base station (Kj , j=l, ,N) and the individual values of the parameters are defined by the operator. 1) The algorithm goes through a loop (step 2-8 below) and makes during the first turn use of the parameters α 1( (j=l, ... ,N) , during the second turn of the parameters ot 2/ etc . 2) Each mobile measures the signal strength to the neighbouring base stations and the own cell. This can in our algorithm be implemented in different ways. Either one can use RXLEV which the mobile reports to the base station on a regular basis, or one can use a function of this, for instance average RXLEV during a certain defined time interval. As an alternative one can use the Cl-criterion according to the GSM-specification (4) . Also other measured values based on signal strength can be used. Let G 1 . be the measured signal strength value (obtained according to some method) between the base station j and mobile i. For each mobile we now form the difference D , between the measured value towards the base station the mobile at present is connected to (serving cell, say that it has index k) G lk , and the adjacent base stations according to the channel list for the adjacent channels. Consequently we will have: D 1D = G .j " G lk j ≠ k ( dB ) for all j which belongs to the channel list for adjacent channels for base station k. This, consequently, is the difference in propagation conditions for mobile i. 3) All mobiles which have at least one adjacent base station (say with index k) with D._ larger than α k l constitute candidates for cell re-selection and are part of the number of candidates S. The relation D 1;) > k l will describe an area between the base stations (which in reality is highly irregular) where the algorithm will search for mobiles which are suitable for cell re- selection. An illustration of this is in Figure 1. It is a very schematic figure which describes the "area" around a base station where one tries to find candidates for cell re-selection. First that area is inspected which is defined by the parameter α k l (light grey area) . If there are no mobiles there, one may examine further into the cell specified by the parameter α k2 (dark grey area), etc. 4) For each mobile of the number S, one inspects for each base station, which together with the mobile fulfils the condition D ι: > k l how many channels x the mobile can have allocated to itself (the maximum number is the number that the mobile wishes) in the potentially new base station. In addition one inspects how many channels y, that can be allocated to other mobiles in the base station to which the mobile in question for the time being is connected (serving cell) , given that the mobile makes a cell re-selection to the candidate base station which is regarded. These two are summed up (x+y) and one will have the total number of channels which can be allocated in the network, given that the mobile is connected towards the new base station, i.e. we study the increase of the total data throughput . This is made for all mobiles in the number of candidates S . These constitute the subset SI. With each mobile in the subset SI is associated the base station which together with the mobile gives maximal increase of throughput. 5) If there in step 4 would be mobiles which have several candidate base stations which give maximal increase of throughput, one selects for respective mobile the candidate base station which has the highest D , i.e. the one with the strongest reception. 6) If there are more than one mobile in the number of SI after step 5, it is a question of finding a final mobile from the number SI. This is made in the following way: Power control is not used: The mobile of the number SI which has the smallest value G lk is selected to the present cell (serving cell) . Power control is used: The mobile of the number SI which has the smallest value of (P._ new - D ι;) ) is selected to the candidate base station which has been obtained in step 5. P. ;new is the receiver power which the base station j orders the mobiles (which are connected towards base station j) to adjust to. 7) The network orders the selected mobile to make cell re- selection to the appointed base station. Then the network checks that other radio connections are no too much interfered with. 8) If there would be no mobiles which do not fulfil the condition D._ >α k l towards any base station, there are no candidates in the area for cell re-selection. This implies that the mobiles in the heavily loaded cells are closer to their base stations than the cell re-selection thresholds ot j (j=l, ...,N) specifies. Then one may try the parameters ( j 2 (j=l, ...,N) and start again from step 2, i.e. one moves gradually closer and closer to the base stations and examines possible candidates . 9) If the cell which the mobile actually preferably would be connected to again will get vacant time slots, then the mobile which has been ordered to make a cell re-selection again can be connected to this . The algorithm is specified to have one mobile at a time selected for cell re-selection. Of course it is possible to speed up the procedure by making multiple selections of mobiles (several are selected at the same time) . As a suggestion the calculations as above then are made parallel for a plurality (or the number which one wants to take away) mobiles and lists the mobiles in order according to step 2-8. An explanation of the different steps in the algorithm is given in the following. 1) No explanation necessary. 2) Explained together with step 3 below. 3) The idea is, as has been mentioned, to select the mobiles which, from a propagation point of view are far from the present base station. Note that we will not make a cell re-selection if there are no mobile that fulfils the condition in the last round (i.e. for the parameters j κj ) even if the system would be "filled up". This is due to the fact that if such a situation should occur, the mobiles are too close to the present base station (serving cell) , and to connect them to a base station too far away requires very high transmission power, which the mobiles may not be able to effect. The number of parameters Kj (j=l,...,N) for respective base station (i.e. the largest area which is regarded for cell re-selection) will be decided by a trade- off between capacity demands and quality demands in the network . 4) This selection is made in order to get as high a data throughput as possible. Note that the algorithm is specified to select only one mobile at a time. If one has a situation where a plurality of mobiles need to make cell re-selection, the cell re-selection for the mobiles will be made in sequence (one at a time) . One can of course examine all combinations of mobiles in the network which gives maximal increase of throughput. This actually is an optimal strategy. The problem is that the complexity of such an algorithm will increase exponentially by the number of mobiles which need to make cell re-selection. For practical realisations we suggest that a sup-optimal sequential strategy is used. In the cases when one only needs to make cell re- selection for one mobile, the sequential method of course is optimal. 5) If a mobile has a plurality of base stations to select from (with the same increase of throughput) , one selects the one for which the wave propagation conditions are best. 6) If there are a plurality of mobiles which constitute candidates in step 5, one selects strategy depending on if one has power control switched on or not . In the case without power control, one selects the mobile which has the worst propagation conditions to the present base station (serving cell) , and which consequently will interfere least when it has been switched over to the new base station. In the case when one has power control, one selects the mobile which gives least interference power in serving cell when one has switched over the mobile to the new base station. We will explain the latter case in detail (assume the cell re-election mobile has index i) . Received power in the new base station (say with index ) is adjusted according to continuously received power control as : P- ( „ ew = constant = G 1 .+P 1 (dB) , where P x is the mobile's transmitting power. P ^ ι = P] ,ne - G^i] => Received interfering power in the old base station: Pk.oid _ G.J.+PJ. _ G lk +P - ; new G 13 - P : / new D. _ Consequently, to minimise received interfering power in serving cell after cell re-selection is the same as to select the mobile which will have the smallest value of P *- j , new-DI} . 7) We deal with point 7 below. 8) This point is self-explaining. 9) The mobile is connected to a cell to which it has not best propagation conditions (but which may be sufficiently good) . If time slots become vacant in the for the mobile "best" base station, one should switch back the mobile to this, to reduce the need of transmitted power from the mobile . Interference towards other links The algorithm is aggressive in so far as it tries to increase the throughput of data in the system towards a t o o en P. PJ Φ 0 ≤ cn H CO tr rt Ω tr Ω rt > PJ H3 rt Hi PJ tr PJ Ω PJ rt ^ ^ rt tr X! 0 • n Ό μ- μ- Pi X Hi 1 • P ^ Φ 0 G 0 0 y tr G 1 hi P. 0 y Ω y 0 μ- μ- tr PJ P hi hi 0 N <! P. rt 0 en a Φ 3 rt P 3 y μ- φ Φ •d CD 3 y Pi !x! K μ- CD PJ Φ 0 rt Φ Φ μ- Φ Ω y rt PJ rt PJ 3 P rt 0 0 CQ X! PJ — Ω 3 0 J Φ CD Q y J tr Φ O hi rr P 0 φ Φ fcr Hi Ω P 3 Φ tr tr Ω CQ G Ω • G Ω "< P. Q, rt μ- rt y P ;o 0 en μ- rt G 3 P CD Hi 0 P PJ Ω φ μ- PJ hi PJ Φ Φ μ- G J Hi 0 rt Φ φ rt Hi μ- 0 hi tr Φ CQ y P μ- ; rt y rt Φ 3 P P ι-3 cn μ- rt Hi Hi 0 ^ Pi 3 μ- VO til rt P rt cn PJ PJ PJ μ. μ- P Ω μ- PJ φ μ- CQ Φ Ω rt tr Ω Φ ■ -3 hi hj « i cn P ) VO rt • : P J Φ P P hi cn Ω Φ PJ 0 y Ω P μ- Φ 3 J Pi G 1 Φ CD 0 Hi μ- y 00 tr rr μ- Pi P. rt Ω rt μ- P XI s- P y Hi φ Ω 0 rt μ- X! *Q rt PJ P 0 φ μ- 0 CD J ≤ Hi tr φ rt μ- CQ 0 tr - rt hi CQ Φ PJ cn μ- PJ cn P C £. cn y Hi μ- P hi μ- rt G O P. μ- Ω W rt i-i μ- cn Φ - y y CQ 0 Φ CD 0 0 y 0 P Ω Hi Ω φ Pi tr rt S • 0 P 0 μ- Ω rt XI y y μ- P P 3 P P 3 cn rt Ω Ω y rt hi PJ rt φ G ■ α P rt rt tr tr μ- P J CD 0 tr P φ Ω O Hi Φ tr 0 i G P J Φ P μ- tr P hi μ. XI tr J G' φ P φ P Ω μ- ≤ 3 PJ "< ^ hi rt tr Φ P Φ CD Φ X5 3 Φ P ≤ P PJ P 3 μ- P Pi . — . PJ y μ- tr P Φ tr φ i hi J rt G tr TJ ≤: μ- i-Q G 1 PJ rr ^ ω •d rt Ω tr rt μ- rt φ CQ J J XI μ- y cn CQ Φ CD Φ φ y tr rt en μ- y Pi hi tr ^ rt PJ μ- rt tr hi y G P 0 Ω Φ Φ hi ^ P φ μ- ^ Ξ Ω μ- rt XI 0 CD o PJ G- CQ 0 < < rt y φ X! $, 0 • CD Ω Pi 3 Ω P μ. tr rt tr hi Φ s: tr rt J PJ Φ P rt Ω tr 0 0 P P Ω 0 rt ■ <: 0 φ T μ- rt rt • <; φ Φ CD μ- y - hi rt rt G- Hi PJ Ω o rt rt J P PJ Hi ■-3 Φ P P y 1 tr 3 • PJ rt φ Φ en 0 0 Φ rt PJ PJ Ω P Φ P P" 3 P. φ rt PJ y Φ PJ 0 rt P Ω 3 μ- rt rr Hi Hi rt rt Ω Ω rt μ- μ- - PJ P tn cn o rt s: 0 tr J P CQ ■≤ PJ tr 3 hi rt μ- μ- PJ CQ J rt PJ p- CD P ) <! tr μ- 5 φ 0 P Φ rt Φ rt P 0 rt Hi 0 O φ G 1 0 0 CD 0 Ω μ- hi Φ P Φ tr μ- 0 φ CD J CD P X P μ- rt Hi μ- hi Ό tr X! Φ P P φ h- • Ω 0 μ- 3 Pi i G 0 *d l-i CQ Ω rt μ- Ω G 1 Hi Ω 0 Φ μ- P CD < Φ P CQ μ- PJ CD rt P Φ 0 tr rt φ 0 Φ P 0 Φ μ- Φ P XI 0 y φ σ Φ .. Φ * Cn φ P ^ J μ- H Hi 0 XI P P rt < CQ Ω y cn G P φ P PJ X rt rt rt rt rt PJ PJ Ό i Φ P P rr φ Φ μ- Ω μ- y - — Φ cn Ω CQ μ- rt J cn μ- Φ ; t cn rt μ- •d - • hi rt PJ φ CQ P ft ^ Φ cn G 1 tr 0 Φ O 0 P μ- >d2 φ φ hi h hi φ r — Ω P Ω ^ -~ Hi P cn P Pi Ω G 1 μ- rt μ- y Hi CD G 1 φ hi rt P φ Φ rt rr rt Φ rt PJ φ rt 3 0 H- Φ P tr CQ CD CQ φ rt rt Φ G Φ Φ μ- Ω Φ IP rt y h-" μ- tr hi 0 rt h- > tr Φ C Q PJ rt tr 0 hi y Hi i rt 1 i μ. y ^ 0 Φ φ μ- . ^ μ- P CD Φ rt P PJ μ- O y PJ 0 Φ rt en Hi φ ω PJ Φ Ω rt P PJ 0 μ- Ω o tr Pi rt P hi φ rt P PJ Φ PJ cn cn PJ μ- hi μ- CQ £ P rt Hi tr rt μ- Hi Φ cn μ- 0 < 3 Ω μ- 3 Ω $, rt P 0 Φ rt ≤ *<: μ- σ tr PJ cn hi 0 rt tr Φ rt P Φ P φ rt μ- tr tr P μ- CD rt PJ PJ hi tr P φ tr £ P tr y y tr Ω rt μ- φ rt tr CD μ- y rt G 1 CO tr Hi PJ cn •d X5 Φ tr cn φ φ . φ tr μ- PJ rt μ- CD Ω φ 0 φ Φ ω y φ Φ o μ- Hi 0 φ y P y μ- 3 μ- P μ- P Φ tr P μ. y 3 PJ <! X hi Φ PJ φ 0 Ω PJ Ω ι-3 μ- Ω 3 rt y GT G CD φ μ- G' P CQ Φ φ 0 rt P P P tr hi Cfl G 1 P rt 0 Φ Φ Hi h- ' PJ 0 cn tt Ω P PJ μ- "< rt Pi 3 tr G 1 P Ω XI Φ S s; Φ Ω rt tr P hi μ- y •d φ PJ rt < CD PJ s; Φ Φ Φ μ- μ- Ω Φ P 0 φ Φ CQ hi Hi μ- 3 y Pi ϋ μ- *d Φ 0 rt μ- Hi Φ Φ Pi φ P PJ •d ra 3 i μ- Φ Φ cn μ- 0 0 0 0 hi CD rt μ- y hi P> P CQ CQ XI P Φ ^ ^ rt 3 Hi P Cu Pi i rr Ω < μ- P μ- rt 0 tr 0 y Φ Ω PJ cn hi CD μ- tr G Φ φ φ G φ rt CD PJ Φ P CQ P 0 Φ P X! G 1 PJ 3 Ω ,~, Ω tr 3 rt y Φ G hi rt hi a P G 1 rt hi •. rt Ω 0 Pi hi G G H Φ tr φ Φ J Φ y H- Φ PJ Φ Ω PJ rt Φ rt tr μ- φ PJ 0 Φ 0 y rt PJ y P 3 P Ω P o tr Φ rt 0 rt tr PJ <τ3 Ό CQ Ω rt P rt 0 G 1 cn y P φ CD Pi Φ P ) Ω hi n y rt • tr Φ rt y 0 μ- Ω Ω P * Ω PJ φ • cn P μ- rr ft Φ ΪV ; P J ^^ ≤ Φ φ 0 X! Ω O ; Φ PJ rt φ rt 0 CQ ≤ μ- . 3 φ μ- tr H Ω H P hi Ω hi ft tr ι-3 Pi y Hi Ω 0 0 μ- w VO P PJ tr PJ 0 φ Pi Ω Φ J 7f P hi P cn rt Φ P P Pi μ- G Pi P Φ Hi en CQ o y P hi hi Ω CD o Φ < XI Φ hi 12 better utilisation of the expensive radio resource. The consequences for the algorithm above is that one cannot guarantee that users in two adjacent cells do not use the same frequency during all time slots, i.e. there may in this case arise situations when a cell re-selection connection can interfere with other radio connections in the network. Regarding frequency hopping, and especially synthesis hopping, there are problems of identifying which transmitter/receiver-pair that are interfering in the network. This is a general problem and is not specific to our algorithm. We suggest that the problem (and point 7 in the algorithm above) in this case is solved in the following way: Because we are studying a GPRS- system which transports principally non-real time services, we have a retransmission protocol which requests re-transmissions if the packets are received with too many errors (the communication quality is too poor) . If the now switched over mobile would cause problems, this will be observed by that the number of re-transmissions for mobiles in adjacent cells and mobiles in the old cell is increased. If there would occur a heavily increased number of re-transmissions, this is a sure symptom of that the performed cell re- selection would not have taken place. One then can chose to regard the cell re-selection action as a failed attempt and order the cell where the transferred mobile is to stop the transmission. Or one can chose to let the transmission go on at the price of a deteriorated quality for the specific mobiles which are negatively influenced by the interference. The latter usually is called "graceful degradation" . The invention is of course not limited to the above specified embodiment, but may be subject to modifications within the frame of the idea of the invention illustrated in the following patent claims.

Claims: 13 PATENT CLAIMS 1. Procedure at a cellular mobile telephone system which makes possible for an operator to re-allocate the traffic load from one cell to another, at packet switched connections in said system and reroute mobiles which have GPRS-functionality, to cells which are less loaded, c h a r a c t e r i s e d in that the throughput of data in GPRS is increased by letting the connections utilise several time slots within the same time frame, at which a network controlled "cell re-selection" -algorithm orders the mobile to make a "cell re-selection" to one by the network specified cell, at which the algorithm can be used both at set-up of the data calls, and during the session in progress. 2. Procedure according to patent claim 1, c h a r a c t e r i s e d in that the algorithm utilises threshold values to identify areas around base stations where candidates for cell changes shall be found out. 3. Procedure according to patent claim 1, c h a r a c t e r i s e d in that the algorithm utilises existing measuring methods in the mobiles to find out the propagation conditions to the adjacent cells (base stations) . 4. Procedure according to patent claim 1, c h a r a c t e r i s e d in that the algorithm is based on a classification of the mobiles is based on the size of the attenuation in the radio links to the different base stations, at which a mobile which has a high attenuation to its present base station (cell) and has a comparatively small attenuation towards adjacent cells, is selected for cell re-selection. 14 5. Procedure according to patent claim 4, c h a r a c t e r i s e d in that the algorithm can be used to select one mobile at a time for cell re-selection, or to select a plurality of mobiles for cell re-selection.

Inventors: ANDERSIN MIKAEL, AYOUB SOUHAD, ANDERSIN, MIKAEL, AYOUB, SOUHAD
Applicants: TELIA AB, TELIA AB (PUBL)
Application year: 1999
Main classification: H04B7
IPC codes: H04L12, H04W16