ALLOCATION OF CONTROL CHANNEL IN PACKET RADIO NETWORK

Abstract: A method for the allocation of a control channel (PACCH) to mobile stations (MS) in a packet radio system, particularly in a GPRS system. The mobile station (MS) sends a resource allocation request (3-1), to which a network (BSS) responds (3-2) by allocating to the mobile station (MS) a TFI identifier and a USF identifier. The network then sends (3-5) data packets in blocks, at least some of which comprise a polling field (S/P), a polling state ('P') which indicates that the mobile station is to acknowledge received data packets on the control channel (PACCH). To ensure that a mobile station receiving in downlink would not prevent the network from allocating one uplink mobile station to said channel, the allocation of the control channel (PACCH) is, in accordance with the invention, independent of a possible USF identifier. The mobile station acknowledges (3-6) the received data packets after a predetermined time (T) from the downlink block in which said polling field is in the polling state ('P'). The predetermined time (T) can be fixed or it can be indicated in an additional extension field (EF2).

Description: ALLOCATION OF CONTROL CHANNEL IN PACKET RADIO NETWORK BACKGROUND OF THE INVENTION The invention relates to packet radio systems in general and particularly to a method and arrangement for providing independence between uplink and downlink in a packet radio network, preferably in a mobile station packet radio network such as a GPRS. The GPRS (General Packet Radio Service) is a new service in the GSM system and an object of standardization in the GSM phase 2+ in the ETSI (European Telecommunication Standard Institute). The operational environment in the GPRS comprises one or more subnetwork service areas interconnected by a GPRS Backbone Network. A subnetwork comprises a plural number of packet data service nodes, which are here referred to as GPRS support nodes (or agents), each of which is connected to the GSM mobile network so as to be able to offer a packet data service to mobile data terminal equipment via a plural number of base stations, i.e. cells. An intermediate mobile network offers circuit-switched or packet-switched data transmission between a support node and mobile data terminal equipment. The separate subnetworks are, in turn, connected to an external data network, e.g. to a PSPDN (Public Switched Packet Data Network). The GPRS service thus allows packet data transmission to be provided between mobile data terminal equipment and external data networks, with the GSM network functioning as an interface network. With reference to Figure 1 , a typical arrangement of a GPRS network will be described. It is to be understood that the architecture in the GPRS systems is not as mature as in the GSM systems. All GPRS terminology should therefore be understood to be descriptive and not restrictive. A typical mobile station functioning as a mobile data terminal comprises a mobile station MS of a mobile network and a portable personal computer PC connected to said MS through a data interface. The mobile station can be for instance a Nokia 2110 manufactured by Nokia Mobile Phones/Finland. By means of a PCMCIA-type Nokia Cellular Datacard, manufactured by Nokia Mobile Phones/Finland, the mobile station can be connected to any portable personal computer PC provided with a PCMCIA card slot. The PCMCIA card thus provides the PC with an interface point supporting a telecommunication application protocol, such as a CCITT X.25 or an Internet Protocol IP, used on the PC. The mobile station can optionally provide a direct interface point supporting a protocol used by the PC application. A further possibility is that the mobile station MS and the computer PC are integrated into a single entity, within which the application software is provided with an interface point supporting the protocol it uses. An example of such a mobile station comprising an integrated computer is Nokia Communicator 9000, which is also manufactured by Nokia Mobile Phones/Finland. Network elements BSC and MSC are known in a typical GSM network. The arrangement shown in Figure 1 comprises a separate Serving GPRS Support Node (SGSN) of the GPRS service. The support node performs certain packet radio service operations in the network. Such operations include registration of the mobile stations MS in and out of the system, updating of routing areas of the mobile stations MS and routing of data packets to their correct destinations. Within the present application the term 'data' is to be understood in a broad sense to refer to any information transmitted in a digital telecommunication system. Such information can comprise speech, inter-computer data traffic, telefax data and short program code sequencies, etc., encoded into a digital form. The SGSN node can be located at a base station BTS, a base station controller BSC or a mobile switching centre MSC, or separate from all these elements. The interface between an SGSN node and a base station controller BSC is called a Gb interface. An area controlled by one base station controller BSC is called a Base Station Subsystem (BSS). Uplink refers to a direction from a mobile station MS to a network and downlink refers to a reverse direction. In the present application, the term 'a standard proposal' refers jointly to the proposals for ETSI GPRS standards, particularly to 3.64 and to supplementing proposals sent for it, particularly to Tdoc SMG2 GPRS 174/97. One of the principles of the GPRS system is that uplink and downlink capacity deployment should be independent of each other. With reference to Figure 2, an area, significant to the understanding of the invention, of a radio resources arrangement according to the standard proposal will be described. Traffic over an air interface Urn is relayed in blocks produced by a physical layer of the OSI model. Each physical block has a duration of four GSM bursts (456 bits in total), which are sent in succession on one physical channel. The amount of data carried by a physical block depends on the channel coding to be used, for which four different coding methods have been defined, i.e. CS-1 , ..., CS-4. The different coding methods are not, however, significant to the understanding of the invention. With reference to Figure 3, an allocation of radio resources will be described in relation to a mobile terminating connection. Item 6.6.4.5. of the standard proposal is considered to represent the prior art. Message fields, such as a TFI and a USF, will be described later in connection with Figure 4. In Figure 3, time proceeds from top to bottom. The Figure shows on the right- hand side, next to messages, said logical channels on which the messages can be sent. The channel used is not, however, significant to the understanding of the invention. In step 3-0, the network searches for a mobile station on a paging channel, i.e. it sends a Packet Paging Request message on a paging channel PPCH or PCH. In step 3-1 , the mobile station sends a channel allocation request Packet Channel Request on a random access channel PRACH or RACH. In the channel allocation request the mobile station can request the network to allocate to it one or two time slots. In step 3-2 the network can grant an access on a Packet Access Grant channel (Immediate Assignment). In step 3-3 the mobile station sends an LLC frame which is relayed to the SGSN to inform the SGSN that the mobile station has moved to a 'Ready' state. The allocation of radio resources (for instance in step 3-2) involves e.g. that the network allocates to the mobile station the identifiers TFI and USF. The mobile station can use one or two time slots allocated to it for sending data, or it can use the radio resources allocated to it for requesting more resources. Let us assume that the resources allocated to the mobile station by the Immediate Assignment message are not sufficient and in step 3- 4 the network sends a Packet Resource Assignment message. The Packet Resource Assignment message comprises e.g. the TFI identifier allocated to the connection; a list (in a bit chart form) of Packet Data Channels PDCH that the network uses for sending a packet; and a Packet Associated Control Channel PACCH that the mobile station is to use for acknowledging received RLC blocks (the channel being indicated by the USF allocated to the mobile station). In addition, the message can comprise e.g. information related to a timing advance and power control. After the radio resources are allocated, the network sends in step 3- 5 to the mobile station data packets provided with a header that comprises a polling field, i.e. a Supplementary/Polling bit S/P. If the S/P field is in a polling state 'P' (i.e. the S/P bit is 1 ), the mobile station is to acknowledge in step 3-6 the received data packets with a positive or a negative acknowledgement Packet Ack/Nack. The indication 'N times' in Figure 3 means that the steps 3-5 and 3-6 below the dashed line are repeated for as along as the network has packets to send. With reference to Figure 4, the radio blocks and the fields used in them will be now described in greater detail. Each radio block comprises three parts: a MAC header, an RLC block and a Block Check Sequence BCS. The MAC header (octet 1 ) comprises e.g. an Uplink State Flag USF, a type field T and a Power Control field PC. A value 0 of the type field T denotes an RLC data block and a value 1 an RLC/MAC control block. The RLC data block (in which T=0) comprises an RLC Header and an RLC information field. The RLC header (octets 2 to 3) denotes e.g. the position of the block in relation to other blocks in the sequence (BSN = Block Sequence Number). In addition, the RLC header comprises allocation and LLC frame data. An Extension bit field E shows whether an optional extension octet 4 is in use. According to the standard proposal, the intended use of the field S/P in connection with data blocks is that when said bit is in the polling state 'P', the mobile station is to send an acknowledgement (Ack/Nack) of the received blocks. The Temporary Flow Identity field TFI is used in downlink blocks to denote a receiving mobile station. The 7 bits allocated to the TFI field can be used for denoting 127 mobile stations (2 7 = 128), because one of the values is reserved for general transmissions received by all mobile stations. In downlink blocks the USF field is used to provide a mobile station- specific authorization for transmitting a corresponding uplink block. So in a downlink block, the USF field provides an identifier of an uplink counter block. The USF field comprises 3 bits, i.e. it can acquire 8 different values. One USF field value is allocated to the mobile station receiving the packet, to denote the uplink block the mobile station is to use for acknowledging the received radio blocks. At the same time the mobile station can express its wish to use a separate uplink data channel. A problem with an arrangement described above arises from the USF identifier allocated in connection with the allocation of the downlink resource. Since the USF identifier is also allocated to the receiving mobile station, the same USF identifier value cannot be allocated for uplink transmissions. Since the USF identifier can acquire only a limited number of possible values (i.e. eight different values), each mobile station receiving in downlink prevents the network from allocating a particular uplink mobile station to the channel in question. If at a particular moment one and the same channel is used for reception by 8 separate mobile stations, a corresponding uplink channel cannot have any separate transmissions, even if plenty of air interface capacity would be available. A possible solution could be to increase the USF field to comprise more than three bits. The problem would thus become less significant, even if the uplink and downlink were not independent of each other. Another alternative solution could be a separate information field (= a bit) indicating whether the USF identifier is in use or not. At least one problem with these solutions would be that the USF field is strongly protected with channel coding, so it uses (with CS-1 coding) up to four times more bandwidth in relation to the net information content. Such an additional load reduces the capacity available to payload traffic. BRIEF DESCRIPTION OF THE INVENTION The invention is firstly based on a detection of a problem, which is a false reasoning behind the standard proposal. In addition to the detection of the problem, an object of the invention is to provide a mechanism that allows the above-mentioned problem to be solved. The object of the invention is achieved with a method characterized by what is stated in the independent claims. The dependent claims relate to the preferred embodiments of the invention. In the invention, allocation of a control channel PACCH is not dependent of a possible USF identifier. Instead, a mobile station acknowledges data packets received, after a predetermined time, from a downlink block in which said polling field is in a polling state. When the allocation of the control channel PACCH is independent from the USF identifier allocated to the mobile station, the invention implements a principle of the GPRS system according to which uplink and downlink capacity deployment should be independent of each other. According to the invention, when the mobile station sends the acknowledgement, the USF identifier in the corresponding downlink block must be one that has not been allocated to any mobile station, so as to avoid collision in the transmissions sent by mobile stations. BRIEF DESCRIPTION OF THE DRAWINGS In the following the invention will be described in greater detail in connection with preferred embodiments and with reference to the attached drawings, in which Figure 1 is a block diagram illustrating elements of a packet radio system relating to the invention; Figure 2 illustrates protocol layers that the invention relates to; Figure 3 illustrates allocation of radio resources; and Figure 4 illustrates a structure of blocks transmitting on the radio path. DETAILED DESCRIPTION OF THE INVENTION In the invention, a control channel PACCH is thus not allocated, as in the standard proposal, by using a USF identifier. Instead, a mobile station acknowledges, after a predetermined time, a block in which a downlink P bit is set. According to a first (primary) embodiment of the invention, the predetermined time is simply a fixed period of time. In Figure 3 the time is shown with a reference sign T, which denotes the time from the block in which P=1 to the block in step 3-6, in which the mobile station sends the acknowledgement. This can be easily implemented in such a way that after the active P bit, the mobile station waits for a fixed number of blocks before it sends the acknowledgement. This implementation of the invention does not even require changes to the identifier part of the standard proposal. The most essential change is primarily that a polling field S/P receives an additional meaning, i.e. a set P bit is used (in addition to the meaning given in the standard proposal) to implicitly denote an allocation of an uplink block which, after a predetermined time T, follows the downlink data block in which the P bit is 1. The predetermined time T is most advantageously set as short as possible so as to enable the network to receive, as quickly as possible, information about the success or failure of the data transmission. The time T should, however, be long enough to allow a mobile station provided with a single set of radio parts to change, even with a maximum timing advance, from reception to transmission. According to a second embodiment of the invention, the P bit denoting polling is interpreted in such a way that an Extension Field 2 (EF2) of the invention shown in Figure 4 denotes the block in which the mobile station is to send the acknowledgement. The easiest way to implement this is to have the additional extension field EF2 in the identifier part of a downlink RLC block to denote a proportional time shift, i.e. the number of blocks from the block in which the P bit is set to the block in which the mobile station is to acknowledge the received data blocks. One modification of this embodiment is to use any existing field in a new manner in the same way as an S/P field can be used for the purpose of the invention in addition to the use according to the standard proposal, as was described above. The arrows shown with curved dash lines in Figure 4 illustrate how the fields E and S/P denote the occurrence of additional extension fields. The set E bit denotes the occurrence of an Extension Field EF1 of the standard proposal. The correspondingly set P bit (the S/P field in the state 'P') denotes the occurrence of the extension field EF2 of the invention. The additional extension field EF2 is shown as a separate octet, but it does not necessarily need to be an entire octet. If the network, for instance due to an obstacle in the terrain, cannot receive the acknowledgement sent by the mobile station, it can provide a new resource by means of a new downlink radio block allocated to said mobile station. The block does not carry any new user data, but only the allocation of the resource for a new acknowledgement transmission (the S/P bit in the state 'P'). The mobile station should continue listening during a few blocks after the last acknowledgement is sent. According to the standard proposal, each mobile station to which a radio resource has been allocated should regularly transmit a random access burst, i.e. a PRACH burst, to the network (PRACH = Packet Random Access Channel). The random access burst is transmitted using an idle burst bound to a USF field. In Figure 3 this function is illustrated in step 3-7. The mechanism is described on page 30 of the standard proposal. Each superframe comprises four multiframes which include altogether 16 idle bursts. According to the standard proposal, all even idle bursts are allocated to the mobile stations on the channel in question using the USF field. Since in this case, according to the invention, the channel is not allocated on the basis of the USF field, it is not immediately evident how the mobile station knows when to send the necessary PRACH burst or whether it can be send at all. There are at least two alternative solutions to this subproblem, which both are based on the same idea, i.e. instead of the USF identifier a random access burst identifier of a similar size, referred to as an RSF (Random access burst Status Flag) in this application, is allocated to the mobile station in connection with downlink allocation of resources (steps 3-2 and /or 3-4). The size of the RSF identifier is advantageously same as that of the USF, i.e. it may be given a value from 0 to 7. According to an alternative embodiment an even idle burst corresponds to each RSF like an odd idle burst corresponds to the USF. According to another embodiment, superframing is increased from four to eight multiframes. In that case, the number of idle bursts is 32, 8 of which are allocated to the USF and 8 to the RSF. (The remaining 16 bursts are left free or reserved for other purposes.) As regards mobile stations, this means that the transmission interval of PRACH bursts would increase from one second to two seconds. This will cause no practical problems because one change of timing advance corresponds to a change of 500 meters in distance. For example, high-speed trains travel only approximately 80 meters per second. It is apparent to a person skilled in the art that as technology advances, the basic idea of the invention can be implemented in various different ways. The invention and its embodiments are therefore not restricted to the above-described examples, but they can vary within the scope of the claims.

Claims: CLAIMS 1. A method for allocating a control channel (PACCH) to mobile stations (MS) in a packet radio system, particularly in a GPRS system, for a downlink transmission, in which a mobile station (MS) sends a resources allocation request (3-1), to which a network (BSS) responds (3-2) by allocating to the mobile station (MS) a control channel (PACCH) and possibly an identifier (TFI) of the mobile station and an identifier (USF) of an uplink counter block; and the network (BSS) sends (3-5) data packets in blocks, at least some of which comprise a polling field (S/P) which, when in a polling state ('P'), indicates that the mobile station (MS) is to acknowledge received data packets on the control channel (PACCH) allocated to it, characterized in that to a downlink block the polling field (S/P) of which is in the polling state ('P'), the network (BSS) does not assign an identifier (USF) of an uplink counter block allocated to a mobile station; the control channel allocated to the mobile station (MS) is independent of a possible uplink counter block identifier (USF); the mobile station acknowledges (3-6) the data packets received, after a predetermined time (T), from the downlink block in which said polling field is in the polling state ('P'). 2. A method according to claim ^ characterized in that the predetermined time (T) is fixed. 3. A method according to claim 1, characterized in that the predetermined time (T) corresponds to a fixed number of blocks. 4. A method according to claim 1, characterized in that the predetermined time (T) is defined in such a way that the downlink data blocks, in which said polling field is in the polling state ('P'), comprise an additional extension field (EF2) denoting the uplink block in which the mobile station is to acknowledge the received data packets. 5. A method according to claim 4, characterized in that said additional extension field (EF2) denotes the number of the blocks from the downlink data block, in which said polling field is in the polling state ('P'), to the uplink block in which the mobile station is to acknowledge the received data packets. 6. A method according to any one of the preceding claims, characterized in that for informing of timing advance a random access burst (PRACH) identifier (RSF) is allocated to the mobile station in connection with downlink allocation of resources. 7. A method according to claim 6, characterized in that the blocks are transmitted as sequences which are repeated so that an idle burst recurs at intervals of a few blocks, and at least some of the idle bursts, advantageously every other idle burst, is allocated to the random access burst identifiers (RSF).

Inventors: MUSTAJAERVI JARI, MUSTAJAERVI, JARI
Applicants: MUSTAJAERVI JARI, NOKIA TELECOMMUNICATIONS OY, MUSTAJAERVI, JARI
Application year: 1998
Main classification: H04B
IPC codes: H04L12, H04W8, H04W28, H04W72, H04W74, H04W84