CN104244430A - Rapid scheduling method - Google Patents

Rapid scheduling method Download PDF

Info

Publication number
CN104244430A
CN104244430A CN201310231337.9A CN201310231337A CN104244430A CN 104244430 A CN104244430 A CN 104244430A CN 201310231337 A CN201310231337 A CN 201310231337A CN 104244430 A CN104244430 A CN 104244430A
Authority
CN
China
Prior art keywords
scheduling request
request resources
serving cell
fast dispatch
scheduling
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.)
Granted
Application number
CN201310231337.9A
Other languages
Chinese (zh)
Other versions
CN104244430B (en
Inventor
李庆华
余晓东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Potevio Institute of Technology Co Ltd
Original Assignee
Potevio Institute of Technology Co Ltd
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 Potevio Institute of Technology Co Ltd filed Critical Potevio Institute of Technology Co Ltd
Priority to CN201310231337.9A priority Critical patent/CN104244430B/en
Publication of CN104244430A publication Critical patent/CN104244430A/en
Application granted granted Critical
Publication of CN104244430B publication Critical patent/CN104244430B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention discloses a rapid scheduling method. The rapid scheduling method includes the steps that a scheduling request resource, special for rapid scheduling, of a cell is allocated by the serving cell to UE in advance, wherein the scheduling request resource special for rapid scheduling is one of 8*N scheduling request resources included in every N frames, the N is larger than or equal to four and smaller than or equal to 3+K, the N is larger than or equal to M, the K is the number of transmission termination signals needing to be continuously received when authorization of the rapid scheduling request resource of the UE is closed, the M is the number of adjacent cells of networking, the scheduling request resources, special for rapid scheduling, of the adjacent cells in every N frames are different, and frames occupied by the scheduling request resources, special for rapid scheduling, in two sets of adjacent N frames, of the serving cells are the same; after the UE receives a rapid scheduling downlink starting command, a scheduling request is transmitted to a base station on the scheduling request resource, special for rapid scheduling, of the serving cell of the UE, and uplink transmission authorization is carried out on the UE through the base station according to the scheduling request. Scheduling locking can be avoided by means of the rapid scheduling method.

Description

Fast dispatch method
Technical field
The present invention relates to mobile communication technology, particularly relate to a kind of fast dispatch method.
Background technology
LTE230 system is a kind of wireless communication system of the applicable private network cluster transmission based on TD-LTE framework structure.This system has done part orientation optimizes for the needs of national grid, farthest can meet the business need of power load monitoring system, simultaneously for the planning of national grid next generation network provides solid technological accumulation and Applied D emonstration.
Fig. 1 is TD-LTE230 network architecture schematic diagram.In the channel relatively flat of the orthogonal multi-sub carrier transmission uniqueness of LTE230 system inherited OFDM and the smaller advantage of the intersymbol interference of channel, innovatively play the expansibility of OFDMA system, frequency selectivity, dispatching flexibility etc., and creationaryly absorbing carrier aggregation, the advanced communication theory such as frequency spectrum perception, constitutes low-power consumption of new generation, high spectrum utilization, the multi-business communication system flexibly of high reliability.
Dispatch request (Schedule Request) is used for asking uplink shared channel resources to be used for sending upstream data.If UE has data arrive and do not have ascending resource, then trigger a dispatch request and start to monitor PDCCH, before obtaining distributing the mandate of UL-SCH resource for new data transmission, UE initiates SR request by all resource locations can initiating SR.
In LTE230 system, for high-priority users, same UE is equivalent to 40 radio frames at 1s() in have twice chance to send SR; For domestic consumer, same UE in 1s once chance can send SR.In UE terminal for switching institute's object and in the Measuring Time section of carrying out, UE can not initiate dispatch request.
When carrying out transfer resource configuration, LTE230 system, by according to the priority of user and the importance of business, carries out work by different user equipment allocation to different frequencies respectively.Usual UE resides at a certain frequency, and monitors various information, after user receives schedule information, receives corresponding control information by the position of specifying.If there is existing working service on that frequency, then user will be communicated to other frequency by fast dispatch, cannot listen to the content of original monitoring frequency in other frequency.
LTE230 system, the UPpts position on each subband is assigned to the position of SR request, and this position produces 8 Preamble by cyclic shift.The feature of this Preamble is: completely orthogonal between (1) sequence, can walk abreast and send simultaneously, and recipient detects correlated series successively by sequence is relevant.(2) after this sequence carries out half cyclic shift, possess certain orthogonality to existing sequence, after relevant to other sequence, correlation peak is lower.
In order to prevent the interference of adjacent cell, every 8 25ms frame small areas can be assigned to the transmission that a uplink pilot time slot (UpPts) carries out SR, and each community is carried out sending in which radio frames can be calculated by the mode of frame number mould 8.Like this, will mean that 8 25ms frames can be distributed to 8 communities respectively and dispatch.Each community uses 1 frame in every 8 25ms frames, as the SR resource of this community.
A SR resource combines by time and lead code Preamble the resource information jointly limited, the different terminals of same community will distribute different SR resources, essence is for they distribute different Preamble codes, these SR resources are by the UpPts of corresponding same number of frames, but the Preamble code of correspondence is different, therefore essence is for they distribute different Preamble codes.Owing to can produce 8 mutually orthogonal Preamble as described previously by cyclic shift, therefore will there be 8 SR resources a community in every 8 25ms frames.So accumulative 8 communities, in 8 25ms frames, will have 64 SR resources.And in 1s in, equivalence always has 320 SR resources for all 8 communities.
In order to improve the utilance of resource, avoid the UE of idle condition to take a certain resource for a long time, LTE230 system introduces terminal discontinuous reception (DRX) mechanism.Under this mechanism, UE, when carrying out transfer of data with network, needs first to be waken up it by network, and then carries out corresponding transfer of data.Appointment is used for the particular frame waking UE up by this mechanism, is in terminal in dormancy and receives indication information for waking up at this particular frame, determine whether self is waken up, if be not waken up, then stopped receiving, enter dormancy according to this indication information.If after terminal or base station data end of transmission, will the transmission ending signal (ending BSR) specified number be sent, and represent and be in closed condition; Recipient receives ending BSR, will know and be in complete state.After ending BSR transmission number reaches specified quantity, the frequency resource mandate will closed a terminal in base station; The acquiescence returning oneself is waited for frequency by terminal.The cycle that current LTE230 system sends information of waking up is a multi-frame i.e. 40 wireless frame lengths (0 ~ 39 frame), and it is the radio frames of 0 or 20 that above-mentioned particular frame is generally frame number in one-period.
Work when LTE230 system needs to wake certain UE up, and this UE place frequency by other CU time, fast dispatch mode being adopted, simplified signaling flow process, by simply specifying another one frequency, namely completing scheduling.And now UE will use the fast dispatch SR resource of its community, place of acquiescence, specified another one frequency carries out uplink communication scheduling.About the fast dispatch SR resource of this acquiescence, current LTE230 system is specified last SR resource of community, UE place in each multi-frame as fast dispatch SR resource.Based on this regulation, UE from DRX wake-up states to finally can SR request upload, maximum possible continues 38 radio frames.So, will there is the risk of scheduling deadlock, concrete reason is analyzed as follows:
Owing to introducing terminal discontinuous reception (DRX) mechanism, LIE230 system takies a certain resource for a long time by not allowing the terminal being in idle condition, can find out this feature from two descending processes of the fast dispatch terminal shown in following table 1.In descending process 1 in Table 1, in the 1st frame, base station (eNB) sends the information of waking up and DXR DCI information to UE, and UE receives this information at this frame; At the 2nd frame, base station is used by other UE due to the frequency of UE normal consistency, and sends descending unlatchings of fast dispatch to this UE and indicate, and carries out fast dispatch to start to UE; At the 3rd frame, UE sends to base station and receives the descending ACK information of opening instruction of this fast dispatch; At the 4th frame, base station sends data message to UE on PDSCH; At the 5th frame, UE is to base station feedback ACK information; At 6-9 frame, base station is transferred to UE also receiving any data from UE owing to not having data to need, and sends ending BSR continuously to UE, and UE does not arrive because the special SR resource of its operable fast dispatch also in 6-9 frame, therefore, any data cannot be sent to base station; At the 10th frame, base station then because the ending BSR sent continuously reaches specified quantity and closes the fast dispatch frequency resource mandate of UE, thus makes UE turn back in the frequency of the normal consistency of oneself at the 12nd frame.
Table 1
As can be seen here, according to current fast dispatch method, likely occur: under fast dispatch state, UE cannot send SR request, and the frequency of its normal consistency is also being used (normal position, because UE is in other frequency, cannot use) by other UE, thus cause dispatching deadlock, UE can not be worked normally.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of fast dispatch method, and the method effectively can avoid the problem of dispatching deadlock.
In order to achieve the above object, the technical scheme that the present invention proposes is:
A kind of fast dispatch method, comprising:
The scheduling request resources being exclusively used in fast dispatch of this community configures to described UE by the Serving cell of user equipment (UE) in advance; Wherein, the described scheduling request resources being exclusively used in fast dispatch is a scheduling request resources in 8 × N number of scheduling request resources of comprising of every N number of frame, 4≤N≤3+K and N >=M, the BSR ending information number received continuously is needed when K is the closedown UE fast dispatch frequency resource mandate of systemic presupposition, M is the neighbor cell number of networking, in every N number of frame, the scheduling request resources being exclusively used in fast dispatch of neighbor cell is different between two, and the frame shared by the scheduling request resources being exclusively used in fast dispatch of described Serving cell in two groups of adjacent N number of frames is identical;
After described UE receives the descending unlatching instruction of fast dispatch of base station transmission, according to the descending unlatching instruction of this fast dispatch, be exclusively used on the scheduling request resources of fast dispatch described in the Serving cell of this UE, send dispatch request to described base station, described base station carries out uplink mandate according to described dispatch request to described UE.
In sum, the fast dispatch method that the present invention proposes, by in every N number of frame for cell allocation one is exclusively used in the scheduling request resources of fast dispatch, UE make before can close its fast dispatch frequency resource mandate by base station under fast dispatch state, carry out transfer of data, thus can avoid dispatching deadlock.
Accompanying drawing explanation
Fig. 1 is TD-LTE230 network architecture schematic diagram;
Fig. 2 is the schematic flow sheet of the embodiment of the present invention one.
Embodiment
For making the object, technical solutions and advantages of the present invention clearly, the present invention is described in further detail below in conjunction with the accompanying drawings and the specific embodiments.
Core concept of the present invention is: when the special SR resource of the fast dispatch arranging community, shorten the interval time of two adjacent special SR resources of fast dispatch, make before ending BSR reaches specified quantity, the UE be waken up can carry out SR request and upload, like this, can guarantee that UE can not owing to not having the special SR resource of available fast dispatch, and cause Deadlock occurs after entering fast dispatch state.
Fig. 2 is the schematic flow sheet of the embodiment of the present invention one, and as shown in Figure 2, the fast dispatch method of this embodiment mainly comprises:
The scheduling request resources being exclusively used in fast dispatch of this community configures to described UE by the Serving cell of step 201, subscriber equipment (UE) in advance; Wherein, the described scheduling request resources being exclusively used in fast dispatch is a scheduling request resources in 8 × N number of scheduling request resources of comprising of every N number of frame, 4≤N≤3+K and N >=M, the transmission ending signal number received continuously is needed when K is the closedown UE fast dispatch frequency resource mandate of systemic presupposition, M is the neighbor cell number of networking, in every N number of frame, the scheduling request resources being exclusively used in fast dispatch of neighbor cell is different between two, and the frame shared by the scheduling request resources being exclusively used in fast dispatch of described Serving cell in two groups of adjacent N number of frames is identical.
In this step, the scheduling request resources being exclusively used in fast dispatch of this community configures to described UE by Serving cell in advance, so that after this, as system fast dispatch UE, UE can send SR request on the scheduling request resources being exclusively used in fast dispatch.Concrete Serving cell can when UE access network or UE to be in above-mentioned resource distribution when connection status starts business to UE.
Here, with existing system difference be: for a community, the scheduling request resources being exclusively used in fast dispatch will a scheduling request resources being had as this community in 8 × N number of scheduling request resources that every N number of frame comprises, 4≤N≤3+K and N >=M, in addition, the frame scheduling request resources that be exclusively used in fast dispatch shared by of community in the N number of frame of two adjacent groups is identical.So, effectively can shorten two adjacent interval times being exclusively used in the scheduling request resources of fast dispatch, N number of frame is defined as by this interval, and owing to needing the BSR ending number received continuously when K is closedown UE fast dispatch frequency resource mandate, 3+K is that base station wakes UE up to the shortest time sending enough BSRending information closedown UE fast dispatch frequency resource mandates, therefore, by making N≤3+K, make every N number of 25ms frame, there is a fast dispatch SR resource community, thus UE makes before can close its fast dispatch frequency resource mandate by base station under fast dispatch state, carry out transfer of data, thus can Avoid deadlock problem occur.
Preferably, when needing the continuous BSR ending information number received to be 5 when closing UE fast dispatch frequency resource mandate, described N can be set to 7 or 8.
In actual applications, in 8 × N number of scheduling request resources that every N number of frame comprises, for the scheduling request resources that is exclusively used in fast dispatch is distributed in Serving cell, be to one that selects the scheduling request resources of this Serving cell from system configuration.Along with the difference of network system, system may be different to the method for Serving cell configuration schedules request resource, such as, following two kinds of methods can be adopted to realize.
Method one, when system utilizes different frames to distinguish different communities, in 8 × N number of scheduling request resources that every N number of frame comprises, frame corresponding to the scheduling request resources that each community takies is by difference, that is, in 8 × N number of scheduling request resources that every N number of frame comprises, the scheduling request resources of described Serving cell takies different frames from the scheduling request resources of the adjacent area of this Serving cell.
Preferably, when employing method one is configured the scheduling request resources of community, the value of the cell id mould N of Serving cell can be adopted to determine the frame that the scheduling request resources of this Serving cell takies.Accordingly, this Serving cell is exclusively used in frame number corresponding to the scheduling request resources of fast dispatch is also the value of the cell id mould N of Serving cell.
Method two, when system utilizes different orthogonal sequences to distinguish different communities, in 8 × N number of scheduling request resources that every N number of frame comprises, different scheduling request resources in each frame are by orthogonal sequences corresponding different respectively, accordingly, these scheduling request resources will configure to different communities.Like this, the scheduling request resources of Serving cell takies different orthogonal sequences from the scheduling request resources of the adjacent area of this Serving cell.
Preferably, the numbering of the orthogonal sequence that the value of cell id mould N can be taken as the scheduling request resources of community.Accordingly, the value being numbered the cell id mould N of Serving cell of orthogonal sequence that takies of the scheduling request resources of Serving cell.
Preferably, when adopting method two to be configured the scheduling request resources of community, for ease of realizing, the scheduling request resources being exclusively used in fast dispatch of different districts can be made to take identical frame, that is, being exclusively used in the scheduling request resources of fast dispatch and will taking identical frame with the scheduling request resources being exclusively used in fast dispatch of the adjacent area of this Serving cell of Serving cell.
Step 202, receive after descending unlatchings of fast dispatch that base station sends indicate as described UE, according to the descending unlatching instruction of this fast dispatch, be exclusively used on the scheduling request resources of fast dispatch described in the Serving cell of this UE, send dispatch request to described base station, described base station carries out uplink mandate according to described dispatch request to described UE.
The same existing system of specific implementation of this step, does not repeat them here.
In sum, these are only preferred embodiment of the present invention, be not intended to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (6)

1. a fast dispatch method, is characterized in that, comprising:
The scheduling request resources being exclusively used in fast dispatch of this community configures to described UE by the Serving cell of user equipment (UE) in advance, wherein, the described scheduling request resources being exclusively used in fast dispatch is a scheduling request resources in 8 × N number of scheduling request resources of comprising of every N number of frame, 4≤N≤3+K and N >=M, the transmission ending signal BSR ending number received continuously is needed when K is the closedown UE fast dispatch frequency resource mandate of systemic presupposition, M is the neighbor cell number of networking, in every N number of frame, the scheduling request resources being exclusively used in fast dispatch of neighbor cell is different between two, frame shared by the scheduling request resources being exclusively used in fast dispatch of described Serving cell in two groups of adjacent N number of frames is identical,
After described UE receives the descending unlatching instruction of fast dispatch of base station transmission, according to the descending unlatching instruction of this fast dispatch, be exclusively used on the scheduling request resources of fast dispatch described in the Serving cell of this UE, send dispatch request to described base station, described base station carries out uplink mandate according to described dispatch request to described UE.
2. method according to claim 1, is characterized in that, in 8 × N number of scheduling request resources that every N number of frame comprises, the scheduling request resources of described Serving cell takies different frames from the scheduling request resources of the adjacent area of this Serving cell.
3. method according to claim 1, is characterized in that, in 8 × N number of scheduling request resources that every N number of frame comprises, the frame number that the scheduling request resources being exclusively used in fast dispatch of described Serving cell is corresponding is the value of the cell id mould N of Serving cell.
4. method according to claim 1, it is characterized in that, in 8 × N number of scheduling request resources that every N number of frame comprises, the scheduling request resources of described Serving cell takies different orthogonal sequences from the scheduling request resources of the adjacent area of this Serving cell, and the scheduling request resources of fast dispatch that is exclusively used in of described Serving cell takies identical frame with the scheduling request resources being exclusively used in fast dispatch of the adjacent area of this Serving cell.
5. method according to claim 4, is characterized in that, in 8 × N number of scheduling request resources that every N number of frame comprises, and the value being numbered the cell id mould N of Serving cell of the orthogonal sequence that the scheduling request resources of described Serving cell takies.
6. method according to claim 1, is characterized in that, described N equals 7 or 8.
CN201310231337.9A 2013-06-09 2013-06-09 Fast dispatch method Expired - Fee Related CN104244430B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310231337.9A CN104244430B (en) 2013-06-09 2013-06-09 Fast dispatch method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310231337.9A CN104244430B (en) 2013-06-09 2013-06-09 Fast dispatch method

Publications (2)

Publication Number Publication Date
CN104244430A true CN104244430A (en) 2014-12-24
CN104244430B CN104244430B (en) 2017-11-24

Family

ID=52231544

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310231337.9A Expired - Fee Related CN104244430B (en) 2013-06-09 2013-06-09 Fast dispatch method

Country Status (1)

Country Link
CN (1) CN104244430B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106856627A (en) * 2016-12-21 2017-06-16 国网四川省电力公司眉山供电公司 It is adapted to the SR collocation methods of fast dispatch
CN107018574A (en) * 2017-04-28 2017-08-04 国网浙江省电力公司宁波供电公司 A kind of SR channels of communication system
CN108494537A (en) * 2018-02-26 2018-09-04 北京国电通网络技术有限公司 Uplink scheduling request resource allocation method and device applied to fast dispatch
CN108574559A (en) * 2017-03-13 2018-09-25 电信科学技术研究院 A kind of transmission method and device
WO2018201488A1 (en) * 2017-05-05 2018-11-08 Zte Corporation Methods and apparatus for configuring a scheduling request

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101945401A (en) * 2009-07-03 2011-01-12 中兴通讯股份有限公司 System and method for preventing terminal measuring and scheduling conflict
WO2011127435A1 (en) * 2010-04-08 2011-10-13 Qualcomm Incorporated Separate resource partitioning management for uplink control and uplink data signals
CN102457895A (en) * 2010-11-01 2012-05-16 中兴通讯股份有限公司 Method and device for feeding back BSR (Buffer Status Reports)
CN103052095A (en) * 2011-10-11 2013-04-17 普天信息技术研究院有限公司 Spectrum sensing method and system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101945401A (en) * 2009-07-03 2011-01-12 中兴通讯股份有限公司 System and method for preventing terminal measuring and scheduling conflict
WO2011127435A1 (en) * 2010-04-08 2011-10-13 Qualcomm Incorporated Separate resource partitioning management for uplink control and uplink data signals
CN102457895A (en) * 2010-11-01 2012-05-16 中兴通讯股份有限公司 Method and device for feeding back BSR (Buffer Status Reports)
CN103052095A (en) * 2011-10-11 2013-04-17 普天信息技术研究院有限公司 Spectrum sensing method and system

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106856627A (en) * 2016-12-21 2017-06-16 国网四川省电力公司眉山供电公司 It is adapted to the SR collocation methods of fast dispatch
CN106856627B (en) * 2016-12-21 2020-05-26 国网四川省电力公司眉山供电公司 SR configuration method suitable for fast scheduling
CN108574559A (en) * 2017-03-13 2018-09-25 电信科学技术研究院 A kind of transmission method and device
CN108574559B (en) * 2017-03-13 2021-03-30 电信科学技术研究院 Transmission method and device
CN107018574A (en) * 2017-04-28 2017-08-04 国网浙江省电力公司宁波供电公司 A kind of SR channels of communication system
CN107018574B (en) * 2017-04-28 2020-12-25 国网浙江省电力公司宁波供电公司 SR channel of communication system
WO2018201488A1 (en) * 2017-05-05 2018-11-08 Zte Corporation Methods and apparatus for configuring a scheduling request
US11653364B2 (en) 2017-05-05 2023-05-16 Zte Corporation Methods and apparatus for configuring a scheduling request
CN108494537A (en) * 2018-02-26 2018-09-04 北京国电通网络技术有限公司 Uplink scheduling request resource allocation method and device applied to fast dispatch

Also Published As

Publication number Publication date
CN104244430B (en) 2017-11-24

Similar Documents

Publication Publication Date Title
US9769753B2 (en) Communication device and communication method as well as communication system
US20200015312A1 (en) Method and device for determining discontinuous reception configuration
CN102204392B (en) Method and device for use of off period of drx for direct peer to peer communication in a cell
CN110267329A (en) It is saved for the received power of channel state information reference signals
US9544816B2 (en) Combined frame of two communication protocols on same carrier for machine-to-machine and for broadband communication
CN103168501B (en) Method and apparatus for performing network entry/reentry in wireless communication system
CN104641706B (en) Wireless communications method, wireless communication system, wireless terminal and wireless base station
CN105210403A (en) Method for enhancing small cell
CN102088775A (en) Method, system and device for distributing contention resources
CN102883439B (en) The communication means of broadband terminal in discrete spectrum communication system
US20210337467A1 (en) User equipment involved in transmitting ue assistance information
CN104936294A (en) Cellular communication and Device-to-Device (D2D) communication coexisting method, system and device
CN105474590A (en) Infrastructure equipment, wireless communications network and method
CN111865536B (en) Search space monitoring and configuration method and device
CN105935001A (en) Redundant scheduling information for direct communication
CN104244430A (en) Rapid scheduling method
CN103428874A (en) Data scheduling method and device
Kai et al. Energy-efficient sensor grouping for IEEE 802.11 ah networks with max-min fairness guarantees
JP7207527B2 (en) Communications system
US20230319830A1 (en) Communication system
CN105357744B (en) A kind of Stochastic accessing repeater, relay system and its trunking method
EP3142438B1 (en) Method for inter-device communications, base station, and user equipment
CN102883452A (en) Up semi-pesistent scheduling method
CN102118768A (en) Method for controlling carrier communication state in carrier aggregation system and device
Xia et al. Practical machine-type communication for energy Internet of Things: An introduction

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20171124