CN114172619A - Network communication method based on distributed batch sparse codes - Google Patents
Network communication method based on distributed batch sparse codes Download PDFInfo
- Publication number
- CN114172619A CN114172619A CN202111493095.1A CN202111493095A CN114172619A CN 114172619 A CN114172619 A CN 114172619A CN 202111493095 A CN202111493095 A CN 202111493095A CN 114172619 A CN114172619 A CN 114172619A
- Authority
- CN
- China
- Prior art keywords
- batch
- coding
- node
- code
- data packet
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000004891 communication Methods 0.000 title claims abstract description 26
- 239000011159 matrix material Substances 0.000 claims description 17
- 238000005457 optimization Methods 0.000 claims description 8
- 230000005540 biological transmission Effects 0.000 claims description 7
- 238000004806 packaging method and process Methods 0.000 claims description 3
- 241000288673 Chiroptera Species 0.000 claims 1
- 238000012546 transfer Methods 0.000 description 4
- 238000013461 design Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000002184 metal Substances 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0015—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a network communication method based on distributed batch sparse codes, which adopts a distributed batch sparse code coding method, does not need to obtain the global information of a link when selecting an inner code coding parameter, only uses the link information and the path length information, further effectively reduces the search space of NLIP problem, and realizes the improvement of network communication speed and network communication quality.
Description
Technical Field
The invention relates to the technical field of electronic information and network communication, in particular to a network communication method based on distributed batch sparse codes.
Background
Conventional network communication protocols, such as TCP/IP, are based on a layered network architecture, where the physical layer provides reliable communication for each hop, and when a packet in the physical layer cannot be decoded correctly, the packet is deleted or handled as a dropped packet. In the prior art, due to limitations in actual network communication, such as limitations on buffer sizes, encoding of limited data blocks in a physical layer cannot guarantee no packet loss, and retransmission in a link layer cannot completely eliminate packet loss.
Network coding is proposed with the aim of improving end-to-end throughput, wherein intermediate nodes can generate and send new packets instead of merely forwarding received packets. An efficient network coding scheme, such as batch sparse coding, is used.
BATched Sparse code (BATS) is an erasure code for realizing reliable end-to-end transmission of a multi-hop wireless network. The BATS code consists of an outer code and an inner code. The outer code may generate any number of batches, where each batch consists of M encoded data packets. The internal code is random linear network coding, and the internal code operation is carried out on the data packets belonging to the same batch on the source node and the intermediate node of the transmission batch. The BATS code combines the characteristics of fountain code and network coding, and has the characteristics of no code rate, low coding and decoding complexity and high throughput.
The design key point of the bat code inner code is to maximize the rank of the expected batch transfer matrix through the total number of data packets transmitted by the source node and the intermediate node, that is, the selection of the inner code encoding parameter needs to obtain global information (including global routing information and packet loss rate) to determine, and the problem of determining the inner code encoding parameter is a nonlinear integer programming (NLIP) problem, which is NP-hard under general conditions, and the problem has a large search space and long calculation time. Therefore, a better coding scheme is needed to improve the network communication efficiency.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a network communication method based on distributed batch sparse codes, when selecting inner code coding parameters, global information of a link is not required to be obtained, and the NLIP problem mentioned in the background technology is further effectively solved.
In order to achieve the purpose, the invention provides the following technical scheme: a network communication method based on distributed batch sparse codes comprises the following steps:
s1, the source node sets Ψ as (Ψ) according to the degree distribution1,…,ΨK) Determining the value of the ith batch;
s2, the source node passes the selected value diSelecting original data packet B participating in ith batch codingi；
S3, the source node selects diAn original data packet BiCarrying out external code encoding of the batch;
s4, the source node further recodes the batch of coded data packets obtained by the outer code coding into a plurality of coded data packets through random linear coding, and sends the obtained coded data packets to the next-hop intermediate node;
s5, after the intermediate node receives the coded data packet, the node network layer stores the current data packet into the coding memory;
s6, the node network layer carries out network coding on the data packets in the coding memory, and the batch is recoded into a plurality of coding data packets through random linear coding to generate the internal code coding data packets of the batch;
s7, the node network layer stores the inner code coded data packet in the sending buffer, sends the data packet to the next hop intermediate node, and repeats the steps S4 to S6 until the destination node receives the coded data packet.
Further, the number of encoded data packets in step S4 and step S6 is obtained according to a distributed batch sparse code encoding method.
Further, the distributed batch sparse code encoding method specifically comprises the following steps:
in the file transmission process, the source node uses the BATS code with the batch size of M to carry out outer code coding on K input packets, and for each batch generated by the outer code, the source node further recodes the batch into t through random linear coding1(> 0) packet, source node at t1Secondary usage link (v)1，v2) T of time-sending batch1Packaging;
at intermediate nodesConsider node vkK is more than or equal to 2 and less than or equal to l, at least one data packet is received in one batch, and t is generated by the intermediate node by using random linear codingkA packet and at tkSecondary usage link (v)k，vk+1) Transmitting the data packet;
and the node v determines the number t of the data packets generated by the coding in the batch by using an inner code rate optimization formula.
Further, the optimization formula of the inner code rate is as follows:
where k is 1, …, l, e is the packet loss rate of node v on the output link, for a given finite field
As defined below:
e＝[0，1，...，M]，h1＝[0，0，...，0，1]，h1Q＝[α0，α1，...，αM]，Q-1e＝[0，β1，β2，...，βM]T。
Q＝[qi，j]1≤i，j≤M+1is a (M +1) × (M +1) lower triangular matrix:
furthermore, the destination node decodes the received coded data packet to recover the original data packet.
The invention has the beneficial effects that: by adopting the distributed batch sparse code coding method, when the internal code coding parameters are selected, the global information of the link is not required to be obtained, and only the link information and the path length information are used, so that the NLIP problem is effectively solved, the search space of the NLIP problem is reduced, and the network communication speed and the network communication quality are improved.
Drawings
FIG. 1 is a diagram of a unicast streaming network in an embodiment of the present invention;
FIG. 2 is a flow chart illustrating the steps of the method of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The BATS code is composed of an outer code and an inner code, and it is assumed that a source node needs to send K data packets to a destination node through a wireless network, and each symbol in the data packets is a finite field F containing q elementsqOf (1). Let the integer M be more than or equal to 1 as the batch number. Outer code encoding may generate batch sequence X as followsi，i＝1，2...，Xi＝BiGiIn which B isiIs represented by dgiA matrix of columns, each representing a randomly selected original data packet, GiRepresents a dgiA fully random matrix of x M dimensions, wherein each element of the matrix is independently and identically distributed selected from a finite field Fq. The inner code coding is to carry out linear coding on the data packets in the batch, and for the ith batch, the data packet Y is codediCan be obtained by the following formula: y isi＝XiHi＝BiGiHiIn which H isiReferred to as a batch transfer matrix.
In the prior art, the design of bat code inner codes is mainly to maximize the rank of an expected batch transfer matrix through the total number of data packets transmitted by a source node and an intermediate node, that is, the selection of inner code coding parameters needs to obtain global information (including global routing information and packet loss rate) to determine, and the problem of determining the inner code coding parameters is a nonlinear integer programming (NLIP) problem, which is NP-hard under general conditions, and the problem has a large search space and long calculation time.
The communication method of the invention provides a distributed batch sparse code coding method, when selecting the inner code coding parameters, the global information of the link is not required to be obtained, thereby effectively solving the NLIP problem and overcoming the defects of the prior art. The overall technical scheme of the invention is as follows: a network communication method based on distributed batch sparse codes, as shown in fig. 2, includes the following steps:
s1, the source node sets Ψ as (Ψ) according to the degree distribution1，…，ΨK) Determining the value of the ith batch;
s2, the source node passes the selected value diSelecting original data packet B participating in ith batch codingi；
S3, the source node selects diAn original data packet BiCarrying out external code encoding of the batch;
s4, the source node further recodes the batch of coded data packets obtained by outer code coding into a plurality of coded data packets through random linear coding, the number of the coded data packets is obtained according to a distributed batch sparse code coding method, and the obtained coded data packets are sent to a next-hop intermediate node;
s5, after the intermediate node receives the coded data packet, the node network layer stores the current data packet into the coding memory;
s6, the node network layer carries out network coding on the data packets in the coding memory, the batch is recoded into a plurality of coded data packets through random linear coding, the number of the coded data packets is obtained according to a distributed batch sparse code coding method, and the internal code coded data packets of the batch are generated;
s7, the node network layer stores the inner code coded data packet into a sending buffer, sends the data packet to the next hop intermediate node, and repeats the steps S4 to S6 until the destination node receives the coded data packet;
the destination node decodes the received data packet to recover the original data packet.
The specific implementation manner of the distributed batch sparse code encoding method in steps S4 and S6 is as follows:
consider a unicast stream over a single transmission path of l hops (l ≧ 2), as shown in FIG. 1. The path consists of l +1 nodes, denoted vkWherein k is 1,2,. l +1, v1Is the source node, vl+1Is the target node. A direct communication link exists only between two consecutive nodes. Communication from a source node to a destination node therefore requires an intermediate node v2，v3，...，vl. It is assumed that one packet can be transmitted per use of the link and that the loss of packets transmitted over the link is independent. Angle oakIs a link (v)k,vk+1) The packet loss rate. Assume that a path has been established and is available during transmission.
In the file transmission process, the source node encodes K input packets by using the BATS code with the batch size of M, and for each batch generated by the external code, the source node further re-encodes the batch into t through random linear coding1(> 0) packets. Then, the source node is at the t1Secondary usage link (v)1，v2) T of time-sending batch1And (4) packaging.
Recoding at intermediate nodes can be summarized as follows. Consider node vkK is more than or equal to 2 and less than or equal to l, if at least one data packet is received in one batch, the intermediate node generates t by using random linear codingkA packet and at tkSecondary usage link (v)k，vk+1) These packets are transmitted. Otherwise, the node does not process the batch.
Since the network operations on each batch are independent, we use a generic batch to represent the recoding operation. Let XinIs a finite field FqA matrix of (2), wherein each column isNode vkReceived packets in a batch, where 1 ≦ k ≦ l, for node v1，XinBatches generated for the outer code. Then at vkThe recoding of (A) can be represented as Xout＝XinΦkWherein phikIs FqA t ofkComplete random matrix of columns, since packet loss is independent, at node vk+1The number of packets received follows a binomial distribution B (t)k,1-òk)。
Let hk＝[hk，0，hk，1，...，hk，M]Is a node vkRank distribution of batch transfer matrix, where hk，mIs that the batch is at node vkThe probability of the rank of the transition matrix being m. At the initial state, h1＝[0，…，0,1]. 1,2, 1, h for kk+1＝hkPkWherein
Is a lower triangular matrix of the matrix, and,
wherein for a given finite field Fq，
As defined below:
for a given rank distribution h on the destination nodel+1The outer code may achieve a rate that is very close to the expected rank
Where n is the number of batches transmitted on the source node. In this context, we consider the inner code parameter t1，t2，...，tlNormalized by the expected total number of packets transmitted in a batch
And (4) maximizing. Let T k1,2, the l table is link (v)k，vk+1) The number of packets of a batch transmitted.
Total number of data packets transmitted in a batch
The total communication cost of transmitting a batch of data packets in all network links is measured. Therefore, the temperature of the molten metal is controlled,
is the efficiency of the code in unit communication cost, called energy efficiency, by selecting the appropriate t1，t2，...，tlMaximizing energy efficiency. Due to the fact that
The following optimization problem can be constructed:
subject to
tk＞0，k＝1，...，l
the problem is a non-linear integer programming (NLIP) problem, which is generally NP-hard.
For k 1,2k+1And desired rank
Can be represented by the following formula:
wherein, ΛkIs a (M +1) × (M +1) diagonal matrix with eigenvalues as follows:
Q＝[qi，j]1≤i，j≤M+1is a (M +1) × (M +1) lower triangular matrix:
e＝[0，1，...，M]，h1＝[0，0，...，0，1]。
for k is more than or equal to 1 and less than or equal to l, n is more than or equal to 0 and less than or equal to tkLet us order
Let h1Q＝[α0，α1，...，αM]，Q-1e＝[0，β1，β2，...，βM]TThe optimization problem can be simplified to the following form:
subject to
tk＞0，k＝1，...，l
where k is 1, …, l, e is the packet loss rate of node v on the output link, for a given finite field
As defined below:
e＝[0，1，...，M]，h1＝[0，0，...，0，1]，h1Q＝[α0，α1，...，αM]，Q-1e＝[0，β1，β2，...，βM]T。
Q＝[qi，j]1≤i，j≤M+1is a (M +1) × (M +1) lower triangular matrix:
the distributed batch sparse code optimization method provided by the invention is characterized in that each node vkOptimizing t using only local information and calculationsk. It is assumed that each node can only know the link information of its two adjacent links, and that each node is known about the network information and other information of the BATS code. It is assumed that the packet loss rate oa of the node v on the output link can be obtained on the basis of the node feedback information on the next hop. Node v optimizes the number t of packets transmitted in its batch using the following optimization (inner code rate):
by adopting the distributed batch sparse code coding method, when the inner code coding parameters are selected, the global information of the link is not required to be obtained, and only the link information and the path length information are used, so that the search space of the NLIP problem is effectively reduced.
Although the present invention has been described in detail with reference to the foregoing embodiments, it will be apparent to those skilled in the art that various changes in the embodiments and/or modifications of the invention can be made, and equivalents and modifications of some features of the invention can be made without departing from the spirit and scope of the invention.
Claims (5)
1. A network communication method based on distributed batch sparse codes is characterized by comprising the following steps:
s1, the source node sets Ψ as (Ψ) according to the degree distribution1,…,ΨK) Determining the value of the ith batch;
s2, the source node passes the selected value diSelecting original data packet B participating in ith batch codingi；
S3, the source node selects diAn original data packet BiCarrying out external code encoding of the batch;
s4, the source node further recodes the batch of coded data packets obtained by the outer code coding into a plurality of coded data packets through random linear coding, and sends the obtained coded data packets to the next-hop intermediate node;
s5, after the intermediate node receives the coded data packet, the node network layer stores the current data packet into the coding memory;
s6, the node network layer carries out network coding on the data packets in the coding memory, and the batch is recoded into a plurality of coding data packets through random linear coding to generate the internal code coding data packets of the batch;
s7, the node network layer stores the inner code coded data packet in the sending buffer, sends the data packet to the next hop intermediate node, and repeats the steps S4 to S6 until the destination node receives the coded data packet.
2. The distributed batch sparse code based network communication method of claim 1, wherein: the number of encoded data packets in the step S4 and the step S6 is obtained according to a distributed batch sparse code encoding method.
3. The distributed batch sparse code based network communication method of claim 2, wherein: the distributed batch sparse code coding method specifically comprises the following steps:
in the file transmission process, the source node uses the BATS code with the batch size of M to carry out outer code coding on K input packets, and for each batch generated by the outer code, the source node further recodes the batch into t through random linear coding1(> 0) packet, source node at t1Secondary usage link (v)1,v2) T of time-sending batch1Packaging;
at an intermediate node, consider node vkK is more than or equal to 2 and less than or equal to l, at least one data packet is received in one batch, and t is generated by the intermediate node by using random linear codingkA packet and at tkSecondary usage link (v)k,vk+1) Transmitting the data packet;
and the node v determines the number t of the data packets generated by the coding in the batch by using an inner code rate optimization formula.
4. The distributed batch sparse code based network communication method of claim 3, wherein: the inner code rate optimization formula is as follows:
where k is 1, …, l, e is the packet loss rate of node v on the output link, for a given finite field
As defined below:
e＝[0，1，…，M]，h1＝[0，0，…，0，1]，h1Q＝[α0，α1，…，αM]，Q-1e＝[0，β1，β2，…，βM]T。
5. the distributed batch sparse code based network communication method of claim 1, wherein: and the destination node decodes the received coded data packet to recover the original data packet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111493095.1A CN114172619A (en) | 2021-12-08 | 2021-12-08 | Network communication method based on distributed batch sparse codes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111493095.1A CN114172619A (en) | 2021-12-08 | 2021-12-08 | Network communication method based on distributed batch sparse codes |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114172619A true CN114172619A (en) | 2022-03-11 |
Family
ID=80484534
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111493095.1A Pending CN114172619A (en) | 2021-12-08 | 2021-12-08 | Network communication method based on distributed batch sparse codes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114172619A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115811381A (en) * | 2022-11-11 | 2023-03-17 | 香港中文大学（深圳） | Network communication method, network communication device, electronic device, and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017112744A1 (en) * | 2015-12-21 | 2017-06-29 | University Of Florida Research Foundation, Incorporated | Improved joint fountain coding and network coding for loss-tolerant information spreading |
| CN109347604A (en) * | 2018-10-26 | 2019-02-15 | 香港中文大学（深圳） | A kind of multihop network communication means and system based on Sparse Code in batches |
| CN110113131A (en) * | 2019-04-24 | 2019-08-09 | 香港中文大学（深圳） | A kind of network communication method and system based on batch coding |
| CN111917512A (en) * | 2020-07-08 | 2020-11-10 | 西安交通大学 | High-efficiency coding design method based on BATS code in multi-hop transmission system |
-
2021
- 2021-12-08 CN CN202111493095.1A patent/CN114172619A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017112744A1 (en) * | 2015-12-21 | 2017-06-29 | University Of Florida Research Foundation, Incorporated | Improved joint fountain coding and network coding for loss-tolerant information spreading |
| CN109347604A (en) * | 2018-10-26 | 2019-02-15 | 香港中文大学（深圳） | A kind of multihop network communication means and system based on Sparse Code in batches |
| CN110113131A (en) * | 2019-04-24 | 2019-08-09 | 香港中文大学（深圳） | A kind of network communication method and system based on batch coding |
| CN111917512A (en) * | 2020-07-08 | 2020-11-10 | 西安交通大学 | High-efficiency coding design method based on BATS code in multi-hop transmission system |
Non-Patent Citations (3)
| Title |
|---|
| ZHIHENG ZHOU: "Joint BATS Code and Periodic Scheduling in Multihop Wireless Networks", 《IEEE ACCESS》 * |
| ZHIHENG ZHOU: "Practical Inner Codes for BATS Codes in Multi-Hop Wireless Networks", 《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 * |
| 杨娟等: "基于高斯消元的BATS码的改进译码算法", 《通信技术》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115811381A (en) * | 2022-11-11 | 2023-03-17 | 香港中文大学（深圳） | Network communication method, network communication device, electronic device, and storage medium |
| CN115811381B (en) * | 2022-11-11 | 2024-04-19 | 香港中文大学（深圳） | Network communication method, network communication device, electronic apparatus, and storage medium |
| WO2024099077A1 (en) * | 2022-11-11 | 2024-05-16 | 香港中文大学（深圳） | Network communication method, network communication apparatus, electronic device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Puducheri et al. | The design and performance of distributed LT codes | |
| WO2017092543A1 (en) | Method and device for rate matching of polar code | |
| CN109347604B (en) | Multi-hop network communication method and system based on batched sparse codes | |
| CN107547436B (en) | Coding and decoding method of transmission control protocol based on network coding | |
| Yang et al. | BATS codes: Theory and practice | |
| CN110113131B (en) | Network communication method and system based on batch coding | |
| CN112600647B (en) | Multi-hop wireless network transmission method based on network coding endurance | |
| CN111917512A (en) | High-efficiency coding design method based on BATS code in multi-hop transmission system | |
| Costa et al. | Informed network coding for minimum decoding delay | |
| CN103650399A (en) | Adaptive generation of correction data units | |
| KR20090058927A (en) | Method of data block transmitting | |
| CN114172619A (en) | Network communication method based on distributed batch sparse codes | |
| Yin et al. | Packet efficiency of BATS coding on wireless relay network with overhearing | |
| Shi et al. | Zigzag decodable online fountain codes with high intermediate symbol recovery rates | |
| Rudow et al. | Learning-augmented streaming codes are approximately optimal for variable-size messages | |
| CN112153693B (en) | Dual-path transmission method based on random linear network coding | |
| CN113543206B (en) | Method, system and device for data transmission | |
| Zhou et al. | Joint BATS code and periodic scheduling in multihop wireless networks | |
| CN107615810B (en) | Packet header compression system and method for online network code | |
| CN110430011B (en) | BATS code coding method based on regular variable node degree distribution | |
| Al Agha et al. | Fountain codes with XOR of encoded packets for broadcasting and source independent backbone in multi-hop networks using network coding | |
| CN111865488B (en) | Code selection method for multi-hop short packet communication | |
| Wu et al. | On optimizing effective rate for random linear network coding over burst-erasure relay links | |
| Pham et al. | An algorithm for the selection of effective error correction coding in wireless networks based on a lookup table structure | |
| Saxena et al. | Dare: Dof-aided random encoding for network coding over lossy line networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220311 |
|
| RJ01 | Rejection of invention patent application after publication |