CN107529201A - A kind of wireless sensor network data transmission method based on LEACH agreements - Google Patents
A kind of wireless sensor network data transmission method based on LEACH agreements Download PDFInfo
- Publication number
- CN107529201A CN107529201A CN201710755089.6A CN201710755089A CN107529201A CN 107529201 A CN107529201 A CN 107529201A CN 201710755089 A CN201710755089 A CN 201710755089A CN 107529201 A CN107529201 A CN 107529201A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- node
- cluster
- cluster head
- 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
-
- 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/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- 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 invention belongs to wireless sensor network system technical field, discloses a kind of wireless sensor network data transmission method based on LEACH agreements, by setting an energy threshold Va, data transmission procedure is divided into election of cluster head in the whole network election of cluster head and cluster；It is less than energy threshold V when energy in all cluster heads be presentaWhen, using the method for the whole network election, make each node in region have the opportunity to turn into cluster head；It is more than energy threshold V when energy in all cluster heads be presentaWhen, elected in cluster, cluster head in new cluster is selected according to dump energy, node density and to the constraints of the distance of barycenter in cluster, the structure of cluster does not change, and elects a non-leader cluster node to turn into new cluster head in cluster.The present invention has the optimal cluster head ratio of wireless sensor and actor networks, it is possible to carries out follow-up all emulation experiments, can more accurately, reliably simulate and various put into practice scene.
Description
Technical field
The invention belongs to wireless sensor network system technical field, more particularly to it is a kind of based on the wireless of LEACH agreements
Sensor network data transmission method.
Background technology
Wireless sensor network is the self-organizing network being made up of a large amount of sensor nodes by being wirelessly transferred, it is therefore an objective to real
When perceive, the relevant environmental parameter in monitoring, collection and processing region, and be ultimately sent to terminal user.Wireless sensor network
The energy of network interior joint is provided by battery, and the life span of node is limited by battery capacity, and therefore, power saving is always
The study hotspot of wireless sensor network.Based on this, the routing algorithm of high-efficiency low energy consumption is designed to extend the life cycle of network, and
The utilization rate of network is improved, it is extremely important for wireless sensor network.Routing algorithm based on sub-clustering can effectively extend
Network lifetime and increase network utilization, at present, LEACH routing algorithms are Clustering Routings in wireless sensor network
Research foundation.Its basic thought is periodically to select leader cluster node at random with certain probability, and other nodes select nearer cluster
Head enters cluster, and data are transmitted directly to the cluster head of this cluster in the timeslice belonging to oneself, and leader cluster node receives and merges this
Data that cluster interior nodes are sent simultaneously are transferred directly to base station.The energy expenditure of whole network is evenly distributed to by LEACH algorithms
In each sensor node, so as to reach the purpose for reducing network energy consumption, improving network entirety life span.
But there is also some problems：
How to be conducted an election distribution without explanation leader cluster node in LEACH Routing Protocol algorithms, just can guarantee that network data
Information transmission it is more excellent, may result in and be distributed in the set of node for be chosen to cluster head in a regional area, towards convergence save
Node energy exhausts rapidly in the critical path of point；
Often carrying out the data transfer of a wheel in LEACH Routing Protocol algorithms, the whole network just carries out re-electing for cluster head,
Some unnecessary the whole network election of cluster head need to consume excessive energy, and the most energy content of battery may be wasted in cluster head
In re-electing；
Election of cluster head in LEACH Routing Protocol algorithms does not have reasonability, only sets cluster by very simple formula
The threshold value of head election, it is unfavorable for improving the utilization rate of energy of wireless sensor network.Dump energy, the density of node are not accounted for
And the influence in geographical position etc..
The content of the invention
The problem of existing for prior art, the invention provides a kind of wireless senser based on LEACH Clustering protocols
Network data transmission method and system.
The present invention is achieved in that a kind of wireless sensor network data transmission method based on LEACH Clustering protocols,
In method after the improvement, unnecessary the whole network election of cluster head is reduced, the local election it being changed in cluster, and in cluster
Dump energy, node density and the node location of node are considered in the election process of head, with balanced each node energy
Consumption, the raising of final wireless sensor network life.
The main thought of the present invention is, by setting an energy threshold Va, data transmission procedure is divided into the whole network cluster head
Election of cluster head in election and cluster；
It is less than energy threshold V when energy in all cluster heads be presentaWhen, using the method for the whole network election, make in region
Each node has the opportunity to turn into cluster head；
It is more than energy threshold V when energy in all cluster heads be presentaWhen, elect in cluster, according to dump energy, node
Density and cluster head in new cluster is selected to the constraints of the distance of barycenter in cluster, the structure of cluster do not change, elected in cluster
One non-leader cluster node turns into new cluster head.
Further, the wireless sensor network data transmission method based on LEACH Clustering protocols comprises the following steps：
Step 1, the first round carry out the whole network election of cluster head, according to dump energy, node density, using election of cluster head threshold value
Formula elects cluster head；
Step 2, all cluster head dump energies are checked, have dump energy to be less than V in cluster headaCluster head, carry out step 3；
Otherwise step 4 is carried out；
Step 3, the whole network election of cluster head is carried out, first, the node for choosing dump energy more than node average residual energy is
Both candidate nodes G1；The threshold value election of cluster head formula of the design and the relative density of node and have to the relative distance of aggregation node
Close, G1Node in set produces random number, is compared with value caused by election of cluster head threshold formula, if random number is less than
It is worth caused by election of cluster head threshold formula, G1Node in set turns into cluster head, otherwise as ordinary node；Cluster head broadcast plus cluster
Information, ordinary node choose cluster head, and add cluster head according to reception signal size；
Step 4, election of cluster head in cluster is carried out, the collection of cluster interior nodes is combined into L, chooses dump energy in cluster and is more than or equal to
The node of average residual energy is set L1, in set L1Middle selection node relative density is more than or equal to average relative density
Node is set L2, in set L2The middle interior node nearest from barycenter of selection cluster is leader cluster node；Original cluster head will be common section
Point, maintain cluster member constant；
Step 5, the stabilization sub stage, carry out the collection and transmission of data message；
Step 6, next round election of cluster head is carried out, since step 2.
Further, the method that election of cluster head threshold value is calculated in the step 3 specifically includes：
Each node calculates the dump energy of oneself, and then aggregation node calculates the average residual energy of all nodes, choosing
Dump energy in region is taken more than the node of all node average residual energy, to be put into a set, this set is referred to as G1；
Election of cluster head threshold formula is designed as：
N in formulaiIt is present node node number, P is cluster head number needed for network and total node number purpose ratio, i.e. cluster head
Ratio；R is current election wheel number.A, b are weight coefficient and a+b=1, ρ (ni) be node relative density, expression be
In standard traffic radius R, node niNeighbor node number and standard cluster in neighbor node number ratio；Formula is：
Neighbor (n in formulai) it is node niNeighbor node number in standard traffic radius, N are always to be saved in region
Points；(1/P-1) is the neighbor node number in standard cluster；Neighbor node number is bigger, and the possibility for electing cluster head as is bigger；
λD(ni) it is ratio of the node to the average distance and node to the distance of aggregation node of aggregation node；Formula is：
D in formulatoBS(ni) it is node niTo the distance of aggregation node.The distance of node to aggregation node is bigger, elects cluster head as
Possibility it is smaller；
Candidate cluster head node generates random number, then judges whether the random number of oneself generation is less than election of cluster head threshold value,
Then election contest message is sent if less than this threshold value to base station；Base station receives the election contest message that some nodes send over, Ran Houjin
The processing of row cluster head data message, it is cluster head to determine which node.
Further, the calculating that election of cluster head in cluster is carried out in the step 4 specifically includes：
The average residual energy of all nodes is in j-th of cluster：
N in formulajFor total node number in the cluster of j-th of cluster, E (ni) it is node niCurrent remaining, by E (ni) with
Compare, select E (ni) be more than or equal toNode deposit set L1；
Set of computations L1In each node relative density ρ (ni), obtain average relative density：
H is set L in formula1Total nodal point number, ρ (ni) it is node niRelative density, by ρ (ni) withCompare, select ρ
(ni) be more than or equal toNode deposit set L2；
Set of computations L2The distance of interior joint to barycenter is：
Its interior joint niCoordinate be (xi,yi), center-of-mass coordinate isI.e.Take D
(ni) minimum node is as cluster head.
Further, the stabilization sub stage of the step 5, in the collection and transmit process that carry out data message, optimal cluster is obtained
Head compares Popt, specifically include：
Each sensor node sends lbit data messages, and the energy of consumption is：
Wherein d be transmit data two euclidean distance between node pair, d0It is critical distance；
Each sensor node receives lbit data messages, and the energy of consumption is：
ERX(l, d)=lEelec；
Assuming that in wireless sensor and actor networks region, the random area that is assigned to of all nodes is M2Region in, cluster head is total
Number is K, and the fusion 1bit data messages node energy to be consumed is EDA, it is total that the data after fusion account for transmitted data message
The ratio of amount is μ, wherein 0 ＜ μ ＜ 1, the data message amount after fusion is L=μ × 1；A wheel is carried out, transmission data length is l, single
Position is bit；
Cluster head consumes gross energy：
ECH=l × Eelec×(N/K-1)+l×EDA×(N/K)+l×L×Eelec+l×L×εmpd4 toBS；
Eno-CH=l × Eelec+l×εfsd2 toCH；
The total energy of wireless sensor network that K cluster is consumed is：
Etotal=K × [ECH+(N/K-1)×Eno-CH]≈K×(ECH+N/K×Eno-CH)
=l × [2N × Eelec+(μ-1)×K×Eelec+N×EDA+μ×εmpd4 toBS+N×εfsd2 toCH]；
≈l×[2N×Eelec+N×EDA+μ×εmpd4 toBS+N×εfsd2 toCH]
Obtain
Being continuously increased or reducing with cluster head quantity, the consumption of sensor network gross energy constantly changes, and certainly exists
A cluster head number K critical value, network total power consumption value is tended to be minimum；
To formula EtotalDerivation, when derivative is 0, obtain optimal cluster head number：
Obtain optimal cluster head ratio
Another object of the present invention is to provide a kind of wireless sensor network data such as based on LEACH agreements to transmit system
System.
Obtain the optimal cluster head ratio of wireless sensor and actor networks, it is possible to follow-up all emulation experiments are carried out, can be more
Accurately, reliably simulate and various put into practice scene.
Advantages of the present invention and good effect are：
The present invention can be seen that under identical wheel number from simulation result, and improved algorithm is all the time than in LEACH algorithm
The interstitial content of survival is more, and the data volume that aggregation node receives is also bigger than LEACH algorithm all the time, and this is also due to balanced node
Energy consumption, when making leader cluster node energy smaller, ordinary node is replaced by, has postponed first node dead time, effectively prolonged
Network morals have been grown, while have improved the efficiency of transmission of data volume.By taking the death time as an example, the 1st, 50,100 node
When starting dead, the wheel number of LEACH algorithms is respectively 532.4,845.2,1781.3, and the wheel number of this innovatory algorithm is respectively
911.3rd, 1067.8,1879.5, it has been respectively increased 71.2%, 26.3%, 5.5% compared to LEACH agreements.
Brief description of the drawings
Fig. 1 is the wireless sensor network data transmission method flow provided in an embodiment of the present invention based on LEACH agreements
Figure.
Fig. 2 is election of cluster head phase flow figure provided in an embodiment of the present invention；
Fig. 3 is cluster formation stages flow chart provided in an embodiment of the present invention；
Fig. 4 is stable transmission data phase flow chart provided in an embodiment of the present invention；
Fig. 5 simulation result figures one provided in an embodiment of the present invention.
Fig. 6 is simulation result figure two provided in an embodiment of the present invention.
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to embodiments, to the present invention
It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to
Limit the present invention.
Traditional Clustering protocol is not defined to the residual energy value of network node；Traditional Clustering protocol selection cluster
The defects of not considering residue energy of node during first node, LEACH agreements select not consider node density and node during cluster head node
The defects of to distance between aggregation node etc..
The application principle of the present invention is described in detail below in conjunction with the accompanying drawings.
Wireless sensor network data transmission method provided in an embodiment of the present invention based on LEACH agreements, cluster head is selected
Act, which is divided into the whole network election and cluster, elects；It is less than energy threshold V when energy in all cluster heads be presentaWhen, elected using the whole network
Method, this election of cluster head method is with the dump energy of wireless sensor network, node density and the distance to aggregation node
Etc. relevant, i.e., cluster head is chosen using reasonable threshold value, each node that the whole network election allows in region has the opportunity to turn into cluster head；
Otherwise elected in cluster, come according to constraintss such as dump energy, node density and the distances to barycenter in cluster
Cluster head in new cluster is selected, the structure of cluster will not change, and elect a non-leader cluster node to turn into new cluster head in cluster.Selected in cluster
Act is easier than the algorithm of the whole network election, and the change in structure will be smaller.Preferably balanced by two kinds of election of cluster head mechanism
The consumption of each node energy.
As shown in figure 1, the wireless sensor network data transmission side provided in an embodiment of the present invention based on LEACH agreements
Method, comprise the following steps：
S101：The first round carries out the whole network election of cluster head, according to dump energy, node density, using rational threshold value cluster head
Elect formula election cluster head.
S102：All cluster head dump energies are checked, if there is dump energy to be less than V in cluster headaCluster head, carry out S103.
Otherwise S104 is carried out.
S103：The whole network election of cluster head is carried out, first, it is time to choose dump energy more than the node of node average residual energy
Select node G1.The threshold formula of design considers the relative density of node and the relative distance to aggregation node, G1Node in set
Random number is produced, is compared with value caused by threshold formula, if random number is less than this value, this node turns into cluster head, no
Then turn into ordinary node.Cluster head broadcast plus cluster information, ordinary node choose cluster head, and add cluster according to reception signal size
Head.
S104：Election of cluster head in cluster is carried out, the collection of cluster interior nodes is combined into L, and dump energy is more than or equal to flat in selection cluster
The node of equal dump energy is set L1, in set L1Middle selection node relative density is more than or the section equal to average relative density
Point is set L2, in set L2The middle interior node nearest from barycenter of selection cluster is leader cluster node.Original cluster head will be ordinary node,
Maintain cluster member constant.
S105：Stabilization sub stage, carry out the collection and transmission of data message.
S106：Next round election of cluster head is carried out, since S102.
The method that election of cluster head threshold value is calculated in the S103 specifically includes：
Each node calculates the dump energy of oneself, and then aggregation node calculates the average residual energy of all nodes, choosing
Dump energy in region is taken more than the node of all node average residual energy, to be put into a set, this set is referred to as G1。
The formula of election of cluster head threshold value may be designed as：
Wherein P represents cluster head ratio；A, b are weight coefficient and a+b=1, ρ (ni) be node relative density, expression
It is the ratio of the neighbor node number and neighbor node number in standard cluster of node in standard traffic radius R.Its formula is：
Wherein Neighbor (ni) it is node niNeighbor node number in standard traffic radius, N are always to be saved in region
Points；(1/P-1) is the neighbor node number in standard cluster.Neighbor node number is bigger, and the possibility for electing cluster head as is bigger.
λD(ni) it is ratio of the node to the average distance and node to the distance of aggregation node of aggregation node.Its formula is：
Wherein b is weight coefficient, DtoBS(ni) it is node niTo the distance of aggregation node.Distance of the node to aggregation node
Bigger, the possibility for electing cluster head as is smaller.
Candidate cluster head node generates random number, then judges whether the random number of oneself generation is less than election of cluster head threshold value,
Then election contest message is sent if less than this threshold value to base station.Base station receives the election contest message that some nodes send over, Ran Houjin
The processing of row cluster head data message, it is cluster head to determine which node.
Calculate and specifically include in the S104：
The average residual energy of all nodes is in j-th of cluster：
Wherein NjFor total node number in the cluster of j-th of cluster, by the dump energy E (n of cluster interior nodesi) withCompare, select
It is more than or equal toNode deposit set L1。
Set of computations L1In each node relative density ρ (ni), obtain average relative density：
Wherein H is set L1Total nodal point number, by the relative density ρ (n of nodei) withCompare, choosing is more than or equal toNode deposit set L2。
Set of computations L2The distance of interior joint to barycenter is：
Its interior joint niCoordinate be (xi,yi), center-of-mass coordinate isI.e.Take D
(ni) minimum node is as cluster head
The stabilization sub stage of the S105 carries out data transfer procedure, can obtain optimal cluster head and compare Popt, calculate specific bag
Include：
Each sensor node sends lbit data messages, and the energy of consumption is：
Wherein d be transmit data two euclidean distance between node pair, d0It is critical distance.
Each sensor node receives lbit data messages, and the energy of consumption is：
ERX(l, d)=lEelec；
Assuming that in wireless sensor and actor networks region, the random area that is assigned to of all nodes is M2Region in, cluster head is total
Number is K, and the fusion 1bit data messages node energy to be consumed is EDA, it is total that the data after fusion account for transmitted data message
The ratio of amount is μ (0 ＜ μ ＜ 1), then the data message amount after merging is L=μ × 1.A wheel is carried out, transmission data length is l, single
Position is bit.
Cluster head consumes gross energy：
ECH=l × Eelec×(N/K-1)+l×EDA×(N/K)+l×L×Eelec+l×L×εmpd4 toBS；
Eno-CH=l × Eelec+l×εfsd2 toCH；
The total energy of wireless sensor network that K cluster is consumed is：
Etotal=K × [ECH+(N/K-1)×Eno-CH]≈K×(ECH+N/K×Eno-CH)
=l × [2N × Eelec+(μ-1)×K×Eelec+N×EDA+μ×εmpd4 toBS+N×εfsd2 toCH]；
≈l×[2N×Eelec+N×EDA+μ×εmpd4 toBS+N×εfsd2 toCH]
It is easy to obtain
Being continuously increased or reducing with cluster head quantity, the consumption of sensor network gross energy is continually changing, so
Certainly exist cluster head number K critical value so that network total power consumption value tends to be minimum.
To formula EtotalDerivation, when derivative is 0, obtain optimal cluster head number：
So as to obtain optimal cluster head ratio
There is the optimal cluster head ratio of wireless sensor and actor networks, it is possible to follow-up all emulation experiments are carried out, can be more
Accurately, reliably simulate and various put into practice scene.
Fig. 2 is election of cluster head phase flow figure provided in an embodiment of the present invention；
Fig. 3 is cluster formation stages flow chart provided in an embodiment of the present invention；
Fig. 4 is stable transmission data phase flow chart provided in an embodiment of the present invention.
The application principle of the present invention is further described with reference to simulation result.
Simulation result：
The network scenarios design of emulation experiment is as follows：The primary power of all the sensors node is identical, is randomly dispersed in area
Domain size is 100m × 100m square area, and sensor node quantity is 100, the coordinate of aggregation node for (45,
175).Aggregation node is located at outside monitored area, and sensor node and aggregation node are immovable.All experimental datas are all logical
Cross obtained by 10 experiments are averaged.Leader cluster node number accounts for the desired value p=0.1 of total node number amount percentage, energy cut-off
Value VaFor 20% primary power.Weight selection parameter a=0.7, b=0.3.
Experiment parameter such as following table：
Fig. 5 and Fig. 6 is right respectively in terms of the surviving node number and aggregation node of Local Area Network receive data volume two
The algorithm of LEACH algorithms and this programme carries out performance comparision.Compare two simulation result figures, designed cluster algorithm performance is bright
It is aobvious to be better than traditional LEACH cluster algorithms, network lifecycle is extended, and can greatly ensure effective transmission of data
Amount.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
All any modification, equivalent and improvement made within refreshing and principle etc., should be included in the scope of the protection.
Claims (6)
1. a kind of wireless sensor network data transmission method based on LEACH agreements, it is characterised in that described to be based on LEACH
The wireless sensor network data transmission method of agreement is by setting an energy threshold Va, data transmission procedure is divided into the whole network
Election of cluster head in election of cluster head and cluster；
It is less than energy threshold V when energy in all cluster heads be presentaWhen, using the method for the whole network election, make each in region
Node has the opportunity to turn into cluster head；
It is more than energy threshold V when energy in all cluster heads be presentaWhen, elect in cluster, according to dump energy, node density
Cluster head in new cluster is selected with the constraints to the distance of barycenter in cluster, the structure of cluster does not change, and one is elected in cluster
Non- leader cluster node turns into new cluster head.
2. the wireless sensor network data transmission method as claimed in claim 1 based on LEACH agreements, it is characterised in that
The wireless sensor network data transmission method based on LEACH agreements comprises the following steps：
Step 1, the first round carry out the whole network election of cluster head, according to dump energy, node density, using election of cluster head threshold formula
Elect cluster head；
Step 2, all cluster head dump energies are checked, have dump energy to be less than V in cluster headaCluster head, carry out step 3；Otherwise enter
Row step 4；
Step 3, the whole network election of cluster head is carried out, first, the node for choosing dump energy more than node average residual energy is candidate
Node G1；G1Node in set produces random number, is compared with value caused by threshold formula, if random number is less than threshold value
It is worth caused by election of cluster head formula, G1Node in set turns into cluster head, otherwise as ordinary node；Cluster head broadcast plus cluster letter
Breath, ordinary node choose cluster head, and add cluster head according to reception signal size；
Step 4, election of cluster head in cluster is carried out, the collection of cluster interior nodes is combined into L, chooses dump energy in cluster and is more than or equal to averagely
The node of dump energy is set L1, in set L1Middle selection node relative density is more than or the node equal to average relative density
For set L2, in set L2The middle interior node nearest from barycenter of selection cluster is leader cluster node；Original cluster head will be ordinary node, dimension
It is constant to hold cluster member；
Step 5, the stabilization sub stage, carry out the collection and transmission of data message；
Step 6, next round election of cluster head is carried out, since step 2.
3. the wireless sensor network data transmission method as claimed in claim 2 based on LEACH agreements, it is characterised in that
Election of cluster head threshold method in the step 3 specifically includes：
Each node calculates the dump energy of oneself, and then aggregation node calculates the average residual energy of all nodes, chooses area
Dump energy is more than the node of all node average residual energy in domain, is put into a set, and this set is referred to as G1；Cluster head
Election threshold formula be：
<mrow>
<mi>T</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mfrac>
<mi>P</mi>
<mrow>
<mn>1</mn>
<mo>-</mo>
<mi>P</mi>
<mo>&lsqb;</mo>
<mi>r</mi>
<mi>mod</mi>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>/</mo>
<mi>P</mi>
<mo>)</mo>
</mrow>
<mo>&rsqb;</mo>
</mrow>
</mfrac>
<mo>&times;</mo>
<mo>(</mo>
<mi>a</mi>
<mi>&rho;</mi>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
<mo>+</mo>
<mi>b</mi>
<msub>
<mi>&lambda;</mi>
<mi>D</mi>
</msub>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
<mo>)</mo>
<mo>,</mo>
<mo>&ForAll;</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>&Element;</mo>
<msub>
<mi>G</mi>
<mn>1</mn>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mn>0</mn>
<mo>,</mo>
<mo>&ForAll;</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>&NotElement;</mo>
<msub>
<mi>G</mi>
<mn>1</mn>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>;</mo>
</mrow>
N in formulaiIt is present node node number, P is cluster head number needed for network and total node number purpose ratio, i.e. cluster head ratio；
R is current election wheel number.A, b are weight coefficient and a+b=1, ρ (ni) be node relative density, expression is in standard
In communication radius R, node niNeighbor node number and standard cluster in neighbor node number ratio；Formula is：
<mrow>
<mi>&rho;</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mrow>
<mi>N</mi>
<mi>e</mi>
<mi>i</mi>
<mi>g</mi>
<mi>h</mi>
<mi>b</mi>
<mi>o</mi>
<mi>r</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>/</mo>
<mi>P</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mfrac>
<mo>;</mo>
</mrow>
Wherein Neighbor (ni) it is node niNeighbor node number in standard traffic radius, N are total node in region
Number；(1/P-1) is the neighbor node number in standard cluster；Neighbor node number is bigger, and the possibility for electing cluster head as is bigger；
λD(ni) it is ratio of the node to the average distance and node to the distance of aggregation node of aggregation node；Formula is：
<mrow>
<msub>
<mi>&lambda;</mi>
<mi>D</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>D</mi>
<mrow>
<mi>t</mi>
<mi>o</mi>
<mi>B</mi>
<mi>S</mi>
</mrow>
</msub>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
<mo>)</mo>
<mo>/</mo>
<mi>N</mi>
</mrow>
<mrow>
<msub>
<mi>D</mi>
<mrow>
<mi>t</mi>
<mi>o</mi>
<mi>B</mi>
<mi>S</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>;</mo>
</mrow>
Wherein b is weight coefficient, DtoBS(ni) it is node niTo the distance of aggregation node.The distance of node to aggregation node is bigger,
The possibility for electing cluster head as is smaller；
Candidate cluster head node generates random number, then judges whether the random number of oneself generation is less than election of cluster head threshold value, if
Then election contest message is sent less than this threshold value to base station；Base station receives the election contest message that some nodes send over, and then carries out cluster
The processing of head data message, it is cluster head to determine which node.
4. the wireless sensor network data transmission method as claimed in claim 2 based on LEACH agreements, it is characterised in that
The calculating that election of cluster head in cluster is carried out in the step 4 specifically includes：
The average residual energy of all nodes is in j-th of cluster：
<mrow>
<msub>
<mover>
<mi>E</mi>
<mo>&OverBar;</mo>
</mover>
<mi>j</mi>
</msub>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>N</mi>
<mi>j</mi>
</msub>
</munderover>
<mi>E</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>/</mo>
<msub>
<mi>N</mi>
<mi>j</mi>
</msub>
<mo>;</mo>
</mrow>
N in formulajFor total node number in the cluster of j-th of cluster, E (ni) it is node niCurrent remaining, by E (ni) withCompare
Compared with selecting E (ni) be more than or equal toNode deposit set L1；
Set of computations L1In each node relative density ρ (ni), obtain average relative density：
<mrow>
<msub>
<mover>
<mi>&rho;</mi>
<mo>&OverBar;</mo>
</mover>
<mi>j</mi>
</msub>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>N</mi>
<mi>j</mi>
</msub>
</munderover>
<mi>&rho;</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>I</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>/</mo>
<mi>H</mi>
<mo>,</mo>
<mi>i</mi>
<mo>&Element;</mo>
<msub>
<mi>L</mi>
<mn>1</mn>
</msub>
<mo>;</mo>
</mrow>
Wherein H is set L1Total nodal point number, ρ (ni) it is node niRelative density, by ρ (ni) withCompare, select ρ (ni) big
In or be equal toNode deposit set L2；
Set of computations L2The distance of interior joint to barycenter is：
<mrow>
<mi>D</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>n</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msqrt>
<mrow>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>-</mo>
<mover>
<mi>x</mi>
<mo>&OverBar;</mo>
</mover>
<mo>)</mo>
</mrow>
<mn>2</mn>
</msup>
<mo>+</mo>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>y</mi>
<mi>i</mi>
</msub>
<mo>-</mo>
<mover>
<mi>y</mi>
<mo>&OverBar;</mo>
</mover>
<mo>)</mo>
</mrow>
<mn>2</mn>
</msup>
</mrow>
</msqrt>
<mo>,</mo>
<mi>i</mi>
<mo>&Element;</mo>
<msub>
<mi>L</mi>
<mn>2</mn>
</msub>
<mo>;</mo>
</mrow>
Its interior joint niCoordinate be (xi,yi), center-of-mass coordinate isI.e.Take D (ni) most
Small node is as cluster head.
5. the wireless sensor network data transmission method as claimed in claim 2 based on LEACH agreements, it is characterised in that
The stabilization sub stage of the step 5, in the collection and transmit process that carry out data message, obtain optimal cluster head and compare Popt, specific bag
Include：
Each sensor node sends lbit data messages, and the energy of consumption is：
<mrow>
<msub>
<mi>E</mi>
<mrow>
<mi>T</mi>
<mi>X</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mi>d</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mi>l</mi>
<mo>&times;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<mi>l</mi>
<mo>&times;</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>m</mi>
<mi>p</mi>
</mrow>
</msub>
<mo>&times;</mo>
<msup>
<mi>d</mi>
<mn>4</mn>
</msup>
<mo>,</mo>
<mi>d</mi>
<mo>&GreaterEqual;</mo>
<msub>
<mi>d</mi>
<mn>0</mn>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mi>l</mi>
<mo>&times;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<mi>l</mi>
<mo>&times;</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<mo>&times;</mo>
<msup>
<mi>d</mi>
<mn>2</mn>
</msup>
<mo>,</mo>
<mi>d</mi>
<mo><</mo>
<msub>
<mi>d</mi>
<mn>0</mn>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>;</mo>
</mrow>
Wherein d be transmit data two euclidean distance between node pair, d0It is critical distance；
Each sensor node receives lbit data messages, and the energy of consumption is：
ERX(l, d)=lEelec；
Assuming that in wireless sensor and actor networks region, the random area that is assigned to of all nodes is M2Region in, cluster head total number is
K, the fusion 1bit data messages node energy to be consumed is EDA, the data after fusion account for the ratio of transmitted data message total amount
For μ, wherein 0 ＜ μ ＜ 1, the data message amount after fusion is L=μ × 1；A wheel is carried out, transmission data length is l, and unit is
bit；
Cluster head consumes gross energy：
ECH=l × Eelec×(N/K-1)+l×EDA×(N/K)+l×L×Eelec+l×L×εmpd4 toBS；
Eno-CH=l × Eelec+l×εfsd2 toCH；
The total energy of wireless sensor network that K cluster is consumed is：
<mrow>
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>E</mi>
<mrow>
<mi>t</mi>
<mi>o</mi>
<mi>t</mi>
<mi>a</mi>
<mi>l</mi>
</mrow>
</msub>
<mo>=</mo>
<mi>K</mi>
<mo>&times;</mo>
<mo>&lsqb;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mi>N</mi>
<mo>/</mo>
<mi>K</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>&times;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>n</mi>
<mi>o</mi>
<mo>-</mo>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>&rsqb;</mo>
<mo>&ap;</mo>
<mi>K</mi>
<mo>&times;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>+</mo>
<mi>N</mi>
<mo>/</mo>
<mi>K</mi>
<mo>&times;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>n</mi>
<mi>o</mi>
<mo>-</mo>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>=</mo>
<mi>l</mi>
<mo>&times;</mo>
<mo>&lsqb;</mo>
<mn>2</mn>
<mi>N</mi>
<mo>&times;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mi>&mu;</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>&times;</mo>
<mi>K</mi>
<mo>&times;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<mi>N</mi>
<mo>&times;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>D</mi>
<mi>A</mi>
</mrow>
</msub>
<mo>+</mo>
<mi>&mu;</mi>
<mo>&times;</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>m</mi>
<mi>p</mi>
</mrow>
</msub>
<msub>
<msup>
<mi>d</mi>
<mn>4</mn>
</msup>
<mrow>
<mi>t</mi>
<mi>o</mi>
<mi>B</mi>
<mi>S</mi>
</mrow>
</msub>
<mo>+</mo>
<mi>N</mi>
<mo>&times;</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<msub>
<msup>
<mi>d</mi>
<mn>4</mn>
</msup>
<mrow>
<mi>t</mi>
<mi>o</mi>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>&ap;</mo>
<mi>l</mi>
<mo>&times;</mo>
<mo>&lsqb;</mo>
<mn>2</mn>
<mi>N</mi>
<mo>&times;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<mi>N</mi>
<mo>&times;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>D</mi>
<mi>A</mi>
</mrow>
</msub>
<mo>+</mo>
<mi>&mu;</mi>
<mo>&times;</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>m</mi>
<mi>p</mi>
</mrow>
</msub>
<msub>
<msup>
<mi>d</mi>
<mn>4</mn>
</msup>
<mrow>
<mi>t</mi>
<mi>o</mi>
<mi>B</mi>
<mi>S</mi>
</mrow>
</msub>
<mo>+</mo>
<mi>N</mi>
<mo>&times;</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<msub>
<msup>
<mi>d</mi>
<mn>4</mn>
</msup>
<mrow>
<mi>t</mi>
<mi>o</mi>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
</mtd>
</mtr>
</mtable>
<mo>;</mo>
</mrow>
Obtain
<mrow>
<mi>E</mi>
<mo>&lsqb;</mo>
<msub>
<msup>
<mi>d</mi>
<mn>2</mn>
</msup>
<mrow>
<mi>t</mi>
<mi>o</mi>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>&rsqb;</mo>
<mo>=</mo>
<mfrac>
<msup>
<mi>M</mi>
<mn>2</mn>
</msup>
<mrow>
<mn>2</mn>
<mi>&pi;</mi>
<mi>K</mi>
</mrow>
</mfrac>
<mo>;</mo>
</mrow>
To formula EtotalDerivation, when derivative is 0, obtain optimal cluster head number：
<mrow>
<msub>
<mi>K</mi>
<mrow>
<mi>o</mi>
<mi>p</mi>
<mi>t</mi>
</mrow>
</msub>
<mo>=</mo>
<msqrt>
<mfrac>
<mi>N</mi>
<mrow>
<mn>2</mn>
<mi>&pi;</mi>
<mi>&mu;</mi>
</mrow>
</mfrac>
</msqrt>
<msqrt>
<mfrac>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>m</mi>
<mi>p</mi>
</mrow>
</msub>
</mfrac>
</msqrt>
<mfrac>
<mi>M</mi>
<mrow>
<msub>
<msup>
<mi>d</mi>
<mn>2</mn>
</msup>
<mrow>
<mi>t</mi>
<mi>o</mi>
<mi>B</mi>
<mi>S</mi>
</mrow>
</msub>
</mrow>
</mfrac>
<mo>;</mo>
</mrow>
Obtain optimal cluster head ratio
6. a kind of wireless sensor network data transmission method as claimed in claim 1 based on LEACH agreements based on LEACH
The wireless sensor network data Transmission system of agreement.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710755089.6A CN107529201A (en) | 2017-08-29 | 2017-08-29 | A kind of wireless sensor network data transmission method based on LEACH agreements |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710755089.6A CN107529201A (en) | 2017-08-29 | 2017-08-29 | A kind of wireless sensor network data transmission method based on LEACH agreements |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107529201A true CN107529201A (en) | 2017-12-29 |
Family
ID=60682427
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710755089.6A Pending CN107529201A (en) | 2017-08-29 | 2017-08-29 | A kind of wireless sensor network data transmission method based on LEACH agreements |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107529201A (en) |
Cited By (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108306821A (en) * | 2018-02-10 | 2018-07-20 | 长安大学 | Super High structures monitor low power consumption optimization method |
| CN108416833A (en) * | 2018-03-02 | 2018-08-17 | 景德镇陶瓷大学 | One kind synchronizing indoor design imaging control system based on mobile terminal data |
| CN108430089A (en) * | 2018-05-04 | 2018-08-21 | 南京邮电大学 | A kind of vehicular ad hoc network based on deep learning is by cluster-dividing method |
| CN108521633A (en) * | 2018-02-27 | 2018-09-11 | 南京邮电大学 | Minepit environment wireless sense network cluster routing method based on K mean values |
| CN108770036A (en) * | 2018-06-20 | 2018-11-06 | 中国联合网络通信集团有限公司 | Communication means and wireless sensor network Routing Protocol between cluster head |
| CN108829941A (en) * | 2018-05-25 | 2018-11-16 | 湖南城市学院 | A kind of assembled architecture design device and method |
| CN108848476A (en) * | 2018-06-21 | 2018-11-20 | 河南科技大学 | Power-efficient data assembly algorithms based on communication distance control in sensor network |
| CN108966327A (en) * | 2018-08-22 | 2018-12-07 | 中国农业科学院农业信息研究所 | A kind of service life extension method and system of agricultural wireless sensor network |
| CN109348442A (en) * | 2018-08-20 | 2019-02-15 | 洛阳中科协同科技有限公司 | A kind of wireless sensor cluster-dividing method based on timer |
| CN109377744A (en) * | 2018-12-19 | 2019-02-22 | 国网新疆电力有限公司电力科学研究院 | A kind of partial discharge of switchgear data collection system based on FUSION WITH MULTISENSOR DETECTION |
| CN109526037A (en) * | 2019-01-03 | 2019-03-26 | 中国联合网络通信集团有限公司 | A kind of node cluster head electoral machinery and system |
| CN109640283A (en) * | 2018-12-28 | 2019-04-16 | 北京航天测控技术有限公司 | A kind of low-consumption wireless sensing network design method based on self energizing technology |
| CN110087273A (en) * | 2019-03-13 | 2019-08-02 | 西安电子科技大学 | The method of Wireless sensor network clustering routing, wireless sensor network protocols platform |
| CN110149672A (en) * | 2019-05-24 | 2019-08-20 | 贵州大学 | A kind of improved I-LEACH routing communication means |
| CN110418382A (en) * | 2019-06-27 | 2019-11-05 | 珠海格力电器股份有限公司 | Networking method of network and network |
| CN110536373A (en) * | 2019-08-13 | 2019-12-03 | 江苏大学 | A kind of optical-wireless sensor network clustering method based on copula theory |
| CN110662190A (en) * | 2019-09-19 | 2020-01-07 | 北京交通大学 | Dynamic clustering LEACH method in wireless sensor network |
| CN111031506A (en) * | 2019-12-16 | 2020-04-17 | 南京邮电大学 | Wireless sensor network clustering algorithm based on Voronoi graph domain processing |
| CN111148117A (en) * | 2020-01-19 | 2020-05-12 | 中南林业科技大学 | LEACH protocol cluster head selection method based on position and energy correlation |
| CN111182492A (en) * | 2020-01-03 | 2020-05-19 | 安徽理工大学 | Improved LEACH clustering hierarchical routing algorithm |
| CN111182574A (en) * | 2019-07-30 | 2020-05-19 | 内蒙古大学 | APTEEN routing protocol optimization method based on genetic algorithm and optimization device thereof |
| CN111541494A (en) * | 2020-06-15 | 2020-08-14 | 河海大学常州校区 | Location privacy protection method based on clustering structure in underwater acoustic sensor network |
| CN111711930A (en) * | 2020-06-04 | 2020-09-25 | 中国联合网络通信集团有限公司 | Cluster head election method, system, terminal equipment and computer readable storage medium |
| CN111935734A (en) * | 2020-06-10 | 2020-11-13 | 长春师范大学 | Wireless sensor network clustering method based on improved AP clustering |
| CN112996076A (en) * | 2021-02-05 | 2021-06-18 | 东北大学 | Mobile charging and data collection method in wireless sensor network |
| CN113242587A (en) * | 2021-01-04 | 2021-08-10 | 湖州师范学院 | Cluster routing method based on hexagonal centroid cluster head election and dynamic time slot allocation |
| CN114025404A (en) * | 2021-11-08 | 2022-02-08 | 中国核动力研究设计院 | Wireless sensor network routing protocol method, wireless sensor and storage medium |
| CN114222343A (en) * | 2021-12-03 | 2022-03-22 | 国网江苏省电力有限公司电力科学研究院 | Underground pipe gallery wireless sensor network routing method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101237416A (en) * | 2008-03-05 | 2008-08-06 | 中科院嘉兴中心微系统所分中心 | Method for local topology reconstruction of wireless sensor network based on sector |
| CN101841884A (en) * | 2010-04-30 | 2010-09-22 | 北京航空航天大学 | Wireless sensor network cluster head inheritance clustering method based on energy |
| CN102802175A (en) * | 2012-02-24 | 2012-11-28 | 东北电力大学 | Energy-consumption-based routing optimization algorithm for wireless sensor network |
| US20160295435A1 (en) * | 2015-03-31 | 2016-10-06 | King Fahd University Of Petroleum And Minerals | Apparatus and method for evaluating wireless sensor networks |
| CN106792973A (en) * | 2016-12-30 | 2017-05-31 | 武汉中原电子信息有限公司 | Cluster head election and its shift process in a kind of energy heterogeneous wireless sensor network |
-
2017
- 2017-08-29 CN CN201710755089.6A patent/CN107529201A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101237416A (en) * | 2008-03-05 | 2008-08-06 | 中科院嘉兴中心微系统所分中心 | Method for local topology reconstruction of wireless sensor network based on sector |
| CN101841884A (en) * | 2010-04-30 | 2010-09-22 | 北京航空航天大学 | Wireless sensor network cluster head inheritance clustering method based on energy |
| CN102802175A (en) * | 2012-02-24 | 2012-11-28 | 东北电力大学 | Energy-consumption-based routing optimization algorithm for wireless sensor network |
| US20160295435A1 (en) * | 2015-03-31 | 2016-10-06 | King Fahd University Of Petroleum And Minerals | Apparatus and method for evaluating wireless sensor networks |
| CN106792973A (en) * | 2016-12-30 | 2017-05-31 | 武汉中原电子信息有限公司 | Cluster head election and its shift process in a kind of energy heterogeneous wireless sensor network |
Non-Patent Citations (5)
| Title |
|---|
| 吕程林等: ""一种基于LEACH协议的分簇路由算法"", 《计算机技术与发展》 * |
| 唐甲东: ""基于LEACH协议的能耗均衡路由算法"", 《计算机工程》 * |
| 唐甲东: ""无线传感器网络路由协议研究-LEACH路由协议的改进"", 《信息科技辑》 * |
| 王灵矫: ""基于权重的NPCHS-Leach协议簇头选取策略优化研究"", 《传感技术学报》 * |
| 高瑜: ""基于节点权值的簇头选举优化算法"", 《太原科技大学学报》 * |
Cited By (41)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108306821A (en) * | 2018-02-10 | 2018-07-20 | 长安大学 | Super High structures monitor low power consumption optimization method |
| CN108521633A (en) * | 2018-02-27 | 2018-09-11 | 南京邮电大学 | Minepit environment wireless sense network cluster routing method based on K mean values |
| CN108416833A (en) * | 2018-03-02 | 2018-08-17 | 景德镇陶瓷大学 | One kind synchronizing indoor design imaging control system based on mobile terminal data |
| CN108430089A (en) * | 2018-05-04 | 2018-08-21 | 南京邮电大学 | A kind of vehicular ad hoc network based on deep learning is by cluster-dividing method |
| CN108829941A (en) * | 2018-05-25 | 2018-11-16 | 湖南城市学院 | A kind of assembled architecture design device and method |
| CN108770036A (en) * | 2018-06-20 | 2018-11-06 | 中国联合网络通信集团有限公司 | Communication means and wireless sensor network Routing Protocol between cluster head |
| CN108770036B (en) * | 2018-06-20 | 2020-10-02 | 中国联合网络通信集团有限公司 | Inter-cluster-head communication method and wireless sensor network routing device |
| CN108848476A (en) * | 2018-06-21 | 2018-11-20 | 河南科技大学 | Power-efficient data assembly algorithms based on communication distance control in sensor network |
| CN109348442B (en) * | 2018-08-20 | 2023-02-21 | 洛阳国花新能源科技有限公司 | Wireless sensor clustering method based on timer |
| CN109348442A (en) * | 2018-08-20 | 2019-02-15 | 洛阳中科协同科技有限公司 | A kind of wireless sensor cluster-dividing method based on timer |
| CN108966327B (en) * | 2018-08-22 | 2021-02-05 | 中国农业科学院农业信息研究所 | Method and system for prolonging service life of agricultural wireless sensor network |
| CN108966327A (en) * | 2018-08-22 | 2018-12-07 | 中国农业科学院农业信息研究所 | A kind of service life extension method and system of agricultural wireless sensor network |
| CN109377744A (en) * | 2018-12-19 | 2019-02-22 | 国网新疆电力有限公司电力科学研究院 | A kind of partial discharge of switchgear data collection system based on FUSION WITH MULTISENSOR DETECTION |
| CN109640283A (en) * | 2018-12-28 | 2019-04-16 | 北京航天测控技术有限公司 | A kind of low-consumption wireless sensing network design method based on self energizing technology |
| CN109526037A (en) * | 2019-01-03 | 2019-03-26 | 中国联合网络通信集团有限公司 | A kind of node cluster head electoral machinery and system |
| CN110087273A (en) * | 2019-03-13 | 2019-08-02 | 西安电子科技大学 | The method of Wireless sensor network clustering routing, wireless sensor network protocols platform |
| CN110087273B (en) * | 2019-03-13 | 2022-07-22 | 西安电子科技大学 | Wireless sensor network clustering routing method and wireless sensor network protocol platform |
| CN110149672A (en) * | 2019-05-24 | 2019-08-20 | 贵州大学 | A kind of improved I-LEACH routing communication means |
| CN110149672B (en) * | 2019-05-24 | 2022-09-23 | 贵州大学 | Improved I-LEACH route communication method |
| CN110418382A (en) * | 2019-06-27 | 2019-11-05 | 珠海格力电器股份有限公司 | Networking method of network and network |
| CN111182574A (en) * | 2019-07-30 | 2020-05-19 | 内蒙古大学 | APTEEN routing protocol optimization method based on genetic algorithm and optimization device thereof |
| CN110536373A (en) * | 2019-08-13 | 2019-12-03 | 江苏大学 | A kind of optical-wireless sensor network clustering method based on copula theory |
| CN110536373B (en) * | 2019-08-13 | 2022-10-28 | 江苏大学 | Optical wireless sensor network clustering method based on copula theory |
| CN110662190B (en) * | 2019-09-19 | 2021-07-13 | 北京交通大学 | Dynamic clustering LEACH method in wireless sensor network |
| CN110662190A (en) * | 2019-09-19 | 2020-01-07 | 北京交通大学 | Dynamic clustering LEACH method in wireless sensor network |
| CN111031506A (en) * | 2019-12-16 | 2020-04-17 | 南京邮电大学 | Wireless sensor network clustering algorithm based on Voronoi graph domain processing |
| CN111031506B (en) * | 2019-12-16 | 2023-07-07 | 南京邮电大学 | Wireless sensor network clustering method based on Voronoi domain processing |
| CN111182492A (en) * | 2020-01-03 | 2020-05-19 | 安徽理工大学 | Improved LEACH clustering hierarchical routing algorithm |
| CN111148117B (en) * | 2020-01-19 | 2022-09-16 | 中南林业科技大学 | LEACH protocol cluster head selection method based on position and energy correlation |
| CN111148117A (en) * | 2020-01-19 | 2020-05-12 | 中南林业科技大学 | LEACH protocol cluster head selection method based on position and energy correlation |
| CN111711930B (en) * | 2020-06-04 | 2023-03-24 | 中国联合网络通信集团有限公司 | Cluster head election method, system, terminal equipment and computer readable storage medium |
| CN111711930A (en) * | 2020-06-04 | 2020-09-25 | 中国联合网络通信集团有限公司 | Cluster head election method, system, terminal equipment and computer readable storage medium |
| CN111935734B (en) * | 2020-06-10 | 2022-08-26 | 长春师范大学 | Wireless sensor network clustering method based on improved AP clustering |
| CN111935734A (en) * | 2020-06-10 | 2020-11-13 | 长春师范大学 | Wireless sensor network clustering method based on improved AP clustering |
| CN111541494A (en) * | 2020-06-15 | 2020-08-14 | 河海大学常州校区 | Location privacy protection method based on clustering structure in underwater acoustic sensor network |
| CN113242587A (en) * | 2021-01-04 | 2021-08-10 | 湖州师范学院 | Cluster routing method based on hexagonal centroid cluster head election and dynamic time slot allocation |
| CN112996076A (en) * | 2021-02-05 | 2021-06-18 | 东北大学 | Mobile charging and data collection method in wireless sensor network |
| CN112996076B (en) * | 2021-02-05 | 2023-03-10 | 东北大学 | Mobile charging and data collection method in wireless sensor network |
| CN114025404A (en) * | 2021-11-08 | 2022-02-08 | 中国核动力研究设计院 | Wireless sensor network routing protocol method, wireless sensor and storage medium |
| CN114025404B (en) * | 2021-11-08 | 2024-01-23 | 中国核动力研究设计院 | Wireless sensor network routing protocol method, wireless sensor and storage medium |
| CN114222343A (en) * | 2021-12-03 | 2022-03-22 | 国网江苏省电力有限公司电力科学研究院 | Underground pipe gallery wireless sensor network routing method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107529201A (en) | A kind of wireless sensor network data transmission method based on LEACH agreements | |
| Bhardwaj et al. | MOFPL: Multi-objective fractional particle lion algorithm for the energy aware routing in the WSN | |
| CN101835237B (en) | Data aggregation method in wireless sensor network | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN106304234A (en) | A kind of wireless sensor network energy consumption optimization method based on clustering routing agreement | |
| AbdulAlim et al. | A fuzzy based clustering protocol for energy-efficient wireless sensor networks | |
| CN106604346A (en) | Wireless sensor network energy effective opportunistic routing protocol implementation method | |
| CN103298032A (en) | Node energy consumption balancing method for wireless sensor network | |
| CN108900996A (en) | A kind of wireless sensor network data transmission method based on the double-deck fuzzy algorithmic approach | |
| Ducrocq et al. | Energy-based clustering for wireless sensor network lifetime optimization | |
| Li et al. | Vote-based clustering algorithm in mobile ad hoc networks | |
| CN105813161A (en) | Clustering routing method of micropower wireless sensor network based on energy difference | |
| Shin et al. | Equal-size clustering for irregularly deployed wireless sensor networks | |
| CN104994020A (en) | Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model | |
| Bala et al. | Proficient D-SEP protocol with heterogeneity for maximizing the lifetime of wireless sensor networks | |
| CN103249109B (en) | Based on the energy-saving routing method of the radio sensing network of irregular cellular automata | |
| CN103929778B (en) | Data staging transmission method | |
| Zhu et al. | Energy-efficient tree-based message ferrying routing schemes for wireless sensor networks | |
| CN102983948A (en) | Adaptive clustering transmission method and device for wireless sensor network | |
| CN103369619B (en) | A kind of method based on degree self-adaptative adjustment dynamic aggregation tree | |
| CN103826285A (en) | Cluster-head voting and alternating method for wireless sensor network | |
| CN103532667A (en) | Reliable wireless sensor network data transmission method based on Chinese remainder theorem | |
| Gautam et al. | Dynamic clustering and distance aware routing protocol for wireless sensor networks | |
| Mishra et al. | Echs: An energy aware cluster head selection algorithm in wireless sensor networks | |
| Cho et al. | Energy efficient routing in 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20171229 |