CN103826282A - Set partitioning multi-hop routing method based on dump energy - Google Patents

Set partitioning multi-hop routing method based on dump energy Download PDF

Info

Publication number
CN103826282A
CN103826282A CN201410061028.6A CN201410061028A CN103826282A CN 103826282 A CN103826282 A CN 103826282A CN 201410061028 A CN201410061028 A CN 201410061028A CN 103826282 A CN103826282 A CN 103826282A
Authority
CN
China
Prior art keywords
cluster head
candidate nodes
node
weights
down hop
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
CN201410061028.6A
Other languages
Chinese (zh)
Other versions
CN103826282B (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.)
Nanchang University
Original Assignee
Nanchang University
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 Nanchang University filed Critical Nanchang University
Priority to CN201410061028.6A priority Critical patent/CN103826282B/en
Publication of CN103826282A publication Critical patent/CN103826282A/en
Application granted granted Critical
Publication of CN103826282B publication Critical patent/CN103826282B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to a set partitioning multi-hop routing method based on dump energy. The set partitioning multi-hop routing method comprises the steps of 1, dividing a wireless sensor network into a plurality of zones; 2, dividing all the nodes in the wireless sensor network into a plurality of first sets with the same number of the nodes according to the closest distance principle; 3, generating a second set with a plurality of cluster heads according to distribution of positions of the first sets in the wireless sensor network; 4, giving a right value to each of the cluster heads; 5, determining a front cluster head of each of the cluster heads in the second set; 6, determining the next cluster head of each of the cluster heads in the second set; 7, reserving first distances between members in each of the first sets and the cluster heads corresponding to the members, reserving second distances between the members and Sink nodes, and determining whether the members are communicated with the cluster heads corresponding to the members or communicated with the Sink nodes according to the size relationship between the first distances and the second distances. By means of the set partitioning multi-hop routing method based on dump energy, performance of the network is improved, and service life of the network is prolonged.

Description

Multi-hop routing method is divided in set based on dump energy
Technical field
The present invention relates to wireless routing algorithmic technique field, particularly relate to a kind of set based on dump energy and divide multi-hop routing method.
Background technology
The finite energy of wireless sensor network, therefore energy problem is the key problem in wireless sensor network (WSNs) application.The Routing Protocol of an efficient low-power consumption can effectively reduce the energy consumption of network, extends the life cycle of WSNs, and therefore routing algorithm becomes the study hotspot of domestic and international WSNs.
The Routing Protocol of WSNs can be divided into plane road by with level route, hierarchical routing algorithm is in WSN, to use routing algorithm more widely.LEACH algorithm is the Clustering Routing of a comparative maturity having proposed the earliest, is also the most representative hierarchy routing algorithm.The agreements such as many clustering route protocols such as SEP, PEGASIS, LEACH-C (LEACH-centralized) and LEACH-F (LEACH-fixed) are all to grow up on the basis of LEACH.But it exists certain deficiency, the random selection cluster head in turn of LEACH agreement, and cluster head and base station direct communication, cause cluster head skewness, and single-hop communication causes huge energy consumption.
Summary of the invention
The object of this invention is to provide the set based on dump energy more reasonable, that can effectively reduce network energy consumption, prolongation network lifecycle of a kind of network route construction and divide multi-hop routing method.
For solving the problems of the technologies described above, as one aspect of the present invention, provide a kind of set based on dump energy to divide multi-hop routing method, comprising: step 1, is divided into multiple regions by wireless sensor network; Step 2, is divided into multiple first set with same node point number by all nodes in wireless sensor network by nearest principle; Step 3, according to the first position distribution being integrated in wireless sensor network, generates second set with multiple cluster heads; Step 4, for each cluster head is given weights; Step 5 is that the each cluster head in the second set is determined forward direction cluster head; Step 6 is that the each cluster head in the second set is determined down hop cluster head; Step 7, between member in each the first set and its corresponding cluster head, there is the first distance, between this member and Sink node, there is second distance, according to first distance and second distance between magnitude relationship, determine this member be the cluster head corresponding with it or with Sink node communication.
Further, wireless sensor network is square, and difference is eight.
Further, step 2 also comprises: random selection and first the same number of the first both candidate nodes of gathering in all nodes; In the node except the first both candidate nodes, the random near node of multiple distance measurements of selecting is as the second both candidate nodes, and wherein, the second both candidate nodes is relative's node of the first both candidate nodes; The first both candidate nodes and the set of the second both candidate nodes composition both candidate nodes.
Further, step 3 is pressed at least one mode and is determined candidate's cluster head: (1), if having a both candidate nodes that belongs to both candidate nodes set in region, adds the second set as candidate's cluster head this both candidate nodes so; (2), if there are two both candidate nodes that belong to both candidate nodes set in region, add the second set as candidate's cluster head one of random selection in these two both candidate nodes so; (3), if there are three both candidate nodes that belong to above both candidate nodes set in region, so this more than three is selected to two in both candidate nodes at random and add the second set as candidate's cluster head; (4) if do not belong to the both candidate nodes of both candidate nodes set in region, skip over so this region.
Further, the weights in step 4 are directly proportional to the node energy of this cluster head, and are inversely proportional to the distance of Sink node.
Further, the weights in step 4 calculate according to following formula:
W = E i E o · d max d ( i , sin k )
Wherein,
W is weights;
Ei is the current energy of node;
Emax is the primary power of node;
Dmax is in all nodes and the maximum distance of Sink node;
D (i, sink) is the distance of node and Sink node.
Further, in step 5: the distance of establishing between cluster head i and Sink node is Disink, and the distance between cluster head j and Sink node is Djsink, and the distance between cluster head i and cluster head j is Dij, if meet the following conditions, cluster head j is the forward direction cluster head of cluster head i:
D ij 2+D isink 2＞D jsink 2
D jsink 2+D isink 2＞D ij 2。
Further, step 6 is determined down hop cluster head by following at least one mode:
(1), if a cluster head has more than two forward direction cluster heads, find out the two forward direction cluster heads nearest apart from this cluster head, and select larger that of weights as its interim down hop cluster head; If the weights of this interim father node are greater than the weights of this cluster head, using this interim down hop cluster head as down hop cluster head, otherwise using Sink node as down hop cluster head;
(2), if a cluster head has two forward direction cluster heads, selecting the forward direction cluster head that weights are larger is interim down hop cluster head; If the weights of this interim down hop cluster head are greater than the weights of this cluster head, using this interim down hop cluster head as down hop cluster head, otherwise using Sink node as down hop cluster head;
(3), if a cluster head only has a forward direction cluster head, the relatively weights of this cluster head and forward direction cluster head, if the weights of this forward direction cluster head are larger, are down hop cluster head by this forward direction cluster head, otherwise using Sink node as down hop cluster head;
(4) if forward direction cluster head is zero, using Sink node as down hop cluster head.
The invention enables the cluster head optimum of election, and between cluster head and base station, set up multi-hop route, reduce the communication distance between node, the balanced energy consumption of network, has improved performance and the life cycle of network to a great extent.
Accompanying drawing explanation
Fig. 1 has schematically shown the zoning plan of wireless sensor network;
Fig. 2 has schematically shown Matlab emulation cluster head number of variations comparison diagram;
Fig. 3 has schematically shown Matlab emulation life cycle comparison diagram.
Embodiment
Below embodiments of the invention are elaborated, but the multitude of different ways that the present invention can be defined by the claims and cover is implemented.
The application is based on above deficiency, proposed a kind of set based on dump energy and divided multi-hop routing method, all the sensors node is divided into several and has the set of same node point number by nearest principle, makes cluster head distribution uniform; Between cluster head and base station (Sink node), establish multi-hop communication path according to weights size again, can avoid so the huge energy consumption that between cluster head and base station, telecommunication causes.Compared with traditional LEACH algorithm, the LEACH-ECM algorithm after the application improves makes network route construction more reasonable, and the balanced energy consumption of network has improved performance and the life cycle of network to a great extent.
Please refer to Fig. 1 to Fig. 3, the invention provides a kind of set based on dump energy and divide multi-hop routing method, comprising:
Step 1, is divided into multiple regions by wireless sensor network.Please refer to Fig. 1, in the embodiment shown in fig. 1, preferably, described wireless sensor network is square, and described difference is eight.In this embodiment, square network is divided into eight regions along diagonal, neutrality line, and marks sequence number 1-8.
Step 2, is divided into multiple first set with same node point number by all nodes in described wireless sensor network by nearest principle.In one embodiment, having 100 nodes in this network, like this, can be 20 first set respectively with 5 nodes by these 100 node division.
Step 3, according to described the first position distribution being integrated in described wireless sensor network, generates second set with multiple cluster heads.For example, can be according to these 20 distributions that are integrated into eight regions in network, select second set with multiple cluster heads.Especially, in the second set, the node of energy maximum is elected as final cluster head.
Step 4, for each described cluster head is given weights.Wherein, the more qualified relaying cluster head of serving as of cluster head that weights are larger.
Step 5, for the each cluster head in described the second set is determined forward direction cluster head.
Step 6, for the each cluster head in described the second set is determined down hop cluster head.
Step 7, between member in each described the first set and its corresponding cluster head, there is the first distance, between this member and Sink node, there is second distance, according to described first distance and described second distance between magnitude relationship, determine this member be the cluster head corresponding with it or with described Sink node communication.Like this, for bunch in member (first set in member), if bunch in the distance of member and cluster head be greater than and the distance of Sink, with Sink direct communication.If because bunch in member directly communicate by letter with cluster head, member's energy consumption in both having increased bunch, has also increased the energy consumption of cluster head.
The present invention is divided into all the sensors node in network several and has the set of same node point number by nearest principle, select some candidate's cluster head set according to the distribution being integrated in network, the point of selecting energy maximum in the set of candidate's cluster head is cluster head.Between cluster head and base station, establish multi-hop communication path according to weights size again.The present invention program makes network route construction more reasonable, has effectively reduced the energy consumption of network, and then the life cycle that has extended network.
The invention enables the cluster head optimum of election, and between cluster head and base station, set up multi-hop route, reduce the communication distance between node, the balanced energy consumption of network, has improved performance and the life cycle of network to a great extent.
Preferably, step 2 also comprises: random selection and described first the same number of the first both candidate nodes of gathering in all nodes; In the node except described the first both candidate nodes, select at random the near node of multiple distance measurements as the second both candidate nodes, wherein, relative's node that described the second both candidate nodes is described the first both candidate nodes; Described the first both candidate nodes and described the second both candidate nodes composition both candidate nodes set.For example, take the network of 100 nodes as example, can first in 100 nodes, select at random 20 nodes is the first both candidate nodes, in 80 remaining nodes, select successively the relative node (i.e. second both candidate nodes) of 4 nearest nodes as this first both candidate nodes, the node in the set after dividing is like this more approaching in position.
Preferably, step 3 is pressed at least one mode and is determined candidate's cluster head:
(1), if there is a both candidate nodes that belongs to described both candidate nodes set in described region, so this both candidate nodes is added described the second set as candidate's cluster head;
(2), if there are two both candidate nodes that belong to described both candidate nodes set in described region, select one to add described the second set as candidate's cluster head using random in these two both candidate nodes so;
(3), if there are three both candidate nodes that belong to above described both candidate nodes set in described region, more than three in both candidate nodes, select at random two to add described the second set as candidate's cluster head this so;
(4) if do not belong to the both candidate nodes of described both candidate nodes set in described region, skip over so this region.
Preferably, the described weights in step 4 are directly proportional to the node energy of this cluster head, and are inversely proportional to the distance of Sink node.
Preferably, the described weights in step 4 calculate according to following formula:
W = E i E o · d max d ( i , sin k )
Wherein,
W is weights;
Ei is the current energy of node;
Emax is the primary power of node;
Dmax is in all nodes and the maximum distance of Sink node;
D (i, sink) is the distance of node and Sink node.
Preferably, in step 5: the distance of establishing between cluster head i and Sink node is Disink, and the distance between cluster head j and Sink node is Djsink, and the distance between cluster head i and cluster head j is Dij, if meet the following conditions, cluster head j is the forward direction cluster head of cluster head i:
D ij 2+D isink 2＞D jsink 2
D jsink 2+D isink 2＞D ij 2。
Preferably, step 6 is determined down hop cluster head by following at least one mode:
(1) if cluster head has more than two forward direction cluster heads described in one, find out the two forward direction cluster heads nearest apart from this cluster head, and select larger that of weights as its interim down hop cluster head; If the weights of this interim father node are greater than the weights of this cluster head, using this interim down hop cluster head as down hop cluster head, otherwise using Sink node as down hop cluster head;
(2), if cluster head has two forward direction cluster heads described in one, selecting the forward direction cluster head that weights are larger is interim down hop cluster head; If the weights of this interim down hop cluster head are greater than the weights of this cluster head, using this interim down hop cluster head as down hop cluster head, otherwise using Sink node as down hop cluster head;
(3), if cluster head only has a forward direction cluster head described in one, the relatively weights of this cluster head and forward direction cluster head, if the weights of this forward direction cluster head are larger, are down hop cluster head by this forward direction cluster head, otherwise using Sink node as down hop cluster head;
(4) if forward direction cluster head is zero, using Sink node as down hop cluster head.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.

Claims (8)

1. a multi-hop routing method is divided in the set based on dump energy, it is characterized in that, comprising:
Step 1, is divided into multiple regions by wireless sensor network;
Step 2, is divided into multiple first set with same node point number by all nodes in described wireless sensor network by nearest principle;
Step 3, according to described the first position distribution being integrated in described wireless sensor network, generates second set with multiple cluster heads;
Step 4, for each described cluster head is given weights;
Step 5, for the each cluster head in described the second set is determined forward direction cluster head;
Step 6, for the each cluster head in described the second set is determined down hop cluster head;
Step 7, between member in each described the first set and its corresponding cluster head, there is the first distance, between this member and Sink node, there is second distance, according to described first distance and described second distance between magnitude relationship, determine this member be the cluster head corresponding with it or with described Sink node communication.
2. method according to claim 1, is characterized in that, described wireless sensor network is square, and described difference is eight.
3. method according to claim 1, is characterized in that, step 2 also comprises:
Random selection and described first the same number of the first both candidate nodes of gathering in all nodes;
In the node except described the first both candidate nodes, select at random the near node of multiple distance measurements as the second both candidate nodes, wherein, relative's node that described the second both candidate nodes is described the first both candidate nodes;
Described the first both candidate nodes and described the second both candidate nodes composition both candidate nodes set.
4. method according to claim 3, is characterized in that, step 3 is pressed at least one mode and determined candidate's cluster head:
(1), if there is a both candidate nodes that belongs to described both candidate nodes set in described region, so this both candidate nodes is added described the second set as candidate's cluster head;
(2), if there are two both candidate nodes that belong to described both candidate nodes set in described region, select one to add described the second set as candidate's cluster head using random in these two both candidate nodes so;
(3), if there are three both candidate nodes that belong to above described both candidate nodes set in described region, more than three in both candidate nodes, select at random two to add described the second set as candidate's cluster head this so;
(4) if do not belong to the both candidate nodes of described both candidate nodes set in described region, skip over so this region.
5. method according to claim 1, is characterized in that, the described weights in step 4 are directly proportional to the node energy of this cluster head, and is inversely proportional to the distance of Sink node.
6. method according to claim 1, is characterized in that, the described weights in step 4 calculate according to following formula:
W = E i E o · d max d ( i , sin k )
Wherein,
W is weights;
Ei is the current energy of node;
Emax is the primary power of node;
Dmax is in all nodes and the maximum distance of Sink node;
D (i, sink) is the distance of node and Sink node.
7. method according to claim 1, is characterized in that, in step 5:
If the distance between cluster head i and Sink node is Disink, the distance between cluster head j and Sink node is Djsink, and the distance between cluster head i and cluster head j is Dij, if meet the following conditions, cluster head j is the forward direction cluster head of cluster head i:
D ij 2+D isink 2＞D jsink 2
D jsink 2+D isink 2＞D ij 2。
8. method according to claim 1, is characterized in that, step 6 is determined down hop cluster head by following at least one mode:
(1) if cluster head has more than two forward direction cluster heads described in one, find out the two forward direction cluster heads nearest apart from this cluster head, and select larger that of weights as its interim down hop cluster head; If the weights of this interim father node are greater than the weights of this cluster head, using this interim down hop cluster head as down hop cluster head, otherwise using Sink node as down hop cluster head;
(2), if cluster head has two forward direction cluster heads described in one, selecting the forward direction cluster head that weights are larger is interim down hop cluster head; If the weights of this interim down hop cluster head are greater than the weights of this cluster head, using this interim down hop cluster head as down hop cluster head, otherwise using Sink node as down hop cluster head;
(3), if cluster head only has a forward direction cluster head described in one, the relatively weights of this cluster head and forward direction cluster head, if the weights of this forward direction cluster head are larger, are down hop cluster head by this forward direction cluster head, otherwise using Sink node as down hop cluster head;
(4) if forward direction cluster head is zero, using Sink node as down hop cluster head.
CN201410061028.6A 2014-02-24 2014-02-24 Set based on dump energy divides multi-hop routing method Expired - Fee Related CN103826282B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410061028.6A CN103826282B (en) 2014-02-24 2014-02-24 Set based on dump energy divides multi-hop routing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410061028.6A CN103826282B (en) 2014-02-24 2014-02-24 Set based on dump energy divides multi-hop routing method

Publications (2)

Publication Number Publication Date
CN103826282A true CN103826282A (en) 2014-05-28
CN103826282B CN103826282B (en) 2017-06-30

Family

ID=50761051

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410061028.6A Expired - Fee Related CN103826282B (en) 2014-02-24 2014-02-24 Set based on dump energy divides multi-hop routing method

Country Status (1)

Country Link
CN (1) CN103826282B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104394565A (en) * 2014-11-07 2015-03-04 南昌大学 Clustering multi-hop routing method based on maximum and minimum distance method
CN107071849A (en) * 2017-06-20 2017-08-18 海信集团有限公司 A kind of method and apparatus for electing leader cluster node
CN107328916A (en) * 2017-08-11 2017-11-07 潘荣兰 A kind of effective soil environment monitoring system
CN110896542A (en) * 2019-11-22 2020-03-20 江南大学 Heterogeneous network construction method under random multi-SINK mode

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20120102179A (en) * 2011-03-01 2012-09-18 울산대학교 산학협력단 Network system and routing method thereof
CN102802175A (en) * 2012-02-24 2012-11-28 东北电力大学 Energy-consumption-based routing optimization algorithm for wireless sensor network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20120102179A (en) * 2011-03-01 2012-09-18 울산대학교 산학협력단 Network system and routing method thereof
CN102802175A (en) * 2012-02-24 2012-11-28 东北电力大学 Energy-consumption-based routing optimization algorithm for wireless sensor network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
何国圆: "基于最优簇首和多跳机制的高效分簇路由协议的设计与实现", 《中国优秀硕士学位论文全文数据库信息科技辑》 *
顾明霞: "无线传感器网络的LEACH算法改进与仿真研究", 《计算机仿真》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104394565A (en) * 2014-11-07 2015-03-04 南昌大学 Clustering multi-hop routing method based on maximum and minimum distance method
CN107071849A (en) * 2017-06-20 2017-08-18 海信集团有限公司 A kind of method and apparatus for electing leader cluster node
WO2018233139A1 (en) * 2017-06-20 2018-12-27 海信集团有限公司 Method, base station, and storage medium for selecting cluster head node
CN107328916A (en) * 2017-08-11 2017-11-07 潘荣兰 A kind of effective soil environment monitoring system
CN110896542A (en) * 2019-11-22 2020-03-20 江南大学 Heterogeneous network construction method under random multi-SINK mode

Also Published As

Publication number Publication date
CN103826282B (en) 2017-06-30

Similar Documents

Publication Publication Date Title
Rezaeipanah et al. A Hybrid Approach for Prolonging Lifetime of Wireless Sensor Networks Using Genetic Algorithm and Online Clustering.
CN104602302B (en) It is a kind of based on cluster structured ZigBee-network balancing energy method for routing
Zanjireh et al. Anch: A new clustering algorithm for wireless sensor networks
Mazumdar et al. A survey on clustering approaches for wireless sensor networks
CN102223644A (en) System and method for combining relay selection and power distribution
Dandapat et al. Smart association control in wireless mobile environment using max-flow
Wang et al. Energy-efficient localized routing in random multihop wireless networks
CN105050095B (en) A kind of topological construction method of the heterogeneous wireless sensor net based on energy predicting
CN104410997A (en) Method for establishing hierarchical topology structure applied to wireless sensor network
CN102497679A (en) Static clustering algorithm for wireless sensor network
CN103826282A (en) Set partitioning multi-hop routing method based on dump energy
Shang et al. An energy efficient localized topology control algorithm for wireless multihop networks
Rani et al. Energy efficient protocol for densely deployed homogeneous network
CN103747498A (en) Direction angle-based wireless sensor network routing void optimization method
Valikannu et al. A novel energy consumption model using Residual Energy Based Mobile Agent selection scheme (REMA) in MANETs
CN103442382B (en) Reduce the topology control method disturbing between link
CN102630086A (en) Gabriel graph-based data communication method of wireless sensor network
Chochlidakis et al. Robust virtual network embedding for mobile networks
Shahabuddin et al. Preliminary framework of topology control algorithm in WSN to achieve node's energy efficiency
Hadawale et al. Link prediction-based topology control and adaptive routing in cognitive radio mobile ad-hoc networks
Boyd et al. A collaborative wireless sensor network routing scheme for reducing energy wastage
Matsuura Maximizing lifetime of multiple data aggregation trees in wireless sensor networks
Prabowo et al. (EDsHEED) Enhanced Simplified Hybrid, Energy-efficient, Distributed Clustering for Wireless Sensor Network
CN106488507A (en) The Uneven Cluster sensor network energy cavity avoiding method of routing overhead shunting
Xiao et al. A novel energy entropy based on cluster head selection algorithm for wireless sensor networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
CB03 Change of inventor or designer information
CB03 Change of inventor or designer information

Inventor after: Yu Guicai

Inventor after: Long Chengzhi

Inventor after: Lin Huan

Inventor after: Xiang Mantian

Inventor after: Huang Caihai

Inventor before: Long Chengzhi

Inventor before: Lin Huan

Inventor before: Xiang Mantian

Inventor before: Huang Caihai

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: 20170630

Termination date: 20210224