CN103916942B - LEACH protocol improvement method capable of lowering energy consumption - Google Patents
LEACH protocol improvement method capable of lowering energy consumption Download PDFInfo
- Publication number
- CN103916942B CN103916942B CN201410134683.XA CN201410134683A CN103916942B CN 103916942 B CN103916942 B CN 103916942B CN 201410134683 A CN201410134683 A CN 201410134683A CN 103916942 B CN103916942 B CN 103916942B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- base station
- distance
- network
- 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.)
- Active
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention provides an LEACH protocol improvement method capable of lowering energy consumption. A basic system comprises normal nodes, cluster header nodes, forwarding nodes and a base station. The specific cycle operation steps comprise network topology determination, initialization, selection of the cluster header nodes, cluster forming, data transmission, selection of the cluster header nodes and cluster forming. According to the defects of an LEACH protocol, improvement is conducted from the aspects of selection of cluster heads, cluster forming and a data transmission mode. In selection of the cluster heads, the comprehensive influences of the energy of the nodes, the distance to the base station and density are considered, the burdens of the cluster heads are balanced, and distribution and energy consumption of the selected cluster header nodes are made balanced in a network. In cluster forming, the mode of grid clustering is used, the nodes calculate the two-dimensional values of grids where the nodes are placed by themselves, and the effectiveness of node energy is guaranteed. In data transmission mode, a routing mode with single-hop and multi-hop combined is used according to the distance of the cluster header nodes and the base station, the energy consumption of network nodes is lowered by the purpose that the energy utilization rate is highest.
Description
Technical field
The present invention relates to wireless sensor network field, and in particular to a kind of LEACH agreement improved methods of reduction power consumption.
Background technology
Wireless sensor network is a kind of emerging network model, and it is by a large amount of miniature biographies for having and communicating with computing capability
Sensor node is intensive to be laid in unattended monitor area composition.These sensor nodes are powered using independent battery, and
The networking in the form of self-organizing, by coordinate operation between node, gathers the information of monitored target in network's coverage area, and
When be sent to observer, complete expected network task.
At present country's wireless sensor network is used for the monitoring of regional environment, because network node is often arranged in evil
The bad, mankind are difficult in the environment for reaching, and are powered using battery, are difficult to and obtain to supplement after the electric energy of node exhausts and more
Change, therefore node power consumption is to restrict application of higher wireless sensor network key element the most prominent.How to reduce and balanced node energy consumption,
Ensure that network stabilization reliably works, be the matter of utmost importance for needing to solve.Progress both domestic and external shows：Routing Protocol is group
The basis of net and the key of data transfer, improvement can effectively reduce node suitable for the Routing Protocol of wireless sensor network
Energy consumption, extends network lifecycle, with very high researching value.
LEACH agreements are by Wendi Rabiner Heinzelman, Anantha Chandrakasan and Hari
The people of Balakrishnan tri- were in Proceedings of the 33rd Hawaii International in 2000
An article Energy-Efficient Communication on Conference on System Sciences
Propose first in Protocol for Wireless Microsensor Networks, the foundation of node dynamic clustering brings
Significant energy-saving effect, the life cycle for making system is extended.But in LEACH agreements, the data transfer of cluster head and base station
It is single-hop mode, when distance is more than sensor communications module distance threshold, energy consumption is calculated using multipath attenuation model, and energy consumption will
Steep to increase, cluster head easily failure in distant place is too early.It is unrelated with node oneself factor and the generation of cluster head fully relies on random number, cause
Cluster head is distributed in a network unbalanced with energy consumption, and some cluster heads are because cluster scale is excessive, the overweight meeting of task and premature failure.
The content of the invention
In order to solve the above problems, the invention provides a kind of LEACH agreement improved methods for reducing power consumption, can be effective
Reduce and balanced node energy consumption, it is ensured that network stabilization reliably works.
In order to achieve the above object, the utility model is achieved through the following technical solutions：A kind of reduction power consumption
LEACH agreement improved methods, comprise the following steps：
Step one, determines network topology：N general sensor nodes are evenly distributed at random in monitor area, each section
The perception radius of point are identical, and overlay area is that, with node as the center of circle, R is the circle of radius；Base station is configured at outside monitored area, can
With with any one sensor node direction communication in region, network topology determine finish；
Step 2, network topology is initialized after determining, the primary power of all nodes is E, base in monitoring network
Calculation base station stand to the distance of each ordinary node, finds apart from maximum and minimum of a value；Base station flooded broadcast the whole network packet,
Including ultimate range, minimum rangeAnd the positional information of base station, each node receives the position after message together with itself
Confidence breath is stored；
Step 3, the selection of leader cluster node：From node energy, the distance of node to base station, three factor sides of node density
Face comprehensively selects cluster head, agreement to distinguish three class special joints according to three factors, by improve special joint elected probability,
The burden of weighing apparatus cluster head；Three class special joints are respectively：
I type high-energy node：Business's difference of node energy consumption rate and network average energy consumption rateLess than 0；
II type " hot-zone " node：Node is less than the 20% of farthest node and base station distance with the distance of base station；
III type close quarters node：Node communication radius internal segment dot density exceeds network average nodal density 50%；
Non-special node is ordinary node in network, and threshold formula is identical with LEACH agreements, is expressed as：
Meet simultaneously when node more than two classes and two classes in three class special joints, then the node is common factor node, its threshold
Value formulaDetermined by weighting scheme, concrete formula is as follows：
Wherein,The threshold values of respectively I, II, III type node,、、Respectively I, II, III type
The weighted value of node, and,、、；
Highest scoring for leader cluster node in common factor node；
Step 4, the formation of cluster：Using grid clustering method, agreement first will by way of node location fuzzy matching
Network is divided into the grid of several formed objects, and rectangular net region is a length of, it is a width of, long side is divided intoEqual portions, broadside
It is divided intoEqual portions, network is divided intoIndividual rectangular mesh, in order to ensure grid interior nodes reliable communication,、Choosing value
Meet the constraint condition,For the communication radius of node；According to matrix arrangement to all grids point
With a two dimension value；
For any two node in networkWith, coordinate is respectively、If,,For bracket function, then location matches are met
Condition；
All nodes calculate the two-dimentional value of itself affiliated grid, meet the node division of location matches condition in same net
Lattice, i.e. two dimension value identical node divide in same cluster, so as to form cluster；
Step 5, data transfer：After cluster is formed, sensor node gathered data simultaneously carries out the transmission of data, and data are passed
Mode is passed including procedure below：Specify a distance threshold first,
Work as leader cluster nodeIt is less than with the distance of base stationWhen, node adopts single-hop mode, and cluster head is directly logical with base station
Letter, completes data transfer；
When the distance between leader cluster node n and base station is more thanWhen, first complete the cluster head in data processing in cluster, i.e. grid
The packet of this cluster node is received, if grid includes multiple cluster heads, the packet of ordinary node is sent to closest
Cluster head；In cluster after the completion of data processing, the cluster head in each grid becomes node to be forwarded, carries out the outer data transfer of cluster, adopts
Multi-hop mode, selects suitable forward node, transfers data to base station；
It is 20s to count cluster head reset time, and the network for transmitting the stage in data stabilization after 20s reenters cluster head selection
Stage, again adjustment wheel numerical value and execution step（Three）~（Five）, so circulation is until all node energies exhaust.
Further improvement of the present invention is：In the selection of the step 3 leader cluster node, the tool of I, II, III type node
The agreement distinguishing condition of body is as follows with each threshold values formula：
（a）When node energy consumption rate and business's difference of network average energy consumption rateLess than 0, formula is met
Then the node is I type high-energy node, and its threshold formula is：
Wherein,For the sum of network node,For the summation of all residue energy of node,
For nodeDump energy；
（b）When the distance of node to base station is less than the 20% of farthest node and base station distance, formula is met
Then the node is II type " hot-zone " node, and its threshold formula is：
Wherein,For network node and the maximum distance of base station,For nodeWith the distance of base station；
（c）When node communication radius internal segment dot density exceeds network average nodal density 50%, formula is met
（3）
Then the node is III type close quarters node, and its threshold formula is：
Wherein,Represent nodeSurviving node number in communication radius,Represent Standard capacity
Nodes contained by cluster.
Further improvement of the present invention is：In step 5 data transmission procedure, carried out outside cluster using multi-hop mode
The method of selection forward node is during data transfer：With leader cluster nodeFor the center of circle,WithIt is that external diameter and internal diameter are made
Annulus, selects optimal forward node in circle ring area, wherein,Distance is forwarded for optimal,、It is respectively outer
Footpath and the supplement amount of internal diameter, control node search area；
If having in circle ring areaIndividual candidate cluster head, first by distance condition, filter out and meet distance condition
M candidate cluster head, wherein, diCandidate cluster head and the distance of base station,For the distance of node to be forwarded and base station,It is distance
Decay factor；Again M candidate cluster head obtained by screening is sorted and scored by distance and dump energy, will be apart from arranging from small to large
Sequence and score be, it is higher apart from less score value；It is by sorting from small to large and scoring by their dump energy again, remain
The bigger score value of complementary energy is higher；Then PTS is calculated by weight calculation formula, PTS highest candidate cluster head is elected as
Forward node, computing formula is：
Wherein,It is the weight of distance,For the weight of energy,For nodeDistance score,For the surplus of node
Complementary energy is scored；
If when in circle ring area without cluster head or without the cluster head for meeting distance condition, selecting the ordinary node in annulus to make
For forward node；Distance condition is first passed through headed by system of selection, M node is filtered out, wherein, diOrdinary node with
The distance of base station,For node to be forwarded and the distance of base station, β2For the range attenuation factor,；Then M node is compared
Dump energy, dump energy highest node be forward node.
Further improvement of the present invention is：In the step 5 data transmission procedure, the ordinary node in cluster according to
TDMA timetables send the data of collection to cluster head, when not sending data in a dormant state；Packet of the cluster head to this cluster
Carry out being sent to base station or forward node after fusion and de-redundant process；For the cluster head that single-hop mode sends packet, in order to
Information collision is avoided, according to different CDMA codes base station is transmitted information to.
The invention has the advantages that：
1. the selection of cluster head has considered node energy, node to the distance and node density of base station, by improving
The elected probability of special joint, the burden of balanced cluster head effectively avoids following several situations：（1）It is excessively near apart from base station
Node premature failure because transfer amount is big；（2）Fail as early as possible because transmission energy consumption is excessive apart from base station node too far；（3）
Cluster head because the scale of place cluster is excessive, the task amount of processing data is excessive and fail as early as possible；（4）Cluster head is located at cluster region
Edge, make cluster inside partial node send data energy consumption it is excessive, energy consumption is uneven between cluster.Finally make cluster head reasonable in a network
Distribution, reduces the purpose with energy balance.
2. the influence degree of the factor for affecting on the generation that cluster head is chosen is adjusted by weights, can be according to network reality
Using situation adjust and optimize weights allocation proportion、、, obtain more superior network performance.
3. the method for being formed by grid clustering of cluster, node passes through the two dimension value for oneself calculating place grid, automatic
With cluster is formed, the validity of the whole network node energy is ensured, the effectively save node energy can extend the network operation cycle.
4. leader cluster node selects forward node to forward data by optimal forwarding distance, realizes node energy utilization rate most
It is high.
5. the data transfer mode of single-hop or multi-hop is flexibly selected according to the distance of node and base station, effectively reduce transmission
Energy consumption.
The present invention is directed to the deficiency of traditional LEACH agreements, from cluster head selection, the formation of cluster, data transfer mode tripartite
Make improvement in face.Cluster head considers the combined influence of the Multiple factors such as node energy, distance in choosing, improve the elected of special joint
Probability, the burden of balanced cluster head makes the distribution in a network of the leader cluster node selected and energy consumption balance.In the formation of cluster, take
Grid clustering, node oneself calculates the two dimension value of place grid, and two dimension value identical node point is in same cluster, effectively save node
The energy, can extend the network operation cycle.In data transfer mode, according to the distance of leader cluster node and base station using single multi-hop knot
The routing mode of conjunction, for the purpose of capacity usage ratio highest, selects forward node, reduces network node power consumption, improves network life
The life cycle.
It is of the invention compared with traditional LEACH agreements, can effectively reduce and balanced node power consumption, it is ensured that network stabilization can
The work leaned on, improves network lifecycle.
Description of the drawings
Fig. 1 is the system construction drawing of the present invention.
Fig. 2 is grid two dimension Distribution value schematic diagram.
Fig. 3 is the node schematic diagram of data transfer.
Fig. 4 is the flow chart of data transfer.
Specific embodiment
In order to deepen to understanding of the present utility model, below in conjunction with embodiment, the utility model is described in further detail,
The embodiment is only used for explanation the utility model, does not constitute the restriction to the utility model protection domain.
As Figure 1-4, a kind of LEACH agreement improved methods of reduction power consumption, including following step are present embodiments provided
Suddenly：Step one, determines network topology：As shown in figure 1, n general sensor nodes are evenly distributed at random in monitor area,
The physique and primary power of each node is identical, possesses certain data processing and fusion function, but using electricity
Pond powers, and self-energy is limited；The perception radius of all nodes are identical in network, and overlay area is that, with node as the center of circle, R is half
The circle in footpath.The approximate distance that each node can communicate according to the Strength co-mputation of the transmission power of transmitting terminal and reception signal,
And transmission power is freely adjusted according to the distance of distance.Base station is configured at outside monitoring network, can with network any one
Sensor node direction communication.Base station is a reinforced sensor node, and its disposal ability, storage capacity are strong, itself energy
Amount is sufficient and need not consider energy consumption problem, and network topology determination is finished.
Step 2, network topology is initialized after determining, the primary power of all nodes is E, base in monitoring network
Calculation base station stand to the distance of each ordinary node, finds apart from maximum and minimum of a value；Base station flooded broadcast the whole network packet,
Including ultimate range, minimum rangeAnd the positional information of base station, each node receives the position after message together with itself
Confidence breath is stored；
Step 3, the selection of leader cluster node：Affect cluster head the factor of network distribution and energy consumption mainly have node energy and
The distance of base station, three factors of node density, therefore from node energy, the distance of node to base station, three factors of node density
Aspect is comprehensive to select cluster head.Agreement after improvement first distinguishes three class special joints, including：I type high-energy node；II type " hot-zone " is saved
Point；III type close quarters node, by the elected probability for improving special joint, the burden of balanced cluster head.
Non-special node is ordinary node in network, and threshold formula is identical with LEACH agreements, is expressed as：
For special joint, make defined below：
Define 1：If business's difference of node energy consumption rate and network average energy consumption rateLess than 0, formula is met
（1）
Then the node is I type high-energy node, and its threshold formula is。
Wherein,For the sum of network node,For the summation of all residue energy of node,
For nodeDump energy.
Define 2：If node is less than the 20% of farthest node and base station distance with the distance of base station, formula is met
（2）
Then the node is II type " hot-zone " node, and its threshold formula is。
Wherein,For network node and the maximum distance of base station,For nodeWith the distance of base station.
Define 3：If node communication radius internal segment dot density exceeds network average nodal density 50%, formula is met
（3）
Then the node is III type close quarters node, and its threshold formula is。
Wherein,Represent nodeSurviving node number in communication radius,Represent Standard capacity
Nodes contained by cluster.
Define 4：If node meets formula（1）、（2）、（3）In two and more than, then the node be common factor node, its threshold value
FormulaDetermined by weighting scheme, concrete formula is as follows：
Wherein,The threshold values of respectively I, II, III type node,、、Respectively I, II, III type
The weighted value of node, and,、、；
Highest scoring for leader cluster node in common factor node；
In the present embodiment, nodeMeet the condition of I type and II type, its threshold formula is, wherein。
Step 4, the formation of cluster：Network is divided into some by the agreement after improvement by way of node location fuzzy matching
The grid of individual formed objects.Rectangular net region is a length of, it is a width of, long side is divided intoEqual portions, broadside is divided intoDeng
Part, network is divided intoIndividual rectangular mesh.In order to ensure grid interior nodes reliable communication,、Choosing value meet the constraint bar
Part,For the communication radius of node.As shown in Fig. 2 according to matrix arrangement to all grids point
With a two dimension value。
For any two node in networkWith, coordinate is respectively、If,,For bracket function, then location matches are met
Condition.
All nodes calculate the two-dimentional value of itself affiliated grid, meet the node division of location matches condition in same net
Lattice, i.e. two dimension value identical node divide in same cluster, so as to form cluster.
Step 5, data transfer：After cluster is formed, sensor node gathered data simultaneously carries out the transmission of data, and data are passed
Mode is passed including procedure below：Specify a distance threshold first,
Work as leader cluster nodeIt is less than with the distance of base stationWhen, node adopts single-hop mode, and cluster head is directly logical with base station
Letter, completes data transfer.
When the distance between leader cluster node n and base station is more thanWhen, first complete the cluster head in data processing in cluster, i.e. grid
The packet of this cluster node is received, if grid includes multiple cluster heads, the packet of ordinary node is sent to closest
Cluster head；In cluster after the completion of data processing, the cluster head in each grid becomes node to be forwarded, carries out the outer data transfer of cluster, adopts
Multi-hop mode, as shown in figure 3, selecting suitable forward node, transfers data to base station；
When node chosen distance itself（For optimal forwarding distance）Node as forward node when, be optimal
Forward node, in the configuration of the now capacity usage ratio highest of node, but actual scene, preferable forward node there's almost no,
Therefore the forward node for picking out optimum is needed.Cluster head is elected as the ideal conditions of the forward node of next-hop：1. from base station
Distance than cluster head to be forwarded closer to and region is near the cluster head of base station；2. its dump energy is candidate cluster head in region
Highest.If two conditions can not meet simultaneously, selected by weights；
As shown in figure 4, during using multi-hop mode transmission data, the method for selecting optimum forward node is：With cluster head section
PointFor the center of circle,WithIt is that external diameter and internal diameter make annulus, optimal forward node is selected in circle ring area, wherein,Distance is forwarded for optimal,、The respectively supplement amount of external diameter and internal diameter, control node search area；
In the present embodiment,, i.e. the internal diameter and external diameter of annulus are respectively 30m and 35m.
If having in circle ring areaIndividual candidate cluster head, dump energy is respectively、……, and the distance difference of base station
For、……, in order that data are forwarded to as early as possible base station, by distance condition plus rapid convergence, filter out and meet apart from bar
M candidate cluster head of part, distance condition is, wherein,For the distance of node to be forwarded and base station,For range attenuation
The factor, adjusts the speed of forwarding convergence.For M cluster head for meeting distance condition, by the distance value of they and base station from greatly to
Little sequence, score respectively 1,2 ... M；Residual energy value sorts from small to large, and score respectively 1,2 ... M, defines the power of distance
Weight is, the weight of energy is.If nodeDistance score be, energy meter is divided into, then its must be divided into, PTS highest candidate cluster head is elected as forward node.
If when in circle ring area without cluster head or without the cluster head for meeting distance condition, selecting the ordinary node in annulus to make
For forward node；In order to reduce computing cost, situation of the annulus without suitable cluster head is broken away from quickening, makes elected node close proximity to base
Stand, distance conditionIt is middle to obtain less apart from decay factor,；In the ordinary node of distance condition is met
Energy highest is chosen as optimal forward node.
In order to reduce node energy consumption, the ordinary node in cluster sends the data of collection to cluster head according to TDMA timetables,
When not sending data in a dormant state；Cluster head the packet of this cluster is merged and de-redundant process after be sent to base station or
Forward node；For the cluster head that single-hop mode sends packet, in order to avoid information collision, will believe according to different CDMA codes
Breath is transferred to base station.
It is 20s to count cluster head reset time, and the network for transmitting the stage in data stabilization after 20s reenters cluster head selection
Stage, again adjustment wheel numerical value and execution step（Three）~（Five）, so circulation is until all node energies exhaust.
A kind of LEACH agreement improved methods of reduction power consumption that the present invention is provided, fundamental system includes ordinary node, cluster head
Node, forward node, base station, concrete circulation job step is the selection → cluster for determining network topology → initialization → leader cluster node
Formation → data transfer → leader cluster node selection → cluster formation → data transfer, the wherein selection → cluster of leader cluster node
Formation → data transfer loop works, until all node energies exhaust.
Claims (4)
1. a kind of LEACH agreement improved methods for reducing power consumption, comprise the following steps：
Step one, determines network topology：N general sensor nodes are evenly distributed at random in monitor area, each node
The perception radius are identical, and overlay area is that, with node as the center of circle, R is the circle of radius；Base station is configured at outside monitored area, Ke Yihe
Any one sensor node direction communication in region, network topology determination is finished；
Step 2, network topology is initialized after determining, the primary power of all nodes is E, base station meter in monitoring network
Base station is calculated to the distance of each ordinary node, is found apart from maximum and minimum of a value；Base station flooded broadcast the whole network packet, including
Ultimate range, minimum rangeAnd the positional information of base station, each node receive after message together with itself position believe
Breath is stored；
Step 3, the selection of leader cluster node：It is comprehensive in terms of node energy, the distance of node to base station, three factors of node density
Conjunction selects cluster head, agreement to distinguish three class special joints according to three factors, by the elected probability for improving special joint, balanced cluster
The burden of head；Three class special joints are respectively：
I type high-energy node：Business's difference of node energy consumption rate and network average energy consumption rateLess than 0；
II type " hot-zone " node：Node is less than the 20% of farthest node and base station distance with the distance of base station；
III type close quarters node：Node communication radius internal segment dot density exceeds network average nodal density 50%；
Non-special node is ordinary node in network, and threshold formula is identical with LEACH agreements, is expressed as：
Meet simultaneously when node more than two classes and two classes in three class special joints, then the node is common factor node, its threshold value is public
FormulaDetermined by weighting scheme, concrete formula is as follows：
Wherein,The threshold values of respectively I, II, III type node,、、Respectively I, II, III type node
Weighted value, and,、、；
Highest scoring for leader cluster node in common factor node；
Step 4, the formation of cluster：Using grid clustering method, first agreement by way of node location fuzzy matching by network
It is divided into the grid of several formed objects, rectangular net region is a length of, it is a width of, long side is divided intoEqual portions, broadside is divided
ForEqual portions, network is divided intoIndividual rectangular mesh, in order to ensure grid interior nodes reliable communication,、Choosing value meet
Constraints,For the communication radius of node；According to matrix arrangement to all grids distribution one
Individual two dimension value；
For any two node in networkWith, coordinate is respectively、If,,For bracket function, then location matches are met
Condition；
All nodes calculate the two-dimentional value of itself affiliated grid, meet the node division of location matches condition in same grid, i.e.,
Two dimension value identical node divides in same cluster, so as to form cluster；
Step 5, data transfer：After cluster is formed, sensor node gathered data simultaneously carries out the transmission of data, data transfer side
Formula includes procedure below：Specify a distance threshold first,
Work as leader cluster nodeIt is less than with the distance of base stationWhen, node adopts single-hop mode, and cluster head is directly and base station communication, complete
Into data transfer；
When the distance between leader cluster node n and base station is more thanWhen, the cluster head first completed in data processing in cluster, i.e. grid is received
The packet of this cluster node, if a grid includes multiple cluster heads, the packet of ordinary node is sent to closest cluster head；
In cluster after the completion of data processing, the cluster head in each grid becomes node to be forwarded, the outer data transfer of cluster is carried out, using multi-hop side
Formula, selects suitable forward node, transfers data to base station；
Reach and count after cluster head reset time, network reenters cluster head and chooses rank in the network that data stabilization transmits the stage
Section, again execution step（Three）~（Five）, so circulation is until all node energies exhaust.
2. it is according to claim 1 it is a kind of reduce power consumption LEACH agreement improved methods, it is characterised in that：In the step
In the selection of rapid three leader cluster node, the specific agreement distinguishing condition of I, II, III type node is as follows with each threshold values formula：
（a）When node energy consumption rate and business's difference of network average energy consumption rateLess than 0, formula is met
Then the node is I type high-energy node, and its threshold formula is：
Wherein,For the sum of network node,For the summation of all residue energy of node,For section
PointDump energy；
（b）When the distance of node to base station is less than the 20% of farthest node and base station distance, formula is met
Then the node is II type " hot-zone " node, and its threshold formula is：
Wherein,For network node and the maximum distance of base station,For nodeWith the distance of base station；
（c）When node communication radius internal segment dot density exceeds network average nodal density 50%, formula is met
Then the node is III type close quarters node, and its threshold formula is：
Wherein,Represent nodeSurviving node number in communication radius,Represent standard gauge variety of moduli institute
Containing nodes.
3. it is according to claim 1 it is a kind of reduce power consumption LEACH agreement improved methods, it is characterised in that：In the step
In rapid five data transmission procedure, adopt multi-hop mode that the method for forward node is selected when carrying out the outer data transfer of cluster for：With cluster head
NodeFor the center of circle,WithIt is that external diameter and internal diameter make annulus, optimal forward node is selected in circle ring area, its
In,Distance is forwarded for optimal,、The respectively supplement amount of external diameter and internal diameter, control node search area；
If having in circle ring areaIndividual candidate cluster head, first by distance condition, filter out meet distance condition M
Candidate cluster head, wherein, diCandidate cluster head and the distance of base station,For the distance of node to be forwarded and base station,For range attenuation
The factor；Again M candidate cluster head obtained by screening is sorted and scored by distance and dump energy, will be apart from sorting from small to large simultaneously
Score and be, it is higher apart from less score value；It is by sorting from small to large and scoring by their dump energy again, residual energy
The bigger score value of amount is higher；Then PTS is calculated by weight calculation formula, PTS highest candidate cluster head is elected as forwarding
Node, computing formula is：
Wherein,It is the weight of distance,For the weight of energy,For nodeDistance score,For the residual energy of node
Gauge point；
If when in circle ring area without cluster head or without the cluster head for meeting distance condition, selecting ordinary node in annulus as turning
Send out node；Distance condition is first passed through headed by system of selection, M node is filtered out, wherein, diOrdinary node and base station
Distance,For node to be forwarded and the distance of base station, β2For the range attenuation factor,；Then the surplus of M node is compared
Complementary energy, dump energy highest node is forward node.
4. it is according to claim 1 it is a kind of reduce power consumption LEACH agreement improved methods, it is characterised in that：In the step
In rapid five data transmission procedure, the ordinary node in cluster sends the data of collection to cluster head according to TDMA timetables, does not send
During data in a dormant state；Base station or forwarding section are sent to after cluster head is merged to the packet of this cluster and de-redundant is processed
Point；For the cluster head that single-hop mode sends packet, in order to avoid information collision, according to different CDMA codes by information transfer
To base station.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410134683.XA CN103916942B (en) | 2014-04-04 | 2014-04-04 | LEACH protocol improvement method capable of lowering energy consumption |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410134683.XA CN103916942B (en) | 2014-04-04 | 2014-04-04 | LEACH protocol improvement method capable of lowering energy consumption |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103916942A CN103916942A (en) | 2014-07-09 |
| CN103916942B true CN103916942B (en) | 2017-04-12 |
Family
ID=51042247
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410134683.XA Active CN103916942B (en) | 2014-04-04 | 2014-04-04 | LEACH protocol improvement method capable of lowering energy consumption |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103916942B (en) |
Families Citing this family (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104394566B (en) * | 2014-11-12 | 2017-09-05 | 南京航空航天大学 | A kind of low power consumption adaptive clustering and multi-hop wireless sensor network topology control method based on fuzzy decision |
| CN105764112B (en) * | 2015-12-28 | 2019-01-08 | 湖南安全技术职业学院 | Coal mine roadway wireless sensor method for routing and system based on more Sink |
| CN105592472B (en) * | 2016-01-22 | 2020-03-17 | 华北电力大学（保定） | Wireless sensor network topology method |
| CN105979539B (en) * | 2016-05-06 | 2019-04-23 | 西安电子科技大学 | Based on the cluster-dividing method of fuzzy logic in mobile ad-hoc network |
| CN106454815B (en) * | 2016-06-30 | 2019-10-18 | 华南理工大学 | A kind of wireless sensor network routing method based on LEACH agreement |
| CN105979560B (en) * | 2016-07-08 | 2019-04-12 | 广西科技大学鹿山学院 | Based on the wireless sensing network data transmission method and system for shunting optimum choice |
| CN106507423B (en) * | 2016-12-02 | 2019-10-29 | 中国人民解放军火箭军工程大学 | A kind of wireless sensor network routing method based on the reachable domain of dynamic |
| CN106792974A (en) * | 2017-03-06 | 2017-05-31 | 南京龙渊微电子科技有限公司 | A kind of improved wireless sensor network minimum weight cluster-dividing method |
| CN108112048A (en) * | 2017-12-28 | 2018-06-01 | 重庆邮电大学 | Recognize a kind of efficiency route protocol based on stability in sensor network |
| CN108600985A (en) * | 2018-04-28 | 2018-09-28 | 深圳大图科创技术开发有限公司 | A kind of air pollution data acquisition and processing system based on block chain technology |
| CN108289317B (en) * | 2018-05-13 | 2020-05-22 | 广东理致技术有限公司 | Wireless sensor network routing method and device based on big data analysis |
| CN108966171B (en) * | 2018-07-31 | 2020-05-15 | 南京绿色健康建筑研究院有限公司 | Regional air pollutant concentration standard exceeding early warning system |
| CN109041001B (en) * | 2018-08-04 | 2021-06-29 | 浙江农林大学 | Method for prolonging life cycle of wireless sensor network in urban comprehensive pipe gallery |
| CN109041159B (en) * | 2018-08-04 | 2021-04-02 | 浙江农林大学 | Method for overcoming energy imbalance in wireless sensor network |
| CN109041160B (en) * | 2018-08-04 | 2020-11-17 | 浙江农林大学 | Method for improving data transmission quality of wireless sensor network in urban comprehensive pipe gallery |
| CN108881499A (en) * | 2018-09-05 | 2018-11-23 | 佛山豆萁科技有限公司 | Safety of Gas Station management system |
| CN109587753B (en) * | 2018-11-26 | 2021-08-06 | 河南大学 | Cluster head selection algorithm of improved LEACH protocol based on target threshold constraint |
| CN109922448A (en) * | 2018-12-28 | 2019-06-21 | 苏州华盖信息科技有限公司 | A kind of data capture method, data acquisition facility and user terminal |
| CN109661013A (en) * | 2019-02-28 | 2019-04-19 | 中国联合网络通信集团有限公司 | A kind of method for message transmission and system |
| CN110087274B (en) * | 2019-05-15 | 2020-10-23 | 中国联合网络通信集团有限公司 | Clustering method and device |
| CN110536372B (en) * | 2019-07-17 | 2022-05-31 | 长春工业大学 | Non-uniform clustering method for annular wireless sensor network based on fuzzy control |
| CN110715181B (en) * | 2019-10-28 | 2020-09-29 | 维吉尔泰光电科技(徐州)有限公司 | Dull and stereotyped lamp of luminance adjustable LED |
| CN111194065B (en) * | 2020-02-13 | 2022-02-25 | 吉林建筑科技学院 | High-energy-efficiency multi-hop clustering routing method for ring-shaped wireless sensor network |
| CN111818553B (en) * | 2020-05-21 | 2022-05-31 | 长春工业大学 | Fuzzy logic-based data transmission method for improving multi-hop LEACH protocol of wireless sensor network |
| CN112153715B (en) * | 2020-08-27 | 2022-09-02 | 西安电子科技大学 | Hybrid big data transmission topological structure method, system, storage medium and application |
| CN112285627B (en) * | 2020-09-22 | 2022-06-17 | 浙江瑞银电子有限公司 | Method for improving measurement accuracy of large-current direct-current ammeter |
| CN112333806B (en) * | 2020-11-11 | 2023-02-24 | 大连金盛义电子科技有限公司 | Tunnel wireless redundant relay ring network system unit and system |
| CN112562286B (en) * | 2020-12-08 | 2023-08-01 | 杭州市电力设计院有限公司 | Power grid material management system based on cloud computing |
| CN112888041B (en) * | 2020-12-30 | 2022-04-15 | 电子科技大学 | Wireless sensor network communication method based on non-uniform node deployment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20090117381A (en) * | 2008-05-09 | 2009-11-12 | 국민대학교산학협력단 | Routing method in sensor network |
| CN102572996A (en) * | 2012-02-24 | 2012-07-11 | 重庆大学 | Annulus-based node energy consumption balancing method in heterogeneous sensor network |
| CN103024849A (en) * | 2012-09-27 | 2013-04-03 | 西安电子科技大学 | LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method |
| TW201410056A (en) * | 2012-08-17 | 2014-03-01 | Univ Nat Taipei Technology | Method and system for hierarchical clustering of wireless sensor networks |
-
2014
- 2014-04-04 CN CN201410134683.XA patent/CN103916942B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20090117381A (en) * | 2008-05-09 | 2009-11-12 | 국민대학교산학협력단 | Routing method in sensor network |
| CN102572996A (en) * | 2012-02-24 | 2012-07-11 | 重庆大学 | Annulus-based node energy consumption balancing method in heterogeneous sensor network |
| TW201410056A (en) * | 2012-08-17 | 2014-03-01 | Univ Nat Taipei Technology | Method and system for hierarchical clustering of wireless sensor networks |
| CN103024849A (en) * | 2012-09-27 | 2013-04-03 | 西安电子科技大学 | LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method |
Non-Patent Citations (1)
| Title |
|---|
| 无线传感器网络LEACH协议的改进;刘玉华，赵永峰，徐凯华，高景菊;《计算机工程与应用》;20100611;117-120 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103916942A (en) | 2014-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103916942B (en) | LEACH protocol improvement method capable of lowering energy consumption | |
| CN104093188B (en) | Novel cluster head election method for wireless sensor networks | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN104410997B (en) | A kind of clustering topology construction method for wireless sensor network | |
| CN106900025A (en) | A kind of wireless sensor network clustering routing based on double cluster heads | |
| CN103269507A (en) | Routing method of double-cluster head wireless sensor network | |
| Liu et al. | A new multi-path routing protocol based on cluster for underwater acoustic sensor networks | |
| CN103052147A (en) | Energy effectiveness multistage ring-type networking method based on wireless sensor network | |
| CN107820257A (en) | Improvement Uneven Cluster algorithm based on regular hexagonal cell division | |
| CN107257572A (en) | A kind of cluster routing method of wireless sense network | |
| CN106028398A (en) | Underwater wireless sensor network topology control method based on energy consumption balance | |
| CN103781143A (en) | Cluster tree hierarchical wireless sensor network routing method with optimized energy efficiency | |
| CN104394571A (en) | Topology control method of wireless sensor network used for monitoring water quality of inland river | |
| CN103095577B (en) | Context-sensitive Uneven Cluster routing algorithm | |
| CN103228022A (en) | Probability type wireless sensor network routing method based on energy harvesting | |
| CN109673034A (en) | A kind of wireless sensor network cluster routing method that must be searched for based on longicorn | |
| Tong et al. | A cross unequal clustering routing algorithm for sensor network | |
| CN101562862A (en) | Routing method for balancing energy of wireless sensor network | |
| CN101640944B (en) | Clustering and multi-hop communication method of wireless sensor | |
| CN108566664A (en) | A kind of WSN clustering routing optimization methods of distribution high energy efficiency | |
| CN108777877A (en) | It is a kind of it is long and narrow topology under WSNs cluster routing methods | |
| CN106559731A (en) | A kind of sewage monitoring wireless sensor network | |
| Wan et al. | AHP based relay selection strategy for energy harvesting wireless sensor networks | |
| CN107222900A (en) | A kind of wireless sensor network node collaboration method based on dynamic chain | |
| CN108566658B (en) | Clustering algorithm for balancing energy consumption in wireless sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Chen Mengyuan Inventor after: Jiang Hui Inventor after: Zhou Meng Inventor after: Chen Yuedong Inventor before: Chen Mengyuan Inventor before: Zhou Meng Inventor before: Chen Yuedong |
|
| COR | Change of bibliographic data | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |