WO2017091942A1 - Procédé et nœud de passerelle pour réduire un trafic de radiomessagerie dans un système de communication sans fil - Google Patents

Procédé et nœud de passerelle pour réduire un trafic de radiomessagerie dans un système de communication sans fil Download PDF

Info

Publication number
WO2017091942A1
WO2017091942A1 PCT/CN2015/095980 CN2015095980W WO2017091942A1 WO 2017091942 A1 WO2017091942 A1 WO 2017091942A1 CN 2015095980 W CN2015095980 W CN 2015095980W WO 2017091942 A1 WO2017091942 A1 WO 2017091942A1
Authority
WO
WIPO (PCT)
Prior art keywords
paging
node
requests
nodes
request
Prior art date
Application number
PCT/CN2015/095980
Other languages
English (en)
Inventor
Ka Ho Mui
Shijun Fan
Yau Yau Yolanda Tsang
Yee Simon Wong
Hua Shen
Original Assignee
Hong Kong Applied Science and Technology Research Institute Company Limited
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 Hong Kong Applied Science and Technology Research Institute Company Limited filed Critical Hong Kong Applied Science and Technology Research Institute Company Limited
Priority to PCT/CN2015/095980 priority Critical patent/WO2017091942A1/fr
Priority to CN201580001525.XA priority patent/CN105493561B/zh
Publication of WO2017091942A1 publication Critical patent/WO2017091942A1/fr

Links

Images

Classifications

    • 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
    • H04W68/04—User notification, e.g. alerting and paging, for incoming communication, change of service or the like multi-step notification using statistical or historical mobility data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • 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
    • H04W68/005—Transmission of information for alerting of incoming communication
    • 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
    • H04W68/02—Arrangements for increasing efficiency of notification or paging channel

Definitions

  • the present invention generally relates to paging in a wireless communication system.
  • the present invention relates to a method and a gateway node for reducing paging traffic by means of caching, scheduling and transmission optimization.
  • a wireless communication system such as a mobile communication system using a Long Term Evolution (LTE) specification, has been moving to a flatter, all-IP architecture in which base stations (BSs) are directly, or indirectly, connected to a packet core network (CN) through some gateways (GWs) .
  • BSs base stations
  • CN packet core network
  • GWs gateways
  • small cells such as femtocells in the LTE system, are increasingly deployed for supporting communications with more user equipments (UEs) per unit area. Due to the high density of small cells located in a given area, it is typical that a GW is connected with hundreds or thousands of small cells.
  • Paging is a procedure of locating a UE in a wireless communication system. It usually generates a significant amount of paging traffic on the links between the GW and the BSs due to the large number of BSs as well as the large number of potential UEs to be paged. Note that the links are usually implemented as part of an Internet Protocol (IP) network. It is desirable if the amount of paging traffic can be reduced.
  • IP Internet Protocol
  • techniques for reducing the amount of paging traffic usually employ one the following two approaches: limiting the number of cells or BSs to do paging to thereby limit the paging traffic; and deciding whether or not to page a target UE.
  • US8428625 suggests a technique that first pages a subset of the total number of cell sites in a tracking area (TA) and then expands the subset after unsuccessful attempts to page a UE.
  • TA tracking area
  • US6351641 a method for re-paging is disclosed. An area according to the location information is divided into a number of sub-areas. If re-paging is required, the number of re-pagings to be performed in each cell within the area is limited based on a limitation value.
  • a permanent user identity is used to determine a set of small cells to page a UE based on a small cell last visited by the UE and small cells that are neighbors of the last-visited small cell.
  • US2015249969 discloses a GW device that stores information regarding an environment around a BS and that selects the cells to be paged for an UE based on the stored information.
  • a method is provided for a GW to page a UE that is in idle mode and resides within a cluster of femtocells.
  • the GW determines whether which femtocells to be involved in paging according to a UE identifier and an identity of at least one femtocell that the UE previously visited.
  • US20140370922 suggests using a table to map a UE and a candidate BS that has some likelihood of successfully paging the UE, thereby some paging traffic can be saved by focusing on this candidate BS in paging.
  • US8537829 suggests that paging may not be needed by determining if a bearer connection or link is in the process of being established, thereby enabling a reduction of paging traffic for the system.
  • a GW having intelligence to determine whether or not to page a particular UE is disclosed. The GW determines to page the UE when the UE is in an idle state or when one or more selective paging rules are satisfied.
  • WO2011026663 a method for determining whether or not to page a UE is suggested, based on a bearer identification and a framework table comprising a number of selection criteria entries for BS name, quality of service class indicator, etc.
  • WO2001080588 suggests a system using multicasting to transmit paging requests from a GW to a plurality of BSs for optimizing paging efficiency. Nonetheless, the use of multicasting is not compliant to major wireless communication standards such as the LTE specification.
  • An aspect of the present invention is to provide a method for paging UEs in a wireless communication system.
  • the system comprises a GW node and plural BS nodes communicable with the GW node via an IP-based communication network.
  • the GW node is arranged to receive paging requests from elsewhere in the system. Each paging request includes information for identifying a target UE to be paged.
  • the GW node creates and updates a cache map comprising entries each for caching a selected UE and either a BS node or a TA most-recently visited by the selected UE, where the TA is a subset of the BS nodes.
  • the GW node When a new paging request is received by the GW node, the GW node buffers the new paging request into an outgoing queue of the GW node unless the outgoing queue has already contained a paging request having the target UE same as the target UE identified by the new paging request. Furthermore, the GW node determines one or more destination BS nodes to which the new paging request is to be sent. If the target UE identified by the new paging request is recorded in the cache map, the one or more destination BS nodes are determined to be the subset of the BS nodes corresponding to the most-recently visited TA, or corresponding to the TA that includes the most-recently visited BS node.
  • the outgoing queue is periodically updated with any paging request in an outgoing buffer every paging interval.
  • the outgoing buffer is arranged to store any paging request not yet sent out in a previous paging interval.
  • the outgoing queue is reorganized such that plural paging requests therein to be sent to the same destination BS node are collectively located and grouped as one cluster in the outgoing queue for easy retrieval.
  • the GW node transmits some or all of the paging requests extracted from the outgoing queue to respective destination BS nodes.
  • the transmitting of some or all of the paging requests is arranged such that the following four conditions are satisfied.
  • the number of paging requests dispatched to one destination BS node over one paging interval is controlled such that each generated transport-layer message does not result in a packet size exceeding a limitation value as required by the IP-based communication network.
  • transmission of paging requests by the GW node is scheduled such that the number of paging requests sent out by the GW node per one paging interval does not exceed a first pre-determined maximum value for limiting paging traffic.
  • the number of BS nodes to receive paging requests over one paging interval is controlled to be not greater than a second pre-determined maximum value for reducing the total number of transport-layer messages per paging interval.
  • Each of the embodiments of the disclosed method is implementable in a GW node comprising a transceiver and one or more computing processors.
  • FIG. 1 depicts, in accordance with an exemplary embodiment of the present invention, a flowchart illustrating a method for paging a UE with a goal of reducing paging traffic and improving transport-layer efficiency in communication between a GW node and plural BS nodes.
  • FIG. 2 depicts, in accordance with one embodiment of the present invention, a sub-process of buffering a new paging request to an outgoing queue and determining destination BS nodes to receive the new paging request, where a prioritization effect is provided such that a paging request having a higher likelihood of successfully getting a response from the target UE identified therein may be broadcast by a destination BS node earlier than another paging request having a lower likelihood.
  • FIG. 3 depicts, in accordance with one embodiment of the present invention, a sub-process of updating the outgoing queue at each paging interval with any paging request not yet transmitted in the previous paging interval and left in an outgoing buffer.
  • FIG. 4 depicts, for illustration, a situation in which a GW node implements the disclosed method.
  • a “user equipment” i.e. UE is a mobile communication device or a mobile station that wirelessly communicates with a BS for data transmission.
  • a UE may be a mobile computing device such as a smart phone or a notebook computer. Since a wireless communication system is desired to page the UE through the BS, the UE is a device registered with the wireless communication system.
  • a “node” in a wireless communication system means a device, or a system having plural devices, comprising one or more communication interfaces for communicating with other devices or UEs, and one or more computing processors/servers for performing computation and control tasks. Furthermore, the node is characterized by performing a specific function in the wireless communication system.
  • a GW node refers to a GW.
  • One communication interface of the GW node is an IP-enabled port for communicating with other IP-enabled devices in the packet CN of the wireless communication system, such as a mobility management entity (MME) .
  • MME mobility management entity
  • a BS node refers to a BS.
  • a “tracking area” i.e. TA) means a cluster of BSs where the BSs are arranged to collectively take an action in tracking a location of a UE.
  • a “most-recently visited BS” of a UE is, among all BSs in the wireless communication system, the latest BS that the UE established a communication link with.
  • a “most-recently visited TA” of a UE is the TA that includes the most-recently visited BS of the UE.
  • a “queue” is interpreted in the sense of computing, and is a collection of entities kept in order.
  • the queue has a front end and a rear end. The entity positioned at the front end has a higher priority of being retrieved or extracted from the queue than the one positioned at the rear end does.
  • both of the terms “paging request” and “paging message” bear the same meaning, and mean a data message having information that identifies a target UE to be paged. These two terms are used interchangeably herein.
  • both of the terms “femtocell” and “small cell” bear the same meaning. These two terms are used interchangeably herein.
  • the present invention is not limited only to a wireless communication system compliant to a LTE specification.
  • the present invention is applicable to any wireless communication system having a GW node communicating with plural BS nodes via an IP-based communication network.
  • a significant amount of paging traffic appears on the links between a GW node and BS nodes. Since there are a large number of paging messages sent from the GW node to the BS nodes, especially in the presence of small cells, there are also a large number of transport-layer messages generated. In particular, an excessively large number of transport-layer messages give rise to a paging storm. The presence of a large number of transport-layer messages appeared over a short time increases the likelihood of packet loss.
  • SCTP Stream Control Transmission Protocol
  • the GW node and the receiver namely, a BS node
  • windowing prevents message flooding, network congestion is experienced, thus increasing latency in message transmission. It is advantageous to improve transport-layer efficiency so as to reduce the likelihood of, or even preventing, the occurrence of paging storm.
  • An aspect of the present invention is to provide a method for paging UEs in a wireless communication system with a goal of reducing paging traffic and improving transport-layer efficiency.
  • the wireless communication system comprises a GW node and plural BS nodes communicable with the GW node via an IP-based communication network.
  • the GW node and at least one of the BS nodes may be a femtocell GW and a femtocell BS, respectively.
  • the GW node is arranged to receive paging requests from elsewhere in the system such as a MME.
  • the method is exemplarily illustrated as follows with an aid of FIG. 1, which depicts a flowchart showing a process flow of the method. The steps disclosed herein in the method are performed by the GW node.
  • the GW node creates a cache map at start-up, or updates the cache map afterwards, where the cache map comprises entries each for caching a selected UE and either a BS node or a TA most-recently visited by the selected UE.
  • the TA is a subset of the BS nodes.
  • the function of the cache map is to record UEs and their most-recently visited BS nodes or most-recently visited TAs, enabling the GW node to track the locations of a certain number of UEs.
  • an outgoing queue is used for storing the received paging requests.
  • the new paging request is buffered into the outgoing queue unless the outgoing queue has already contained a paging request having the target UE same as the target UE identified by the new paging request (step 120) .
  • the GW node determines one or more destination BS nodes to which the new paging request is to be sent (step 130) .
  • the cache map can be advantageously used in determining the one or more destination BS nodes and limiting the number of the determined destination BS nodes, thereby allowing the paging traffic to be reduced. If the target UE identified by the new paging request is already cached by the cache map, the one or more destination BS nodes are determined to be the subset of the BS nodes corresponding to the most-recently visited TA, or corresponding to the TA that includes the most-recently visited BS node.
  • dispatch of the paging requests to the determined destination BS nodes is periodically performed with a period of a pre-determined time duration, which is herein referred to as a paging interval.
  • the paging interval is suggested to be no more than one second. This is mainly for controlling the latency to dispatch paging messages to be less than 1 second and for performance measurement purpose. Typically, one second is used for statistical purpose, e.g. 100 paging messages per second.
  • the GW node periodically updates the outgoing queue every paging interval.
  • the outgoing queue is updated with any paging request not yet transmitted in the previous paging interval and left in an outgoing buffer (step 150) .
  • the outgoing queue is further reorganized such that plural paging requests therein to be sent to the same destination BS node are located and grouped as one cluster in the outgoing queue for easy retrieval.
  • the GW node extracts some or all of the paging requests from the outgoing queue and transmits the extracted paging requests to respective destination BS nodes (step 160) .
  • the transmission is arranged such that the following four conditions are satisfied.
  • paging requests to be sent to the same destination BS node are grouped into one batch in generating a transport-layer payload according to a transport-layer protocol in order to reduce the number of generated transport-layer messages when compared to sending the paging requests individually.
  • the transport-layer protocol employed by the LTE system for data communication between the GW node and any BS node is the SCTP, so that the transport-layer payload is a SCTP payload.
  • the SCTP has a provision known as piggybacking for grouping the paging requests destined to the same destination BS node with a result that the number of resultant SCTP messages is reduced. This reduction is advantageously utilized in a direct reduction of paging traffic.
  • Another advantage of having less number of SCTP messages is that the windowing/congestion control overhead experienced at the transport layer is reduced, further reducing the paging traffic as well as improving the transmission efficiency.
  • the GW node controls the number of paging requests dispatched to one destination BS node over one paging interval such that each generated transport-layer message does not result in a packet size exceeding a limitation value as required by the IP-based communication network.
  • the maximum packet size allowable to transmit on a TCP/IP network at present is 1500 bytes, and thus each transport-layer message is required to be limited to a packet size of less than or equal to 1500 bytes.
  • the GW node schedule its transmission of paging requests such that the number of paging requests sent out by the GW node per one paging interval does not exceed a first pre-determined maximum value for limiting paging traffic.
  • the transport-layer protocol is the SCTP as in the LTE system, preferably this maximum value is determined in order to avoid triggering the aforesaid window size adjustment algorithm at the GW node.
  • the GW node controls the number of BS nodes to receive paging requests over one paging interval to be not greater than a second pre-determined maximum value.
  • the aim of this limitation is to reduce the total number of transport-layer messages per paging interval, thereby limiting the paging traffic.
  • any paging request not yet transmitted due to satisfying the aforementioned four conditions are left over in the outgoing buffer.
  • such left-over paging request (s) are to be used in updating the outgoing sequence in the step 150 in the next paging interval.
  • the GW node determines whether or not one or more UEs respond to the paging requests broadcast by the one or more destination BS nodes over radio coverage areas thereof.
  • the GW node removes one or more paging requests in the outgoing queue where the target UE identified in each of the one or more paging requests is the responding UE (step 180) .
  • the cache map is updated with information on the BS node or the TA most-recently visited by the responding UE (step 190) .
  • a paging request having a higher likelihood of successfully getting a response from the target UE identified therein is broadcast by a destination BS node earlier than another paging request having a lower likelihood.
  • This prioritization has an effect that the response is obtained in an earlier time, so that the remaining paging requests directed to page the same target UE but not yet broadcast by other destination BSs can be removed from the outgoing queue in an earlier time too, thereby reducing the paging traffic.
  • FIG. 2 is a flowchart showing an embodiment of the steps 120 and 130 of buffering the new paging request to the outgoing queue and determining destination BS nodes to receive the new paging request, further achieving the aforesaid prioritization.
  • a check is performed to determine if the target UE identified in the new paging request is already recorded in the outgoing queue (step 210) . If the outgoing queue already has a record of paging this target UE, the new paging request is not duplicated in the outgoing queue. Otherwise the one or more destination BS nodes for the new paging request are determined (step 215) based on the approach as detailed above.
  • step 215 whether the cache map has a record of a BS node or a TA most-recently visited by the target UE becomes known. If the cache map has this record, then insert the new paging request to the front of the outgoing queue (step 230) , else insert the new paging request to the end of the outgoing queue (step 240) .
  • FIG. 3 depicts a flowchart showing an embodiment of realizing the step 150 of updating the outgoing sequence.
  • a step 310 is used to check if the outgoing buffer has one or more paging requests not yet transmitted in the previous paging interval. If the outgoing buffer is not empty, then each not-yet-transmitted paging request is examined and its destination BS node is considered. In a step 320, another check is performed to find out if the outgoing queue has at least one paging request to be sent to the same destination BS node as the not-yet-transmitted paging request.
  • step 330 locate all the paging requests having the same destination BS nodes in the outgoing queue, and group these paging requests with the non-yet-transmitted paging request together in a cluster. If not, then create a new paging request for the not-yet-transmitted paging request and append the newly-created paging request to the end of the outgoing queue (step 340) .
  • FIG. 4 depicts a situation that a GW node 410 is configured to implement an embodiment of the disclosed method.
  • the GW node 410 is configured to communicate with plural BS nodes 470 via an IP-based communication network 480, and comprises a transceiver 420 and one or more computing processors 430.
  • the transceiver 420 is configured to receive paging requests from a packet CN 460, each paging request including information for identifying a target UE to be paged.
  • the one or more computing processors 430 are configured to execute a paging-preparation process for generating transport-layer payloads of paging requests to be delivered.
  • the transceiver 420 is further configured to transmit the transport-layer payloads to respective destination BS nodes 470.
  • the paging-preparation process is configured to perform computing and controlling functions as set forth in any of the embodiments of the method disclosed herein.
  • DSP digital signal processors
  • ASIC application specific integrated circuits
  • FPGA field programmable gate arrays

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé pour réduire un trafic de radiomessagerie entre une passerelle (GW) et plusieurs stations de base (BS) lors d'un contact par radiomessagerie d'équipements utilisateurs (UE). Une carte de cache, qui enregistre des BS les plus récemment visitées d'UE sélectionnés, est utilisée pour limiter le nombre de BS dans la radiomessagerie de chaque UE sélectionné, ce qui réduit ainsi le trafic de radiomessagerie. En outre, des demandes de radiomessagerie envoyées vers le même nœud de BS sont regroupées en un lot par la génération d'une charge utile de couche de transport, ce qui réduit le nombre de messages de couche transport générés. Lorsqu'elles sont utilisées dans un système LTE, des demandes de radiomessagerie annexes telles que fournies par le SCTP réduisent le trafic de radiomessagerie et un fenêtrage/un surdébit de commande de congestion au niveau de la couche de transport. L'efficacité de transmission est ainsi améliorée. En outre, le nombre de demandes de radiomessagerie envoyées par le nœud GW pour un intervalle de radiomessagerie est commandé pour ne pas être supérieur à une valeur maximale prédéterminée pour limiter davantage le trafic de radiomessagerie pour éviter l'apparition d'une tempête de radiomessagerie.
PCT/CN2015/095980 2015-11-30 2015-11-30 Procédé et nœud de passerelle pour réduire un trafic de radiomessagerie dans un système de communication sans fil WO2017091942A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2015/095980 WO2017091942A1 (fr) 2015-11-30 2015-11-30 Procédé et nœud de passerelle pour réduire un trafic de radiomessagerie dans un système de communication sans fil
CN201580001525.XA CN105493561B (zh) 2015-11-30 2015-11-30 用于降低无线通信系统中的寻呼通信量的方法和网关节点

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/095980 WO2017091942A1 (fr) 2015-11-30 2015-11-30 Procédé et nœud de passerelle pour réduire un trafic de radiomessagerie dans un système de communication sans fil

Publications (1)

Publication Number Publication Date
WO2017091942A1 true WO2017091942A1 (fr) 2017-06-08

Family

ID=55678534

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/095980 WO2017091942A1 (fr) 2015-11-30 2015-11-30 Procédé et nœud de passerelle pour réduire un trafic de radiomessagerie dans un système de communication sans fil

Country Status (2)

Country Link
CN (1) CN105493561B (fr)
WO (1) WO2017091942A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100165917A1 (en) * 2006-09-13 2010-07-01 Panasonic Corporation Base station apparatus, access gateway apparatus, communication control system and communication control method
US20100255841A1 (en) * 2009-04-03 2010-10-07 Hitachi, Ltd. Wireless communication system
WO2014012568A1 (fr) * 2012-07-16 2014-01-23 Telefonaktiebolaget L M Ericsson (Publ) Gestion de liste de zones de suivi
US20140155109A1 (en) * 2012-11-30 2014-06-05 Cisco Technology, Inc. Subscriber-aware paging

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100962798B1 (ko) * 2007-12-28 2010-06-09 엘지노텔 주식회사 ＷｉＭＡＸ 시스템에서의 단말 위치 등록 방법
KR101290377B1 (ko) * 2009-12-15 2013-08-07 한국전자통신연구원 초소형 가정용 기지국을 위한 페이징 관리 방법 및 시스템

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100165917A1 (en) * 2006-09-13 2010-07-01 Panasonic Corporation Base station apparatus, access gateway apparatus, communication control system and communication control method
US20100255841A1 (en) * 2009-04-03 2010-10-07 Hitachi, Ltd. Wireless communication system
WO2014012568A1 (fr) * 2012-07-16 2014-01-23 Telefonaktiebolaget L M Ericsson (Publ) Gestion de liste de zones de suivi
US20140155109A1 (en) * 2012-11-30 2014-06-05 Cisco Technology, Inc. Subscriber-aware paging

Also Published As

Publication number Publication date
CN105493561A (zh) 2016-04-13
CN105493561B (zh) 2019-02-01

Similar Documents

Publication Publication Date Title
CN110636628B (zh) 信息传输方法及装置
EP3236696B1 (fr) Procédé de recherche d'équipement utilisateur et entité de gestion de mobilité
CN101828364B (zh) 用于数据通信的方法和装置以及包括这种装置的通信系统
CN104584671B (zh) 分组移动网络中数据传输的支持
US8023433B2 (en) Relay device, wireless communication system and multicast relay method
CN114760658A (zh) 用于管理无线通信网络中的数据通信的方法和设备
US9306862B2 (en) Handling redundant data in a communication system
US20110188377A1 (en) Method and apparatus for flow control between rlc and pdcp in a communication
CN113473567A (zh) 支持数据传输的方法和设备
Huang et al. Design and performance study for a mobility management mechanism (WMM) using location cache for wireless mesh networks
CN101374350B (zh) 无线电信网络中的切换方法和装置
CN110475299A (zh) 一种切换小区的方法及装置
CN111052822B (zh) 节点设备及其控制方法、计算机可读存储介质
CN101540992A (zh) 报文转发的方法、基站和系统
EP3439269B1 (fr) Procédé et appareil de transmission de données, et dispositif de gestion de session
US9713120B2 (en) Method and a gateway node for reducing paging traffic in a wireless communication system
WO2017091942A1 (fr) Procédé et nœud de passerelle pour réduire un trafic de radiomessagerie dans un système de communication sans fil
CN106572030A (zh) 一种分布式网络中多路径发送控制方法、及系统
CN109729551B (zh) 通信方法、基站和具有储存功能的装置
CN108184265B (zh) 一种寻呼消息的发送、接收方法、网络设备及终端
Al-Samman et al. A c-ran architecture for lte control signalling
WO2024020878A1 (fr) Granularité configurable pour la mesure et le rapport de latence de transmission dans un réseau sans fil
WO2018165864A1 (fr) Procédé de transmission de données, dispositif de plan de commande et station de base
CN117880877A (zh) 测量上报的方法和设备
JP2004349811A (ja) 無線通信システム、ゲートウェイ、ノード及びアクセスノード

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 201580001525.X

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15909459

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15909459

Country of ref document: EP

Kind code of ref document: A1