CALL SET-UP IN A TRANSMISSION TRUNKING RADIO SYSTEM

Abstract: The invention relates to a call control method in a transmission trunking radio system, in which (i) M traffic channels are simultaneously allocated to at most N mobile stations (MS) for a call, N and M being positive integers and N > M; and (ii) a mobile station is commanded to go onto one of the M traffic channels during a call for the duration of the call transactions only and onto a control channel at other times. In accordance with the invention, the number N of calls can be optimised by (iii) collecting data about collisions of call transactions of different calls on said M traffic channels, and (iv) automatically adjusting the maximum number N of simultaneously allowed calls in accordance with the collected data.

Description: Call set-up in a transmission trunking radio system Field of the Invention The invention relates to a call control method in a transmission trunking radio system. Background of the Invention In a trunking radio system, several user groups, even several user organizations, share a common pool of channels. In radio systems like this, a message trunking procedure is usually utilized for call set-up. In this procedure a traffic channel is permanently allocated for one call for the entire duration of the call. The call may consist of various separate call transactions (several pressel activations by separate terminals). The channel is not de-allocated (released) until the call is explicitly terminated or a specific timer expires. In a transmission trunking procedure, a group of simultaneous calls shares a certain group of traffic channels; for each call, a traffic channel belonging to this group is allocated, separately for each call trans¬ action (each activation of the pressel). The traffic channel is immediately de-allocated at the end of the call transaction, i.e. when the pressel is released and one stops speaking. Between the call transactions, the MS participating in the call goes to listen onto a control channel. It is typical of transmission trunking that allocation of a channel requires only a little signalling during an on-going call. On account of transmission trunking, for example, more than four calls can, in principle, be allowed simultaneously in a 4-channel system. However, there is no guarantee that a subscriber can be served at the precise moment the service is requested for. Another problem with optimisation of channel utilization is that it is not necessarily possible to make a reli¬ able estimate of the number of calls that can be allowed simultaneously on transmission trunking channels since the amount of traffic may vary from day to day. For example, a very large number of calls by which sub¬ scribers give brief instructions to one another relatively seldom (e.g. group call) can be allowed simultaneously. On the other hand, one call with normal conversation occupies an entire traffic channel for a long time. Disclosure of the Invention An object of the present invention is to optimise the number of simultaneous calls in a trans¬ mission trunking radio system. This is achieved according to the invention with a call control method in a transmission trunking radio system, in which M traffic channels are simultaneously allocated to at most N mobile stations for a call, N and M being positive integers and N > M; and during a call a mobile station is commanded to go onto one of the M traffic channels for the duration of the call transactions only and to go onto a control channel at other times. The method is characterised by collecting data about collisions of call transactions of different calls on said M traffic channels, and ato- matically adjusting the maximum number N of simulta¬ neously allowable calls in accordance with the collected data. The invention offers a solution to the problem of optimising the number of calls: the radio system collects collision data about call transactions of different calls, e.g. at a base station or a mobile exchange. On the basis of these traffic and collision data the radio system automatically controls the number of simultaneous calls, increasing the number if no collisions occur and reducing it on certain conditions if collisions occur. It is thus possible to establish several simultaneous calls if traffic is such that the probability of collision is small. A requirement for collection of collision data is that it is possible to make a relatively reliable estimate of an occurrence of a collision. In one embodi- ment of the invention, a mobile station sends a channel request to a base station for each service transaction. Each situation where the system is not capable of imme¬ diately allocating a traffic channel because no free channels are available is then interpreted as a colli- sion of call transactions. The maximum number of simultaneous calls can be adaptively adjusted on the basis of the number and frequency of collisions. The adaptation may depend e.g. on the ratio of such channel allocation attempts which have caused collisions to the total number of allocation attempts in a time unit. The invention also relates to a transmission trunking radio system comprising base station sites (BS), mobile stations (MS), call control means (MX) and, in at least one base station site, at least one control channel and at least M traffic channels in which at most N simultaneous calls are allowed, N and M being positive integers and N > M; the call control means (MX) command¬ ing the mobile station to go onto one of the M traffic channels during a call for the duration of the call transactions and onto a control channel at other times. The system of the invention is characterized in that it further comprises means (MX) for collecting data about collisions of call transactions of different calls on said M traffic channels, and means (MX) for automatical- ly adjusting the maximum number N of simultaneously allowable calls in accordance with the collected data. Brief Description of the Drawings In the following the preferred embodiments of the invention will be described in greater detail with reference to the attached drawings, in which Fig. 1 illustrates a radio system in which the invention may be applied, Fig. 2 shows a general block diagram of a mobile station, Fig. 3 shows a signalling scheme illustrating a transmission trunking procedure, and Fig. 4 is a flow diagram of one optimisation algorithm according to the invention. Preferred Embodiments of the Invention Fig. 1 shows a trunking radio telephone system in which the geographical area covered by the system is divided into smaller radio areas or cells Cl, C2 and C3, which may be separate, defined by one another or overlap in their peripheral areas. Each cell Cl, C2, C3 contains at least one fixed - typically multichannel - trans¬ ceiver apparatus BS, which is called a base station. All base stations BS are connected by fixed transmission links, such as cables, to a mobile exchange MX, which controls the operation of the base stations BS. The base stations BS communicate via a radio connection with subscriber mobile stations MS roaming freely within the radio system on the radio frequencies or channels assigned to the radio system. A trunking radio telephone system may be a digital TDMA system or an analog FDMA system. The analog FDMA system may be e.g. of the type described in Finnish Patent Application 914,654. In an analog FDMA system each radio channel serves as a traffic channel or a control channel. A control channel is a channel on which signalling for controlling the system is transmitted. A traffic channel is a channel on which speech or data are transmitted. In a TDMA system each radio channel is further divided into timeslots (e.g. 4 or 8 timeslots per radio channel), in which control and traffic channels are conveyed. In radio systems, a so called message trunking principle is normally used for call set-up: a traffic channel is allocated for one call for the complete duration of the call. The number of simultaneous calls is thus limited to the number of traffic channels. A call is complete information exchange between two or more parties. A call may be made up of one or more call transactions. In a semi-duplex call these transactions are sequential. A call transaction refers generally to all of the functions associated with com¬ plete unidirectional transmission of information during a call. The invention relates to a trunking radio system in which a so called transmission trunking procedure is utilized at least on some traffic channels. The number of simultaneous calls may exceed the number of traffic channels available, a traffic channel being allocated separately for each call transaction (each activation of the pressel) . A traffic channel is de¬ allocated immediately at the end of the call trans¬ action, i.e. as the pressel is released and one stops speaking. During the interval between call transactions a mobile station participating in the call goes onto a control channel. One application of this is known as quasi-transmission trunking, which is otherwise similar to conventional transmission trunking but channel de- allocation is delayed for a short period at the end of the call transaction (after the pressel release) . During this 'hang-time' the channel allocation may be re-used for a new call transaction that is part of the same call. In the following the transmission trunking principle will be described with reference to Fig. 3. In this embodiment it is assumed that a call is estab¬ lished between two mobile stations MSA and MSB located within the area of one base station. The MSA and MSB listen on a control channel, ready to go, if necessary, for the duration of call transactions onto the M traffic channels available, M being e.g. 4. When the MSB user wants to speak, he activates the pressel, whereby the MSB sends a request-to-transmit message U TX DEMAND on a control channel to the base station BS. The base station BS forwards the message to the mobile exchange MX. The MX comprises a call control computer, which allocates free traffic channels to the calling parties and sends a permission-to-transmit message D TX GRANTED through the base station BS to the MSB, and a D CONTINUE message to the other calling party MSA, thereby announcing the call transaction to be performed. Each message also contains channel allocation, which commands the mobile stations MSA and MSB to the traffic channels allocated to them. The MSA and MSB then go onto the traffic channels allocated, and the MSB initiates trans¬ mission of speech through the base station BS to the mobile station MSA. When the MSB subscriber terminates the call transaction, he releases the pressel, whereby the MSB sends an end-of-transmission message U TX CEASED to the base station BS. The call control computer subsequently de-allocates the traffic channel concerned and sends an end-of-transmission message D TX CEASED to both parties MSA and MSB, whereby MSA and MSB go back onto a control channel. One successful call transaction I has thus been completed. In Fig. 3, the MSB user wants to continue the call and presses the pressel, whereby the MSB sends a new request-to-transmit message U TX DEMAND. However, the call control computer of the mobile exchange MX has no free channels available at that moment, and so the MX puts the request in a queue and sends a D-TX WAIT message through the base station BS to the calling parties MSA and MSB on a control channel. When a traffic channel is then freed, the MX allocates it for a call and sends D-TX GRANTED and D-CONTINUE messages to the mobile stations MSA and MSB in the above manner. The MSB and MSA then go onto the traffic channel allocated to them for speech transmission. When the pressel is released, the MSB sends an end-of-transmission message U-TX CEASED, whereby the channel is de-allocated as described in connection with call transaction I. Another successful call transaction II in which the MSB has had to queue for channel resources has thus been completed. A call may be made of a plurality of call transactions of the type described above, either one of the calling parties MSA and MSB initiating said trans¬ actions. When the parties want to terminate a call, they initiate a conventional call release procedure. As stated above, a certain number M of trans¬ mission trunking traffic channels may be simultaneously allocated for a larger number of calls. The problem is that there is no guarantee that free traffic channels can be found and that a subscriber can be served at the precise moment he wants to. Another problem with the optimisation of the number of channels is that it is not necessarily possible to make a very reliable estimate of the highest level of traffic allowed since situations may vary from day to day depending on the users of the system. In the invention the radio system collects collision data of call transactions; on the basis of these data the radio system then defines the maximum number of simultaneous calls allowable in a given situ- ation. The condition for this is that the system is capable of estimating fairly reliably when a collision has occurred. For example, in a system following the procedure of Fig. 3, in which a mobile station MS requests a traffic channel for each call transaction, every situation in which a traffic channel cannot be allocated immediately may be regarded as a collision. For example, in Fig. 3 the call in call transaction II has to queue for resources (traffic channel) since each traffic channel is allocated for call transactions of simultaneous calls, i.e. a collision has occurred. Depending on the system, other suitable methods may also be applied to detect a collision/congestion of calls. The system adjusts the number of simultaneous calls on the basis of the collected traffic and colli¬ sion data. If the number or frequency of collisions increases, the maximum number of simultaneously allow¬ able calls is reduced. If no collisions occur, the system increases the number of simultaneous calls. The maximum number of calls may also change with the ratio of such channel allocation attempts which have caused collisions to the total number of allocation attempts within a certain period of time. Fig. 4 shows an algorithm for the optimisation of the number of calls. The algorithm is always initi¬ ated when a new channel allocation attempt is made. In the embodiment of Fig. 3, this means that a U-TX DEMAND message is sent. First the time from the previous colli¬ sion is calculated or measured. It is then checked whether the channel allocation attempt was immediately successful or whether resources had to be queued for on account of collision. If there is no collision, the number of allowable calls is integrated upward by an integration constant selected by the operator. In case of collision, the maximum number of allowable calls is integrated downward. It is then checked that the integ¬ ration result does not go beyond certain limits set to the radio system. The limits may be due to limitations inherent in the radio system (e.g. the radio system may have only five bits for identification of calls; i.e. a maximum of 32 calls), or a lower limit set by the operator. The integration result is then used as the new maximum number until the following integration. It is advantageous to the operation of the radio system that the control algorithm is integrative (contains a certain time constant). Without integration, e.g. when the traffic load is low, even a large number of calls may cause few collisions or none at all, whereby the maximum number of calls allowed rises high. If the amount of traffic then increases abruptly due to increase in call activity, the result is a large number of failed call transactions on account of too numerous calls. In a fixed network, collection of data and calculation associated with optimisation according to the invention may be included in the operation of any component of the network, such as a mobile exchange or a base station, but most advantageously of a call con¬ trol computer located in the mobile exchange MX, the computer controlling channel allocation and all signal- ling associated with call control. The mobile station MS may be of any type, depending on the radio system. Fig. 2 shows a general block diagram of subscriber equipment MS in which the invention may be applied. The MS comprises a transceiver 21 connected to an antenna 27, the receiver being connected to a loudspeaker 25 and the transmitter being connected to a microphone 26. The operation of the MS is controlled by a microprocessor 22, which processes the signals transmitted and received by the transceiver 21. The subscriber equipment MS also comprises a pressel SI, or a switch, which the speaker activates (closes) as he speaks. The microprocessor 22 detects that the pressel SI is activated and starts the above-described operations to perform a call transaction. On detecting the release of the pressel SI, the microprocessor 22 starts the above operations to terminate the call trans¬ action. The attached figures and the description thereof are intended only to illustrate the present invention. The call control method and radio system according to the invention may vary in their details within the scope and spirit of the attached claims.

Claims: Claims 1. A call control method in a transmission trunking radio system, in which M traffic channels are simultaneously allocated to at most N mobile stations for a call, N and M being positive integers and N > M; and during a call a mobile station is commanded to go onto one of the M traffic channels for the duration of the call transactions only and to go onto a control channel at other times, c h a r a c t e r i s e d by collecting data about collisions of call trans¬ actions of different calls on said M traffic channels, and automatically adjusting the maximum number N of simultaneously allowable calls in accordance with the collected data. 2. The method ofclaim 1, c h a r a c t e r - i s e d in that the call transaction is initiated by activating a pressel and terminated by releasing the pressel in a mobile station. 3. The method of claim 1 or 2, c h a r a c ¬ t e r i s e d in that the calling mobile station requests a traffic channel for each call transaction, and that every situation in which the system is not capable of immediately allocating a traffic channel is registered as collision of call transactions. 4. The method of any one of the preceding claims, c h a r a c t e r i s e d in that the maximum number N of simultaneously allowable calls is adjusted in accordance with the number of collisions. 5. The method of any one of claims 1 to 4, c h a r a c t e r i s e d in that the maximum number N of simultaneously allowable calls is adjusted in accordance with the frequency of collisions. 6. The method of any one of claims 1 to 4, c h a r a c t e r i s e d in that the maximum number N of simultaneously allowable calls is adjusted in accordance with the ratio of such channel allocation attempts which have caused collisions to the total number of allocation attempts in a time unit. 7. The method of any one of claims 1 to 4 and 6, c h a r a c t e r i s e d in that adjustment of the maximum number N of simultaneously allowable calls com¬ prises, in connection with every channel allocation attempt, the steps of measuring the time from the previous collision, integrating the maximum number of calls down¬ ward if the allocation attempt causes collision of call transactions, integrating the maximum number of calls upward if the allocation attempt does not cause collision of call transactions. 8. A transmission trunking radio system com¬ prising base station sites (BS), mobile stations (MS), call control means (MX) and, in at least one base station site, at least one control channel and at least M traffic channels in which at most N simultaneous calls are allowed, N and M being positive integers and N > M; the call control means (MX) commanding the mobile station to go onto one of the M traffic channels during a call for the duration of the call transactions only and onto a control channel at other times, c h a r a c ¬ t e r i s e d in that the system further comprises means (MX) for collecting data about collisions of call transactions of different calls on said M traffic channels, and means (MX) for automatically adjusting the maximum number N of simultaneously allowable calls in accordance with the collected data.

Inventors: PAAVONEN TAPIO, PAAVONEN, TAPIO
Applicants: NOKIA TELECOMMUNICATIONS OY, PAAVONEN TAPIO, PAAVONEN, TAPIO
Application year: 1993
Main classification: H04Q7
IPC codes: H04W84