CN106454858B - A method of solving the problems, such as the hot-zone present in multi-hop sensor network - Google Patents
A method of solving the problems, such as the hot-zone present in multi-hop sensor network Download PDFInfo
- Publication number
- CN106454858B CN106454858B CN201610581562.9A CN201610581562A CN106454858B CN 106454858 B CN106454858 B CN 106454858B CN 201610581562 A CN201610581562 A CN 201610581562A CN 106454858 B CN106454858 B CN 106454858B
- Authority
- CN
- China
- Prior art keywords
- node
- energy
- coverage
- region
- meet
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/30—TPC using constraints in the total amount of available transmission power
- H04W52/34—TPC management, i.e. sharing limited amount of power among users or channels or data types, e.g. cell loading
- H04W52/346—TPC management, i.e. sharing limited amount of power among users or channels or data types, e.g. cell loading distributing total power among users or channels
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Arrangements For Transmission Of Measured Signals (AREA)
Abstract
A kind of method solving the problems, such as the hot-zone present in multi-hop sensor network disclosed by the invention, comprising the following steps: S1, the topology policy model unevenly arranged using node, number of nodes are distributed in the form of arithmetic progression；S2, control area data production rate: the acquisition by each round to residue energy of node just calculates the mathematic expectaion and standard deviation of each region energy consumption by SINK, then judges whether to trigger control command；S3, the coverage met the requirements by the way that the distribution shape of node is arranged.Method of the invention, it is possible to realize its energy-consuming balance, efficient studies also in addition are carried out to the distribution shape of node, improve the utilization rate of node.
Description
Technical field
The present invention relates to wireless sensor field, in particular to a kind of solution hot-zone present in multi-hop sensor network
The method of problem.
Background technique
In wireless sensor network, the electricity of node is usually limited to hardly result in supplement, and communication distance is inadequate, huge
Meshed network in generally use the strategy of multi-hop information is sent to aggregation node, but shortcoming of this strategy be from
The closer node of aggregation node will not only send the data of oneself, but also there are also the information roads as the node far from aggregation node
It by transit node, undertakes a greater amount of information and sends task, then the node near aggregation node disappears than other nodes consumption energy
Consume faster, if things go on like this, for the node near aggregation node once failed earlier than other nodes, network just has big section
Domain is unable to get monitoring, and the information of other nodes is also difficult to be sent to aggregation node.This unbalanced situation of network energy consumption claims
Be hot-zone problem.
Such as Fig. 1, hot-zone problem is analyzed and modeled below: setting regional nodes density as p, each ring represents outer
The next-hop region of one ring of side, if sharing M ring, it is mutually all b that the data of each node, which generate speed, and i is ring ordinal number, then ring i
Load can be understood as the ratio so data traffic and ring i interior joint number, then
The ring i data traffic transfer amount to be undertaken is
ringfu=p* ((2*M*r)2-π*(i*r)2)*b
The sum of ring i interior joint is
rings=p* (π * ((i+1) * r)2-π*(i*r)2)
The load of ring i is
It can be seen that i is smaller, Load is bigger, then may indicate that in the wireless sensor network of multi-hop closer to convergence
The node load of node is bigger.
It is Energy distribution problem of non-uniform on the question essence of hot-zone, can theoretically makes following strategy: allows the width of ring
Difference, but node density is uniform.The width of each annulus is allowed to reduce with increasing at a distance from base station, and the node in each ring
The next-hop node that all can serve as the node of a peripheral ring, then have more nodes to undertake routing transfer, reach remittance in ring
The bigger purpose of the energy of poly- near nodal.But in practical operation, the node density of the strategy is uniform, simply by drawing
In draw circle ring area significantly and increase the energy near aggregation node, and it is unrealistic.
Alleviating hot-zone problem by topology design in the wireless sensor network of multi-hop is very important, and also has
Much about the research of this respect, such as a kind of node primary power proposed in document [1] strategy unevenly distributed and document
[2] a kind of functional relation that Node distribution quantity is determined with distance proposed in, but all lacking in the presence of operation difficult in reality
Point.
Document [1] are as follows: W.R.Heinzelman, A.Chandrakasan, H.Balakrishnan.Energy-
efficient communication protocol for wireless micro-sensor networks[C].In
Proc.of the 33rd Annual Hawaii International Conference on System Sciences,
January 2000.
Document [2] are as follows: Lian J, Naik K, Agnew G.Date Capacity Improvement of Wire-
less Sensor Networks Using Non-Uniform Sensor Distribution[J].inter-national
Journal of Distributed Sentor Networks,2006,2(2):121-1。
Document is [3]: a kind of Nodal Arranging Scheme of Wireless Sensor Networks [J] of Lu Kezhong, Liu Yingling is calculated
Machine application, 2007,27 (7): 1566-1568
Summary of the invention
The purpose of the present invention is to overcome the shortcomings of the existing technology with it is insufficient, provide it is a kind of based on node linear topology from
Adapt to the method for data capture of acquisition rate.
The purpose of the present invention is realized by the following technical solution:
A method of solving the problems, such as the hot-zone present in multi-hop sensor network, comprising the following steps:
S1, the topology policy model unevenly arranged using node, number of nodes are distributed in the form of arithmetic progression；
S2, control area data production rate: the acquisition by each round to residue energy of node is just calculated by SINK
The mathematic expectaion and standard deviation of each region energy consumption, then judge whether to trigger control command；
S3, the coverage met the requirements by the way that the distribution shape of node is arranged.
In step S1, the number of nodes is distributed in the form of arithmetic progression, specifically: the density of annulus interior nodes with
With the increase of base station distance and successively reduce, successively reduce and meet arithmetic progression.The energy near aggregation node can be reached in this way
Bigger purpose is measured, there are more energy to undertake the task of energy transfer.
The step S1, specifically:
S101, it divides network: line style network is divided into n region, remember that each zone number is aiIf each region is long
Degree is all L, and each region area is S, region aiInternal segment dot density is ρi；Wherein 1≤i≤n；
S102, zoning aiTotal energy consumption:
Remember the electricity e of each node in region, and assume that the data production rate in region is identical, every wheel is M；It is sensing
As can be seen that data transmission range is very big to energy consumption in the consumption energy theorem of device sending module, and distance in formula
The value of number 2,4 is specifically also closely related with actual environment, if in the case where outdoor transmissions condition is good, usually all
2 can be got, it is for example indoor or tunnel can only take 4 in the poor place of transmission environment, and study originally be it is particularly applicable to
The Linear Network topology of bridge, bridge belongs to the preferable environment of outdoor transmissions condition, so the technical program takes 2.
Unrelated with number of nodes since the data production rate in each region is identical, then every each region of wheel receives and sends out
The data volume sent is n*M；
From macroscopically, region anIt needs to forward all data that one's respective area acquires and peripheral region generates, receive
On due to being the topology using sub-clustering, data receiver amount, which can also be approximatively believed to be, to be considered to receive one's respective area and periphery
The data that region generates, data transmission distance are assumed to region and interregional centre distance L；Then to region ai:
Every received data of wheel consume ENERGY ERxFor
ERx=Eclec*n*M；
Wherein EclecFor recruiting unit's message loss of energy；
Every wheel sends the ENERGY E of data consumptionTxFor
ETx=n*M* (Eelec+Eamp*L2)；
Wherein EelecTo emit unit message loss of energy；EampFor amplifying power energy；
Every wheel region aiAlways energy consumption E is
E=ERx+ETx=n*M* (Eclec+Eelec+Eamp*L2)；
S103, the ratio K for calculating region gross energy and region total energy consumption:
Keep the energy consumption of network entirety uniform, then the energy consumption that can be understood as each region of each node reaches
Balance, and to make the service life of region and each node close, energy consumption reaches balance, i.e., to make each region node gross energy and
It is every wheel energy consumption ratio be consistent, thus can from the balance for reaching each region energy consumption on the whole of network, thus
So that the energy consumption of generally each node also reaches balance；
Each region aiGross energy is
ρi*S*e
Remember region aiGross energy and region aiTotal energy consumption ratio of every wheel is K:
S104, with the ρ inside KiTable egress total number simultaneously finds out ρiAbout the expression formula of network node sum g, area surface
Product is S；Then
Then network node sum is for g
Then
Abbreviation:
It substitutes into
Because of M, Eclec、Eelec、Eamp, L be definite value, then abbreviation obtains
Then region aiNumber of nodes asAre as follows:
, region a closer from aggregation node is found out from the formulaiNumber of nodes it is more, the node between region and region
Number relationship is in arithmetic progression relationship.The prior art also proposed some topology designs, but not all roses, such as document [2]
In propose a kind of strategy that node primary power is different, but due to the limitation of battery technology and allow the initial of node in reality
The different operability of electricity is difficult, and this way is simultaneously unrealistic.Document [3], which also proposed one, can make network energy distribution not
Uniform node dispose function formula, but actually if according to a node density about the formula with aggregation node distance come
Arrangement, operating is also comparable difficulty, there is certain operability, this hair for equilibrium energy consumption and in reality
It is bright to partition the network into n equal subregions, Area Node density with increase at a distance from aggregation node and reduced node not
The strategy being evenly arranged, this strategy strong operability in reality.
The step S2, specifically:
The node set in a region is set into cluster, and member does not change by n wheel, i.e. the node in other regions
The member of this cluster can not be become；
Since cluster head can collect the energy information of each member, it is subsidiary sensing data together, cluster head just calculates energy
Distribution situation is measured, it is all logical between cluster head and node member in communication energy consumption and region between cluster head and cluster head in order to balance
Believe that energy consumption, the design use the mechanism that cluster head is elected according to regional nodes energy residual situation；
The cluster head in each region is artificially first set since the first round, node member starts to acquire data and lead to cluster head
During letter, the energy residual information of self residual is sent to leader cluster node together, in the eve of rotation, cluster head according at
The energy situation of member, gives dump energy maximum member node specify information, if the most node of dump energy has incessantly
It one, then selects cluster head at random in these maximum members of dump energy, completes rotation.
The step S2, specifically:
Each round cluster head can grasp the energy residual situation of itself member, and information is sent to convergence section by cluster head
After point, after aggregation node obtains the node energy residue situation of each region entirety, each residue energy of node e is calculatedjWith each region
Average residual ENERGY Ej, dump energy average value Eave, wherein 1≤j≤g, then
Obtain EaveAfterwards, aggregation node is by calculating each region average residual ENERGY EjWith EaveStandard deviation X and variance x,
Know each region dump energy situation to EaveDeviation situation；
Standard deviation X:
Variance x:
By preset threshold value K, as soon as when K is in specific horizontal, aggregation node Broadcasting Control reduces region
Remaining node energy subaverage EaveAnd deviate maximum region data generation rate.
Since node energy consumption is mainly related in communication distance, road under the strategy of this inserting knot and under election of cluster head mechanism
Network energy consumption can be made to have certain harmony by the uncertainty in path, but it is this get at random it is harmonious and not good enough, especially
It is far from the farther away region of aggregation node, and the quantity of Node distribution is differed with the number of nodes from the closer region of aggregation node
It is very remote, therefore with the routed path that next-hop cluster head is formed a possibility that opposite routed path from the closer region of aggregation node
Possibility quantity gap is also very big, since the energy adjusting of regional nodes is made by the maximum node of election dump energy
It is cluster head come what is adjusted, this quantitative difference of routed path comes the energy of the node far from aggregation node region relatively
Say that smaller possibility obtains the lesser routing road strength of energy consumption, in the case where multiple job rotating, far from aggregation node
Comparatively region has a possibility that bigger region most fast as consumption energy.Disappear to alleviate far from aggregation node region
For the speed of energy consumption with respect to the very fast this problem in other regions, the technical program proposes a kind of aggregation node Broadcasting Control energy consumption mistake
The mechanism of the data production rate in fast region can further balance the energy consumption of network.
Step S3, the distribution shape of the node, when node is arranged at bridge two sides, the distribution shape of node includes:
To isosceles triangle, to rectangle.
It is described to isosceles triangle, specific setting up procedure are as follows:
The induction radius of node O, A, B are r, and bridge model width is h, and J is one of node, the bottom of isosceles triangle
OA is equal to d, it is assumed that r > h will meet triangle OAB by seamless coverage, and coverage is at least 2, then needs line segment length to meet
OJ≥OA；It is at least 2 isosceles triangle deployment in coverage, it is necessary to meet:
If desired meet the seamless coverage that coverage is at least 3, then triangle OAB must be in the monitoring model of circle O, A, B
In enclosing, then it must satisfy:
r≥d。
It is described to rectangle, specific setting up procedure are as follows:
The induction radius of node A, B, C, D are r, and bridge model width is h, the bottom AB=d of isosceles triangle, it is assumed that r > h,
Reach the seamless coverage of rectangle ABCD coverage at least 2, E, F, G are one of node, and region EFG is only by circle A
The region of covering will be covered by circle B or D, then need AG+FB >=AB, i.e.,
Equally to meet the seamless coverage that rectangle ABCD coverage is at least 3, then at least need E pairs of intersection point of round A and circle C
The vertical range of AC is greater than AB, i.e.,
The formula be also simultaneously rectangle ABCD coverage be at least 4 seamless coverage meet condition.
Compared with the prior art, the invention has the following advantages and beneficial effects:
The present invention proposes a kind of linear topology strategy suitable for real bridge, and the strategy is using node uneven distribution
Strategy avoids hot-zone problem bring network energy consumption unevenness problem, calculates egress by mathematical computations and is distributed in specific region
Quantity, strategy selects cluster head in sub-clustering mechanism based on the dump energy of node, and uses a kind of sacrifice data collection capacity
The method of network energy consumption is further balanced, under these strategies, is able to confirm its energy-consuming balance in simulations, it is in addition also right
The distribution shape of node carries out efficient studies, improves the utilization rate of node.
Detailed description of the invention
Fig. 1 is that hot-zone problem models schematic diagram.
Fig. 2 is a kind of process for the method for solving the problems, such as the hot-zone present in multi-hop sensor network of the present invention
Figure.
Fig. 3 is the election of cluster head flow chart of Fig. 2 the method.
Fig. 4 is the analogous diagram of uneven distribution residue energy of node.
Fig. 5 is the analogous diagram for being uniformly distributed residue energy of node.
Fig. 6 is node location figure.
Fig. 7 is the analogous diagram of the residue energy of node under no data production rate Regulation mechanism.
Fig. 8 is the analogous diagram for having the variance tendency under data production rate Regulation mechanism.
Fig. 9 is the analogous diagram for having the residue energy of node under data production rate Regulation mechanism.
Figure 10 be coverage be 2 rectangle compared with isosceles triangle efficiency figure.
Figure 11 be coverage be 3 rectangle compared with isosceles triangle efficiency figure.
Specific embodiment
Present invention will now be described in further detail with reference to the embodiments and the accompanying drawings, but embodiments of the present invention are unlimited
In this.
Such as Fig. 2, a method of solving the problems, such as the hot-zone present in multi-hop sensor network, comprising the following steps:
S1, the topology policy model unevenly arranged using node, number of nodes are distributed in the form of arithmetic progression；
S2, control area data production rate: the acquisition by each round to residue energy of node is just calculated by SINK
The mathematic expectaion and standard deviation of each region energy consumption, then judge whether to trigger control command；
S3, the coverage met the requirements by the way that the distribution shape of node is arranged.
In step S1, the number of nodes is distributed in the form of arithmetic progression, specifically: the density of annulus interior nodes with
With the increase of base station distance and successively reduce, successively reduce and meet arithmetic progression.
The step S1, specifically:
S101, it divides network: line style network is divided into n region, remember that each zone number is aiIf each region is long
Degree is all L, and each region area is S, region aiInternal segment dot density is ρi；Wherein 1≤i≤n；
S102, zoning aiTotal energy consumption:
Remember the electricity e of each node in region, and assume that the data production rate in region is identical, every wheel is M；Then every wheel
The data volume that each region sends and receivees is n*M；
Data transmission distance is assumed to region and interregional centre distance L；Then to region ai:
Every received data of wheel consume ENERGY ERxFor
ERx=Eclec*n*M；
Wherein EclecFor recruiting unit's message loss of energy；
Every wheel sends the ENERGY E of data consumptionTxFor
ETx=n*M* (Eelec+Eamp*L2)；
Wherein EelecTo emit unit message loss of energy；EampFor amplifying power energy；
Every wheel region aiAlways energy consumption E is
E=ERx+ETx=n*M* (Eclec+Eelec+Eamp*L2)；
S103, the ratio K for calculating region gross energy and region total energy consumption:
Each region aiGross energy is
ρi*S*e
Remember region aiGross energy and region aiTotal energy consumption ratio of every wheel is K:
S104, with the ρ inside KiTable egress total number simultaneously finds out ρiAbout the expression formula of network node sum g, area surface
Product is S；Then
Then network node sum is for g
Then
Abbreviation:
It substitutes into
Because of M, Eclec、Eelec、Eamp, L be definite value, then abbreviation obtains
Then region aiNumber of nodes asAre as follows:
, region a closer from aggregation node is found out from the formulaiNumber of nodes it is more, the node between region and region
Number relationship is in arithmetic progression relationship.
The step S2, specifically:
After information is sent to aggregation node by cluster head, aggregation node obtains the node energy residue situation of each region entirety
Afterwards, each residue energy of node e is calculatedjWith each region average residual ENERGY Ej, dump energy average value Eave, wherein 1≤j≤g, then
Obtain EaveAfterwards, aggregation node is by calculating each region average residual ENERGY EjWith EaveStandard deviation X and variance x,
Know each region dump energy situation to EaveDeviation situation；
Standard deviation X:
Variance x:
By preset threshold value K, as soon as when K is in specific horizontal, aggregation node Broadcasting Control reduces region
Remaining node energy subaverage EaveAnd deviate maximum region data generation rate.
Such as Fig. 3, the step S2, specifically:
The node set in a region is set into cluster, and member does not change by n wheel, i.e. the node in other regions
The member of this cluster can not be become；
Since cluster head can collect the energy information of each member, it is subsidiary sensing data together, cluster head calculates energy
Distribution situation；
The cluster head in each region is set since the first round, node member starts the phase for acquiring data and communicating with cluster head
Between, the energy residual information of self residual is sent to leader cluster node together, in the eve of rotation, cluster head is according to the energy of member
Situation is measured, gives dump energy maximum member node specify information, if the most node of dump energy has more than one,
It selects cluster head at random in these maximum members of dump energy, completes rotation.
Step S3, the distribution shape of the node, when node is arranged at bridge two sides, the distribution shape of node includes:
To isosceles triangle, to rectangle.
It is described to isosceles triangle, specific setting up procedure are as follows:
The induction radius of node O, A, B are r, and bridge model width is h, and J is one of node, the bottom of isosceles triangle
OA is equal to d, it is assumed that r > h will meet triangle OAB by seamless coverage, and coverage is at least 2, then needs line segment length to meet
OJ≥OA；It is at least 2 isosceles triangle deployment in coverage, it is necessary to meet:
If desired meet the seamless coverage that coverage is at least 3, then triangle OAB must be in the monitoring model of circle O, A, B
In enclosing, then it must satisfy:
r≥d。
It is described to rectangle, specific setting up procedure are as follows:
The induction radius of node A, B, C, D are r, and bridge model width is h, the bottom AB=d of isosceles triangle, it is assumed that r > h,
Reach the seamless coverage of rectangle ABCD coverage at least 2, E, F, G are one of node, and region EFG is only by circle A
The region of covering will be covered by circle B or D, then need AG+FB >=AB, i.e.,
Equally to meet the seamless coverage that rectangle ABCD coverage is at least 3, then at least need E pairs of intersection point of round A and circle C
The vertical range of AC is greater than AB, i.e.,
The formula be also simultaneously rectangle ABCD coverage be at least 4 seamless coverage meet condition.
In order to which whether the Node distribution strategy and control data production rate controlling mechanism of verifying above-mentioned can be really achieved energy
The efficiency of consumption balance and node deployment shape, this trifle is programmed simulating, verifying using Matlab, and analyzes result.
One, node is unevenly disposed compared with the energy consumption uniformly disposed
Parameter setting
1 parameter setting of table
Simulation result such as Fig. 4,5.
The experimental results showed that in the strategy that node unevenly divides, occurring in the 549th wheel under the setting of above-mentioned parameter
First node death, node residue gross energy are 0.91, account for the 3.3% of initial total energy, and node is evenly distributed on the 121st
There is first node death in wheel, and node residue gross energy is 13.50, accounts for the 49.09% of initial total energy.It can be with from this result
Find out, the uniform type of network energy consumption can be improved in the strategy of node uneven distribution really, improves network life.
Two, the effect of data production rate Regulation mechanism
2 parameter setting of table
Experimental result is shown in Fig. 6,7,8,9.
Analysis of experimental results:
It due to node random distribution, is averaged using each 3 experiments of two mechanism, has shown that data production rate adjusts machine
The average total surplus energy of system is 5.35, and first node death wheel number is 1049, without data production rate Regulation mechanism
Average total surplus energy be 9.38, first node death wheel number average out to 933.The experimental results showed that there is data production rate
Regulation mechanism can further extend the service life of network to a certain extent really.
Three, the efficiency of inserting knot shape compares
3 parameter setting of table
| Bridge width | 8 meters |
| Node incudes radius | 10 meters |
Experimental result is shown in Figure 10,11.The experimental results showed that in the case where coverage is at least 2 requirement, distributed rectangular than etc.
Lumbar triangle shape distribution efficiency wants high, and in the case where coverage is at least 3 requirement, isosceles triangle is distributed than distributed rectangular efficiency
It is high.
According to above analysis, if being divided into 10 regions by the bridge of 1000m*8m, each zone length is 100m, that
5 nodes can be used far from first region SINK to reach coverage for 1 network, when first region arranges 5
Node means that Two Areas puts 10 nodes according to work before, and third region is put, 15 nodes, with such
Push away so be exactly since third region by coverage be 2, the rectangular arrangement of peak efficiency.It is exactly since the 5th region
It is 3 by coverage, the isosceles triangle of peak efficiency is arranged.It is exactly by coverage since the 7th region is 4, peak efficiency
Rectangular arrangement.Nodal function is not wasted to reach, improves the purpose of monitoring accuracy.
The above embodiment is a preferred embodiment of the present invention, but embodiments of the present invention are not by above-described embodiment
Limitation, other any changes, modifications, substitutions, combinations, simplifications made without departing from the spirit and principles of the present invention,
It should be equivalent substitute mode, be included within the scope of the present invention.
Claims (4)
1. a kind of method for solving the problems, such as the hot-zone present in multi-hop sensor network, it is characterised in that: the following steps are included:
S1, the topology policy model unevenly arranged using node, number of nodes are distributed in the form of arithmetic progression；
S2, control area data production rate: the acquisition by each round to residue energy of node just calculates each area by SINK
The mathematic expectaion and standard deviation of domain energy consumption, then judge whether to trigger control command；
S3, the coverage met the requirements by the way that the distribution shape of node is arranged；
The distribution shape of the node, when node is arranged at bridge two sides, the distribution shape of node includes: to isoceles triangle
Shape, to rectangle；
It is described to isosceles triangle, specific setting up procedure are as follows:
The induction radius of node O, A, B are r, and bridge model width is h, and J is one of node, bottom OA of isosceles triangle etc.
In d, it is assumed that r > h will meet triangle OAB by seamless coverage, and coverage is at least 2, then need line segment length meet OJ >=
OA；It is at least 2 isosceles triangle deployment in coverage, it is necessary to meet:
If desired meet the seamless coverage that coverage is at least 3, then triangle OAB must all circle O, A, B monitoring range in,
Then it must satisfy:
r≥d。
2. solving the problems, such as the method for the hot-zone present in multi-hop sensor network according to claim 1, it is characterised in that:
In step S1, the number of nodes is distributed in the form of arithmetic progression, specifically: the density of annulus interior nodes with base station
The increase of distance and successively reduce, successively reduce meet arithmetic progression.
3. solving the problems, such as the method for the hot-zone present in multi-hop sensor network according to claim 1, which is characterized in that
The step S2, specifically:
The node set in a region is set into cluster, and member does not change by n wheel, i.e. the node in other regions can not
Member as this cluster；
Since cluster head can collect the energy information of each member, it is subsidiary sensing data together, cluster head calculates Energy distribution
Situation；
The cluster head in each region is set since the first round, during node member starts to acquire data and communicate with cluster head,
The energy residual information of self residual is sent to leader cluster node together, and in the eve of rotation, cluster head is according to the energy feelings of member
Condition gives dump energy maximum member node specify information, if the most node of dump energy has more than one, surplus
Cluster head is selected in these maximum members of complementary energy at random, completes rotation.
4. solving the problems, such as the method for the hot-zone present in multi-hop sensor network according to claim 1, it is characterised in that:
It is described to rectangle, specific setting up procedure are as follows:
The induction radius of node A, B, C, D are r, and bridge model width is h, the bottom AB=d of isosceles triangle, it is assumed that r > h will reach
To the seamless coverage of rectangle ABCD coverage at least 2, E, F, G are one of node, and region EFG is only by circle A covering
Region will by circle B or D cover, then need AG+FB >=AB, i.e.,
Equally to meet the seamless coverage that rectangle ABCD coverage is at least 3, then at least need the intersection point E of round A and circle C to AC's
Vertical range is greater than AB, i.e.,
The formula be also simultaneously rectangle ABCD coverage be at least 4 seamless coverage meet condition.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610581562.9A CN106454858B (en) | 2016-07-21 | 2016-07-21 | A method of solving the problems, such as the hot-zone present in multi-hop sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610581562.9A CN106454858B (en) | 2016-07-21 | 2016-07-21 | A method of solving the problems, such as the hot-zone present in multi-hop sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106454858A CN106454858A (en) | 2017-02-22 |
| CN106454858B true CN106454858B (en) | 2019-10-22 |
Family
ID=58184227
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610581562.9A Active CN106454858B (en) | 2016-07-21 | 2016-07-21 | A method of solving the problems, such as the hot-zone present in multi-hop sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106454858B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108650696A (en) * | 2018-05-03 | 2018-10-12 | 南京邮电大学 | A kind of wireless sense network cluster head selection method of high energy efficiency |
| CN109041159B (en) * | 2018-08-04 | 2021-04-02 | 浙江农林大学 | Method for overcoming energy imbalance in wireless sensor network |
| CN115315030A (en) * | 2022-08-08 | 2022-11-08 | 国网智能电网研究院有限公司 | Wireless sensor network based on cluster head energy differentiation and deployment method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101394321A (en) * | 2008-09-25 | 2009-03-25 | 重庆邮电大学 | Non-uniform clustering method for cluster wireless sensor network based on energy balance |
| CN101883385A (en) * | 2010-04-12 | 2010-11-10 | 北京航空航天大学 | Actively predicted reliable data transmission method in wireless sensor network |
| CN104394571A (en) * | 2014-12-10 | 2015-03-04 | 河海大学常州校区 | Topology control method of wireless sensor network used for monitoring water quality of inland river |
| CN104883301A (en) * | 2015-06-03 | 2015-09-02 | 中国矿业大学 | Wireless sensor network clustering routing protocol based on residual energy and communication cost |
-
2016
- 2016-07-21 CN CN201610581562.9A patent/CN106454858B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101394321A (en) * | 2008-09-25 | 2009-03-25 | 重庆邮电大学 | Non-uniform clustering method for cluster wireless sensor network based on energy balance |
| CN101883385A (en) * | 2010-04-12 | 2010-11-10 | 北京航空航天大学 | Actively predicted reliable data transmission method in wireless sensor network |
| CN104394571A (en) * | 2014-12-10 | 2015-03-04 | 河海大学常州校区 | Topology control method of wireless sensor network used for monitoring water quality of inland river |
| CN104883301A (en) * | 2015-06-03 | 2015-09-02 | 中国矿业大学 | Wireless sensor network clustering routing protocol based on residual energy and communication cost |
Non-Patent Citations (2)
| Title |
|---|
| "一种线型无线传感器网络的节点布置方案";陆克中等;《计算机应用》;20070701;第27卷(第7期);1566-1568 * |
| "基于节点负载均衡的分布式光伏发电无线安全监控网络研究";陈孟元;《电子测量与仪器学报》;20160115;第30卷(第1期);92-100 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106454858A (en) | 2017-02-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106454858B (en) | A method of solving the problems, such as the hot-zone present in multi-hop sensor network | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN104469879B (en) | A kind of dynamic k value cluster routing methods | |
| CN108599138A (en) | Meter and the probabilistic energy storage system capacity configuration method of micro-capacitance sensor distributed energy | |
| CN103269490B (en) | A kind of wireless hybrid cellular network base station selection and scale calculation method | |
| CN104796333B (en) | A kind of wireless sensor network based on IPv6 and Internet multiple gateway interconnection scheme | |
| CN106792764B (en) | Wireless base station planning method for power distribution terminal communication access network | |
| CN106658642A (en) | Energy heterogeneous wireless sensor network clustering method and system | |
| CN109451556A (en) | The method to be charged based on UAV to wireless sense network | |
| CN113675853A (en) | Energy internet-oriented power consumption information acquisition system | |
| CN109511150A (en) | A kind of movable charging vehicle path planning algorithm based on the more charging techniques of single pair | |
| CN110673475A (en) | Intelligent building energy-saving system with internet of things sensing function and control method | |
| CN102149101B (en) | Administration of energy conservation method and system | |
| CN105676820A (en) | Urban garden layered distributed temperature control load demand response control strategy | |
| CN103327592B (en) | A kind of wireless sensor network Poewr control method based on the node number of degrees | |
| CN106524277A (en) | Multi-energy region energy supply system for winter heating | |
| CN103906245A (en) | Distributed rate control method for wireless sensor network | |
| CN102088753A (en) | Alternate hole routing method of Internet of Things (IOT) for guaranteeing service quality | |
| CN102572995B (en) | Solution for hot area problem based on geographical adaptive fidelity (GAF) improved clustering mechanism in wireless sensor network | |
| CN103313264B (en) | A kind of sensor redundancy node deployment method based on honeycomb grid | |
| CN102802166A (en) | Improved Zigbee network lamination method | |
| CN110162824A (en) | A kind of structure design of wired home energy management system and communicate selection method | |
| CN106488507A (en) | The Uneven Cluster sensor network energy cavity avoiding method of routing overhead shunting | |
| CN104267777B (en) | Based on wireless network realize distributed solar energy generate electricity by way of merging two or more grid systems control method | |
| Kumar et al. | Improved data gathering protocol for WSN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |