EP1142372A1 - Messagerie selective et efficace dans un systeme de communication mobile - Google Patents

Messagerie selective et efficace dans un systeme de communication mobile

Info

Publication number
EP1142372A1
EP1142372A1 EP99964868A EP99964868A EP1142372A1 EP 1142372 A1 EP1142372 A1 EP 1142372A1 EP 99964868 A EP99964868 A EP 99964868A EP 99964868 A EP99964868 A EP 99964868A EP 1142372 A1 EP1142372 A1 EP 1142372A1
Authority
EP
European Patent Office
Prior art keywords
cell
cells
list
area
message
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
EP99964868A
Other languages
German (de)
English (en)
Inventor
Göran ENGMAN
Pär GUSTAVSSON
Jan Tellinger
Jan Wahlman
Thomas Johansson
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
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 Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP1142372A1 publication Critical patent/EP1142372A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12—Messaging; Mailboxes; Announcements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W68/00—User notification, e.g. alerting and paging, for incoming communication, change of service or the like

Definitions

  • the present invention relates to wireless communications, and more particularly, to a method and apparatus for selectively and efficiently communicating control messages in a mobile radio network.
  • a geographical area is divided into cell areas served by base stations which are connected to a radio network.
  • Each user (mobile subscriber) in the mobile radio system is provided with a portable radio referred to as a mobile station which communicates one or more types of information, e.g., voice, data, video, etc. with the cellular radio network via one or more radio base stations.
  • Each base station includes a plurality of channel units including a transmitter, a receiver, and a controller and may be equipped with an omni-directional antenna for transmitting equally in all directions in one relatively large cell area or with several directional antennas, each directional antenna serving a particular sector cell.
  • Each mobile station also includes a transmitter, a receiver, a controller, and a user interface and is identified by a specific mobile station identifier.
  • a mobile subscriber is typically identified by another identifier, e.g., an international mobile subscription number (IMS I).
  • IMS I international mobile subscription number
  • One area where efficiency can be improved relates to control message signaling from a radio network control node to various cells in the network. For example, many paging messages are provided to the mobile communications network and must ultimately be communicated (if possible) to the mobile station via pages transmitted from such cells.
  • Mobile communications networks are typically divided into paging areas, and each paging area typically contains a number of cells. Paging messages are transmitted to all paging areas in the service area of the network Each mobile station informs the network of its current location periodically or whenever it crosses a paging area border by means of a registration access procedure. When the paging area of a mobile station is known, a page message for that mobile station is sent to all the base stations in that particular paging area Each of those base stations turn transmit the paging message in each cell associated with that base station If a page is not answered by the mobile station, the paging process is repeated either within the same paging area or in a larger area
  • a radio network control node when a paging request is received by a radio network control node, there is considerable signaling overhead associated with distributing the paging message to all cells in the paging area. In some cellular systems, that signaling overhead may be carried across the radio interface between base and mobile stations.
  • a base station Once a base station receives a page request, it transmits a paging message ovei a radio paging channel in each of its associated cells.
  • the amount of control signaling over the radio interface is an important issue in any mobile communications system; it is particularly important in a Code Division Multiple Access (CDMA) type of mobile communications system.
  • CDMA Code Division Multiple Access
  • the capacity of a CDMA system is ultimately limited by a maximum interference level in the system which includes both desired and undesired interference signals If there is a high level of interference, e.g , caused by a large number of mobile stations currently communicating in a cell, that cell is currently "overloaded" from a radio network point of view, and therefore cannot take on additional calls or other requests for radio resources. It is therefore unnecessary to send a page message to an overloaded cell.
  • the problem addressed by the present invention is how to best distribute a page request when one or more cells within the paging area is not granting new call requests for radio resources at current congestion levels
  • the present invention solves this problem using a selective messaging procedure that efficiently distributes messages only to eligible cells and eliminates distribution of unnecessary messaging information to ineligible cells.
  • Eligibility is used here in the broad sense that an eligible cell would be able to productively use or respond to the messaging information while an ineligible cell would not.
  • the message information may correspond to any type of message, in the example, non-limiting embodiment, the message information relates to a page request for a mobile station.
  • the admission status may be determined using any criterion or criteria, in the example embodiment, the admission status is determined using a congestion or overload threshold. A cell with a congestion level at or below the congestion threshold is deemed to have a favorable admission status. A cell having a congestion level above the congestion threshold is deemed to have an unfavorable admission status.
  • the page message may be sent only to those cells in a paging area where the mobile station is registered or otherwise located whose admission status is determined to be favorable. Indeed, if the admission status of the cell in which the mobile station is currently registered is determined to be unfavorable, then the message is not sent to any cell in the area.
  • a list data structure is established in memory for each paging area and may include for each area cell an admission indicator. Based on one or more admission criteria, a value may be stored for each of the admission indicators in the list.
  • a decision is made whether to send that message to one or more cells in the area depending on the admission indicator value for the one or more cells in that area.
  • the admission status of each cell is regularly monitored and updated in the list.
  • An alternative cell list structure may be employed. For each paging area, the congestion level for each cell is checked to determine if it exceeds a threshold. A cell is added to its paging area's list if the threshold is not exceeded. On the other hand, if the threshold is exceeded, that cell is removed from the list. That way when a page is detected for a mobile station, the appropriate paging area is identified, and the paging message is sent only to those cells currently included on that paging area's cell list. The admission status for each cell is regularly monitored and the cell list updated.
  • the present invention reduces the amount of control signaling in the radio network by not sending messages that are not useful or that cannot be acted upon under the current conditions. This decreases data processing and signaling overhead within the radio network itself. It also decreases data processing and signaling between radio base stations and mobile stations over the radio interface. In other words, if a mobile station currently located in a congested cell is paged over the radio interface by the associated base station, the mobile station will naturally respond with a request for radio resources over the radio interface to support that call in response to the page. The base station then must send another message over the radio interface back to the mobile station denying that request because the cell is currently overloaded. By not transmitting these unnecessary signals over the radio interface, the present invention preserves limited radio resources for more productive requests and also avoids contributing to the already significant congestion problem.
  • FIG. 1 shows a diagram of an example mobile radio communications system in which the present invention may be employed
  • Fig. 2 is a simplified function block diagram of a radio network controller and a base station
  • Fig. 3 is a simplified function block diagram of a mobile station
  • Fig. 4 illustrates example location and registration areas
  • Fig. 5 is a flowchart diagram illustrating a selective messaging procedure in accordance with one embodiment of the present invention.
  • Fig. 6 is a diagram of a conceptual example list data structure for plural paging areas
  • Fig. 7 is a selective paging routine in accordance with one example, non- limiting selective paging routine in accordance with one example embodiment of the invention.
  • Fig. 8 is another example, non-limiting selective paging routine in accordance with another example embodiment of the present invention.
  • a representative, circuit- switched, external core network, shown as a cloud 12 may be for example the public switched telephone network (PSTN) and/or the integrated services digital network (ISDN).
  • PSTN public switched telephone network
  • ISDN integrated services digital network
  • PLMN Public Land Mobile radio Network
  • a representative, packet- switched, external core network shown as cloud 14 may be for example an IP network such as the Internet.
  • the core networks are coupled to corresponding network service nodes 16.
  • the PSTN/ISDN network 12 and other PLMN network 13 are connected to a circuit-switched core node (CSCN), such as a Mobile Switching Center (MSC), that provides circuit-switched services.
  • CSCN circuit-switched core node
  • MSC Mobile Switching Center
  • the MSC 18 is connected over an interface A to a base station subsystem (BSS) 22 which in turn is connected to a radio base station 23 over an interface A'.
  • the packet-switched network 14 is connected to a packet-switched core node (PSCN), e.g., a General Packet Radio Service (GPRS) node 20 tailored to provide packet-switched type services in the context of GSM which is sometimes referred to as the Serving GPRS Service Node (SGSN).
  • PSCN packet-switched core node
  • GPRS General Packet Radio Service
  • SGSN Serving GPRS Service Node
  • Each of the core network service nodes 18 and 20 also connects to a UMTS terrestrial radio access network (UTRAN) 24 over a radio access network interface.
  • the UTRAN 24 includes one or more radio network systems (RNS) 25 each with a radio network controller (RNC) 26 coupled to a plurality of base stations (BS) 28 and to the RNCs in the UTRAN 24.
  • radio access over the radio interface is based upon wideband, Code Division Multiple Access (WCDMA) with individual radio channels allocated using CDMA spreading codes.
  • WCDMA Code Division Multiple Access
  • Each mobile station is assigned its own scrambling code in order for a base station 28 to identify transmissions from that particular mobile station.
  • the mobile station also uses its own scrambling code to identify transmissions from the base station either on a general broadcast or common channel or transmissions specifically intended for that mobile station. That scrambling code distinguishes the scrambled signal from all of the other transmissions and noise present in the same area.
  • the radio network controller 26 includes a memory 50 coupled to data processing circuitry 52 that performs numerous radio and data processing operations required to perform its control functions and conduct communications between the RNC 26 and other entities such as the core network service nodes, other RNCs, and base stations.
  • Data processing circuitry may include any one or a combination of a suitably programmed or configured general purpose computer, microprocessor, microcontroller, dedicated logic circuitry, DSP, ASIC, etc.
  • the base station 28 includes a data processing and control unit 54 which, in addition to performing processing operations relating to communications with the RNC 26, performs a number of measurement and control operations associated with the base station radio equipment such as transceivers 56 connected to one or more antennas 58.
  • the mobile station's data processing and control unit 36 provides control signals as well as data to a radio transceiver 62 connected to an antenna 66. Both the data processing and control unit 60 and the transceiver 62 are powered by a battery 64. The amount of power supplied by the battery 64 is regulated by one or more control signals from the data processing and control unit 36.
  • broadcast channels including a general broadcast channel (BCH), a paging channel (PCH), and a forward access channel (FACF1) for providing various types of control messages to mobile stations.
  • BCH general broadcast channel
  • PCH paging channel
  • FACF1 forward access channel
  • RACH random access channel
  • the U ⁇ lTS 10 may be divided into a plurality of areas, each area containing a plurality of cells as illustrated in Fig. 4.
  • Each cell is a geographical area where radio coverage is provided by radio base station equipment at a base station site.
  • a base station may serve one or more cells.
  • the particular areas illustrated in Fig. 4 include Location Areas (LA(1)-LA(3)) 32 indicated by cross-hatching and UTRAN Registration Areas (URA(1)-URA(3)) 34.
  • LA refers to a paging area associated with a core network.
  • a URA refers to a paging area associated with the UTRAN.
  • the LA is applicable when the mobile station is powered on but is in an idle mode.
  • the URA is applicable when the mobile has established a packet data connection but is not currently sending or receiving data.
  • the LA and URA are only non-limiting examples of paging areas. Thereafter, the mobile station may move freely between cells belonging to that same location area or registration area without having to perform a registration update procedure. Consequently, if information is to be sent from the network to the mobile station and the location of the mobile station is known only at a location or registration area level, (rather than at a cell level), a paging message is broadcast in all cells belonging to the location/registration area where the mobile station made its last registration area update.
  • location areas 32 and UTRAN registration areas 34 contain cells coupled to more than one base station.
  • the RNC typically identifies the location or registration area where the paged mobile is believed to be currently located, e.g., last registered.
  • the page request is then distributed to all cells in the paging area.
  • Fig. 4 shows two cells in both a location area LA(1) and a UTRAN registration area URA(l) in an overloaded state which will not take on additional call requests. Accordingly, the inventors of the present invention recognized that it is pointless to send paging messages to these overloaded cells, like cells 4 and 5, if additional call resources cannot be allocated to support another call in those overloaded cells.
  • a page request in accordance with the invention is only sent to those cells within the paging area that are in a "normal state" as shown in Fig. 4. For example, a page request to a mobile registered in LA(1) would only be sent to and therefore transmitted from cells 1, 2, 3, and 6.
  • Fig. 5 outlines a selective messaging routine (block 70) in accordance with a first embodiment of the present invention.
  • information is received for a mobile station located in a cell contained in a particular location area or registration area which typically, although not necessarily, consists of more than one cell (block 72).
  • the current admission status associated with each of the cells in the area is determined before or after the receipt of that information (block 74).
  • Admission status may be based on the congestion level of a particular cell as indicated in Fig. 2 in terms of the cell's ability to allocate new resources to a call.
  • there may be an existing call which is currently supported where additional resources are requested for that call, e.g., radio bandwidth resources for a video connection coupled with the existing voice connection.
  • admission status may be based on any type of condition or criterion that might be used to control the admission of new calls or the allocation of new resources in the cell.
  • a message associated with the information received for the mobile station (or the information itself) is then sent to one or more cells where the admission status is currently determined to be favorable (block 76).
  • the message may be any sort of message including but not limited to paging messages, measurement-related messages, admission control messages, broadcast parameter messages, short data messages, etc. Conversely, such a message is not sent to any cell where the admission status is currently determined to be unfavorable (block 76).
  • the memory 50 in the RNC 26 stores a list for each paging area in the mobile communications network.
  • the list structures could be stored in some other control node in the network such as the base stations.
  • One example list data structure is shown in Fig. 6. Two exemplar ⁇ ' lists are shown for location areas LA(1) and LA(2), each of which contain six cells numbered (1 -6). For each cell entry in the list there may be an associated base station identifier and an admission status indicator. For example, if the admission status is favorable, a flag may be set to "1"; otherwise, an unfavorable condition is indicated with a "0". Other more elaborate admission status indication schemes may be employed.
  • location area LA(1) includes four cells (1-4) coupled to base station BS(1) and two cells (5-6) coupled to base station BS2.
  • Five cells (1-5) are contained in URA(l) and four cells (6, 1, 2, and 3) are contained in URA(2) with one cell (6) in URA(2), overlapping with one cell in LA(1).
  • Three cells (4, 5, and 6) of URA(3) are also included in location LA (2). Only cells 4 and 5 in location area LA(1) are currently overloaded.
  • the URA entries are optional.
  • a list is established for each location area including a cell entry and an admission status indicator (block 82).
  • Other optional entries indicate the current base station and UTRAN registration area (URA) associated with each cell.
  • the congestion level is then determined for each cell.
  • An appropriate admission status indicator e.g., a flag bit, corresponding to that determined congestion level is stored in the list (block 84).
  • the congestion level may be determined for example by comparing a measured signal-to-interference ratio or other congestion-type parameter.
  • a page is detected for a mobile station and routed to the RNC (block 86).
  • the RNC processing circuitry 52 determines in which location area the mobile station is currently located or registered (block 88).
  • the processing circuitry accesses memory 50, and in particular the list corresponding to the determined location area, to determine and select which cells in that location area (if any) have a favorable admission status and therefore should receive a page message (block 90).
  • the corresponding paging message is then sent to the selected cells (block 92).
  • the procedure continues by again detecting the current congestion level in each cell in each location area and updating the admission status in the corresponding location area list in memory 90 (block 94). In the event that the location of the mobile station is known at a cell level, the paging message is sent only to that cell if it is not congested. If the cell is congested, the paging message is not sent at all.
  • the list structure employed in memory 50 may simply contain only entries for those cells having a favorable admission status. In other words, cells having an unfavorable admission status are removed from the list while cells having a favorable admission status are either added or maintained in the list.
  • the Selective Paging routine (block 100) shown in Fig. 8.
  • a cell list is established for each location area (block 102).
  • the RNC processing circuitry 52 determines whether a congestion level exceeds a threshold (block 104). If the threshold is exceeded, the processing circuitry 52 removes that cell from the list (block 106). If the threshold is not exceeded, the processing circuitty' 52 adds that cell to the list (block 108).
  • the RNC When a page is detected for a mobile station by the RNC (block 110), it determines the location area when the mobile station is currently located or otherwise registered (block 112). The processing circuitty' 52 then checks the corresponding location area list in memory 50 and sends a paging message only to those cells currently included in that area's cell list (block 114). Thereafter, as in the routine in Fig. 7, the processing circuitry 52 continues to determine the congestion level in each cell and updates the cell list for each location area (block 116).
  • the present invention provides a number of benefits.
  • the amount of control signaling in the radio network is reduced because messages that are not useful or that cannot be acted upon under current conditions are not sent. This decreases data processing and signaling overhead within the radio network itself. It also decreases data processing and signaling between radio base stations and mobile stations over the radio interface. For example, if a mobile station currently located in a congested cell is paged over the radio interface by an associated base station, the mobile station will naturally respond with a request for radio resources over the radio interface to support the call in response to the page. The base station then sends another message over the radio interface back to the mobile station denying the request because the cell is currently overloaded.
  • the interference level in that cell is reduced or at least not increased in the downlink direction.
  • the mobile station does not respond to the page, interference is also reduced in the uplink direction.

Abstract

L'invention concerne une procédure de messagerie assurant une distribution efficace des messages uniquement dans les cellules concernées et permettant de supprimer la distribution inutile d'informations de messagerie aux cellules non concernées dans un réseau de communication mobile. Lorsqu'une information destinée à une station mobile se trouvant dans une zone contenant une ou plusieurs cellules est reçue, l'état d'admission associé à chacune des cellules dans cette zone est déterminé. Un message est ensuite envoyé à une ou plusieurs cellules dont l'état d'admission a été reconnu comme favorable. Inversement ce message n'est pas envoyé à une quelconque cellule présentant un statut d'admission défavorable. Pour le suivi de l'état d'admission des cellules une liste structurée de données est créée dans une mémoire pour chaque zone et peut comprendre, par exemple un indicateur d'admission pour chaque cellule répertoriée. Une valeur appropriée fondée sur un ou plusieurs critères d'admission peut être mémorisée pour chaque indicateur d'admission. Lorsqu'un message destiné à une station mobile est détecté, et que la zone dans laquelle se trouve cette station mobile est temporairement enregistrée, la décision d'envoyer ou non ce message dans une ou plusieurs cellules de la zone sera prise en fonction de la valeur de l'indicateur d'admission pour une ou plusieurs cellules de cette zone. Dans un autre type de liste structurée de cellules, une cellule est ajoutée à la liste lorsque la condition est remplie et une cellule est éliminée de la liste lorsque la condition n'est pas remplie. L'état d'admission de chaque cellule est surveillé et mis à jour régulièrement.
EP99964868A 1998-12-18 1999-12-14 Messagerie selective et efficace dans un systeme de communication mobile Withdrawn EP1142372A1 (fr)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US399133 1989-08-28
WOPCT/IB98/02077 1998-12-18
IB9802077 1998-12-18
US39913399A 1999-09-20 1999-09-20
PCT/SE1999/002357 WO2000038444A1 (fr) 1998-12-18 1999-12-14 Messagerie selective et efficace dans un systeme de communication mobile

Publications (1)

Publication Number Publication Date
EP1142372A1 true EP1142372A1 (fr) 2001-10-10

Family

ID=26318732

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99964868A Withdrawn EP1142372A1 (fr) 1998-12-18 1999-12-14 Messagerie selective et efficace dans un systeme de communication mobile

Country Status (5)

Country Link
EP (1) EP1142372A1 (fr)
JP (1) JP2002534020A (fr)
CN (1) CN1130934C (fr)
AU (1) AU3090400A (fr)
WO (1) WO2000038444A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11902129B1 (en) 2023-03-24 2024-02-13 T-Mobile Usa, Inc. Vendor-agnostic real-time monitoring of telecommunications networks

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7660282B2 (en) 2003-02-18 2010-02-09 Qualcomm Incorporated Congestion control in a wireless data network
US7155236B2 (en) 2003-02-18 2006-12-26 Qualcomm Incorporated Scheduled and autonomous transmission and acknowledgement
US8081598B2 (en) 2003-02-18 2011-12-20 Qualcomm Incorporated Outer-loop power control for wireless communication systems
US8391249B2 (en) 2003-02-18 2013-03-05 Qualcomm Incorporated Code division multiplexing commands on a code division multiplexed channel
US8150407B2 (en) 2003-02-18 2012-04-03 Qualcomm Incorporated System and method for scheduling transmissions in a wireless communication system
US20040160922A1 (en) 2003-02-18 2004-08-19 Sanjiv Nanda Method and apparatus for controlling data rate of a reverse link in a communication system
US8705588B2 (en) 2003-03-06 2014-04-22 Qualcomm Incorporated Systems and methods for using code space in spread-spectrum communications
US7215930B2 (en) 2003-03-06 2007-05-08 Qualcomm, Incorporated Method and apparatus for providing uplink signal-to-noise ratio (SNR) estimation in a wireless communication
KR100595585B1 (ko) * 2003-05-13 2006-07-03 엘지전자 주식회사 이동통신시스템에서의 멀티미디어 방송 및 멀티캐스트서비스를 위한 무선자원관리방법
US8477592B2 (en) 2003-05-14 2013-07-02 Qualcomm Incorporated Interference and noise estimation in an OFDM system
US8489949B2 (en) 2003-08-05 2013-07-16 Qualcomm Incorporated Combining grant, acknowledgement, and rate control commands
US7126928B2 (en) * 2003-08-05 2006-10-24 Qualcomm Incorporated Grant, acknowledgement, and rate control active sets
CN101325803B (zh) * 2007-07-12 2011-06-22 中兴通讯股份有限公司 编解码选择和指配方法
US8135418B2 (en) 2007-09-26 2012-03-13 Motorola Mobility, Inc. Method and base station for managing calls in wireless communication networks

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5305466A (en) * 1990-02-20 1994-04-19 Nec Corporation Location registration and paging procedure for mobile communication
US5153902A (en) * 1990-04-27 1992-10-06 Telefonaktiebolaget L M Ericsson Multi-exchange paging system for locating a mobile telephone in a wide area telephone network
US5533094A (en) * 1992-05-12 1996-07-02 Telefonaktiebolaget L M Ericsson, A Corp. Of Sweden Allocation of paging capacity in cellular applications by storing a set of page request group designations, paging extents and paging priority parameters
US5369681A (en) * 1992-05-12 1994-11-29 Telefonaktiebolaget L M Ericsson Cellular communications system utilizing paging areas
JP2885067B2 (ja) * 1994-05-30 1999-04-19 日本電気株式会社 移動体加入者呼出方法および移動体通信システム
US5649289A (en) * 1995-07-10 1997-07-15 Motorola, Inc. Flexible mobility management in a two-way messaging system and method therefor
FI104352B (fi) * 1997-02-07 1999-12-31 Nokia Networks Oy Matkaviestimen haku solukkoradiojärjestelmässä
US6058308A (en) * 1997-02-18 2000-05-02 Telefonaktiebolaget L M Ericsson Apparatus, and associated method, for adaptively selecting a paging area in which to page a mobile terminal

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO0038444A1 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11902129B1 (en) 2023-03-24 2024-02-13 T-Mobile Usa, Inc. Vendor-agnostic real-time monitoring of telecommunications networks

Also Published As

Publication number Publication date
CN1130934C (zh) 2003-12-10
AU3090400A (en) 2000-07-12
WO2000038444A1 (fr) 2000-06-29
JP2002534020A (ja) 2002-10-08
CN1348661A (zh) 2002-05-08

Similar Documents

Publication Publication Date Title
EP1338166B1 (fr) Liberation d'un equipement utilisateur utilisant une procedure de recherche d'une personne dans un systeme de communication cellulaire
US6434390B2 (en) Macrodiversity control system having macrodiversity mode based on operating category of wireless unit
US7215948B2 (en) Multicast communication method in a CDMA mobile communication system
US8923912B2 (en) Base station apparatus, method, and radio communication system
JP4643103B2 (ja) 移動体の上り回線における送信電力情報を使用して無線ネットワークを制御する方法
EP0472349B1 (fr) Régulation autonome de surcharge à l'inscription pour systèmes radio mobile cellulaires
EP1179273B1 (fr) Etablissement de rapports sur des mesures de stations mobiles fondes sur des evenements
EP2373103B1 (fr) Procédé et arrangement de radiomessagerie dans E-UTRAN
WO2000038444A1 (fr) Messagerie selective et efficace dans un systeme de communication mobile
AU5010599A (en) Method and system for overhead message updates
CA2279983A1 (fr) Procede de commande dynamique de la longueur des messages de "r_data" sur un canal d'acces aleatoire
EP1275266B1 (fr) Recherche multidestinataire de personne dans un systeme de communication
WO2007127099A1 (fr) Procede et appareil de transmission d'un message multicast
TW457821B (en) Selective and efficient messaging in a mobile communications system
EP2247000B1 (fr) Système de communication radio et terminal mobile recevant des données d'un service multimédia de diffusion/multidiffusion

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20010601

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)

17Q First examination report despatched

Effective date: 20050420

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20060912