CN108966347B - Paging message scheduling method and device - Google Patents
Paging message scheduling method and device Download PDFInfo
- Publication number
- CN108966347B CN108966347B CN201710351992.6A CN201710351992A CN108966347B CN 108966347 B CN108966347 B CN 108966347B CN 201710351992 A CN201710351992 A CN 201710351992A CN 108966347 B CN108966347 B CN 108966347B
- Authority
- CN
- China
- Prior art keywords
- paging message
- candidate
- scheduling
- message packets
- paging
- 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.)
- Active
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a paging message scheduling method and device, relates to the technical field of communication, and aims to improve the scheduling success rate of paging messages. The scheduling method of the paging message comprises the following steps: acquiring N candidate paging message packets, wherein N is an integer greater than 0; coding the N candidate paging message packets to obtain N coded candidate paging message packets; respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets; and sending the N coded candidate paging message packets and the paging message scheduling information to a bottom layer. The invention improves the scheduling success rate of the paging message.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for scheduling paging messages.
Background
In order to meet the requirement of Internet of Things (lot Term Evolution) in the existing LTE (Long Term Evolution) cellular network, the 3GPP standards organization has proposed NB-IoT (narrow band-Internet of Things) and eMTC (enhanced Machine Type Communication) technologies, aiming at lower user equipment cost and larger coverage. A UE (User Equipment) at the cell edge needs to make up for the loss of coverage by a proper amount of repeated transmissions. Therefore, for the requirement of coverage enhancement, it is specified in the standard that each physical channel needs to be repeatedly transmitted in a plurality of consecutive subframes, so as to improve the receiving signal-to-noise ratio of the receiving end.
In the 3GPP standard, the sending mechanism of the Paging message is that the network multiplexes Paging records (Paging records) of multiple users into the same Paging message (Paging message) for scheduling. The specific implementation process is that an RRC (Radio Resource Control protocol) layer determines a target user for Paging, that is, after multiplexing a plurality of Paging records (Paging records) in the same Paging message (Paging message) to uniformly perform ans.1(Abstract Syntax Notation 1) coding, the coded result is sent to a bottom layer, that is, an RLC (Radio Link Control) layer and a MAC (Media Access Control) layer, for scheduling. For the MAC, since the Physical Control Channel (PCCH) adopts the TM mechanism, it will try to allocate a grant that can carry the coding result, so as to facilitate the non-segmented transmission of the PCCH data block. In LTE systems, at each downlink scheduling instant, the MAC finds enough resources for scheduling of the PCCH to be a problem, since the scheduling of the PCCH is always put at a high priority level.
After NB-IoT systems and eMTC techniques introduce repeated transmissions, even though the scheduling of the PCCH is always put at a high priority level, the resources at the current scheduling time may be occupied by the authorized repeated transmissions allocated at the previous scheduling time, which may result in that insufficient resources are not found at the current scheduling time for transmitting the PCCH. For the PCCH, the failure of the PCCH scheduling is caused by the inability to perform segmented transmission. And once the scheduling fails, the paging message is not sent out at the current paging moment, so that the paging opportunity is wasted.
Disclosure of Invention
In view of this, the present invention provides a method and an apparatus for scheduling a paging message to improve the success rate of scheduling the paging message.
In order to solve the above technical problem, the present invention provides a method for scheduling a paging message, including:
acquiring N candidate paging message packets, wherein N is an integer greater than 0;
coding the N candidate paging message packets to obtain N coded candidate paging message packets;
respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets;
and sending the N coded candidate paging message packets and the paging message scheduling information to a bottom layer.
Wherein the determining paging message scheduling information corresponding to the N encoded candidate paging message packets respectively includes:
respectively acquiring channel condition information of paged users corresponding to the N coded candidate paging message packets, the size of a single paging message and a demodulation threshold of successful paging;
and respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets according to the channel condition information of the paged user, the size of the single paging message and the demodulation threshold of the successful paging.
Wherein the paging message scheduling information includes: paging number, repetition times, modulation and coding strategy MCS level in the candidate paging message packet after coding;
after the determining the paging message scheduling information corresponding to the N encoded candidate paging message packets, respectively, the method further includes:
and sorting the paging message scheduling information corresponding to the N coded candidate paging message packets according to a preset sorting sequence by taking the paging number or the repetition times or the modulation and coding strategy MCS level as a basis.
Wherein, after the sending the paging message scheduling information and the encoded candidate paging message packets obtained after the acquiring N encoded candidate paging message packets to the bottom layer, the method further comprises:
receiving resource notification information of the bottom layer, wherein the resource notification information comprises the number of currently available resources determined by the bottom layer and the corresponding maximum number of times of repetition allowed to be used;
according to the resource notification information, M candidate paging message packets are obtained again, wherein M is an integer larger than 0;
coding the M candidate paging message packets to obtain M coded candidate paging message packets;
determining paging message scheduling information corresponding to the M encoded candidate paging message packets;
and sending the M coded candidate paging message packets and paging message scheduling information corresponding to the M coded candidate paging message packets to the bottom layer.
Wherein, prior to the obtaining of the N candidate paging message packets, the method further comprises:
informing the bottom layer to report the resource information;
receiving the paging resource available information reported by the bottom layer;
the acquiring of the N candidate paging message packets includes:
and obtaining N candidate paging message packets according to the paging resource available information reported by the bottom layer.
In a second aspect, an embodiment of the present invention provides a method for scheduling a paging message, including:
receiving N coded candidate paging message packets sent by a high layer and paging message scheduling information corresponding to the N coded candidate paging message packets, wherein N is an integer greater than 0;
and scheduling the paging message according to the N coded candidate paging message packets and the paging message scheduling information.
Wherein, the performing paging message scheduling according to the N encoded candidate paging message packets and the paging message scheduling information includes:
determining whether enough resources bear the corresponding candidate paging message packets according to the paging scheduling information corresponding to the N coded candidate paging message packets respectively;
if enough resources bear the corresponding candidate paging message packet, performing paging scheduling; otherwise, returning a scheduling result notice to the high layer, wherein the scheduling result notice is used for indicating that the paging message scheduling fails.
Wherein, after the paging message scheduling is performed according to the N encoded candidate paging message packets and the paging message scheduling information, the method further includes:
sending resource notification information to the high layer, wherein the resource notification information comprises the number of currently available resources and the corresponding maximum number of repetitions allowed to be used;
receiving M encoded candidate paging message packets retransmitted by the high layer according to the resource notification information and paging message scheduling information corresponding to the M encoded candidate paging message packets, wherein M is an integer greater than 0;
and scheduling the paging message according to the M coded candidate paging message packets and the paging message scheduling information corresponding to the M coded candidate paging message packets.
Before receiving the candidate paging message packets after the N codes sent by the radio resource control high layer and the paging message scheduling information corresponding to the candidate paging message packets after the N codes, the method further includes:
and reporting the available information of the paging resources to the high layer according to the notification of the high layer.
In a third aspect, an embodiment of the present invention provides a scheduling apparatus for paging messages, including:
an obtaining module, configured to obtain N candidate paging message packets, where N is an integer greater than 0;
the coding module is used for coding the N candidate paging message packets to obtain N coded candidate paging message packets;
a determining module, configured to determine paging message scheduling information corresponding to the N encoded candidate paging message packets, respectively;
and the sending module is used for sending the N coded candidate paging message packets and the paging message scheduling information to a bottom layer.
Wherein the determining module comprises:
an obtaining submodule, configured to obtain channel condition information of a paged user, a size of a single paging message, and a demodulation threshold for successful paging, which correspond to the N encoded candidate paging message packets, respectively;
and the determining submodule is used for respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets according to the channel condition information of the paged user, the size of the single paging message and the demodulation threshold of the successful paging.
Wherein the determining sub-module further comprises:
and the sequencing submodule is used for sequencing the paging message scheduling information corresponding to the N coded candidate paging message packets according to a preset sequencing sequence by taking the paging number or the repetition times or the modulation and coding strategy MCS level as a basis.
Wherein the apparatus further comprises:
a first receiving module, configured to receive resource notification information of the bottom layer, where the resource notification information includes the number of currently available resources determined by the bottom layer and a corresponding maximum number of repetitions allowed to be used;
the obtaining module is further configured to obtain M candidate paging message packets again according to the resource notification information, where M is an integer greater than 0;
the coding module is further configured to code the M candidate paging message packets to obtain M coded candidate paging message packets;
the determining module is further configured to determine paging message scheduling information corresponding to M encoded candidate paging message packets, where M is an integer greater than 0;
the sending module is further configured to send the M encoded candidate paging message packets and the paging message scheduling information corresponding to the M encoded candidate paging message packets to the bottom layer.
Wherein the apparatus further comprises:
the notification module is used for notifying the bottom layer to report the resource information;
a second receiving module, configured to receive the paging resource availability information reported by the bottom layer;
the obtaining module is specifically configured to obtain N candidate paging message packets according to the paging resource availability information reported by the bottom layer.
In a fourth aspect, an embodiment of the present invention provides an apparatus for scheduling a paging message, including:
a receiving module, configured to receive N encoded candidate paging message packets sent by a high layer and paging message scheduling information corresponding to the N encoded candidate paging message packets, where N is an integer greater than 0;
and the scheduling module is used for scheduling the paging message according to the N coded candidate paging message packets and the paging message scheduling information.
Wherein the scheduling module comprises:
a determining submodule, configured to determine whether there are enough resources to carry the corresponding candidate paging message packet according to the paging scheduling information corresponding to the N encoded candidate paging message packets, respectively;
the processing submodule is used for carrying out paging scheduling if enough resources bear the corresponding candidate paging message packet; otherwise, returning a scheduling result notice to the high layer, wherein the scheduling result notice is used for indicating that the paging message scheduling fails.
Wherein the apparatus further comprises:
a sending module, configured to send resource notification information to the high layer, where the resource notification information includes the number of currently available resources and a corresponding maximum number of repetitions allowed to be used;
the receiving module is further configured to receive M encoded candidate paging message packets that are retransmitted by the high layer according to the resource notification information, and paging message scheduling information corresponding to the M encoded candidate paging message packets, where M is an integer greater than 0;
the scheduling module is further configured to perform paging message scheduling according to the M encoded candidate paging message packets and paging message scheduling information corresponding to the M encoded candidate paging message packets.
Wherein the apparatus further comprises:
and the reporting module is used for reporting the available information of the paging resources to the high layer according to the notification of the high layer.
The technical scheme of the invention has the following beneficial effects:
in the embodiment of the invention, the high layer sends the coded candidate data packet and the corresponding paging scheduling information to the bottom layer, and the bottom layer carries out scheduling according to the paging scheduling information and the coded candidate data packet. Therefore, the bottom layer can carry out scheduling according to the paging scheduling information, the defect that paging opportunities are wasted because the paging information cannot be sent at the current paging moment in the prior art is overcome, and the scheduling success rate of the paging information is improved.
Drawings
Fig. 1 is a flowchart of a scheduling method of paging messages according to an embodiment of the present invention;
fig. 2 is a flowchart of a scheduling method of paging messages according to an embodiment of the present invention;
FIG. 3 is a flowchart of a method for scheduling paging messages according to an embodiment of the present invention;
FIG. 4 is a flowchart of a method for scheduling paging messages according to an embodiment of the present invention;
FIG. 5 is a flowchart of a method for scheduling paging messages according to an embodiment of the present invention;
fig. 6 is a schematic diagram of a paging message scheduling apparatus according to an embodiment of the present invention;
fig. 7 is a block diagram of a paging message scheduling apparatus according to an embodiment of the present invention;
fig. 8 is a block diagram of a paging message scheduling apparatus according to an embodiment of the present invention;
fig. 9 is a schematic diagram of a paging message scheduling apparatus according to an embodiment of the present invention;
fig. 10 is a block diagram of a paging message scheduling apparatus according to an embodiment of the present invention;
fig. 11 is a block diagram of a paging message scheduling apparatus according to an embodiment of the present invention;
fig. 12 is a schematic diagram of a network-side device according to an embodiment of the present invention;
fig. 13 is a schematic diagram of a network device according to an embodiment of the present invention.
Detailed Description
The following detailed description of embodiments of the present invention will be made with reference to the accompanying drawings and examples. The following examples are intended to illustrate the invention but are not intended to limit the scope of the invention.
As shown in fig. 1, the method for scheduling a paging message according to the embodiment of the present invention is applied to a higher layer, and includes:
Here, the required candidate paging message packet may be set as needed.
And 102, coding the N candidate paging message packets to obtain N coded candidate paging message packets.
Here, the manner of encoding the N candidate paging messages is not limited in the embodiment of the present invention. For example, the N candidate paging message packets may be ans.1 encoded.
And 103, respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets.
Here, the channel condition information of the paged user, the size of a single paging message, and the demodulation threshold of successful paging corresponding to the N encoded candidate paging message packets are respectively obtained, and the paging message scheduling information corresponding to the N encoded candidate paging message packets is respectively determined according to the channel condition information of the paged user, the size of the single paging message, and the demodulation threshold of successful paging.
The Channel condition information of the paged user may be obtained by performing indirect estimation on the number of times of repeated transmission and the aggregation level of an MPDCCH (MTC Physical Downlink Control Channel) of the paged user, which is recorded by a core network, or other information.
For the N encoded paging message scheduling information, in order to further improve the scheduling success rate and save resources, the paging message scheduling information corresponding to the N encoded candidate paging message packets may be sorted according to a predetermined arrangement order based on the number of pages or the number of repetitions or the MCS (Modulation and Coding Scheme) level.
For example, the pages may be first sorted in descending order by number; under the condition of the same paging number, the paging messages are arranged in ascending order according to the repetition times; when the number of repetitions is the same, the MCS levels are sorted in descending order.
And step 104, sending the N encoded candidate paging message packets and the paging message scheduling information to a bottom layer.
In the embodiment of the invention, the high layer sends the coded candidate data packet and the corresponding paging scheduling information to the bottom layer, and the bottom layer carries out scheduling according to the paging scheduling information and the coded candidate data packet. Therefore, the bottom layer can carry out scheduling according to the paging scheduling information, the defect that paging opportunities are wasted because the paging information cannot be sent at the current paging moment in the prior art is overcome, and the scheduling success rate of the paging information is improved.
On the basis of the foregoing embodiment, to further improve the scheduling success rate of the paging message, the method may further include:
and receiving resource notification information of the bottom layer, wherein the resource notification information comprises the number of currently available resources determined by the bottom layer and the corresponding maximum number of repetitions allowed to be used. And according to the resource notification information, re-acquiring M candidate paging message packets, wherein M is an integer larger than 0. And coding the M candidate paging message packets, acquiring the M coded candidate paging message packets, and determining paging message scheduling information corresponding to the M coded candidate paging message packets. And sending the M coded candidate paging message packets and paging message scheduling information corresponding to the M coded candidate paging message packets to the bottom layer.
The high layer can re-determine the candidate paging message packet and the corresponding paging message scheduling information according to the feedback of the bottom layer, thereby further improving the scheduling success rate of the paging message.
On the basis of the above embodiment, to further improve the scheduling success rate of the paging message and avoid the high-level invalid packet operation, the method may further include: and informing the bottom layer to report resource information, receiving paging resource available information reported by the bottom layer, and acquiring N candidate paging message packets according to the paging resource available information reported by the bottom layer.
As shown in fig. 2, the method for scheduling a paging message according to the embodiment of the present invention is applied to a bottom layer, and includes:
In this step, it is determined whether there are enough resources to carry the corresponding candidate paging message packet according to the paging scheduling information corresponding to the N encoded candidate paging message packets, respectively. If enough resources bear the corresponding candidate paging message packet, performing paging scheduling; otherwise, returning a scheduling result notice to the high layer, wherein the scheduling result notice is used for indicating that the paging message scheduling fails.
In the embodiment of the invention, the high layer sends the coded candidate data packet and the corresponding paging scheduling information to the bottom layer, and the bottom layer carries out scheduling according to the paging scheduling information and the coded candidate data packet. Therefore, the bottom layer can carry out scheduling according to the paging scheduling information, the defect that paging opportunities are wasted because the paging information cannot be sent at the current paging moment in the prior art is overcome, and the scheduling success rate of the paging information is improved.
On the basis of the foregoing embodiment, to further improve the scheduling success rate of the paging message, the method may further include:
sending resource notification information to the high layer, wherein the resource notification information comprises the number of currently available resources and the corresponding maximum number of times of repetition allowed to be used, and receiving M encoded candidate paging message packets which are retransmitted by the high layer according to the resource notification information and paging message scheduling information corresponding to the M encoded candidate paging message packets, wherein M is an integer greater than 0. And scheduling the paging message according to the M coded candidate paging message packets and the paging message scheduling information corresponding to the M coded candidate paging message packets.
The high layer can re-determine the candidate paging message packet and the corresponding paging message scheduling information according to the feedback of the bottom layer, thereby further improving the scheduling success rate of the paging message.
On the basis of the above embodiment, to further improve the scheduling success rate of the paging message and avoid the high-level invalid packet operation, the method may further include: and reporting the available information of the paging resources to the high layer according to the notification of the high layer.
In the embodiment of fig. 3, when the RRC layer performs paging message packet packing, N candidate paging message packets are provided, and form a paging message scheduling list to be submitted to the bottom layer for scheduling. As shown in fig. 3, the method for scheduling a paging message according to the embodiment of the present invention includes:
When the RRC layer carries out paging message packet packing, N candidate paging message packets are provided, a paging message scheduling list is formed and submitted to the bottom layer for scheduling, and N is assumed to be 3.
Here, the channel condition of the paged user is obtained, wherein the channel condition can be obtained by indirectly estimating the number of times of repeated transmission and aggregation level of the MPDCCH of the paged user recorded by the core network, or other information. And determining paging message scheduling information corresponding to the N candidate paging message packets according to the channel condition, the size of the single paging message and the demodulation threshold of successful paging. Wherein the paging message scheduling information can be implemented in the form of a paging message scheduling information list. Suppose as shown in table 1 below.
TABLE 1
In this table, "aggregation level/repetition number" of MPDCCH represents a channel condition, "paging number/repetition number/MCS level in an ans.1 encoded paging message packet" represents paging message scheduling information.
The ordering of the three dimensions of paging number, repetition times and MCS level is not limited. In this embodiment, it is assumed that the pages are first arranged in descending order according to the number of pages; under the condition of the same paging number, the paging messages are arranged in ascending order according to the repetition times; when the number of repetitions is the same, the MCS levels are sorted in descending order.
And step 304, the MAC layer carries out scheduling.
Specifically, the MAC layer tries to allocate resources one by one according to the records in the paging message scheduling list until enough resources can be found to carry a certain candidate paging message in the paging message scheduling list. If enough resources are found to bear a certain candidate paging message in the paging message scheduling list, the remaining attempts of the candidate paging message scheduling information are terminated, and the paging message scheduling list is destroyed after the scheduling is completed. If the MAC layer can not successfully schedule any record in the paging message scheduling list, the MAC layer informs the high layer of failed scheduling and destroys the paging message scheduling list.
In the embodiment of fig. 4, when the RRC layer performs paging message packet packing, N candidate paging message packets are provided and submitted to the bottom layer for scheduling; the MAC notifies the RRC layer of the scheduling result so that the RRC layer further provides a candidate paging message packet.
As shown in fig. 4, the method for scheduling a paging message according to the embodiment of the present invention includes:
Here, the channel condition of the paged user is obtained, wherein the channel condition can be obtained by indirectly estimating the number of times of repeated transmission and aggregation level of the MPDCCH of the paged user recorded by the core network, or other information. And determining paging message scheduling information corresponding to the N candidate paging message packets according to the channel condition, the size of the single paging message and the demodulation threshold of successful paging. Wherein the paging message scheduling information can be implemented in the form of a paging message scheduling information list. Suppose as shown in table 2 below.
TABLE 2
Since there is only one element in the table, it is not necessary to perform sorting according to a certain criterion based on three dimensions of paging number/repetition number/MCS level.
And step 404, the MAC layer carries out scheduling.
Specifically, the MAC layer tries to allocate resources one by one according to the records in the paging message scheduling list until enough resources can be found to carry a certain candidate paging message in the paging message scheduling list. If enough resources are found to bear a certain candidate paging message in the paging message scheduling list, the remaining attempts of the candidate paging message scheduling information are terminated, and the paging message scheduling list is destroyed after the scheduling is completed. If the MAC layer can not successfully schedule any record in the paging message scheduling list, the MAC layer informs the high layer of failed scheduling and destroys the paging message scheduling list.
TABLE 3
The ordering of the three dimensions of paging number, repetition times and MCS level is not limited. In this embodiment, it is assumed that the pages are first arranged in descending order according to the number of pages; under the condition of the same paging number, the paging messages are arranged in ascending order according to the repetition times; when the number of repetitions is the same, the MCS levels are sorted in descending order.
And the MAC tries to allocate resources one by one according to the elements in the paging message scheduling list sent again by the RRC layer until enough resources can be found to bear a certain candidate paging message in the paging message scheduling list. If enough resources are found to bear a certain candidate paging message in the paging message scheduling list, the remaining attempts of the candidate paging message scheduling information are terminated, and the paging message scheduling list is destroyed after the scheduling is completed. If the MAC layer can not successfully schedule any record in the paging message scheduling list, the MAC layer informs the high layer of failed scheduling and destroys the paging message scheduling list.
In the loop executing step 405-407, the specific loop number X may be controlled by OAM (Operation Administration and Maintenance), where X is greater than or equal to 1.
In the embodiment of fig. 5, the RRC layer notifies the MAC to report resource information before paging message packet, and then provides N candidate paging message packets to the MAC according to the report result of the MAC resource information, and submits the N candidate paging message packets to the bottom layer for scheduling.
As shown in fig. 5, the method for scheduling a paging message according to the embodiment of the present invention includes:
Here, the channel condition of the paged user is obtained, wherein the channel condition can be obtained by indirectly estimating the number of times of repeated transmission and aggregation level of the MPDCCH of the paged user recorded by the core network, or other information. And determining paging message scheduling information corresponding to the N candidate paging message packets according to the channel condition, the size of the single paging message and the demodulation threshold of successful paging. Wherein the paging message scheduling information can be implemented in the form of a paging message scheduling information list. Suppose as shown in table 4 below.
TABLE 4
The ordering of the three dimensions of paging number, repetition times and MCS level is not limited. In this embodiment, it is assumed that the pages are first arranged in descending order according to the number of pages; under the condition of the same paging number, the paging messages are arranged in ascending order according to the repetition times; when the number of repetitions is the same, the MCS levels are sorted in descending order.
And step 505, the RRC layer submits the paging message scheduling list and the corresponding ans.1 encoded paging message packet to the bottom layer, i.e., the RLC and MAC layers for scheduling.
And the MAC layer tries to allocate resources one by one according to the records in the paging message scheduling list until enough resources can be found to bear a certain candidate paging message in the paging message scheduling list. If enough resources are found to bear a certain candidate paging message in the paging message scheduling list, the remaining attempts of the candidate paging message scheduling information are terminated, and the paging message scheduling list is destroyed after the scheduling is completed. If the MAC layer can not successfully schedule any record in the paging message scheduling list, the MAC layer informs the high layer of failed scheduling and destroys the paging message scheduling list.
In the loop executing step 502-506, the specific loop time X can be controlled by OAM (Operation Administration and Maintenance), and X is greater than or equal to 1.
As shown in fig. 6, the scheduling apparatus for paging messages according to the embodiment of the present invention includes:
an obtaining module 601, configured to obtain N candidate paging message packets, where N is an integer greater than 0; an encoding module 602, configured to encode the N candidate paging message packets to obtain N encoded candidate paging message packets; a determining module 603, configured to determine paging message scheduling information corresponding to the N encoded candidate paging message packets, respectively; a sending module 604, configured to send the N encoded candidate paging message packets and the paging message scheduling information to a bottom layer.
Wherein the determining module 603 comprises:
an obtaining submodule, configured to obtain channel condition information of a paged user, a size of a single paging message, and a demodulation threshold for successful paging, which correspond to the N encoded candidate paging message packets, respectively;
and the determining submodule is used for respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets according to the channel condition information of the paged user, the size of the single paging message and the demodulation threshold of the successful paging.
Wherein the determining sub-module 603 further comprises:
and the sequencing submodule is used for sequencing the paging message scheduling information corresponding to the N coded candidate paging message packets according to a preset sequencing sequence by taking the paging number or the repetition times or the modulation and coding strategy MCS level as a basis.
As shown in fig. 7, the apparatus further includes:
a first receiving module 605, configured to receive resource notification information of the bottom layer, where the resource notification information includes the number of currently available resources determined by the bottom layer and a corresponding maximum number of repetitions allowed to be used; the obtaining module 601 is further configured to obtain M candidate paging message packets again according to the resource notification information, where M is an integer greater than 0; the encoding module 602 is further configured to encode the M candidate paging message packets to obtain M encoded candidate paging message packets; the determining module 603 is further configured to determine paging message scheduling information corresponding to M encoded candidate paging message packets, where M is an integer greater than 0; the sending module 604 is further configured to send the M encoded candidate paging message packets and the paging message scheduling information corresponding to the M encoded candidate paging message packets to the bottom layer.
As shown in fig. 8, the apparatus further includes:
a notification module 609, configured to notify the bottom layer to report resource information; a second receiving module 610, configured to receive the paging resource availability information reported by the bottom layer; the obtaining module 601 is specifically configured to obtain N candidate paging message packets according to the paging resource availability information reported by the bottom layer.
The working principle of the device according to the invention can be referred to the description of the method embodiment described above.
In the embodiment of the invention, the high layer sends the coded candidate data packet and the corresponding paging scheduling information to the bottom layer, and the bottom layer carries out scheduling according to the paging scheduling information and the coded candidate data packet. Therefore, the bottom layer can carry out scheduling according to the paging scheduling information, the defect that paging opportunities are wasted because the paging information cannot be sent at the current paging moment in the prior art is overcome, the scheduling success rate of the paging information is improved, and the paging time delay is reduced.
As shown in fig. 9, the scheduling apparatus for paging messages according to the embodiment of the present invention includes:
a receiving module 901, configured to receive N encoded candidate paging message packets sent by a high layer and paging message scheduling information corresponding to the N encoded candidate paging message packets, where N is an integer greater than 0; a scheduling module 902, configured to perform paging message scheduling according to the N encoded candidate paging message packets and the paging message scheduling information.
Wherein the scheduling module 902 comprises:
a determining submodule, configured to determine whether there are enough resources to carry the corresponding candidate paging message packet according to the paging scheduling information corresponding to the N encoded candidate paging message packets, respectively; the processing submodule is used for carrying out paging scheduling if enough resources bear the corresponding candidate paging message packet; otherwise, returning a scheduling result notice to the high layer, wherein the scheduling result notice is used for indicating that the paging message scheduling fails.
As shown in fig. 10, the apparatus further includes: a sending module 903, configured to send resource notification information to the higher layer, where the resource notification information includes the number of currently available resources and the corresponding maximum number of repetitions allowed to be used; the receiving module 901 is further configured to receive M encoded candidate paging message packets that are retransmitted by the higher layer according to the resource notification information, and paging message scheduling information corresponding to the M encoded candidate paging message packets, where M is an integer greater than 0; the scheduling module 902 is further configured to perform paging message scheduling according to the M encoded candidate paging message packets and paging message scheduling information corresponding to the M encoded candidate paging message packets.
As shown in fig. 11, the apparatus further includes: a reporting module 904, configured to report the available paging resource information to the higher layer according to the notification of the higher layer.
The working principle of the device according to the invention can be referred to the description of the method embodiment described above.
In the embodiment of the invention, the high layer sends the coded candidate data packet and the corresponding paging scheduling information to the bottom layer, and the bottom layer carries out scheduling according to the paging scheduling information and the coded candidate data packet. Therefore, the bottom layer can carry out scheduling according to the paging scheduling information, the defect that paging opportunities are wasted because the paging information cannot be sent at the current paging moment in the prior art is overcome, and the scheduling success rate of the paging information is improved.
As shown in fig. 12, the network side device according to the embodiment of the present invention includes: a processor 1200 for reading the program in the memory 1220 and executing the following processes:
a processor 1200 for reading the program in the memory 1220 and executing the following processes:
acquiring N candidate paging message packets, wherein N is an integer greater than 0, and encoding the N candidate paging message packets to acquire N encoded candidate paging message packets; respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets; the N encoded candidate paging message packets and the paging message scheduling information are transmitted to a base layer through a transceiver 1210.
A transceiver 1210 for receiving and transmitting data under the control of the processor 1200.
Where in fig. 12, the bus architecture may include any number of interconnected buses and bridges, with various circuits of one or more processors represented by processor 1200 and memory represented by memory 1220 being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 1210 may be a number of elements, including a transmitter and a transceiver, providing a means for communicating with various other apparatus over a transmission medium. The processor 1200 is responsible for managing the bus architecture and general processing, and the memory 1220 may store data used by the processor 1200 in performing operations.
The processor 1200 is responsible for managing the bus architecture and general processing, and the memory 1220 may store data used by the processor 1200 in performing operations.
The processor 1200 is further configured to obtain channel condition information of a paged user, a size of a single paging message, and a demodulation threshold for successful paging, which correspond to the N encoded candidate paging message packets, respectively; and respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets according to the channel condition information of the paged user, the size of the single paging message and the demodulation threshold of the successful paging.
The paging message scheduling information includes: paging number, repetition times, modulation and coding strategy MCS level in the candidate paging message packet after coding; the processor 1200 is further configured to rank the paging message scheduling information corresponding to the N encoded candidate paging message packets according to a predetermined ranking order based on the number of pages or the number of repetitions or the modulation and coding strategy MCS level.
The processor 1200 is further configured to receive resource notification information of the bottom layer, where the resource notification information includes the number of currently available resources determined by the bottom layer and a corresponding maximum number of repetitions allowed to be used; according to the resource notification information, M candidate paging message packets are obtained again, wherein M is an integer larger than 0; coding the M candidate paging message packets to obtain M coded candidate paging message packets; determining paging message scheduling information corresponding to the M encoded candidate paging message packets; and sending the M coded candidate paging message packets and paging message scheduling information corresponding to the M coded candidate paging message packets to the bottom layer.
The processor 1200 is further configured to notify the bottom layer to report the resource information; receiving the paging resource available information reported by the bottom layer; and obtaining N candidate paging message packets according to the paging resource available information reported by the bottom layer.
As shown in fig. 13, the network side device according to the embodiment of the present invention includes: a processor 1300, for reading the program in the memory 1320, for executing the following processes:
a processor 1300, configured to read a program in the memory 1320, and receive N encoded candidate paging message packets sent by a higher layer and paging message scheduling information corresponding to the N encoded candidate paging message packets, where N is an integer greater than 0; and scheduling the paging message according to the N coded candidate paging message packets and the paging message scheduling information.
A transceiver 1310 for receiving and transmitting data under the control of the processor 1300.
In fig. 13, among other things, the bus architecture may include any number of interconnected buses and bridges with various circuits being linked together, particularly one or more processors represented by processor 1300 and memory represented by memory 1320. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 1310 can be a number of elements including a transmitter and a transceiver that provide a means for communicating with various other apparatus over a transmission medium. The processor 1300 is responsible for managing the bus architecture and general processing, and the memory 1320 may store data used by the processor 1300 in performing operations.
The processor 1300 is responsible for managing the bus architecture and general processing, and the memory 1320 may store data used by the processor 1300 in performing operations.
The processor 1300 is further configured to determine whether there are enough resources to carry the corresponding candidate paging message packet according to the paging scheduling information corresponding to the N encoded candidate paging message packets, respectively; if enough resources bear the corresponding candidate paging message packet, performing paging scheduling; otherwise, returning a scheduling result notice to the high layer, wherein the scheduling result notice is used for indicating that the paging message scheduling fails.
The processor 1300 is further configured to send resource notification information to the higher layer, where the resource notification information includes the number of currently available resources and the corresponding maximum number of repetitions allowed to be used; receiving M encoded candidate paging message packets retransmitted by the high layer according to the resource notification information and paging message scheduling information corresponding to the M encoded candidate paging message packets, wherein M is an integer greater than 0; and scheduling the paging message according to the M coded candidate paging message packets and the paging message scheduling information corresponding to the M coded candidate paging message packets.
The processor 1300 is further configured to report the available paging resource information to the higher layer according to the notification from the higher layer.
The embodiment of the present invention further provides a computer-readable storage medium for storing a computer program, where the computer program is capable of being executed by a processor to perform the processes of the foregoing method embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be physically included alone, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device) to execute some steps of the transceiving method according to various embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (16)
1. A method for scheduling paging messages, comprising:
acquiring N candidate paging message packets, wherein N is an integer greater than 0;
coding the N candidate paging message packets to obtain N coded candidate paging message packets;
respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets;
sending the N encoded candidate paging message packets and the paging message scheduling information to a bottom layer, so that the bottom layer performs paging message scheduling according to the N encoded candidate paging message packets and the paging message scheduling information;
the determining paging message scheduling information corresponding to the N encoded candidate paging message packets respectively includes:
respectively acquiring channel condition information of paged users corresponding to the N coded candidate paging message packets, the size of a single paging message and a demodulation threshold of successful paging;
and respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets according to the channel condition information of the paged user, the size of the single paging message and the demodulation threshold of the successful paging.
2. The method of claim 1, wherein the paging message scheduling information comprises: paging number, repetition times, modulation and coding strategy MCS level in the candidate paging message packet after coding;
after the determining the paging message scheduling information corresponding to the N encoded candidate paging message packets, respectively, the method further includes:
and sorting the paging message scheduling information corresponding to the N coded candidate paging message packets according to a preset sorting sequence by taking the paging number or the repetition times or the modulation and coding strategy MCS level as a basis.
3. The method of any of claims 1-2, wherein after said sending said paging message scheduling information and said encoded obtained N encoded candidate paging message packets to the bottom layer, said method further comprises:
receiving resource notification information of the bottom layer, wherein the resource notification information comprises the number of currently available resources determined by the bottom layer and the corresponding maximum number of times of repetition allowed to be used;
according to the resource notification information, M candidate paging message packets are obtained again, wherein M is an integer larger than 0;
coding the M candidate paging message packets to obtain M coded candidate paging message packets;
determining paging message scheduling information corresponding to the M encoded candidate paging message packets;
and sending the M coded candidate paging message packets and paging message scheduling information corresponding to the M coded candidate paging message packets to the bottom layer.
4. The method of any of claims 1-2, wherein prior to said obtaining N candidate paging message packets, the method further comprises:
informing the bottom layer to report the resource information;
receiving the paging resource available information reported by the bottom layer;
the acquiring of the N candidate paging message packets includes:
and obtaining N candidate paging message packets according to the paging resource available information reported by the bottom layer.
5. A method for scheduling paging messages, comprising:
receiving N coded candidate paging message packets sent by a high layer and paging message scheduling information corresponding to the N coded candidate paging message packets, wherein N is an integer greater than 0;
scheduling the paging message according to the N coded candidate paging message packets and the paging message scheduling information;
wherein the paging scheduling information is determined by the higher layer as follows:
respectively acquiring channel condition information of paged users corresponding to the N coded candidate paging message packets, the size of a single paging message and a demodulation threshold of successful paging;
and respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets according to the channel condition information of the paged user, the size of the single paging message and the demodulation threshold of the successful paging.
6. The method of claim 5, wherein said performing paging message scheduling according to the N encoded candidate paging message packets and the paging message scheduling information comprises:
determining whether enough resources bear the corresponding candidate paging message packets according to the paging scheduling information corresponding to the N coded candidate paging message packets respectively;
if enough resources bear the corresponding candidate paging message packet, performing paging scheduling; otherwise, returning a scheduling result notice to the high layer, wherein the scheduling result notice is used for indicating that the paging message scheduling fails.
7. The method of claim 5, wherein after said paging message scheduling according to said N encoded candidate paging message packets and said paging message scheduling information, said method further comprises:
sending resource notification information to the high layer, wherein the resource notification information comprises the number of currently available resources and the corresponding maximum number of repetitions allowed to be used;
receiving M encoded candidate paging message packets retransmitted by the high layer according to the resource notification information and paging message scheduling information corresponding to the M encoded candidate paging message packets, wherein M is an integer greater than 0;
and scheduling the paging message according to the M coded candidate paging message packets and the paging message scheduling information corresponding to the M coded candidate paging message packets.
8. The method of claim 5, wherein before the receiving the paging message scheduling information corresponding to the N encoded candidate paging message packets and the N encoded candidate paging message packets sent by the higher radio resource control layer, the method further comprises:
and reporting the available information of the paging resources to the high layer according to the notification of the high layer.
9. An apparatus for scheduling paging messages, comprising:
an obtaining module, configured to obtain N candidate paging message packets, where N is an integer greater than 0;
the coding module is used for coding the N candidate paging message packets to obtain N coded candidate paging message packets;
a determining module, configured to determine paging message scheduling information corresponding to the N encoded candidate paging message packets, respectively;
a sending module, configured to send the N encoded candidate paging message packets and the paging message scheduling information to a bottom layer, so that the bottom layer performs paging message scheduling according to the N encoded candidate paging message packets and the paging message scheduling information;
wherein the determining module comprises:
an obtaining submodule, configured to obtain channel condition information of a paged user, a size of a single paging message, and a demodulation threshold for successful paging, which correspond to the N encoded candidate paging message packets, respectively;
and the determining submodule is used for respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets according to the channel condition information of the paged user, the size of the single paging message and the demodulation threshold of the successful paging.
10. The apparatus of claim 9, wherein the determination submodule further comprises:
and the sequencing submodule is used for sequencing the paging message scheduling information corresponding to the N coded candidate paging message packets according to a preset sequencing sequence by taking the paging number or the repetition times or the modulation and coding strategy MCS level as a basis.
11. The apparatus according to any one of claims 9-10, further comprising:
a first receiving module, configured to receive resource notification information of the bottom layer, where the resource notification information includes the number of currently available resources determined by the bottom layer and a corresponding maximum number of repetitions allowed to be used;
the obtaining module is further configured to obtain M candidate paging message packets again according to the resource notification information, where M is an integer greater than 0;
the coding module is further configured to code the M candidate paging message packets to obtain M coded candidate paging message packets;
the determining module is further configured to determine paging message scheduling information corresponding to M encoded candidate paging message packets, where M is an integer greater than 0;
the sending module is further configured to send the M encoded candidate paging message packets and the paging message scheduling information corresponding to the M encoded candidate paging message packets to the bottom layer.
12. The apparatus according to any one of claims 9-10, further comprising:
the notification module is used for notifying the bottom layer to report the resource information;
a second receiving module, configured to receive the paging resource availability information reported by the bottom layer;
the obtaining module is specifically configured to obtain N candidate paging message packets according to the paging resource availability information reported by the bottom layer.
13. An apparatus for scheduling paging messages, comprising:
a receiving module, configured to receive N encoded candidate paging message packets sent by a high layer and paging message scheduling information corresponding to the N encoded candidate paging message packets, where N is an integer greater than 0;
the scheduling module is used for scheduling the paging message according to the N coded candidate paging message packets and the paging message scheduling information;
wherein the paging scheduling information is determined by the higher layer as follows:
respectively acquiring channel condition information of paged users corresponding to the N coded candidate paging message packets, the size of a single paging message and a demodulation threshold of successful paging;
and respectively determining paging message scheduling information corresponding to the N coded candidate paging message packets according to the channel condition information of the paged user, the size of the single paging message and the demodulation threshold of the successful paging.
14. The apparatus of claim 13, wherein the scheduling module comprises:
a determining submodule, configured to determine whether there are enough resources to carry the corresponding candidate paging message packet according to the paging scheduling information corresponding to the N encoded candidate paging message packets, respectively;
the processing submodule is used for carrying out paging scheduling if enough resources bear the corresponding candidate paging message packet; otherwise, returning a scheduling result notice to the high layer, wherein the scheduling result notice is used for indicating that the paging message scheduling fails.
15. The apparatus of claim 13, further comprising:
a sending module, configured to send resource notification information to the high layer, where the resource notification information includes the number of currently available resources and a corresponding maximum number of repetitions allowed to be used;
the receiving module is further configured to receive M encoded candidate paging message packets that are retransmitted by the high layer according to the resource notification information, and paging message scheduling information corresponding to the M encoded candidate paging message packets, where M is an integer greater than 0;
the scheduling module is further configured to perform paging message scheduling according to the M encoded candidate paging message packets and paging message scheduling information corresponding to the M encoded candidate paging message packets.
16. The apparatus of claim 13, further comprising:
and the reporting module is used for reporting the available information of the paging resources to the high layer according to the notification of the high layer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710351992.6A CN108966347B (en) | 2017-05-18 | 2017-05-18 | Paging message scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710351992.6A CN108966347B (en) | 2017-05-18 | 2017-05-18 | Paging message scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108966347A CN108966347A (en) | 2018-12-07 |
| CN108966347B true CN108966347B (en) | 2020-12-04 |
Family
ID=64462584
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710351992.6A Active CN108966347B (en) | 2017-05-18 | 2017-05-18 | Paging message scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108966347B (en) |
Family Cites Families (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101060713B (en) * | 2006-04-20 | 2010-05-12 | 大唐移动通信设备有限公司 | A paging method and base station and terminal equipment |
| US9320016B2 (en) * | 2010-10-01 | 2016-04-19 | Mitsubishi Electric Corporation | Communication system |
| WO2013139023A1 (en) * | 2012-03-22 | 2013-09-26 | Renesas Mobile Corporation | Method and apparatus for providing enhanced initial access support for limited-bandwidth devices |
| CN103428853B (en) * | 2012-05-23 | 2017-05-03 | 电信科学技术研究院 | Method and device for paging |
| US9603163B2 (en) * | 2012-11-01 | 2017-03-21 | Lg Electronics Inc. | Method and apparatus for supporting scheduling groups of devices characteristics in a wireless communication system |
| CN105409138B (en) * | 2013-07-26 | 2018-09-25 | Lg 电子株式会社 | Send the method and its device of the signal for MTC |
| CN105659687B (en) * | 2013-08-07 | 2020-01-21 | 交互数字专利控股公司 | Coverage enhancement for low cost MTC devices in uplink/downlink decoupling scenarios |
| CN104202828B (en) * | 2014-03-21 | 2019-09-10 | 中兴通讯股份有限公司 | Control transmission, the method for reseptance, apparatus and system of information |
| US10455544B2 (en) * | 2015-01-30 | 2019-10-22 | Qualcomm Incorporated | Enhanced paging procedures for machine type communications (MTC) |
| CN106160974B (en) * | 2015-04-08 | 2020-11-24 | 中兴通讯股份有限公司 | Method and base station for realizing channel transmission |
| EP3634039B1 (en) * | 2015-04-10 | 2022-06-01 | Panasonic Intellectual Property Corporation of America | System information scheduling in machine type communication |
| EP3360379A1 (en) * | 2015-11-06 | 2018-08-15 | Sony Corporation | Communications device, infrastructure equipment, communications system and methods |
-
2017
- 2017-05-18 CN CN201710351992.6A patent/CN108966347B/en active Active
Non-Patent Citations (1)
| Title |
|---|
| 基于LTE-Advance是M2M通信覆盖增强和资源分配研究;秦新涛;《中国优秀硕士论文全文数据库》;20151031;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108966347A (en) | 2018-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9681427B2 (en) | Method for transmitting feedback information for downlink data, terminal, and base station | |
| CN111654917B (en) | Transmission system and method for unlicensed uplink transmission scheme | |
| US9407412B2 (en) | Method, apparatus and system for receiving and sending scheduling information | |
| CN104468030B (en) | A kind of data transmission method, user equipment and base station | |
| US10805947B2 (en) | Method for uplink packet scheduling and device thereof | |
| EP2858443B1 (en) | Data transmission method, base station, and user equipment | |
| WO2017193890A1 (en) | Method for transmitting harq feedback information, ue unit, base station, and system | |
| CN103069906B (en) | Use the method based on the resource area transmitting data of competition and equipment in the wireless network | |
| CN110583074B (en) | URLLC support using two radio resource pools | |
| EP3476068B1 (en) | Enhanced feedback signalling | |
| CN111566972B (en) | Method for indicating time slot format of UE group in cell of base station, user equipment and base station | |
| CN105050189A (en) | Wireless resource scheduling method and relevant equipment | |
| US20210037520A1 (en) | Method for Reporting Channel Status and Device | |
| HUE035350T2 (en) | Reducing decoding processing for searching for the pdcch | |
| EP3439211A1 (en) | Method, device, and computer storage media for transmitting signals | |
| CN111447048A (en) | Data transmission method, equipment and system | |
| CN107370570B (en) | Feedback information transmission method, UE, base station and system | |
| US10512064B1 (en) | Allocating wireless communication link resources in a control channel | |
| US11050541B2 (en) | Feedback information processing method, device and system, base station and terminal | |
| CN111092695A (en) | Retransmission number determination method, indication method, device, terminal, communication node, and medium | |
| EP3496480B1 (en) | Method, apparatus and system for sending control information | |
| CN108464043B (en) | Paging with optimized transmission resources in mobile networks | |
| CN108631927B (en) | Information transmission method and device | |
| EP3910840A1 (en) | Multi-stage scheduling | |
| KR102690501B1 (en) | Scheduling method, device, base station, terminal, and computer-readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| CP01 | Change in the name or title of a patent holder | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210603 Address after: 100085 1st floor, building 1, yard 5, Shangdi East Road, Haidian District, Beijing Patentee after: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| TR01 | Transfer of patent right |