CN104244423B - Timeslot scheduling algorithm based on wireless sensor network multi-path transmission - Google Patents
Timeslot scheduling algorithm based on wireless sensor network multi-path transmission Download PDFInfo
- Publication number
- CN104244423B CN104244423B CN201410519888.XA CN201410519888A CN104244423B CN 104244423 B CN104244423 B CN 104244423B CN 201410519888 A CN201410519888 A CN 201410519888A CN 104244423 B CN104244423 B CN 104244423B
- Authority
- CN
- China
- Prior art keywords
- node
- entry
- tree
- path
- time slot
- 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.)
- Expired - Fee Related
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 37
- 238000010586 diagram Methods 0.000 claims abstract description 28
- 238000000034 method Methods 0.000 claims abstract description 18
- 238000004891 communication Methods 0.000 claims description 15
- 239000002699 waste material Substances 0.000 description 5
- 238000005457 optimization Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000004080 punching Methods 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of timeslot scheduling algorithm based on wireless sensor network multi-path transmission, this method includes：Communicated for primary network, corresponding routing diagram G is generated according to network topology Gg(Vg, Eg), according to routing diagram building topology tree T, each node includes an entry in topological tree；Topological tree T, generation path tree T are begun stepping through from the root node of topological trees；Travel through Ts, calculate for each entry and store the number of plies.Path optimizing tree, obtain path optimizing tree To.Travel through To, carry out time slot distribution.If time slot scheduling is limited, limited timeslot scheduling is carried out.The link scheduling not conflicted in different paths in same time slot, is passed through the virtual shared Optimized Operation for realizing time slot of the same time slot of the link pair that do not conflict by this programme.Real-time, the validity of timeslot scheduling are ensure that by scheme of the present invention, while avoids the interference problem in transmission.
Description
Technical field
The present invention relates to field of wireless communication, is adjusted more particularly to the time slot based on wireless sensor network multi-path transmission
Spend algorithm.
Background technology
WSNs (Wireless Sensor Networks, wireless sensor network) is the important composition portion of computer network
Point, be made up of the microsensor node of substantial amounts of low cost, low-power consumption, by communication form multi-hop from
Organize network.Terminal node is responsible for the object information of collection physical world (such as：Temperature, humidity, light intensity etc.), then data are converged
It is poly- to send to server.
TDMA (Time Division Multiple Access, time division multiple access) agreement is wireless sensor network
The important technical protocol of middle access control layer, time slot distribution play vital effect in TDMA agreements.The distribution of time slot
The order transmitted in multihop network is determined, this will directly affect the time delay of data transfer.Meanwhile the transmission of multipath is when causing
Gap scheduling problem becomes more complicated, is to distribute corresponding time interval resource per paths to cause the waste of the communication resource, seriously
Influence the time delay of data transfer.
Accordingly, it is desirable to provide a kind of timeslot scheduling method, to overcome communication resource waste in the prior art, during data transfer
The problem of prolonging.
The content of the invention
The technical problem to be solved in the present invention is to provide a kind of wireless sensor network multichannel suitable for centralized management
The timeslot scheduling algorithm of footpath transmission, for the multi-path transmission machine based on TDMA access protocols and Internet of centralized management
System, proposes real-time time slot Optimization scheduling algorithm, so as to save Internet resources, improves the real-time of network transmission.
In order to solve the above technical problems, the present invention uses following technical proposals.
Timeslot scheduling algorithm based on wireless sensor network multi-path transmission, this method include：
For wireless sensor network G (V, E), node in network is by destination node (being usually gateway), gradually
Network is added, each new node chooses one or more nodes and adds network as the father node of oneself, so as to ensure data
The redundancy of transmission path, there is provided the support of multi-path transmission.Node selection has been added to the neighbor node of routing diagram as father
Node, the number of father node can be one or more.The selection of father node can combine practical communication demand and link circuit condition
Carry out, such as selected according to parameters such as hop count, link reliabilities.For multi-path transmission, during actual transmissions, number
A paths can be only used according to bag actual transmissions, and the link in different paths will not produce transmission collision.Therefore, according to link
Order of transmission, the link that do not conflict in different paths can share same time slot, and link punching will not be also produced in transmitting procedure
It is prominent.The step of this method, includes：
The first step, based on the routing diagram G in networkg(Vg, Eg), a topological tree T is initially set up, wherein each tree node
Including an entry, the entry is made up of Level, Lchild, Ldata, Rdata and Rchild, and wherein Lchild points to left son
Node, Ldata record the node number of the node, and Rchild points to right child node, and Rdata records the node number of the node.Topology
In tree, it is identical with Rdata that Level is defaulted as 0, Ldata acquiescences.
Second step, whole topological tree is traveled through, first child node is begun stepping through from root node.In ergodic process, if tree
There are other child nodes on dry node, then the Rdata for being pointed to node is changed to the trunk node, and Rchild points to other sub- sections
Point, so as to obtain path tree Ts。
3rd step, traverse path tree Ts, calculate for each node and store the number of plies.
4th step, path optimizing tree, each layer is begun stepping through from number of plies highest entry, searches for each entry, if
The low entry of the number of plies is identical with the Ldata and Rdata of the high entry of the number of plies, then the entry can be placed in the entry phase high with the number of plies
Same one layer, so as to obtain path optimizing tree To。
5th step, traversal tree ToIt is that the entry of the identical number of plies distributes same time slot since the low entry of the number of plies；It is same
In individual time slot, receiving node is the Ldata in entry, and corresponding sending node is sensing this destination node；In same time slot
Send to receive and no number is limited.
6th step, the limited timeslot scheduling of time slot.If the available number of time slot of the transmitting and scheduling is limited, then high
It will be cut out in the number of plies of timeslot number, obtain limited path tree Tm.Then from the high entry traversal tree T of the number of pliesmIf should
Entry is leaf node and Ldata is not destination node, then the entry will be deleted.
Beneficial effects of the present invention are as follows：
Technical scheme of the present invention, based on the figure routing plan for supporting multipath, is led to using the management structure of centralization
Foundation and successive optimization path tree are crossed, so as to obtain corresponding timeslot scheduling scheme, improves the utilization rate of Internet resources, at the same it is right
Multi-path transmission provides support.
Brief description of the drawings
The embodiment of the present invention is described in further detail below in conjunction with the accompanying drawings；
Fig. 1 shows the schematic diagram of time slot distribution in the prior art；
Fig. 2 shows the schematic diagram of network topology in the embodiment of the present invention；
Fig. 3 shows the schematic diagram of the figure route based on the network topology in the embodiment of the present invention；
Fig. 4 shows path tree T schematic diagrames in the embodiment of the present invention；
Fig. 5 shows path tree T in the embodiment of the present inventionsSchematic diagram；
Fig. 6 shows the path tree T in the embodiment of the present invention with the number of pliessSchematic diagram；
Fig. 7 shows path optimizing tree T in the embodiment of the present inventionoSchematic diagram；
Fig. 8 shows the schematic diagram after dispatching algorithm optimization in the embodiment of the present invention；
Fig. 9 shows the limited path tree T described in the embodiment of the present inventionmSchematic diagram；
Figure 10 shows the timeslot scheduling algorithm based on wireless sensor network multi-path transmission described in the embodiment of the present invention
Schematic diagram.
Embodiment
The present invention is described further with reference to one group of embodiment and accompanying drawing.
Time interval resource scheduling problem needs Internet and data link layer to together decide on, specific to implement to need succession.
Internet is to provide routing diagram by figure route for a pair of communication nodes, source node or destination node first, and the routing diagram specifies
The available neighbor node of next-hop, data link layer is the corresponding time interval resource of each jump scheduling afterwards.Supporting multihop routing
Network in, time interval resource scheduling need to consider routing order problem, otherwise can influence its real-time.In radio sensing network,
Multipath is the important technology for improving network reliability.However, all distribute phase if every paths of source node data transmission
The time interval resource answered, due to packet, for actual transmissions only with a paths, most Internet resources will be by end to end
Waste.Such resource scheduling scheme not only increases the time delay of data transfer, and reduces the scalability of network, limitation
Network size.
As shown in figure 1, network support multi-path transmission, the node in path has one or more next-hop nodes.Work as section
After point sends failure to next-hop node, redundancy next-hop is selected to be retransmitted；If node is sent all to all next-hops
After failure, then packet bust this；If data link layer distributes corresponding time interval resource meeting to all communication links
Cause largely to waste.During actual transmissions, packet actual transmissions can only use a paths, in different paths
Link will not produce transmission collision.Therefore, according to link transmission order, the link that do not conflict in different paths can be shared same
Time slot, link conflict will not be also produced in transmitting procedure.
The present invention is optimized scheduling to the whole network resource by the webserver, is reduced section using the network structure of centralization
The point amount of calculation of itself.Network topology is represented that wherein V is the set of nodes by G (V, E), and E is communication link in network
Set.Server is according to network topology and link performance, generation routing diagram Gg(Vg, Eg).Node selection in routing diagram one
Or multiple father nodes add network, therefore support multi-path transmission.The present invention is according to routing diagram GgCorresponding timeslot scheduling is generated,
Different from tradition corresponding time slot is distributed for each of the links.A time slot can simultaneously be distributed to and multiple will not produced in the present invention
The communication pair of conflict, so as to improve the utilization rate of time slot.
As shown in Fig. 2 being a network topology example provided in an embodiment of the present invention, embodiment provides source node S and arrived
Destination node D dispatching algorithm process.
Step 1, as shown in figure 3, according to network topology generate node S to node D routing diagram.Using node D as initial section
Point, the node in network gradually add network.First, nodes of the C as first addition network, it is father node to select D；F makees
For the node of second addition network, it is father node to select C, D, by that analogy.Node selects to have been added to the neighbours of routing diagram
For node as father node, the number of father node can be one or more.The selection of father node can combine practical communication demand
Carried out with link circuit condition, such as selected according to parameters such as hop count, link reliabilities.As shown in figure 3, network is opened up in embodiment
Flutter the corresponding routing diagram G of generationg(Vg, Eg)。
Step 2, as shown in figure 4, being based on routing diagram Gg, corresponding network topology can generate topological tree T.In topological tree
Each entry has five parts：(Level, Lchild, Ldata, Rchild, Rdata), wherein Lchild point to left child node,
Ldata records the node number of the node, and Rchild points to right child node, and Rdata records the node number of the node.In accompanying drawing 3
Shown, Ldata and Rdata acquiescences are identical in entry, and Level is defaulted as 0.The root entry of topological tree for communication source node, entry
Ldata is the next-hop node of the entry interior joint in next pointed entry, and multi-path transmission supports there is one or more
Individual next-hop node.
Step 3, as shown in figure 5, traversal topological tree T, generation path tree Ts.First next-hop is begun stepping through from root node
Node, its Lchild point to the node, and next-hop node continues to travel through its first next-hop node, and now the path is defaulted as
Optimal path.In ergodic process, Lchild points to points to redundant path compared with shortest path, Rchild.Therefore, when node has under redundancy
One when jumping, and the Rdata of its entry pointed to still saves as the node number, and Rchild points to redundancy next-hop, until all next
Jump is traversed, as shown in Figure 4.S has two next-hop nodes of B, E, and wherein B is more excellent node, therefore S Lchild is pointed to
Node B, while still memory node S, its Rchild point to node E to the Rdata in B entries.Due to node E be S last
Next-hop node, therefore Rdata and Ldata is all E.If S still has a redundancy next-hop, E Rdata is still S, and Rchild
Point to redundancy next-hop.
Step 4, as shown in fig. 6, traverse path tree TsCalculated for each node and store the number of plies.
Step 5, as shown in fig. 7, path optimizing tree, obtain path optimizing tree To.Begun stepping through from number of plies highest entry
Each layer, search for each entry.If the low entry of the number of plies is identical with the Ldata and Rdata of the high entry of the number of plies, this
Mesh can be placed in one layer of the entry identical high with the number of plies, so as to obtain path optimizing tree To.In figure, C to D transmission is the 3rd
Layer, layer 5, layer 6 have, and in practical communication, packet can only select a link.Unnecessary scheduling meeting wastes network
Resource, and increase communication contention aware.Therefore, C to D transmission, which can merge, is placed on layer 6.
Step 6, as shown in figure 8, traversal tree To, carry out time slot distribution.It is the identical number of plies since the low entry of the number of plies
Entry distributes same time slot.In same time slot, receiving node is the Ldata in entry, and corresponding sending node is sensing
This destination node.Send to receive in same time slot and no number is limited.In time slot 1, receiving node is in Level1
Node B, sending node are node S corresponding to the Lchild of the sensing entry.Equally in time slot 5, receiving node Level5
In node C, sending node is node F, E corresponding to pointing to the Lchild of these entries, therefore has two pairs of transmissions to connect in time slot 5
Receipts pair, F to C and E to C.
The limited scheduling of step 7, time slot.If the available number of time slot of the transmitting and scheduling is limited, then higher than when
The number of plies of gap number will be cut out, and obtain limited path tree Tm.Then from the high entry path tree T of the number of pliesmIf the entry
It is not destination node for leaf node and Ldata, then the entry will be deleted.In figure, the transmission is limited only with 5 time slots
Complete to dispatch, the entry of layer 6 will be deleted in topological tree T.Then begun stepping through from layer 5, wherein four entries
It is leaf entry, the Ldata of two entries is not D, is deleted.The 4th layer is traveled through therewith, and only two entries are leaf bar
Mesh and Ldata is D, therefore need not delete.By that analogy, as shown in figure 9, qualified entry in path tree is deleted,
Then repeat step 5, limited path tree T is optimizedm, further according to step 6, carry out time slot distribution.
In summary, technical scheme of the present invention is using the management structure of centralization, the figure road based on support multipath
By scheme, by foundation and successive optimization path tree, so as to obtain corresponding timeslot scheduling scheme, the utilization of Internet resources is improved
Rate, while provide support to multi-path transmission；Scheduling to multi-path transmission optimizes, and improves its real-time and expansible
Property, while multi-path transmission is supported well.
Obviously, the above embodiment of the present invention is only intended to clearly illustrate example of the present invention, and is not pair
The restriction of embodiments of the present invention, for those of ordinary skill in the field, may be used also on the basis of the above description
To make other changes in different forms, all embodiments can not be exhaustive here, it is every to belong to this hair
Row of the obvious changes or variations that bright technical scheme is extended out still in protection scope of the present invention.
Claims (7)
- Include being based on network topology 1. based on the timeslot scheduling method of wireless sensor network multi-path transmission, the step of this method Generate corresponding routing diagram；According to the routing diagram, building topology tree T, including：Based on the routing diagram in network, a topological tree T is initially set up, its In each tree node include an entry, the entry by Level, Lchild, Ldata, Rdata and Rchild composition, wherein Lchild points to left child node, and Ldata records the node number of the node, and Rchild points to right child node, and Rdata records the node Node number, topological tree T root entry is communication source node, and Ldata is in the entry in next entry pointed by entry The next-hop node of node；Topological tree T, generation path tree T are begun stepping through from the root node of topological trees, and utilize path tree TsCalculated for each node And the number of plies is stored, including：First next-hop node is begun stepping through from root node, its Lchild points to the node, next-hop section Point continues to travel through its first next-hop node, and now the path is defaulted as optimal path；In ergodic process, Lchild point to compared with Shortest path, Rchild point to redundant path；When node has redundancy next-hop, the Rdata of its entry pointed to still saves as the section Period, Rchild points to redundancy next-hop, until all next-hops are traversed；Traverse path tree TsCalculated for each node And store the number of plies；Path optimizing tree Ts, obtain path optimizing tree To, including：Each layer is begun stepping through from number of plies highest entry, search is each Individual entry, if the number of plies it is low entry it is identical with the Ldata and Rdata of the high entry of the number of plies, the entry can be placed in and layer One layer high of entry identical of number, so as to obtain path optimizing tree To；Path optimizing tree ToIt is that the entry of the identical number of plies distributes same time slot since the low entry of the number of plies.
- 2. timeslot scheduling method according to claim 1, it is characterised in that described that corresponding road is generated based on network topology The step of by scheming, includesServer generates routing diagram according to network topology；Using destination node as start node, the node in network sequentially adds network；New node selection has been added to the neighbor node of routing diagram as father node, and the number of father node can be one or more It is individual.
- 3. timeslot scheduling method according to claim 2, it is characterised in that the selection of the father node is needed by practical communication Summation link circuit condition is selected.
- 4. timeslot scheduling method according to claim 1, it is characterised in that multi-path transmission supports have under one or more One hop node.
- 5. timeslot scheduling method according to claim 4, it is characterised in that the generation path tree TsThe step of includeIf node has the 3rd redundant node, the Rdata of redundancy next-hop also saves as the node number, and Rchild points to the 3rd Individual redundant node.
- 6. timeslot scheduling method according to claim 4, it is characterised in that in the same time slot, in entry Ldata is receiving node, and corresponding sending node is sensing this destination node.
- 7. timeslot scheduling method according to claim 1, it is characterised in that the algorithm further comprise time slot by limited time Scheduling, the step includeIf the available number of time slot of the transmitting and scheduling is limited, then the number of plies higher than timeslot number will be cut out, and be obtained Limited path tree Tm；The entry path tree T high from the number of pliesmBegin stepping through, if the entry is leaf node and Ldata is not destination node, The entry will be deleted；Qualified entry in path tree is deleted, then optimizes limited path tree Tm, carry out time slot distribution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410519888.XA CN104244423B (en) | 2014-09-30 | 2014-09-30 | Timeslot scheduling algorithm based on wireless sensor network multi-path transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410519888.XA CN104244423B (en) | 2014-09-30 | 2014-09-30 | Timeslot scheduling algorithm based on wireless sensor network multi-path transmission |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104244423A CN104244423A (en) | 2014-12-24 |
| CN104244423B true CN104244423B (en) | 2018-01-30 |
Family
ID=52231541
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410519888.XA Expired - Fee Related CN104244423B (en) | 2014-09-30 | 2014-09-30 | Timeslot scheduling algorithm based on wireless sensor network multi-path transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104244423B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP6535387B2 (en) | 2015-04-15 | 2019-06-26 | ノキア ソリューションズ アンド ネットワークス オサケユキチュア | Self-organizing network concept for small cell backhaul |
| CN108092732B (en) * | 2017-12-30 | 2019-07-30 | 迈锐数据（北京）有限公司 | A kind of slot allocation method and device |
| CN114374647B (en) * | 2021-11-30 | 2023-03-14 | 北京交通大学 | Planning method and device for time-sensitive service flow and route combined scheduling |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1984001A (en) * | 2006-05-01 | 2007-06-20 | 华为技术有限公司 | Method for sharing group-broadcasting tree time gap in automatic-exchange light network |
| CN101132351A (en) * | 2006-08-21 | 2008-02-27 | 北京邮电大学 | Wireless sensor network path establishing method and device thereof |
| CN101977414A (en) * | 2010-11-11 | 2011-02-16 | 聂菊根 | Simultaneous transmission slot time distribution method of wireless sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6954449B2 (en) * | 2002-01-10 | 2005-10-11 | Harris Corporation | Method and device for establishing communication links and providing reliable confirm messages in a communication system |
-
2014
- 2014-09-30 CN CN201410519888.XA patent/CN104244423B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1984001A (en) * | 2006-05-01 | 2007-06-20 | 华为技术有限公司 | Method for sharing group-broadcasting tree time gap in automatic-exchange light network |
| CN101132351A (en) * | 2006-08-21 | 2008-02-27 | 北京邮电大学 | Wireless sensor network path establishing method and device thereof |
| CN101977414A (en) * | 2010-11-11 | 2011-02-16 | 聂菊根 | Simultaneous transmission slot time distribution method of wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| A source Aware Scheduling Algorithm for Time-Optimal Convergecast;Jing Zhao, Yajuan Qin, Dong Yang, Ying Rao;《International Journal of Distributed Sensor Networks》;20140630;全文 * |
| 基于路由树的多信道多跳无线传感器网络资源分配算法;杨彦红，张晓彤，张学颖;《北京邮电大学学报》;20140430;第37卷(第2期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104244423A (en) | 2014-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102769885B (en) | Method for realizing routing in sensor network and sensor network | |
| CN106375231A (en) | Flow switching method, device and system | |
| Jain et al. | Viro: A scalable, robust and namespace independent virtual id routing for future networks | |
| CN102185749B (en) | Method for avoiding routing loop by adopting tree topology relationship | |
| CN101401360A (en) | Tree-guided distributed link state routing method | |
| CN102971988A (en) | Alternate down paths for directed acyclic graph (DAG) routing | |
| Tareq et al. | Mobile ad hoc network energy cost algorithm based on artificial bee colony | |
| CN101420445A (en) | Fast routing protocol of wireless sensor network | |
| JP5943431B2 (en) | Network, data transfer node, communication method and program | |
| CN102447686A (en) | Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application | |
| CN104883304B (en) | For part entangled quantum to the method for routing of bridge communications network | |
| CN109246624A (en) | A kind of multicast forward method and relevant device | |
| CN103986661B (en) | A kind of multicast route method for supporting network code | |
| CN102143546B (en) | Method for reducing redundant routing packet in tree ZigBee network | |
| Ee et al. | Practical Data-Centric Storage. | |
| CN104580165A (en) | Cooperative caching method in intelligence cooperative network | |
| CN102572994A (en) | Wireless self-organizing network fusing routing generation method based on node characteristics | |
| CN104244423B (en) | Timeslot scheduling algorithm based on wireless sensor network multi-path transmission | |
| CN103297342A (en) | Energy-saving ZigBee network tree topology formation method | |
| CN108684063A (en) | A kind of on-demand routing protocol improved method based on network topology change | |
| CN109788521B (en) | WSN clustering routing method based on weighted optimization tree | |
| JP5868551B2 (en) | Wireless communication system and wireless communication method | |
| CN102098729A (en) | Construction method and related packet forwarding method for tree backbone structure in wireless network | |
| CN108924055B (en) | A kind of name data network multi-broadcast routing method based on steiner tree | |
| CN102573000A (en) | Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20141224 Assignee: BEIJING SHEENLINE TECHNOLOGY Co.,Ltd. Assignor: Beijing Jiaotong University Contract record no.: 2016990000185 Denomination of invention: Wireless sensor network based multi-path transmission time slot scheduling algorithm License type: Common License Record date: 20160505 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| 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: 20180130 |