WO2002017668A1 - Schema d'access aleatoire rapide - Google Patents

Schema d'access aleatoire rapide Download PDF

Info

Publication number
WO2002017668A1
WO2002017668A1 PCT/EP2000/008347 EP0008347W WO0217668A1 WO 2002017668 A1 WO2002017668 A1 WO 2002017668A1 EP 0008347 W EP0008347 W EP 0008347W WO 0217668 A1 WO0217668 A1 WO 0217668A1
Authority
WO
WIPO (PCT)
Prior art keywords
fast
network
fpccch
control device
access
Prior art date
Application number
PCT/EP2000/008347
Other languages
English (en)
Inventor
Janne Parantainen
Guillaume SÉBIRE
Original Assignee
Nokia Corporation
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 Nokia Corporation filed Critical Nokia Corporation
Priority to AU2000267038A priority Critical patent/AU2000267038A1/en
Priority to PCT/EP2000/008347 priority patent/WO2002017668A1/fr
Priority to EP00954661A priority patent/EP1226731A1/fr
Publication of WO2002017668A1 publication Critical patent/WO2002017668A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information
    • H04W74/006—Transmission of channel access control information in the downlink, i.e. towards the terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access

Definitions

  • the present invention relates to a method and a network control device for optionally providing fast resources in a network.
  • the invention relates to the GSM Edge Radio Access Network (GERAN) in which two approaches for allowing a so-called Temporary Block Flow (TBF) are considered.
  • GERAN GSM Edge Radio Access Network
  • TBF Temporary Block Flow
  • the Temporary Block Flow is a physical connection used between two peer entities to support an unidirectional transfer of LLC PDUs (Logistic Line Control Packet Data Units) on packet data physical channels.
  • the TBF is an allocated radio resource on one or more PDCHs (Packet Data Channels) and comprises a number of RLC/MAC (Radio Link Control / Medium Access Control) blocks carrying one or more LLC PDUs. It is noted that the above definition is valid for Release ⁇ 97- ⁇ 99, in Release '00 changes will occur, in particular, PDCP (Packet Data Convergence Protocol) replaces LLC and SNDCP (Subnetwork Dependent Convergence Protocol) .
  • a TBF is temporary and is maintained until there are no more RLC/MAC blocks to be transmitted and, in RLC acknowledged mode, all of the transmitted RLC/MAC blocks have been successfully acknowledged by the receiving entity.
  • a TBF may operate in either GPRS (General Packet Radio Network) or EGPRS (Enhanced GPRS) TBF mode.
  • GPRS General Packet Radio Network
  • EGPRS Enhanced GPRS
  • MSs Mobile Stations
  • Each TBF is assigned a Temporary Flow Identity (TFI) by the network.
  • TFI Temporary Flow Identity
  • an RLC/MAC block associated with a certain TBF comprises a TFI.
  • the TBF is identified by the TFI together with, in case of a RLC data block, the direction (uplink or downlink) in which the RLC data block is sent; and in case of a RLC/MAC control message, the direction in which the RLC/MAC control message is sent and the message type.
  • EGPRS TBFs Temporal Block Flows
  • RACH Random Access Channel
  • PRACH Packet Random Access Channel
  • the access can be a one phase or a two phase access. It is noted that in GPRS one phase access is not possible on RACH, but only on PRACH.
  • RACH Random Access Channel
  • PRACH Packet Random Access Channel
  • PRACH is on PCCCH (Packet Common Control Channel)
  • RACH is on CCCH (Common Control Channel) . If PCCCH is not available, CCCH is used for (E)GPRS. (Usually, CCCH is used for circuit-switched connections) .
  • the TBF is released immediately after last block
  • TBF setup may be relatively long depending on the load on a CCCH or PCCCH. Especially two phase access may take a long time, because the access procedure as such requires two two-way message exchanges.
  • TBF is kept alive (TFI reserved) also during idle periods.
  • the physical resource can be either kept reserved or reallocated to another user during the idle period. If the resource is kept reserved, and idle periods are frequent and long, this leads to significant waste of capacity. Therefore it is better to reallocate the capacity for other mobile stations than keep it unnecessarily reserved.
  • the physical resource is reallocated it is crucial that some resources can be given back when the active period begins.
  • TBF is terminated when the idle period begins and it is fast re-established when the active period begins.
  • the fast TBF setup shall have the same properties as the initial TBF setup that was used for conveying the targeted data. That is, e.g., close-ended or open-ended.
  • the problem is how the network can know when the original MS becomes active.
  • a first option is regular polling in which the network checks at regular intervals whether the original MS becomes active again.
  • a second option is the so-called random access based notification. Polling is sufficient if the application can tolerate relatively long access delay and if the idle periods are not very long. If the polling period is short and idle periods long, network polls the MS unnecessarily most of the time. That is, the network assigns sending permission but the MS does not have anything to send. This leads to waste of capacity.
  • the random access based solution is preferable.
  • the MS when the MS is idle, no physical resources are allocated for it until a notification is received on a random access channel (RACH or PRACH) . After receiving a notification, the network immediately assigns capacity for the MS so that transmission can start.
  • RACH random access channel
  • the current MAC (Medium Access Control) procedures need to be changed in order to meet the delay requirement of some traffic types having real-time nature (e.g. chat, telnet, ... ) .
  • the object underlying the invention resides in removing the above drawbacks of the prior art.
  • This object is solved by a method for optionally providing fast resources in a network, comprising the step of transmitting network system information including information as to whether a fast access is supported in the network or not.
  • a network control device for controlling an optional provision of fast resources in a network, comprising a transmitting means for transmitting network system information including information as to whether a fast access is supported in the network or not.
  • fast access is made optional. That is, by transmitting the information message e.g. by broadcast, every mobile station (MS) knows immediately whether fast access is supported, and, when it is supported, how it can use it.
  • MS mobile station
  • the operator of a network can allow fast access only if he has enough spectrum and large enough portion of traffic to benefit from fast access. For example, when COMPACT deployments are used, only a limited spectrum may be available and, therefore, all unnecessary signaling should be avoided. If the operator does not support fast access, polling or continuous allocation based solutions can be used (even if they are suboptimal) .
  • the above network system information may be transmitted in one network system information message or in a set of plural network system information messages.
  • network system information including information regarding the location of Fast Packet Common Control Channel (FPCCCH) blocks in a multiframe structure may be transmitted. This information may come in a different system information message than the info whether fast access is supported.
  • FPCCCH Fast Packet Common Control Channel
  • a new Fast Packet Common Control Channel Group may be defined on which the Fast Packet Common Control Channel (FPCCCH) is mapped.
  • the FPCCCH_GROUP and the FPCCCH can be similar to the PCCCH_GROUP and PCCCH defined in GSM/ (E) GPRS, but may be independent thereof.
  • the Fast Packet Common Control Channel may be mapped on a Packet Common Control Channel Group (PCCCH_GROUP) .
  • the network system information message may be sent as broadcast message. Thus, all mobile stations concerned can immediately know whether fast access is supported or not, even when the descision as to the fast access is changed during operation.
  • a mobile station In case fast access is available in the network, it may be additionally decided whether a mobile station is allowed to use fast access or not based on a predetermined criterion.
  • mobile stations can be individually allowed to use fast access or not. This is advantageous for example in case fast access channels are congested. Then, some mobile stations can be blocked from using fast access.
  • the predetermined criterion may be the current traffic load in the network. That is, in case the current traffic load is too high, no fast resources will be allocated such that the traffic is not excessively limited.
  • the criterion maybe the traffic class of a call. For example, in case the mobile station performs a call which demands real-time communication, this mobile station is allowed to use fast access.
  • the predetermined criterion can be the operation performed in a call. For example, if an interactive operation is performed, fast access may be allowed.
  • the predetermined criterion may be the state of a network element .
  • the network control device may be a Base Transceiver Station.
  • new channels for performing the fast access are introduced. Furthermore, corresponding allocation procedures for allocating the new channels are introduced.
  • Fig. 1 an example for a PRACH allocation on a 52 multiframe according to the invention
  • Fig. 2 an example for a FPRACH allocation relatively to PRACH in a 52 multiframe according to the invention.
  • the invention as described in the following embodiment describes a scheme of optional fast access channels and procedures that can be used only when they are beneficial.
  • Network system information messages contain information whether a fast random access channel is available or not and where it is located in a multiframe structure.
  • the invention describes the needed signalling that is used to convey the information.
  • the invention covers procedures for different traffic types in case fast access is or is not available.
  • FPRACH refers to Fast Packet Random Access Channel
  • FAGCH Fast Access Grant Channel
  • the FPRACH is used by the MS to send a connection request to a BTS (Base Transceiver Station) .
  • the FAGCH is used to allocated resources that were requested on the FPRACH.
  • Fast access may work only if a) FPRACH and FAGCH are close enough in time to be fast and subsequent allocations of FPRACH are close enough in time, so that an MS does not need to wait too long before being able to send on a FPRACH (in order to grant a request for a fast messaging as soon as possible) , and b) the signaling on FPRACH and FAGCH is limited (in order that the signals can be processed quickly) .
  • one UL (Uplink) message for fast request and one DL (Downlink) message for fast assignment should be allowed. It may be used in either of the approaches described above: fast reallocation or fast TBF setup.
  • the new fast random access and access grant channels should be accessible to mobile stations (MS) only which actually can utilize this service, i.e., which are able to request and get resources fast.
  • these new channels should be accessible to mobile stations according to the Release 2000 and onwards (further referred to as R'Ox) standard only.
  • fast messaging should be introduced if sufficient capacity is available in the network only.
  • the solution may be either fast TBF setup based or fast resource request based. The approach as described above works for both.
  • the first alternative for providing new channels for fast messaging is that new logical channels are introduced on the current PCCCH_GROUPs . That is, some blocks are reserved to those logical channels with parameters broadcast on PBCCCH that are visible to R'Ox MS and defined in a similar way as current parameters (e.g. BS_PRACH_BLKS) .
  • FAGCH is mapped on PCCCH/D
  • FPRACH is mapped on PCCCH/U.
  • current PCCCH/U contains only PRACH
  • the second alternative for providing new channels for fast messaging is to define new FPCCCH_GROUPS .
  • These new FPCCCH_GROUPS are defined in a similar way as for PCCCH__GROUPS (based on IMSI (International Mobile Subscriber Identity)) on which new channels (FPCCCH/U and FPCCCH/D) for "fast" messaging only are mapped.
  • IMSI International Mobile Subscriber Identity
  • FPCCCH/U and FPCCCH/D new channels for "fast" messaging only are mapped.
  • FAGCH would be mapped on FPCCCH/D and FPRACH on FPCCCH/U.
  • FPCCCH/D is allocated blocks occurring shortly after FPCCCH/U. Note that FPCCCH/D may be skipped (i.e. not allocated) in case PCCCH/D occurs shortly after FPCCCH/U. Therefore, FPCCCH/D may be allocated only if FPCCCH/U is allocated.
  • the second alternative is more flexible, as it is not tied to the PCCCH allocation in the network (cell) and therefore allows for providing, if sufficient capacity is available, fast messaging to existent networks in a smooth way. That is, PCCCH need not be re-dimensioned.
  • FPCCCH In case FPCCCH is available in general, on multiframes where there is no FPCCCH, fast messaging is forbidden since it is not possible. Also, FPCCCH should be introduced only if sufficient capacity is available in the network, as mentioned above.
  • An MS may send fast resource request on FPRACH (assuming the data connection is already alive) on PCCCH/U (resp. FPCCCH/U) of its corresponding PCCCH_GROUP (resp. FPCCCH_GROUP) only. If no FPCCCH/D is available, the fast assignment could be made on the PCCCH/D of its corresponding PCCCH_GROUP provided it is sufficiently close (depending on the most stringent QoS requirements of the targeted data connections) in time to the (F) PCCCH/U where the fast request was sent. If FPCCCH/D is available, fast assignment may not be sent elsewhere than on this channel.
  • an assignment message carried as fast assignment can be in the same form as the current (E)GPRS assignment message.
  • FPRACH should use the access burst for the same reason as the PRACH (no up-to-date timing advance) . Because FPRACH occurs on different blocks than PRACH, all bits in the access burst (extended access burst) are available. It is noted that here the access burst denote at the same time an acces burst (8 bits of information) and an extended access burst (11 bits of information) .
  • Availability and the location of FPCCCH/U and FPCCCH/D in multiframe is informed in system information messages.
  • the determination of the FPCCCH_GROUP can be similar (based on IMSI) to that of PCCCH_GROUP (see GSM 05.02).
  • the number of FPCCCH_GROUPs may be different from the number of PCCCH_GROUPs : it may for example be bigger. (Currently, the PCCCH_GROUPs are limited to 16, so that it is likely that more FPCCCH_GROUPs will be defined) .
  • GSM 04.60 a so called Packet System Information Type 2 (PSI2) is defined.
  • PSI2 Packet System Information Type 2
  • This message is sent by the network on PBCCH and PACCH giving information of reference frequency lists, cell allocation, GPRS mobile allocations and PCCH descriptions being used in the cell.
  • the indication of FPCCCH availability can be indicated in one message of the consistent set of PSI2 messages, in a similar way as for PCCCH.
  • FPCCCH description structure can be defined in the same way as for the PCCCH description (see GSM 04.60).
  • FPCCCH/D bit is required to indicate the availability of downlink FPCCCH.
  • FPCCCH/D may be not allocated in case PCCCH/D is close enough in time to FPCCCH/U.
  • ⁇ TIMESLOT_ALLOCATION bit (8) > ;
  • ⁇ Hopping FPCCCH Carriers Lists struct > :: ⁇ 1 ⁇ Hopping FPCCCH Carriers struct > ⁇ ** 0 ;
  • ⁇ TIMESLOT_A LOCATION bit (8) > ;
  • the information element fields mentioned above are similar to those defined in GSM 04.60.
  • the field TSC (3 bit field) is the binary representation of the training sequence code, see GSM 05.02. Range: 0 to 7.
  • the field MA_NUMBER (4 bit field) is the binary identification of a GPRS Mobile Allocation provided in this message or the binary reference to such. Range: 0 to 15.
  • the field ARFCN (10 bit field) is the binary representation of the absolute radio frequency channel number (ARFCN) defined in GSM 05.05. Range 0 to 1023.
  • the field MAIO (6 bit field) is the binary representation of the mobile allocation index offset (MAIO), see GSM 05.02. Range: 0 to 63.
  • a new field is the TIMESLOT_ALLOCATION (8 bit field) indicating which timeslots are allocated as FPCCCH.
  • the PSI2 should in addition contain, in case of the second alternative (i.e., introducing of new FPCCCH_GROUPS) , the FPCCCH organization parameters to control the organization of FPCCCHs present in the cell (fixed allocation) , as an optional Information Element (IE) . If this IE is absent, no fast messaging is allowed in the cell. That is, introducing or not-introducing of the fast messaging is controlled by the fact whether the PSI2 contains such an Information Element or not.
  • the above- described information element could be included in another suitable network system information message (apart from PSI2) .
  • the parameter BS_FPCC_REL is similar to the BS_PCC_REL (as described, e.g., in GSM 04.60). This parameter describes release of the FPCCCH.
  • the parameter BS_FPRACH_BLKS indicates the number of blocks reserved in a fixed way to the FPRACH channel on any PDCH carrying FPCCCH. This parameter has similar range as BS_PRACH_BLKS (see GSM 05.02) .
  • Fig. 1 shows a multiframe, and in particular an example of a PRACH Allocation on a 52 multiframe.
  • the symbols B0 to Bll denote radio blocks, respectively, wherein the numerals within each block indicate the order of allocation of the blocks to PRACH.
  • Fig. 2 an example of FPRACH allocation relatively to PRACH (on the same PDCH) according to the invention is illustrated.
  • the FPRACH allocation should be made relatively to the blocks allocated to PRACH. This implies that a maximum number of 12 PRACH blocks may be allocated on any PDCH for FPRACH in a fixed manner. In the example of Fig. 2, blocks BO, B6 and B3 are allocated for FPRACH.
  • a per-PDCH allocation could be done instead, however, this would require more signaling.
  • Dynamic allocation in downlink and uplink may be realized using the same principles as used currently for PCCCH:
  • dynamic uplink allocation may be realized using the same principle as for PRACH, i.e., through an Uplink State Flag (USF) defined in GSM 04.60.
  • UPF Uplink State Flag
  • Such an Uplink State Flag (USF) is included in the header of each
  • RLC/MAC block on a downlink PDCH may be used by the network to control the multiplexing of different mobile stations on uplink PDCH.
  • USF is further specified in GSM 05.02.
  • this USF value could be allocated to some MS for data transfer.
  • the use of USF allows for dynamic allocation of the FPRACH.
  • the FPCCCH may occur on the PDCH of the corresponding FPCCCH_GROUP.
  • FPCCCH/D blocks would be allocated in a dynamic manner, similarly to PCCCH/D: see GSM 05.02.
  • the message_type field of the control messages sent on PCCCH/D identifies the associated logical channel. The same principle may be applied on FPCCCH/D.
  • a rule to dimension the above new channels is based on the population of Release ⁇ 0x MS to be supported, for example.
  • the capacity available for the new channels should be bigger or equal to the estimated number of MS to be supported.
  • the second embodiment is similar to the fist embodiment, however, here, additionally, an MS can be informed independently whether it is allowed to use fast access or not.
  • the network may allow or not allow a specific MS to use fast access, even though fast access would be available in the network.
  • This information can be carried as assignment of resources within the Packet Uplink Assignment message sent on PACCH (Packet Associated Control Channel) to the MS, by adding on bit as follows:
  • the MS is allowed to use fast access 0: The MS is not allowed to use fast access This is in particular useful in case fast access channels get congested.
  • congestion of fast access channels can be a criterion. That is, in case of a high traffic load on the fast access channels, certain (selected) MSs can be prohibited from using fast access.
  • fast access is meant to be used mainly for applications of a traffic class having real-time (or tight) delay requirements.
  • traffic classes in shared mode of operation may use fast access. Therefore, in other dedicated modes which do not require fast access, are not allowed to use fast access.
  • fast access may not be supported in case of certain operations performed during a call of the MS.
  • RT interactive traffic is sent through the so-called shared mode MAC. If there is no dedicated mode which requires fast access or in which no fast access is possible, no fast access is performed.
  • the state of a requesting MS is considered.
  • the MS can be in packet idle mode or packet transfer mode.
  • One or two phase accesses can be made in packet idle mode to setup a TBF to enter packet transfer mode.
  • some relevant information needed in TBF setup radio priority, MS multislot class, etc
  • the MS could be assigned an identifier (for example, an Access Request Identifier (ARI)) so that access burst on PRACH with ARI included can be used to setup TBF and that way speed up access.
  • an identifier for example, an Access Request Identifier (ARI)
  • fast access Another way to realize fast access would be to introduce a new state (e.g. packet silent mode) which would be a sub state of packet transfer mode, where the MS wouldn't have anything to send but would have TBF on (TFI allocated, all MS related necessary information stored) . From this state fast access (or actually fast resource request) can be made by sending a fast resource request in order to get physical resources (move to packet transfer mode) .
  • a new state e.g. packet silent mode
  • TBF on TBF on

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé et un dispositif de gestion de réseau permettant de fournir en option des ressources rapides dans un réseau. Ce procédé consiste à transmettre des informations de système réseau, y compris des informations permettant de déterminer si l'accès rapide est pris en charge par le réseau ou non. Ce procédé permet de rendre facultative l'utilisation de ressources rapides.
PCT/EP2000/008347 2000-08-25 2000-08-25 Schema d'access aleatoire rapide WO2002017668A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
AU2000267038A AU2000267038A1 (en) 2000-08-25 2000-08-25 Fast random access scheme
PCT/EP2000/008347 WO2002017668A1 (fr) 2000-08-25 2000-08-25 Schema d'access aleatoire rapide
EP00954661A EP1226731A1 (fr) 2000-08-25 2000-08-25 Schema d'access aleatoire rapide

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2000/008347 WO2002017668A1 (fr) 2000-08-25 2000-08-25 Schema d'access aleatoire rapide

Publications (1)

Publication Number Publication Date
WO2002017668A1 true WO2002017668A1 (fr) 2002-02-28

Family

ID=8164075

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2000/008347 WO2002017668A1 (fr) 2000-08-25 2000-08-25 Schema d'access aleatoire rapide

Country Status (3)

Country Link
EP (1) EP1226731A1 (fr)
AU (1) AU2000267038A1 (fr)
WO (1) WO2002017668A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004057897A1 (fr) 2002-12-20 2004-07-08 Nokia Corporation Procede, dispositif, station de base et systeme permettant l'acces direct par liaison montante a un reseau de telecommunication mobile
WO2004093483A1 (fr) * 2003-04-15 2004-10-28 Qualcomm Incorporated Prevention d'interruption de canal d'octroi par l'application de l'algorithme glouton dans un procede de programmation de canal d'octroi et station de base a adaptation correspondante, controleur de recepteur et reseau de communications amrc
EP1511246A2 (fr) * 2003-08-29 2005-03-02 Samsung Electronics Co., Ltd. Dispositif et procédé pour contrôler les états de fonctionnement de la couche de commande d'accès au support dans un système de communication d'accès sans fil à large bande
WO2005051032A1 (fr) * 2003-11-21 2005-06-02 Telefonaktiebolaget Lm Ericsson (Publ) Adaptation de lien pour voie point-multipoints
DE102004001742A1 (de) * 2004-01-13 2005-08-04 Wingcon Gmbh Zugangsverfahren für ausgewählte Teilnehmer eines Mobilfunknetzes
EP1786226A1 (fr) * 2005-11-10 2007-05-16 Research In Motion Limited Dispositif et procédé pour la signalisation d'affectation de ressources de communication sur une base de blocs
US7773996B2 (en) 2005-11-10 2010-08-10 Research In Motion Limited Apparatus and method for signaling communication resource allocation on a block basis

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000007401A1 (fr) * 1998-07-25 2000-02-10 Motorola Limited Systeme et procede de communication
US6031832A (en) * 1996-11-27 2000-02-29 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for improving performance of a packet communications system
EP1006743A1 (fr) * 1998-12-02 2000-06-07 Lucent Technologies Inc. Procédés et dispositif pour l'établissement de trames d'accès courts pour une latence rapide

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6031832A (en) * 1996-11-27 2000-02-29 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for improving performance of a packet communications system
WO2000007401A1 (fr) * 1998-07-25 2000-02-10 Motorola Limited Systeme et procede de communication
EP1006743A1 (fr) * 1998-12-02 2000-06-07 Lucent Technologies Inc. Procédés et dispositif pour l'établissement de trames d'accès courts pour une latence rapide

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100728067B1 (ko) 2002-12-20 2007-06-13 스파이더 네비게이션즈 엘.엘.씨. 이동 통신 네트워크에서 다이렉트 업링크 액세스를 위한방법, 장치, 기지국 및 시스템
CN100431379C (zh) * 2002-12-20 2008-11-05 诺基亚公司 用于在移动通信网络中直接上行链路接入的方法、设备、基站和系统
US7426394B2 (en) * 2002-12-20 2008-09-16 Spyder Navigations L.L.C. Method, device, base station and system for direct uplink access in a mobile communications network
AU2003288303B2 (en) * 2002-12-20 2008-09-04 Spyder Navigations L.L.C Method, device, base station and system for direct uplink access in a mobile communications network
WO2004057897A1 (fr) 2002-12-20 2004-07-08 Nokia Corporation Procede, dispositif, station de base et systeme permettant l'acces direct par liaison montante a un reseau de telecommunication mobile
WO2004093483A1 (fr) * 2003-04-15 2004-10-28 Qualcomm Incorporated Prevention d'interruption de canal d'octroi par l'application de l'algorithme glouton dans un procede de programmation de canal d'octroi et station de base a adaptation correspondante, controleur de recepteur et reseau de communications amrc
AU2004229615B2 (en) * 2003-04-15 2008-07-10 Qualcomm Incorporated Avoiding GCH-outage by appliance of the greedy algrithm in a grant channel scheduling method, and correspondingly adapted base station, transceiver controller and CDMA communications network
US7085574B2 (en) 2003-04-15 2006-08-01 Qualcomm, Incorporated Grant channel assignment
EP1768443A3 (fr) * 2003-08-29 2007-08-08 Samsung Electronics Co., Ltd. Dispositif et procédé pour contrôler les états de fonctionnement de la couche de commande d'accès au support dans un système de communication d'accès sans fil à large bande
EP1768442A2 (fr) * 2003-08-29 2007-03-28 Samsung Electronics Co., Ltd. Dispositif et procédé pour contrôler les états de fonctionnement de la couche de commande d'accès au support dans un système de communication d'accès sans fil à large bande
EP1768442A3 (fr) * 2003-08-29 2007-08-08 Samsung Electronics Co., Ltd. Dispositif et procédé pour contrôler les états de fonctionnement de la couche de commande d'accès au support dans un système de communication d'accès sans fil à large bande
EP1511246A3 (fr) * 2003-08-29 2006-05-17 Samsung Electronics Co., Ltd. Dispositif et procédé pour contrôler les états de fonctionnement de la couche de commande d'accès au support dans un système de communication d'accès sans fil à large bande
US7400642B2 (en) 2003-08-29 2008-07-15 Samsung Electronics Co., Ltd Apparatus and method for controlling operational states of medium access control layer in a broadband wireless access communication system
EP1511246A2 (fr) * 2003-08-29 2005-03-02 Samsung Electronics Co., Ltd. Dispositif et procédé pour contrôler les états de fonctionnement de la couche de commande d'accès au support dans un système de communication d'accès sans fil à large bande
US7164890B2 (en) 2003-11-21 2007-01-16 Telefonaktiebologet Lm Ericsson (Publ) Link adaptation for point-to-multipoint channel
WO2005051032A1 (fr) * 2003-11-21 2005-06-02 Telefonaktiebolaget Lm Ericsson (Publ) Adaptation de lien pour voie point-multipoints
DE102004001742A1 (de) * 2004-01-13 2005-08-04 Wingcon Gmbh Zugangsverfahren für ausgewählte Teilnehmer eines Mobilfunknetzes
EP1786226A1 (fr) * 2005-11-10 2007-05-16 Research In Motion Limited Dispositif et procédé pour la signalisation d'affectation de ressources de communication sur une base de blocs
US7773996B2 (en) 2005-11-10 2010-08-10 Research In Motion Limited Apparatus and method for signaling communication resource allocation on a block basis

Also Published As

Publication number Publication date
AU2000267038A1 (en) 2002-03-04
EP1226731A1 (fr) 2002-07-31

Similar Documents

Publication Publication Date Title
RU2212109C2 (ru) Освобождение в физических каналах в общем пакетном радиообслуживании
CA2272594C (fr) Procede et appareil ameliorant les performances d'un systeme de communication par paquets
KR100387040B1 (ko) 이동통신 시스템에서 패킷 데이터 송수신 방법
KR100659691B1 (ko) 패킷 무선 서비스에서의 리소스 배치 방법 및 장치
FI101920B (fi) Kanavanvarausmenetelmä pakettiverkkoa varten
EP1006695B2 (fr) Procédé et dispositif de transfert de données en temps réel dans un réseau de radiocommunication par paquets
KR100911304B1 (ko) 무선통신 시스템에서 우선순위를 갖는 무선베어러의 데이터전송 방법
US7092373B2 (en) Advanced method and arrangement for transferring information in a packet radio service
RU2222876C2 (ru) Оптимальное использование логических каналов в сети подвижной связи
EP1133888B1 (fr) Procede d'acces pour un systeme de telecommunication mobile
CA2420953C (fr) Procede et systeme ameliores pour transferer des informations dans un service de donnees radio en mode paquets
KR20000015422A (ko) 이동통신 시스템의 매체접근제어 부계층상에서멀티미디어서비스 방법
KR100272109B1 (ko) 효율적 무선 자원 할당을 위한 무선통신 장치 및 그 운용 방법
KR20070047124A (ko) 무선 자원에 관한 정보를 송수신하는 방법
NZ338052A (en) Enhanced preemption within a mobile telecommunications network
CN108271213B (zh) 通信控制方法、非授权传输方法及装置
EP1226731A1 (fr) Schema d'access aleatoire rapide
JP4227406B2 (ja) ダウンリンクの論理チャネルに対する無線リソースの高速割り当て方法

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2000954661

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 2000954661

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Ref document number: 2000954661

Country of ref document: EP