|Numéro de publication||USRE42452 E1|
|Type de publication||Octroi|
|Numéro de demande||US 11/222,486|
|Date de publication||14 juin 2011|
|Date de dépôt||8 sept. 2005|
|Date de priorité||5 oct. 1998|
|Autre référence de publication||CA2283906A1, CA2283906C, DE69842034D1, EP0993214A1, EP0993214B1, EP0993214B2, EP2088830A1, EP2088830B1, EP2306662A1, EP2306662B1, EP2919548A1, US6621803, US20030095528, USRE43669, USRE44809|
|Numéro de publication||11222486, 222486, US RE42452 E1, US RE42452E1, US-E1-RE42452, USRE42452 E1, USRE42452E1|
|Inventeurs||John Halton, Paul James|
|Cessionnaire d'origine||Sony Deutschland Gmbh|
|Exporter la citation||BiBTeX, EndNote, RefMan|
|Citations de brevets (17), Référencé par (5), Classifications (16), Événements juridiques (1)|
|Liens externes: USPTO, Cession USPTO, Espacenet|
The present invention relates to a method and to devices for transmitting and receiving data in a code division multiple access telecommunication system.
A telecommunication system is a system, in which data are communicated between one or more base stations or one or more mobile stations. Thereby, the communication area is divided in cells, in which one base station communicates with one or more mobile stations. Multiple access stations are used to support the simultaneous access of a plurality of mobile stations to one base station within delimited resources of the transmission system. Several multiple access systems are known, for example frequency division multiple access (FDMA), time division multiple access (TDMA), or code division multiple access (CDMA). Additional to these basic types of multiple access systems, combinations of these different systems are possible and in practical use. The GSM-system for example uses a combination of FDMA and TDMA.
The present invention particularly relates to the transmission and reception of random access data in a code division multiple access system. Random access data are transmitted in the so-called random access channel (RACH) from a mobile station to build up a connection with a base station. The random access data from the mobile station can contain a request, if the base station has sufficient resources available to build up the required connection.
The random access channel comprises or consists of succeedingly or periodically provided random access time windows, in which several random access slots are available. An example for such a known random access time window is shown in
A collision, i.e. a situation, where the messages collide and are lost, only occurs, when both, the preamble code and the time offset are chosen in the same random access time window. In practice it is expected that only about 30% of the theoretical maximum of 128 accesses per 10 ms will be possible.
In a situation, where a number of packet data users are operating in a burst traffic situation, this maximum could be quickly reached. In such a situation the access to the network will either become slower or not be possible at all. This is due to congestion caused by the build-up of first time requests and the retransmissions made necessary by previous collisions. Since the access to the random access slots is contention based, a guaranteed upper limit on the amount of time needed to access the system even after an initial bust is not ensured. For packet data applications, which demand a constant periodic delivery of data, ready access is critical.
The object of the present invention is thus to provide a method and devices for transmitting and receiving data in a code division multiple access telecommunication system, in which a random access time window comprising a plurality of random access slots for transmitting random access data is provided and which enable a reduced congestion on the random access slots and a more efficient use of the random access time window.
This object is achieved by a method for transmitting and receiving data in a code division multiple access telecommunication system, comprising the steps of providing a random access time window comprising a plurality of random access slots for transmitting random access data from at least one first communication device to a second communication device, dividing a plurality of random access slots of the random access time window into at least two groups, and allocating the groups to respective priority classes, whereby the priority classes represent the transmission priorities of the random access data to be transmitted in the random access slots.
The first communication device can thereby be a mobile station and the second communication device can thereby be a base station of the telecommunication system.
The above object is further achieved by a device for transmitting and receiving data in a code division multiple access telecommunication system, in which a random access time window comprising a plurality of random access slots for transmitting random access data is provided, the plurality of random access slots of the random access time window being divided into at least two groups and the groups being allocated to respective priority classes, whereby the priority classes represent the transmission priorities of the random access data to be transmitted in the random access slots, with means for randomly choosing one or more random access slots from a group having a certain priority class corresponding to the transmission priority of the random access data to be transmitted, and means for transmitting the random access data in said chosen random access slot(s). This device for transmitting and receiving data according to the present invention can for example be a mobile station.
The above object is further achieved by a device for transmitting and receiving data in a code division multiple access communication system, in which a random access time window comprising a plurality of random access slots for transmitting random access data is provided, with means for dividing the plurality of random access slots of the random access time window into at least two groups, whereby the groups are allocated to respective priority classes, the priority classes representing the transmission priorities of the random access data to be transmitted in the random access slots, and means for transmitting information defining the groups of the random access time window. This device for transmitting and receiving data according to the present invention can for example be a base station.
According to the method and the devices of the present invention, the allocated random access channel resources are divided between different types of access on a priority basis. Thus higher priority access types receive more physical resources. This ensures, that some access types will have a better possibility of gaining access to the network due to the higher probability that a particular message will be successful in reaching the base station. The priority types and ratings can be tailored by the network and broadcast to a mobile station upon the broadcast control channel.
The method and the devices according to the present invention particularly lessens the effect of possible congestion on the random access channel caused by increased load, for instance packet data capacity requests, and the transfer of small amounts of user data within random access bursts.
Advantageously, the transmission priorities of the random access data to be transmitted are determined on the basis of the content and the type of the random access data. Further, in said device for transmitting and receiving data, which can be a base station, said means for dividing the random access slots into groups sets the number of random access slots in each group variably depending on system requirements. The size of each group is thus controlled by the network and can be dynamically changed depending on current traffic patterns, network requirements and so forth. A corresponding signal indicating the new groups will then be transmitted over a broadcast channel from the base station to the mobile stations.
Said device for transmitting and receiving data according to the present invention, which can be a mobile station, can further comprise means for extracting information defining the groups of the random access time window from a received broadcast signal. Each time the defined groups are changed by the network, a corresponding signal is broadcast from the respective base station. This signal is received by the mobile stations, in which above-mentioned means for extracting the information defining the groups extracts said information and uses the information for the following transmissions of random access bursts. The access probability can depend on the number of random access slots in the respective groups. Thus, groups with higher priority classes can comprise a larger number of random access slots than groups with lower priority classes.
Further advantageously, each random access slot in said random access time window is defined by a time offset value and a preamble code.
The advantages of the method and the devices of the present invention are a high flexibility in allowing prioritization of access related to the access type and subsequent prevention of congestion for certain access types which may be considered to have a higher access priority at the expense of those access types that may be considered to have a low access priority. A further advantage of the present invention is the ability to dynamically chose the quality of service level on a regular basis depending upon traffic conditions via a broadcast channel for different access types. The present invention further avoids deadlock situations, where random access channel re-transmissions combine with normal traffic to cause a system overload and then a collapse for certain types of traffic at the expense of others.
A preferred embodiment of the present invention is now explained in detail relating to the enclosed drawings, in which
The random access time window shown as an example in
The third group of random access slots 23 is the largest group and is defined by the second eight preamble codes and all possible 8 time offset values. The random access slots 23 of the third group are allocated for voice call access attempts. These are attempts of a mobile station, which already has build up a connection with a base station and wishes to initiate a real time speech connection. Since the third group has the highest priority class, the third group has the largest number of random access slots 23 available so that a high probability of access is given for voice call access attempts.
The mobile station 24 shown in
The base station 25 shown in
According to the present invention, the available random access slots in the random access time windows 20 are divided into groups, for example, a first group of random access slots 21 allocated to initial access attempts, a second group of random access lots 22 allocated for packet data access attempts and a third group of random access lots 23 allocated for voice call access attempts. These groups are mapped to different priority classes and the size, i.e. the number of random access slots, of each group may depend upon current traffic levels and the required quality of service for that priority class. It is thereby possible, that the contents of one group may overlap with another. When a random access message is to be sent upon the random access channel, then this message will fall into one of the priority classes, which will correspond to one group of random access slots. Which priority class the message falls into depends upon the message type and content. From this corresponding group a random choice will be made from the mobile station 24 regarding the random access slot or slots to be used. This ensures that a message from a certain priority class has a probability of successful access to the network equal to that of other messages of the same class sent by other mobile stations in the cell, but not necessarily as other random access messages of different priority classes. The size, i.e. the number of random access slots of the group dictates the probability of the access. The size of each group is controlled by the base station 25 and can be dynamically changed by the means 34 for dividing the random access time windows into groups and by broadcasting a corresponding information to the connected mobile stations. The means 34 thereby divides a random access time window 20 into groups depending upon current traffic patterns, network requirements or any other predesigned control parameter.
The information signal containing information on the groups in the random access time windows 20 which is broadcast by the transmission means 33 of the mobile station 25, can be a simple pair of digits. If for example the random access time window 20 of
An additional feature for reducing congestion on the random access slots and a more efficient use of the random access time window is to partition the groups of the random access time window respectively into at least a first section and a second section. The first section contains only contention based random access slots, whereas the second section only contains reservation based random access slots. The random access slots of the first sections of the groups are used for the usual contention based random access attempts, whereas the random access slots in the second sections can be reserved in succeeding random access time windows for the transfer of larger amounts of data, for example packet data. The partitioning of each group in the random time access windows can thereby also be dynamically controlled by the network depending on network requirements. A corresponding signal is broadcast to the mobile stations to change the partitioning of the groups.
|Brevet cité||Date de dépôt||Date de publication||Déposant||Titre|
|US5295152 *||10 avr. 1992||15 mars 1994||Telefonaktiebolaget L M Ericsson||TDMA for mobile access in a CDMA system|
|US5689503 *||14 juil. 1995||18 nov. 1997||Ntt Mobile Communications Network Inc.||Random access system of a mobile communication system|
|US5729542||21 nov. 1995||17 mars 1998||Motorola, Inc.||Method and apparatus for communication system access|
|US5742592||1 sept. 1995||21 avr. 1998||Motorola, Inc.||Method for communicating data in a wireless communication system|
|US6031827||19 févr. 1997||29 févr. 2000||Nokia Mobile Phones Limited||Method for radio resource control|
|US6111863 *||29 déc. 1995||29 août 2000||Lsi Logic Corporation||Method and apparatus for the dynamic allocation of signal bandwidth between audio, video and data signals|
|US6122270 *||25 janv. 1996||19 sept. 2000||Motorola, Inc.||Communications system and a method therefor|
|US6137787||3 avr. 1997||24 oct. 2000||Chawla; Kapil K.||Method and apparatus for resource assignment in a wireless communication system|
|US6574212 *||1 oct. 1999||3 juin 2003||Sony International (Europe) Gmbh||Transmission of random access bursts with at least one message part|
|US6606313 *||5 oct. 1998||12 août 2003||Telefonaktiebolaget Lm Ericsson (Publ)||Random access in a mobile telecommunications system|
|US6697346 *||4 oct. 1999||24 févr. 2004||Sony International (Europe) Gmbh||Automatic determination point for random access channel partitioning scheme|
|US6954464 *||3 avr. 2001||11 oct. 2005||Sony International (Europe) Gmbh||Prioritisation method for users randomly accessing a common communication channel|
|US7324465 *||17 oct. 2001||29 janv. 2008||Electronics And Telecommunications Research Institute||Random access channel access apparatus for mobile satellite communication system and method therefor|
|US20010026539||3 avr. 2001||4 oct. 2001||Stefan Kornprobst||Event triggered change of access service class in a random access channel|
|US20010036113||3 avr. 2001||1 nov. 2001||Jens-Uwe Jurgensen||Prioritisation method for users randomly accessing a common communication channel|
|EP0639899A1||3 mars 1994||22 févr. 1995||Ntt Mobile Communications Network Inc.||Random access communication method by use of cdma, and system for mobile stations which use the method|
|WO1997019525A1||19 nov. 1996||29 mai 1997||Motorola Inc.||Method and apparatus for communication system access|
|Brevet citant||Date de dépôt||Date de publication||Déposant||Titre|
|US8798656 *||16 avr. 2012||5 août 2014||Qualcomm Incorporated||Methods and apparatus by which periodically broadcasting nodes can resolve contention for access to a smaller pool of broadcasting resources|
|US9344212 *||6 oct. 2008||17 mai 2016||Nec Corporation||Communication system, response notifying method and apparatus|
|US20100260340 *||6 oct. 2008||14 oct. 2010||Nec Corporation||Communication system, response notifying method and apparatus|
|US20130273951 *||16 avr. 2012||17 oct. 2013||Qualcomm Incorporated||Methods and apparatus by which periodically broadcasting nodes can resolve contention for access to a smaller pool of broadcasting resources|
|US20170156127 *||12 juin 2015||1 juin 2017||Motorola Solutions, Inc.||Method and server for broadcasting a data file to a plurality of radio talk groups|
|Classification aux États-Unis||370/329, 370/320, 370/335, 370/342|
|Classification internationale||H04W4/00, H04B7/216, H04J13/00, H04W74/08, H04J3/16, H04B7/26, H04B7/24|
|Classification coopérative||H04W74/006, H04W74/0833, H04W74/0875|
|Classification européenne||H04W74/08F2, H04W74/08D|
|2 août 2011||RF||Reissue application filed|
Effective date: 20110523