CN110177388A - A kind of wireless sensor network node distributed clustering method - Google Patents
A kind of wireless sensor network node distributed clustering method Download PDFInfo
- Publication number
- CN110177388A CN110177388A CN201910474826.4A CN201910474826A CN110177388A CN 110177388 A CN110177388 A CN 110177388A CN 201910474826 A CN201910474826 A CN 201910474826A CN 110177388 A CN110177388 A CN 110177388A
- Authority
- CN
- China
- Prior art keywords
- node
- clustering
- leader cluster
- sub
- cluster
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of wireless sensor network node distributed clustering methods, a kind of wireless sensor network node distributed clustering method, after all nodes are clustered in network, each node confirms the cluster head of oneself from neighbor node, and the node with identical cluster head is considered as a sub-clustering；For node when sending information, the non-leader cluster node in same sub-clustering sends information to leader cluster node, and leader cluster node is sent to the leader cluster node of upper level after polymerizeing to the information received, final information is sent to base station.The present invention is by way of node clustering, select the higher node of remaining capacity as leader cluster node, and periodically replace leader cluster node, reduce the energy consumption of the middle-and-high-ranking other node of network, improve the energy consumption of low level node, the effective rate of utilization of energy gets a promotion in network, extends Network morals.
Description
Technical field
The present invention relates to a kind of wireless sensor network node distributed clustering methods, belong to wireless sensor technology neck
Domain.
Background technique
Wireless sensor network is a large amount of miniature, cheap, low-power consumption sensors by being deployed in monitoring region
Node and base station composition, what these nodes were mostly constituted in a manner of self-organizing and multi-hop etc..It perceived, adopted with cooperation mode between node
Collection, processing and transmission network overlay area in monitoring object information, and by multihop routing and data aggregate processing after, by information
Base station is converged to, then these information are sent to by way of communication the owner of network.Wireless sensor network extends
People are to information obtaining ability, together with transmission network connection by the physical message of objective world, for people provide it is direct, have
Effect, true massive information.
Wireless sensor node is usually to provide energy with minicell, in face of minicell finite energy and operates in evil
Energy is difficult to the problem of supplementing in bad or even dangerous natural environment, and whether the Expenditure Levels of the energy content of battery can play work to node
With playing a decisive role.And in wireless sensor network, wireless communication is the main consumer of the energy content of battery again.And for
For sensor node, if energy consumption is too fast, energy is exhausted prior to next stage sensor node, then its next stage sensor
Node will will form isolated island, can not transfer data to base station.Therefore in wireless sensor network, node energy consumption speed
Unbalanced, high-level node energy consumption is fast, and low level node energy consumption is slow, and the effective rate of utilization of energy is low in network, net
Network life cycle is shorter.
Summary of the invention
The problem of for above-mentioned field, the present invention provide a kind of side that wireless sensor network node efficiently clusters
Method, so that node clustering cluster, so that the wireless communication number of network is reduced, thus the sensor node energy in equalising network
Consumption, extends the life cycle of whole network.
A kind of wireless sensor network node distributed clustering method, after all nodes are clustered in network, each node
Node with identical cluster head is considered as a sub-clustering by the cluster head that oneself is confirmed from neighbor node；Node is when sending information, together
Non- leader cluster node in one sub-clustering sends information to leader cluster node, and leader cluster node is sent after polymerizeing to the information received
To the leader cluster node of upper level, final information is sent to base station.
The cluster is periodic duty, and each cluster period is divided into ordinary node clustering phase, leader cluster node clustering phase
And the stabilization sub stage；Network completes the cluster operation of all nodes in ordinary node clustering phase and leader cluster node clustering phase, really
Determine the leader cluster node of oneself；After cluster runs a period of time, the cluster period restarts, and redefines the cluster head of oneself again
Node.
The method of the cluster is when the cluster period starts, and all nodes are all set as ordinary node state in network, is opened
Beginning ordinary node clustering phase, all nodes number the order to determine cluster according to itself；It, should when certain node is clustered
Node obtains the information of surrounding neighbours node and is analyzed, if establishing newly in neighbor node without the leader cluster node of sub-clustering
Sub-clustering selects a certain node as the leader cluster node of new sub-clustering, and newly-established sub-clustering is added；If there is sub-clustering in neighbor node
Leader cluster node, it is determined that a certain sub-clustering, and sub-clustering is added；It is leader cluster node clustering phase after ordinary node clustering phase,
In leader cluster node clustering phase, all leader cluster nodes according to the information of surrounding neighbours node, determine higher level's neighbor node or
The leader cluster node of base station another sub-clustering as belonging to, and the sub-clustering is added；After leader cluster node clustering phase, institute in network
There is node all to cluster cluster, network enters the stabilization sub stage, and sensor node acquires data, and is sent to the cluster head section of itself
Point, leader cluster node are uploaded to base station step by step again.
The method of the cluster order is node according to itself number N, and (N- is waited after ordinary node clustering phase starts
1) * T time, then start to be clustered, wherein T is that individual node carries out clustering the required time.
The method for obtaining surrounding neighbours nodal information is the nodal information of node broadcasts oneself, and receives and around save
The broadcast message of point, to confirm the state of oneself neighbor node, and is analyzed.
The nodal information include node rank, remaining capacity, whether be leader cluster node information.
The method of the leader cluster node as new sub-clustering that selects a certain node is node by the remaining capacity of itself and adjacent
The remaining capacity for occupying node compares, leader cluster node of the node for selecting one of remaining capacity most as new sub-clustering.
The method that newly-established sub-clustering is added sends asking containing node ID to the leader cluster node of new sub-clustering for node
Packet is sought, the leader cluster node of new sub-clustering changes oneself state, become leader cluster node, broadcast oneself new shape after receiving request packet
State information, and the ID in request packet is extracted, it is added in the cluster of oneself, and reply response bag；Node is receiving new sub-clustering
Leader cluster node send should wrap after, confirmation be added sub-clustering success, the leader cluster node of new sub-clustering is set as to the cluster head section of itself
Point；If node itself is chosen as the leader cluster node of new sub-clustering, change state, become leader cluster node, and broadcasts the shape of oneself row
State information.
The method of a certain sub-clustering of determination is that there are the leader cluster node of sub-clustering, more each cluster heads in surrounding neighbours node
The rank and remaining capacity of node determine sub-clustering belonging to remaining capacity is most in the minimum leader cluster node of rank leader cluster node
For the sub-clustering that node is to be added.
The method that sub-clustering is added sends the request containing node ID to the leader cluster node of identified sub-clustering for node
Packet, the ID in request packet is extracted, is added in the cluster of oneself after receiving request packet by the leader cluster node of sub-clustering, and is replied
Response bag.Node receive the sub-clustering leader cluster node send should wrap after, confirmation be added sub-clustering success, by the cluster of the sub-clustering
Head node is set as the leader cluster node of itself.
The method of one higher level's neighbor node of determination is the information that leader cluster node analyzes neighbor node, if upper level is adjacent
It occupies in node that there are the leader cluster nodes of other sub-clusterings, then selects the leader cluster node that wherein remaining capacity is most；If upper level is adjacent
The leader cluster node for not having other sub-clusterings in node is occupied, then creates new sub-clustering, selects in upper level neighbor node remaining capacity most
Leader cluster node of more nodes as new sub-clustering.
Ordinary node: the nothing of the environmental informations such as temperature, humidity, illuminance, the gas concentration of its surrounding space can be perceived
Line sensor network nodes.Ordinary node has the function of data packet aggregation and forwarding simultaneously, the biography that its own can be generated
The sensing data of sense data or the other nodes received carries out polymerization processing and is sent to the reachable any section of its ability to communicate
Point, ordinary node have oneself unique ID (identification number)；Ordinary node is divided into level-one, second level, three-level etc.；In routine
Common sense in network, low-level sensors nodal distance base station farther out, need to forward by even higher level of node when transmitting information.This hair
In bright, ordinary node is pertaining only in a sub-clustering.
Leader cluster node: has the node of data aggregate and transfer capability.Any common sensing in network is defined in the present invention
Device node can become leader cluster node.In the present invention, leader cluster node belongs in two sub-clusterings, the cluster head section as a sub-clustering
The non-leader cluster node of point and another sub-clustering.
Base station: the node that sensing data is finally transferred to.In the present invention, base station is pertaining only in a sub-clustering, and is this point
The leader cluster node of cluster.
The present invention is centered on node, and each node is according to the situation of respective neighbor node, so that all sections in network
Point cluster cluster.Each cluster period is divided into three phases, ordinary node clustering phase, leader cluster node clustering phase and stable rank
Section.In ordinary node clustering phase, node itself number determines cluster order, when node starts cluster, according to neighbor node
Information, existing sub-clustering or the new sub-clustering of creation is added in selection.In leader cluster node clustering phase, leader cluster node is according to upper one
The information of grade neighbor node, selection are added existing sub-clustering or create new sub-clustering.Node in the stabilization sub stage, network will
The information of acquisition is sent to leader cluster node, and leader cluster node is transmitted to upper level leader cluster node after being polymerize received information,
Finally transfer information to base station.By a large amount of Computer Simulations, the invention has the following beneficial effects:
The present invention selects the higher node of remaining capacity as leader cluster node by way of node clustering, and periodically
Replacement leader cluster node, reduce the energy consumption of the middle-and-high-ranking other node of network, improve the energy consumption of low level node, energy has in network
Effect utilization rate gets a promotion, and extends Network morals.
Detailed description of the invention
Fig. 1 is the flow chart of wireless sensor network interior joint distributed clustering method；
Wherein a is ordinary node clustering phase, and b is leader cluster node clustering phase,
Fig. 2 is that ordinary node is established and new sub-clustering schematic diagram is added；
It is not cluster head that wherein a, which is node A, B, and b is node A using itself as cluster head, and c is node A using node B as cluster head；
Fig. 3 is that surrounding sub-clustering schematic diagram is added in ordinary node；
There are B, C, D, E cluster head in the neighbor node that wherein a is node A, wherein b is node A with cluster head D for oneself cluster
Head；
Fig. 4 is that leader cluster node is established and new sub-clustering schematic diagram is added；
Wherein a is leader cluster node A, and higher level's neighbor node B, C is without cluster head, and wherein b is that leader cluster node A determines higher level neighbours
Node B is cluster head；
Fig. 5 is that sub-clustering schematic diagram is added in leader cluster node；
Wherein a is leader cluster node A, and higher level's neighbor node B, C are cluster head, and wherein b is that leader cluster node A determines higher level neighbours
Leader cluster node B is the cluster head of oneself；
Fig. 6 is wireless sensor network interior joint cluster result schematic diagram；
Wherein: 1,2,3,4 is four sub-clusterings, and wherein sink is base station, and A, B, D are leader cluster node, and C, E, F, G are common section
Point,
Fig. 7 is the partition of the level schematic diagram of wireless sensor network interior joint；
A, B, D, C, E, F are node in figure, and sink is base station.
Specific embodiment
The present invention is directed to the Distributed Cluster process of wireless sensor network interior joint, according to the remaining capacity of neighbor node
It to select leader cluster node, and periodically clusters again, so that the sensor node energy consumption in equalising network, improves in network
The utilization rate of the node energy, extends Network morals.
Its specific method and step are as follows:
Step 1) is random, uniform broadcasting is multiple has identical primary power, same communication ability and pass in network environment
The general sensor nodes of sense ability, node can monitor the remaining capacity of itself, known to the sensor node sum of spreading；
In step 2) the network clustering period, oneself state is set as ordinary node by all nodes in network, and broadcast from
Oneself nodal information, network enter ordinary node clustering phase；
All nodes are numbered according to itself in step 3) network, after waiting the corresponding time, are successively clustered.A in Fig. 1
The flow chart clustered for ordinary node clustering phase, ordinary node.Node obtains surrounding neighbours node when being clustered
Information analyzed.
If not having the leader cluster node of sub-clustering in step 3.1) surrounding neighbours node, as shown in a in Fig. 2, the neighbours of node A are saved
There is no leader cluster node in point, then establishes new sub-clustering, and the remaining capacity of comparison node A and surrounding neighbours node.Assuming that node A
Remaining capacity it is most, then node A change oneself state, become the leader cluster node of new sub-clustering, broadcast oneself new status information,
As shown in b in Fig. 2.Assuming that the remaining capacity of neighbor node B is most, then node A sends the request containing self ID to node B
Packet；Node B changes oneself state, becomes the leader cluster node of new sub-clustering after receiving request packet, broadcasts oneself new state letter
Breath, the ID of request packet interior joint A is extracted, is added in the cluster of oneself, and sends response bag to node A；Node A, which is received, to be answered
After answering packet, sub-clustering success is added in confirmation, node B is set as to the leader cluster node of oneself, as shown in c in Fig. 2.
If having the leader cluster node of sub-clustering, as shown in a in Fig. 3, the neighbor node of node A in step 3.2) surrounding neighbours node
In have a leader cluster node, respectively leader cluster node B, C, D, E, the rank of interior joint D, E are identical and are lower than the rank of node B, C,
The remaining capacity of node D is greater than the remaining capacity of node E, and node A determines that remaining capacity is most in the minimum leader cluster node of rank
Leader cluster node D, be sent to it the request packet containing self ID；After leader cluster node D receives request packet, by request packet interior joint A
ID extract, be added in the cluster of oneself, and to node A send response bag；After node A receives response bag, confirmation, which is added, to divide
Node D, is set as the leader cluster node of oneself, as shown in b in Fig. 3 by cluster success.
All ordinary nodes of step 4) carry out after reuniting class, and ordinary node clustering phase terminates, and it is poly- to start leader cluster node
The class stage.It needs to compete in all leader cluster nodes of leader cluster node clustering phase and be clustered.B is that leader cluster node clusters rank in Fig. 1
Section, the flow chart that leader cluster node is clustered.When being clustered, the information for obtaining surrounding upper level neighbor node carries out node
Analysis.
If there is no leader cluster node in step 4.1) upper level neighbor node, as shown in a in Fig. 4, the upper level of leader cluster node A
There is no leader cluster node in neighbor node B, C, then establish new sub-clustering, and compares the remaining capacity of upper level neighbor node B, C, it is false
If the remaining capacity of node B is more, then node A sends the request packet containing self ID to node B；Node B is receiving request packet
Afterwards, change oneself state, become the leader cluster node of new sub-clustering, broadcast oneself new status information, by the ID of request packet interior joint A
It extracts, is added in the cluster of oneself, and send response bag to node A；After node A receives response bag, confirmation be added sub-clustering at
Node B is set as the leader cluster node of oneself by function, as shown in b in Fig. 4.
If having leader cluster node in step 4.2) upper level neighbor node, as shown in a in Fig. 5, the upper level of leader cluster node A is adjacent
Leader cluster node B, C in node there are sub-clustering are occupied, node A is selected in leader cluster node B, C, the more cluster head section of remaining capacity
Point, it is assumed that the remaining capacity of leader cluster node B is more, and node A sends the request packet containing self ID to leader cluster node B；Cluster head section
The ID of request packet interior joint A is extracted, is added in the cluster of oneself after receiving request packet by point B, and is answered to node A transmission
Answer packet；After node A receives response bag, sub-clustering success is added in confirmation, leader cluster node B is set as to the leader cluster node of oneself, in Fig. 5
Shown in b.
After step 5) leader cluster node clustering phase, all node clusterings are completed in network.As shown in fig. 6, the network
After completing cluster, four sub-clusterings are formd, wherein sink is base station, and A, B, D are leader cluster node, and C, E, F, G are common section
Point.Ordinary node or base station are pertaining only in a sub-clustering, and base station is the leader cluster node of its affiliated sub-clustering, and ordinary node is its institute
Belong to the non-leader cluster node of sub-clustering.Leader cluster node belongs in two sub-clusterings, leader cluster node and another sub-clustering as a sub-clustering
Non- leader cluster node.
For step 6) in the stabilization sub stage, the data of acquisition are sent to the leader cluster node of itself by node, and leader cluster node is again step by step
It is uploaded to base station.
After the step 7) stabilization sub stage, in the new cluster period, node re-starts cluster.
Fig. 7 is the partition of the level schematic diagram of wireless sensor network interior joint, is carried out according to sensor node with base station
Minimum hop count when data are transmitted to carry out partition of the level to sensor node.Sensor node is carrying out data with base station
When transmission, the node rank that can directly carry out data transmission with base station is 1, such as node A；A node is at least needed to be turned
The node rank of hair is 2, such as node B, C；The node rank at least needing two nodes to be forwarded is 3, such as node D, E, F；
And so on, it may be determined that the rank of all the sensors node in network.
Claims (11)
1. a kind of wireless sensor network node distributed clustering method, after all nodes are clustered in network, each node from
Node with identical cluster head is considered as a sub-clustering by the cluster head that oneself is confirmed in neighbor node；Node is same when sending information
Non- leader cluster node in sub-clustering sends information to leader cluster node, and leader cluster node is sent to after polymerizeing to the information received
The leader cluster node of upper level, final information are sent to base station.
2. clustering method according to claim 1, the cluster is periodic duty, and each cluster period is divided into ordinary node
Clustering phase, leader cluster node clustering phase and stabilization sub stage；Network is in ordinary node clustering phase and leader cluster node clustering phase
The cluster operation for completing all nodes determines the leader cluster node of oneself；After cluster runs a period of time, the cluster period opens again
Begin, redefines the leader cluster node of oneself again.
3. clustering method according to claim 2, for when the cluster period starts, all nodes are all set as common in network
Node state, starts ordinary node clustering phase, and all nodes number the order to determine cluster according to itself；Certain node into
When row cluster, the information which obtains surrounding neighbours node is simultaneously analyzed, if without the leader cluster node of sub-clustering in neighbor node,
New sub-clustering is then established, selects a certain node as the leader cluster node of new sub-clustering, and newly-established sub-clustering is added；If neighbor node
In have the leader cluster node of sub-clustering, it is determined that a certain sub-clustering, and sub-clustering is added；It is leader cluster node after ordinary node clustering phase
Clustering phase, in leader cluster node clustering phase, all leader cluster nodes determine a higher level neighbour according to the information of surrounding neighbours node
The leader cluster node of node or base station another sub-clustering as belonging to is occupied, and the sub-clustering is added；After leader cluster node clustering phase,
All nodes have all clustered cluster in network, and network enters the stabilization sub stage, and sensor node acquires data, and is sent to itself
Leader cluster node, leader cluster node are uploaded to base station step by step again.
4. clustering method according to claim 3, the method for the order of the cluster is node according to itself number N,
Ordinary node clustering phase waits (N-1) * T time after starting, then starts to be clustered, and wherein T is that individual node is clustered
The required time.
5. clustering method according to claim 3, the method for obtaining surrounding neighbours nodal information be node broadcasts from
Oneself nodal information, and the broadcast message of surroundings nodes is received, to confirm the state of oneself neighbor node, and analyzed.
6. clustering method according to claim 3, the information of the node include node level not, remaining capacity, whether be
The information of leader cluster node.
7. clustering method according to claim 3, the method for the leader cluster node as new sub-clustering that selects a certain node
The remaining capacity of itself is compared with the remaining capacity of neighbor node for node, the section for selecting one of remaining capacity most
Leader cluster node of the point as new sub-clustering.
8. clustering method according to claim 3, the method that newly-established sub-clustering is added is node to new sub-clustering
Leader cluster node sends the request packet containing node ID, and the leader cluster node of new sub-clustering changes oneself state after receiving request packet, at
For leader cluster node, oneself new status information is broadcasted, and the ID in request packet is extracted, is added in the cluster of oneself, and is returned
Multiple response bag；Node receive new sub-clustering leader cluster node send should wrap after, confirmation be added sub-clustering success, by new sub-clustering
Leader cluster node is set as the leader cluster node of itself；If node itself is chosen as the leader cluster node of new sub-clustering, change state, becomes cluster
Head node, and broadcast the status information of oneself row.
9. clustering method according to claim 3, the method for a certain sub-clustering of determination is to exist in surrounding neighbours node
There is the leader cluster node of sub-clustering, the rank and remaining capacity of more each leader cluster node determine remaining in the minimum leader cluster node of rank
Sub-clustering belonging to the most leader cluster node of electricity is node sub-clustering to be added.
10. clustering method according to claim 3, the method that sub-clustering is added is cluster of the node to identified sub-clustering
Head node sends the request packet containing node ID, and the leader cluster node of sub-clustering extracts the ID in request packet after receiving request packet
Out, it is added in the cluster of oneself, and replys response bag.Node receive the sub-clustering leader cluster node send should wrap after, really
Recognize and sub-clustering success is added, the leader cluster node of the sub-clustering is set as to the leader cluster node of itself.
11. clustering method according to claim 3, the method for one higher level's neighbor node of determination is leader cluster node point
The information of neighbor node is analysed, if selecting wherein remaining electricity there are the leader cluster node of other sub-clusterings in upper level neighbor node
Measure most leader cluster nodes；If not having the leader cluster node of other sub-clusterings in upper level neighbor node, new sub-clustering is created, is selected
Leader cluster node of the most node of remaining capacity as new sub-clustering in upper level neighbor node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910474826.4A CN110177388A (en) | 2019-06-03 | 2019-06-03 | A kind of wireless sensor network node distributed clustering method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910474826.4A CN110177388A (en) | 2019-06-03 | 2019-06-03 | A kind of wireless sensor network node distributed clustering method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110177388A true CN110177388A (en) | 2019-08-27 |
Family
ID=67697087
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910474826.4A Pending CN110177388A (en) | 2019-06-03 | 2019-06-03 | A kind of wireless sensor network node distributed clustering method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110177388A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113588001A (en) * | 2021-08-12 | 2021-11-02 | 上海宏英智能科技股份有限公司 | Engineering machine tool state monitoring system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101841884A (en) * | 2010-04-30 | 2010-09-22 | 北京航空航天大学 | Wireless sensor network cluster head inheritance clustering method based on energy |
| CN101895956A (en) * | 2010-08-05 | 2010-11-24 | 中国兵器工业第二〇五研究所 | Data transmission method of multilayer distributed wireless sensor network |
| CN102711180A (en) * | 2012-05-25 | 2012-10-03 | 杭州电子科技大学 | Cluster head multiple selection energy balance routing method |
| CN103249108A (en) * | 2013-04-19 | 2013-08-14 | 江苏科技大学 | Wireless sensor network balanced energy consumption route method based on non-uniform clustering |
| CN103796273A (en) * | 2014-01-20 | 2014-05-14 | 南京邮电大学 | Energy-balanced clustering routing strategy for wireless sensor networks |
| CN107787021A (en) * | 2016-08-26 | 2018-03-09 | 扬州大学 | The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy |
| CN108882258A (en) * | 2018-09-18 | 2018-11-23 | 天津理工大学 | A kind of neighbour's rotation Hierarchical Clustering method of Wireless Sensor Networks |
-
2019
- 2019-06-03 CN CN201910474826.4A patent/CN110177388A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101841884A (en) * | 2010-04-30 | 2010-09-22 | 北京航空航天大学 | Wireless sensor network cluster head inheritance clustering method based on energy |
| CN101895956A (en) * | 2010-08-05 | 2010-11-24 | 中国兵器工业第二〇五研究所 | Data transmission method of multilayer distributed wireless sensor network |
| CN102711180A (en) * | 2012-05-25 | 2012-10-03 | 杭州电子科技大学 | Cluster head multiple selection energy balance routing method |
| CN103249108A (en) * | 2013-04-19 | 2013-08-14 | 江苏科技大学 | Wireless sensor network balanced energy consumption route method based on non-uniform clustering |
| CN103796273A (en) * | 2014-01-20 | 2014-05-14 | 南京邮电大学 | Energy-balanced clustering routing strategy for wireless sensor networks |
| CN107787021A (en) * | 2016-08-26 | 2018-03-09 | 扬州大学 | The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy |
| CN108882258A (en) * | 2018-09-18 | 2018-11-23 | 天津理工大学 | A kind of neighbour's rotation Hierarchical Clustering method of Wireless Sensor Networks |
Non-Patent Citations (17)
| Title |
|---|
| AMANJOT SINGH TOOR ET AL.: "A new Energy Aware Cluster Based Multi-hop Energy Efficient routing protocol for Wireless Sensor Networks", 《2018 THE 6TH IEEE INTERNATIONAL CONFERENCE ON SMART ENERGY GRID ENGINEERING》 * |
| AMIRA BEN AMMAR ET AL.: "Multi-Hop LEACH based Cross-layer Design for Large Scale Wireless Sensor Networks", 《2016IEEE》 * |
| ASHLYN ANTOO ET AL.: "EEM-LEACH: Energy Efficient Multi-hop LEACH Routing Protocol for Clustered WSNs", 《2014ICCICCT》 * |
| EMAD ALNAWAFA ET AL.: "DMHT-LEACH: Dynamic Multi-Hop Technique for Wireless Sensor Networks", 《2017IEEE》 * |
| EMAD ALNAWAFA ET AL.: "MHT: Multi-Hop Technique for the Improvement of LEACH Protocol", 《2016 15TH ROEDUNET CONFERENCE: NETWORKING IN EDUCATION AND RESEARCH》 * |
| IMEN SOUID ET AL.: "Multi-Hop Dynamic Clustering LEACH Protocol for Large Scale Networks", 《2014 22ND INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS (SOFTCOM)》 * |
| TIN AYE CHIT ET AL.: "Lifetime Improvement of Wireless Sensor Network using Residual Energy and Distance Parameters on LEACH Protocol", 《ISCIT 2018》 * |
| TINGTING YANG ET AL.: "Wireless Routing Clustering Protocol Based on Improved LEACH Algorithm", 《2018 IEEE INTERNATIONAL CONFERENCE ON RFID TECHNOLOGY & APPLICATION (RFID-TA)》 * |
| ZHANG JINGXIA ET AL.: "LEACH-WM: Weighted and intra-cluster multi-hop energy-efficient algorithm for wireless sensor networks", 《PROCEEDINGS OF THE 35TH CHINESE CONTROL CONFERENCE》 * |
| ZHUANG JUN ET AL.: "Research Of Cross-Layer And Multi-Hops Algorithm Based On Energy And Location", 《2012 INTERNATIONAL CONFERENCE ON INDUSTRIAL CONTROL AND ELECTRONICS ENGINEERING》 * |
| 严英鹏: "基于混合聚类算法的无线传感器网络LEACH协议改进研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 廖倩: "基于能量均衡的无线传感器网络LEACH协议的研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 施云波著: "《普通高等教育物联网工程专业"十三五"规划教材 无线传感器网络技术概论》", 31 October 2017 * |
| 李灯熬等: "一种能量有效的无线传感器网络分簇及簇间路由算法", 《自动化仪表》 * |
| 覃琪等: "一种改进LEACH的无线传感器路由协议仿真", 《科技创新与应用》 * |
| 覃琪等: "无线传感器网络低能耗多跳路由协议仿真", 《计算机仿真》 * |
| 陈炳才等: "一种基于LEACH 协议改进的簇间多跳路由协议", 《传感技术学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113588001A (en) * | 2021-08-12 | 2021-11-02 | 上海宏英智能科技股份有限公司 | Engineering machine tool state monitoring system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Long et al. | Energy-aware real-time routing for large-scale industrial internet of things | |
| CN102026331B (en) | Distributed multi-jump energy-saving communication method in wireless sensor network | |
| Sabet et al. | An energy efficient multi-level route-aware clustering algorithm for wireless sensor networks: A self-organized approach | |
| CN101360051B (en) | Energy efficient wireless sensor network routing method | |
| CN101227413B (en) | Cluster energy saving route algorithm applied in wireless sensor network | |
| CN107787021A (en) | The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy | |
| CN102740395A (en) | Self-organizing routing method facing mobile sensor network | |
| CN103209455A (en) | Wireless sensor network routing method based on node position information | |
| CN105072661A (en) | Clustering multi-hop routing protocol of wireless sensor network | |
| CN103945484A (en) | Farmland wireless self-organizing network topology density correlation path selecting and optimizing method | |
| CN101252543B (en) | Rapid data anastomosing algorithm used for wireless sensor network | |
| Manzoor et al. | Enhanced TL-LEACH routing protocol for large-scale WSN applications | |
| da Costa Bento et al. | Bio-inspired routing algorithm for MANETs based on fungi networks | |
| Pathak et al. | A priority-based weighted clustering algorithm for mobile ad hoc network | |
| CN105246117A (en) | Energy-saving routing protocol realization method suitable for mobile wireless sensor network | |
| CN101321184B (en) | Method for implementing wireless sensor network query, and data return method | |
| CN110177388A (en) | A kind of wireless sensor network node distributed clustering method | |
| Nam et al. | Cluster head selection for equal cluster size in wireless sensor networks | |
| KR100915555B1 (en) | Query-based ZigBee Mesh Routing Protocol | |
| CN110996371A (en) | Clustering algorithm for prolonging life cycle of wireless sensor network | |
| Boucetta et al. | Hierarchical cuckoo search-based routing in wireless sensor networks | |
| Hooda et al. | Enrichment of life span of sensor networks through BCO and gateway node | |
| Prusty et al. | Energy aware optimized routing protocols for wireless ad hoc sensor network | |
| Soni et al. | An investigation on energy efficient routing protocol for wireless sensor network | |
| Claudios et al. | Performance study of reconfiguration algorithms in cluster-tree topologies for wireless sensor 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: 20190827 |
|
| RJ01 | Rejection of invention patent application after publication |