CN101835233A - Wireless sensor network oriented random route selecting method - Google Patents
Wireless sensor network oriented random route selecting method Download PDFInfo
- Publication number
- CN101835233A CN101835233A CN 201010128999 CN201010128999A CN101835233A CN 101835233 A CN101835233 A CN 101835233A CN 201010128999 CN201010128999 CN 201010128999 CN 201010128999 A CN201010128999 A CN 201010128999A CN 101835233 A CN101835233 A CN 101835233A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- ready
- information
- sending
- 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
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a wireless sensor network oriented random route selecting method. A network consists of a sensor node and a convergent node, which both store topology information of the network. The random route selecting method comprises the following steps that: (1), the network randomly selects a node ready for sending a data packet from the network; (2), the node ready for sending the data packet selects a next hop node receiving the data packet from the next hop nodes which have the minimum distance from the node ready for sending the data packet by comparing the hop numbers of shortest routes from the next hop nodes to the convergent node with the shortest routes from the node ready for sending the data packet to the convergent node, if the selected next hop node is the convergent node, step (4) is carried out, otherwise step (3) is carried out; (3), the data packet is sent to the selected next hop node, and step (2) is carried out by taking the next hop node as the node ready for sending the data packet in the selection of the next route; and (4), the convergent node receives the data packet and random route selection is completed.
Description
Technical field
The present invention relates to a kind of random route selecting method towards wireless sensor network, particularly a kind of in wireless sensor network, based on the jumping figure of sensor node, select the method for route at random apart from the shortest path of aggregation node.
Background technology
Compressed sensing (Compressed Sensing) is an emerging signal processing technology in recent years, its core concept is that data sampling and compression merging are carried out, the non-self-adapting linear projection (measured value) of acquired signal at first, then according to corresponding restructing algorithm by the measured value release signal.Compressed sensing has the basic demand of two aspects: the sparse property of signal, the non-correlation of observation base (observing matrix) and transform-based (transformation matrix).For natural any signal, all there is a specific representation space, make this signal have sparse property in this space.Prove through correlation theory, random matrix, promptly element is the matrix of random number, has good non-correlation with the transform-based of fixing.
The mathematical principle of compressed sensing is: the conversion coefficient of vector signal X on orthogonal transform base Ψ of establishing length and be N is sparse, that is: raw information X is one dimension N * 1 vector, X ∈ R
N, there is a N * N transformation matrix Ψ, X=Ψ P, wherein P also is one dimension N * 1 vector, makes P have sparse property.The sparse property of signal is meant that K＜N claims that then this vector is that K-is sparse if the number of nonzero term is K in the vector.
With with the incoherent observing matrix Φ of transform-based Ψ raw information being carried out linear transformation, observing matrix Φ is the matrix of a M * N, Φ ∈ R
M * N(M＜＜N), and obtain observation signal set Y, promptly
Y＝ΦX，
So Y is one dimension M * 1 vector.Known
Condition under, can utilize optimize method for solving from Y accurately or high probability ground reconstruction signal P, recover primary signal X then.
The great advantage of compressed sensing technology is and can significantly reduces resource and energy that signal consumes in data acquisition and transmission course to sample far below the sampling rate of nyquist sampling rate.With respect to the distributed source coding method that the elder generation of routine samples and afterwards compresses, the advantage of compressed sensing do not need to be any prior information of processed signal, and does not need the control information exchange.
Wireless sensor network (Wireless Sensor Network, WSN) be a multi-hop forming of the mode by radio communication and network system might self-organizing, form by a large amount of microsensor nodes that are deployed in certain surveyed area, major function is the monitoring information of perception collaboratively, collection and processing network's coverage area, and sends to observation center (aggregation node).In general, comprise the node of a large amount of extensive distributions in the wireless sensor network, so need transmission, analyze and handle lot of data.
Characteristic according to compressed sensing and wireless sensor network, the compressed sensing technology is used in the wireless sensor network, under situation without any prior information, a kind of active data blending algorithm is provided, reduce and handle the needed measured value number of mass data, the transfer of data burden in the reduction wireless sensor network and the computation complexity of data fusion.In wireless sensor network, compressed sensing is combined with network topology and route, the information of each distribution node converges in biography continuous weighting in the path of aggregation node, weighted information constitutes the observing matrix of compressed sensing Technology Need, and final aggregation node is according to each nodal information in the correct reconstructed network of observing matrix.The observing matrix that forms through route is a sparse matrix, thereby has significantly reduced the amount of calculation when aggregation node carries out signal reconstruction.
Yet, at present about compressed sensing being used for the very big defective of technology existence that wireless sensor network combines with route.In current techniques, the observing matrix that forms through existing routing technique no longer has good randomness, thus the non-correlation of observing matrix and transform-based can not be guaranteed, thereby lowered the performance of signal reconstruction in the compressed sensing greatly.How event realizes becoming the problem of needing solution badly via the randomness of the observing matrix of routing technique formation.
Summary of the invention
The purpose of this invention is to provide a kind of gradual system of selection of the route at random towards wireless sensor network, thereby realized the randomness of route, compressed sensing has been used for the stochastic problems of wireless sensor network via the observing matrix of routing technique formation thereby solve.
In wireless sensor network, the route selection method that satisfies path randomness to greatest extent should be in the Route Selection each parameter determine to be at random route selection method.In the wireless sensor network that the present invention relates to, the parameter in the Route Selection comprises that selecting which node is path starting node, and how selected node selects next-hop node, and the weight coefficient of node when sending perception data information.In route selection method of the present invention, select the sensor node of wireless sensor network to send data randomly with the probability of setting as data source, open free routing; In each paths, selected node is selected next-hop node randomly; The weight coefficient that selected node sends data is a random number of utilizing random number generator to generate, thereby can realize the randomness of route.
Specifically, the present invention realizes that the technical scheme that its purpose is taked is: should be towards the random route selecting method of wireless sensor network:
Described network is made of sensor node and an aggregation node, and described aggregation node and each sensor node all store the topology information of described network;
Comprise the steps: when carrying out the selection of described route at random
(1) to select the sensor node in the network at random with the probability of setting be the node that is ready for sending packet to described network, the information that is comprised in the packet of the node that is ready for sending packet that each is selected is the computing information of the id information of this node and this node, the product of the information of the detected object that described computing information is obtained for this node and the random number of generation;
(2) be ready for sending the next-hop node of its packet of node selective reception of packet, selected next-hop node meet the following conditions A or condition B,
Described condition A is: the distance between selected next-hop node and the described node that is ready for sending packet is minimum, and this next-hop node is identical to the jumping figure of the shortest path of aggregation node with the described node that is ready for sending packet to the jumping figure of the shortest path of aggregation node
Described condition B is: the distance between selected next-hop node and the described node that is ready for sending packet is minimum, and this next-hop node is littler by 1 to the jumping figure of the shortest path of aggregation node than the described node that is ready for sending packet to the jumping figure of the shortest path of aggregation node
The A if selected next-hop node satisfies condition, then execution in step (3); Otherwise, judge whether selected next-hop node is aggregation node:
If selected next-hop node is aggregation node, execution in step (4) then, otherwise execution in step (3);
(3) node that is ready for sending packet is sent to the next-hop node that step (2) is chosen with its packet;
This next-hop node is judged the id information that whether has this next-hop node self in the id information in this packet after receiving packet, if there is not the id information of this next-hop node self, then the computing information in the packet that the computing information of this next-hop node self is received with it is superimposed and simultaneously the id information of this next-hop node self is added in its packet that receives so that this packet that receives obtains upgrading, and the packet after this renewals is the packet that is ready for sending of this next-hop node; If there is the id information of this next-hop node self, then the packet that this next-hop node is received is as the packet that is ready for sending of this next-hop node;
Be the node execution in step (2) that is ready for sending packet in next step Path selection then with this next-hop node;
(4) aggregation node receives packet, and described Route Selection at random finishes.
Compared with prior art, the invention has the advantages that:
The present invention determines each parameter in the Route Selection randomly, wherein, the selection of path starting node is to select at random with the probability of setting, next-hop node is to select at random in satisfactory node, the weight coefficient that selected node sends data is a random number, thereby the present invention has realized Route Selection mode at random.When compressed sensing was used for described wireless sensor network, the observing matrix that generates according to this Route Selection mode at random had randomness.Have the character of good non-correlation according to random matrix and any fixed base, thereby can satisfy observing matrix and the non-correlation that is observed signal, satisfy the necessary condition that compressed sensing is effectively applied to wireless sensor network.
When having satisfied randomness, the present invention is owing to select route based on sensor node to the jumping figure of the shortest path of aggregation node, so when compressed sensing is used for wireless sensor network, the observing matrix that generates has sparse preferably property, thereby can reduce the computation complexity that aggregation node carries out data reconstruction greatly.
Description of drawings:
Fig. 1 is the topological diagram of wireless sensor network in one embodiment of the present invention;
Fig. 2 is the flow chart that the present invention is based on the random route selecting method of wireless sensor network.
Embodiment
For can explaining technical scheme of the present invention easily, below be example with wireless sensor network shown in Figure 1.Need to prove that wireless sensor network shown in Figure 1 is not the restriction to the used wireless sensor network of the present invention.
Comprise N sensor node and an aggregation node in the assumed wireless sensor network.As one embodiment of the present invention, in wireless sensor network shown in Figure 1, aggregation node is positioned at the center of sensor node institute overlay area.Certainly, wireless sensor network involved in the present invention, aggregation node can be the optional position that is positioned at sensor node institute overlay area, or is positioned at outside the sensor node institute overlay area, carries out proper communication as long as can guarantee aggregation node and each sensor node.Each sensor node all has an intrinsic id.Aggregation node and each sensor node all store the topology information of described network, therefore the topology information of network is known at aggregation node and each sensor node place, and the topology information of network comprises the id of the id of aggregation node in the network and positional information, each sensor node and positional information and each sensor node shortest path information to aggregation node.Suppose that sensor node in the network is L to the maximum to the jumping figure of the shortest path of aggregation node
MaxAccording to the jumping figure of each sensor node, wireless sensor network is divided into different zones to the shortest path of aggregation node.For ease of technical scheme of the present invention is described, can as shown in Figure 1 wireless sensor network be divided into different annular sections, make the identical sensor node of jumping figure of the shortest path that obtains aggregation node be arranged in same annular section: wherein, to the jumping figure of the shortest path of aggregation node is that 1 sensor node is arranged in the annular section nearest apart from aggregation node, claims that this annular section nearest apart from aggregation node is the 1st annular section; The sensor node that is to the jumping figure of the shortest path of aggregation node is arranged in apart from aggregation node annular section farthest, claims that this is L apart from aggregation node annular section farthest
MaxAnnular section; From the 1st annular section to L
MaxAnnular section, the sensor node that comprises in each annular section adds 1 successively to the jumping figure of the shortest path of aggregation node therebetween, and promptly the sensor node that comprises in each annular section therebetween is followed successively by 2,3 to the jumping figure of the shortest path of aggregation node ..., L
Max-1, thus claim successively therebetween each annular section be the 2nd annular section, the 3rd annular section ..., L
Max-1 annular section.So in Fig. 1, node a is in the 2nd annular section, be 2 apart from the jumping figure of the shortest path of aggregation node; Node b is in the 2nd annular section, is 2 apart from the jumping figure of the shortest path of aggregation node; Node c is in the 3rd annular section, is 3 apart from the jumping figure of the shortest path of aggregation node; Node d is in the 3rd annular section, is 3 apart from the jumping figure of the shortest path of aggregation node.
In wireless sensor network of the present invention, packet all can be by correct reception and forwarding.
Specifically, as shown in Figure 2, the present invention towards the step based on the random route selecting method of the jumping figure of shortest path of wireless sensor network is:
(1) to select the node in the network randomly with the probability of setting be the node that is ready for sending packet to network, the probability of this setting is M/N, wherein M is for satisfying the arbitrary integer of M＞KlogN, N is total number of node in the network, and K is the sparse property index of the detected object information that all nodes obtain in the network.The information that is comprised in the packet of each selected node is the id information of this node and the computing information of this node, the product of the single value of information of the detected object that described computing information is obtained for this node and the random number of generation, this random number are the random coefficients that utilizes built-in random generator to produce according to himself id information by this node;
(2) node that the is ready for sending packet next-hop node of its packet of selective reception as follows:
Suppose that this node that is ready for sending packet is positioned at L
qAnnular section, L
q∈ [1, L
Max], L
qBe positive integer, select to be ready for sending the nodal distance minimum of packet, and be positioned at L with this
qNode in the annular section or be positioned at L
qNode in-1 annular section receives the next-hop node of its packet for this.If be positioned at L
qThe node of annular section is selected to be this next-hop node, then execution in step (3); Otherwise, judge whether this selected next-hop node is aggregation node: if this selected next-hop node is aggregation node, execution in step (4) then, otherwise execution in step (3).Through planting the next-hop node selection mode of its packet of node selective reception that is ready for sending packet thus, realized selecting in the Route Selection randomness of next-hop node;
(3) node that is ready for sending packet is sent to the selected next-hop node of step (2) with its packet.
This next-hop node is judged self id that whether has this next-hop node in the id information in this packet after receiving packet, if there is not self id of this next-hop node, then the computing information in the packet that self computing information of this next-hop node is received with it is superimposed and simultaneously self id information of this next-hop node is added in its packet that receives so that this packet that receives obtains upgrading, and the packet after this renewals is the packet that is ready for sending of this next-hop node; If there is self id of this next-hop node, then the packet that this next-hop node is received is as the packet that is ready for sending of this next-hop node.
Be the node execution in step (2) that is ready for sending packet in next step Path selection then with this next-hop node;
(4) aggregation node receives packet, and described Route Selection at random finishes.
Claims (1)
1. random route selecting method towards wireless sensor network is characterized in that:
Described network is made of sensor node and an aggregation node, and described aggregation node and each sensor node all store the topology information of described network;
Comprise the steps: when carrying out the selection of described route at random
(1) to select the sensor node in the network at random with the probability of setting be the node that is ready for sending packet to described network, the information that is comprised in the packet of the node that is ready for sending packet that each is selected is the computing information of the id information of this node and this node, the product of the information of the detected object that described computing information is obtained for this node and the random number of generation;
(2) be ready for sending the next-hop node of its packet of node selective reception of packet, selected next-hop node meet the following conditions A or condition B,
Described condition A is: the distance between selected next-hop node and the described node that is ready for sending packet is minimum, and this next-hop node is identical to the jumping figure of the shortest path of aggregation node with the described node that is ready for sending packet to the jumping figure of the shortest path of aggregation node
Described condition B is: the distance between selected next-hop node and the described node that is ready for sending packet is minimum, and this next-hop node is littler by 1 to the jumping figure of the shortest path of aggregation node than the described node that is ready for sending packet to the jumping figure of the shortest path of aggregation node
The A if selected next-hop node satisfies condition, then execution in step (3); Otherwise, judge whether selected next-hop node is aggregation node:
If selected next-hop node is aggregation node, execution in step (4) then, otherwise execution in step (3);
(3) node that is ready for sending packet is sent to the next-hop node that step (2) is chosen with its packet;
This next-hop node is judged the id information that whether has this next-hop node self in the id information in this packet after receiving packet, if there is not the id information of this next-hop node self, then the computing information in the packet that the computing information of this next-hop node self is received with it is superimposed and simultaneously the id information of this next-hop node self is added in its packet that receives so that this packet that receives obtains upgrading, and the packet after this renewals is the packet that is ready for sending of this next-hop node; If there is the id information of this next-hop node self, then the packet that this next-hop node is received is as the packet that is ready for sending of this next-hop node;
Be the node execution in step (2) that is ready for sending packet in next step Path selection then with this next-hop node;
(4) aggregation node receives packet, and described Route Selection at random finishes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010128999XA CN101835233B (en) | 2010-03-19 | 2010-03-19 | Wireless sensor network oriented random route selecting method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010128999XA CN101835233B (en) | 2010-03-19 | 2010-03-19 | Wireless sensor network oriented random route selecting method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101835233A true CN101835233A (en) | 2010-09-15 |
| CN101835233B CN101835233B (en) | 2012-08-08 |
Family
ID=42719114
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010128999XA Active CN101835233B (en) | 2010-03-19 | 2010-03-19 | Wireless sensor network oriented random route selecting method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101835233B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102186186A (en) * | 2010-11-30 | 2011-09-14 | 无锡悟莘科技有限公司 | Wireless sensor network motoring method and system for infrastructure |
| WO2011144114A2 (en) * | 2011-05-27 | 2011-11-24 | 华为技术有限公司 | Method, device and system for detecting path information |
| CN104349285A (en) * | 2013-08-05 | 2015-02-11 | 诺基亚公司 | Method, apparatus, and computer program product for hop count usage in cluster selection |
| CN105682168A (en) * | 2016-03-07 | 2016-06-15 | 天津大学 | Compressible wireless multi-hop data transmission method |
| CN106413025A (en) * | 2016-10-21 | 2017-02-15 | 国网黑龙江省电力有限公司信息通信公司 | Electric vehicle charging route selection method |
| CN108462982A (en) * | 2017-02-17 | 2018-08-28 | 中移（杭州）信息技术有限公司 | A kind of method of data capture and device |
| CN110972149A (en) * | 2019-11-27 | 2020-04-07 | 河海大学 | Node optimization deployment method of circular ring type wireless sensor network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132351A (en) * | 2006-08-21 | 2008-02-27 | 北京邮电大学 | Wireless sensor network path establishing method and device thereof |
| WO2008077936A1 (en) * | 2006-12-22 | 2008-07-03 | Thales | Routing method intended for intermittently connected networks |
| CN101605337A (en) * | 2009-06-22 | 2009-12-16 | 徐坤杰 | Node energy balance optimizing method in the wireless sensor network |
| JP2010045701A (en) * | 2008-08-18 | 2010-02-25 | Central Res Inst Of Electric Power Ind | Sensor terminal arrangement supporting method for wireless sensor network and program |
-
2010
- 2010-03-19 CN CN201010128999XA patent/CN101835233B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132351A (en) * | 2006-08-21 | 2008-02-27 | 北京邮电大学 | Wireless sensor network path establishing method and device thereof |
| WO2008077936A1 (en) * | 2006-12-22 | 2008-07-03 | Thales | Routing method intended for intermittently connected networks |
| JP2010045701A (en) * | 2008-08-18 | 2010-02-25 | Central Res Inst Of Electric Power Ind | Sensor terminal arrangement supporting method for wireless sensor network and program |
| CN101605337A (en) * | 2009-06-22 | 2009-12-16 | 徐坤杰 | Node energy balance optimizing method in the wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| 《计算机学报》 20090131 陈力军， 刘 明， 陈道蓄， 谢 立 基于随机行走的无线传感器网络簇间拓扑演化 第69-76页 1 第32卷, 第1期 2 * |
| 《软件学报》 20091130 朱红松, 赵 磊, 徐勇军, 李晓维, 孙利民 基于精细梯度策略的多链路协同数据转发协议 第3045-3059 1 第20卷, 第11期 2 * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102186186B (en) * | 2010-11-30 | 2013-08-14 | 无锡悟莘科技有限公司 | Wireless sensor network motoring method and system for infrastructure |
| CN102186186A (en) * | 2010-11-30 | 2011-09-14 | 无锡悟莘科技有限公司 | Wireless sensor network motoring method and system for infrastructure |
| WO2011144114A2 (en) * | 2011-05-27 | 2011-11-24 | 华为技术有限公司 | Method, device and system for detecting path information |
| WO2011144114A3 (en) * | 2011-05-27 | 2012-04-26 | 华为技术有限公司 | Method, device and system for detecting path information |
| CN104349285B (en) * | 2013-08-05 | 2018-07-03 | 诺基亚技术有限公司 | The method, apparatus and computer program product used for the hop count in being selected in cluster |
| CN104349285A (en) * | 2013-08-05 | 2015-02-11 | 诺基亚公司 | Method, apparatus, and computer program product for hop count usage in cluster selection |
| CN105682168A (en) * | 2016-03-07 | 2016-06-15 | 天津大学 | Compressible wireless multi-hop data transmission method |
| CN106413025A (en) * | 2016-10-21 | 2017-02-15 | 国网黑龙江省电力有限公司信息通信公司 | Electric vehicle charging route selection method |
| CN106413025B (en) * | 2016-10-21 | 2019-07-26 | 国网黑龙江省电力有限公司信息通信公司 | Electric car charging route selection method |
| CN108462982A (en) * | 2017-02-17 | 2018-08-28 | 中移（杭州）信息技术有限公司 | A kind of method of data capture and device |
| CN108462982B (en) * | 2017-02-17 | 2020-09-08 | 中移（杭州）信息技术有限公司 | Data collection method and device |
| CN110972149A (en) * | 2019-11-27 | 2020-04-07 | 河海大学 | Node optimization deployment method of circular ring type wireless sensor network |
| CN110972149B (en) * | 2019-11-27 | 2021-07-02 | 河海大学 | Node optimization deployment method of circular ring type wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101835233B (en) | 2012-08-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101835233B (en) | Wireless sensor network oriented random route selecting method | |
| EP3189310B1 (en) | System and method for sensor node localization and sensor network organization based on contextual event detection | |
| Long et al. | Reliability guaranteed efficient data gathering in wireless sensor networks | |
| Cheng et al. | STCDG: An efficient data gathering algorithm based on matrix completion for wireless sensor networks | |
| Ebrahimi et al. | Compressive data gathering using random projection for energy efficient wireless sensor networks | |
| CN104618947B (en) | Dynamic clustering wireless sense network method of data capture and device based on compressed sensing | |
| Qiao et al. | Compressive data gathering based on even clustering for wireless sensor networks | |
| EP3606280A1 (en) | Method for managing a network and apparatus for implementing the same | |
| CN103906164A (en) | Maritime search and rescue wireless sensor network topology structure and topology control method thereof | |
| CN105682171A (en) | Spatio-temporal clustering method for compressive data gathering | |
| CN103889020A (en) | Wireless sensor network system based on dynamic routing and method thereof | |
| JP2021527987A (en) | Methods and equipment for managing networks | |
| CN102164395A (en) | Method for locally acquiring overall information of wireless sensor network based on compressed sensing | |
| Sun et al. | CS‐PLM: compressive sensing data gathering algorithm based on packet loss matching in sensor networks | |
| Lv et al. | A sparsity feedback-based data gathering algorithm for wireless sensor networks | |
| CN101808383B (en) | Method for selecting matrix wireless sensor network-oriented random routing | |
| CN107071800B (en) | A kind of cluster wireless sensor network method of data capture and device | |
| Amarlingam et al. | A novel low-complexity compressed data aggregation method for energy-constrained IoT networks | |
| Iyer et al. | Performance comparison of routing protocols over smart utility networks: A simulation study | |
| CN101895957B (en) | Random routing method facing matrix type wireless sensor network distribution weighing | |
| CN107743302A (en) | Rate-allocation and route combined optimization algorithm in wireless sensor network based on compressed sensing | |
| Uchida et al. | Optimal route selection method with satellite system for cognitive wireless network in disaster information network | |
| CN103237364A (en) | Integrated data gathering mechanism for wireless sensor network | |
| Birgani et al. | Mobility enhancement of patients body monitoring based on WBAN with multipath routing | |
| Mahyastuty et al. | Low energy adaptive clustering hierarchy routing protocol for wireless sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |