CN109152103A - A kind of pair of wireless sensor network carries out network-building method and device - Google Patents
A kind of pair of wireless sensor network carries out network-building method and device Download PDFInfo
- Publication number
- CN109152103A CN109152103A CN201811308609.XA CN201811308609A CN109152103A CN 109152103 A CN109152103 A CN 109152103A CN 201811308609 A CN201811308609 A CN 201811308609A CN 109152103 A CN109152103 A CN 109152103A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- leader cluster
- particle
- 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.)
- Granted
Links
Classifications
-
- 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
-
- 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
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication 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 embodiment of the invention discloses a kind of pair of wireless sensor networks to carry out network-building method and device, this method comprises: being Connected undigraph by sensor network modeling；Node of the central node into communication range sends establishing route request；Each node obtains the parameter preset information between the energy minimum hop count, each node self residual between central node, and node of the acquisition in the communication range centered on itself all in accordance with request in node；Node determines the leader cluster node in node and non-cluster head member node according to the above parameter；According to the relationship between leader cluster node and central node, alternatively, choosing head-end site from leader cluster node according to the functional relation between leader cluster node, non-cluster head member node and central node；According to head-end site, a networking is carried out to the first particle in population, obtains network lifecycle value corresponding with the first particle；Optimal networking particle is updated and iteration.
Description
Technical field
The present invention relates to network technique fields, and in particular to a kind of pair of wireless sensor network carries out network-building method and dress
It sets.
Background technique
Refine to plant relies on technology of Internet of things realization entirely square to soil, temperature, humidity, crop growthing state as a kind of
The planting technology scheme of position detection and management, provides highly efficient for investment, management and the output in agricultural production process
Management mode.However, being limited to the distribution and growing environment feature of crop, it is big to refine sensor device in implant system
Mostly using battery as main energy supply carrier, the behaviour in service of battery capacity is directly concerning the sensing capability to target area
And the operating status of network.
In the research of moment sensor network establishing method, mostly use remaining capacity, transmission range as network struction greatly
Foundation realizes network struction by way of multi-hop, and does not bring the prediction of sensor device life cycle into network struction
Come in the process.
And in the network constructed through the above way, sensor device also needs to undertake adjacent in addition to completing the transmission of data itself
The data forwarding function of node will necessarily cause if some sensor device serves as forward node always and consumes its electricity
Greatly shorten network lifecycle.
So how to evade some sensor device and serve as forward node always, that is, avoids leading because partial load is overweight
" hot spot " problem caused increases network lifecycle to carry out networking to sensor device during sensor networking
As technical problem urgently to be resolved.
Summary of the invention
A kind of pair of wireless sensor network that be designed to provide of the embodiment of the present invention carries out network-building method and device, to
It solves some sensor device in existing sensor networking composition and serves as forward node always, cause sensor network raw
The problem of ordering cycle time.
To achieve the above object, the embodiment of the present invention provides a kind of pair of wireless sensor network and carries out network-building method, the party
Method includes:
It is Connected undigraph by sensor network modeling, includes central node and node in Connected undigraph；
Node of the central node into communication range sends establishing route request；
Each node is all in accordance with request in node, and minimum hop count, each node between acquisition and central node are certainly
The remaining energy of body, and obtain the parameter preset information between the node in the communication range centered on itself；
Node is according to minimum hop count, and obtains the parameter preset between the node in the communication range centered on itself
Information determines the leader cluster node in node and non-cluster head member node；
According to the relationship between leader cluster node and central node, alternatively, according to leader cluster node, non-cluster head member node and in
Functional relation between heart node is to select in leader cluster node from head-end site head-end site is chosen in leader cluster node
The maximum point of coefficient；
According to head-end site, a networking is carried out to the first particle in wireless sensor network population, is obtained
Network lifecycle value corresponding with the first particle, the first particle are all during a wheel wireless sensor networking
The matrix that the corresponding temperature coefficient of one sensor node is constituted；
Until network optimization index is calculated after determination carries out networking to all particles in wireless sensor network,
And determine this time corresponding temperature coefficient matrix of optimal networking particle；
And the heat when the corresponding temperature coefficient matrix of this optimal networking particle due to being better than the optimal networking particle of history
It when spending coefficient matrix, is updated the temperature coefficient of this optimal networking particle as current optimal networking particle, otherwise will
The optimal networking particle of history is as current optimal networking particle；
Current optimal networking particle is counted as optimal number；
When number is less than the first preset times threshold value, the currently corresponding temperature coefficient matrix of optimal networking particle is carried out
It is mobile, and networking is re-started, until number is pre- greater than second greater than the first preset times threshold value, or the number of circulation networking
If terminating when frequency threshold value.
The embodiment of the present invention has the advantages that each node is requested according to the establishing route that central node is sent respectively,
It obtains and the minimum hop count between central node, the energy of each node self residual and acquisition leading to centered on itself
Believe the parameter preset information between the node in range, the leader cluster node in node and non-cluster head member node is determined, according to cluster
Relationship between head node and central node, alternatively, according to the letter between leader cluster node, non-cluster head member node and central node
Number relationship, proper head-end site is selected from leader cluster node.By these head-end sites, realize to grain
Particle in subgroup carries out networking.And the head-end site selected is the selection maximum leader cluster node of coefficient, the larger theory of coefficient
Bright cluster head dump energy is larger, and communication energy consumption is smaller, and the hop count of distance center node is smaller than surroundings nodes.Therefore, may be used
To greatly promote network lifecycle.After carrying out networking to all particles, it is also necessary to select optimal particle.Then to optimal
Particle is iterated update, until determining optimal networking mode.Realize the optimal of sensor node data transfer amount in network
Change adjustment, is finally reached the purpose for promoting network lifecycle.
To achieve the above object, the embodiment of the present invention provides a kind of pair of wireless sensor network and carries out network device, the dress
Set includes: processor, memory, and one or more programs；One or more programs are stored in memory by processor
Operation executes the method as above for carrying out networking to wireless sensor network.
The embodiment of the present invention has the advantages that each node is requested according to the establishing route that central node is sent respectively,
It obtains and the minimum hop count between central node, the energy of each node self residual and acquisition leading to centered on itself
Believe the parameter preset information between the node in range, the leader cluster node in node and non-cluster head member node is determined, according to cluster
Relationship between head node and central node, alternatively, according to the letter between leader cluster node, non-cluster head member node and central node
Number relationship, selects proper head-end site from leader cluster node.By these head-end sites, realize to particle
Particle in group carries out networking.And the head-end site selected is the selection maximum leader cluster node of coefficient, the larger explanation of coefficient
Cluster head dump energy is larger, and communication energy consumption is smaller, and the hop count of distance center node is smaller than surroundings nodes.It therefore, can be with
Greatly promote network lifecycle.After carrying out networking to all particles, it is also necessary to select optimal particle.Then to optimal grain
Son is iterated update, until determining optimal networking mode.Realize the optimization of sensor node data transfer amount in network
Adjustment is finally reached the purpose for promoting network lifecycle.
Detailed description of the invention
Fig. 1 is that a kind of pair of wireless sensor network that the embodiment of the present invention 1 provides carries out network-building method flow diagram；
Fig. 2 is provided by the invention under conditions of identical network deployment and Energy distribution, and the present embodiment is respectively adopted
Algorithm and cluster radius-adaptive network-building method carry out experiment comparative result schematic diagram；
Fig. 3 is selection network after the algorithm and cluster radius-adaptive network-building method provided by the invention using the present embodiment
The mean time to failure, MTTF of node compares and analyzes result schematic diagram when first time networking；
Fig. 4 is that a kind of pair of wireless sensor network that the embodiment of the present invention 2 provides carries out network device structural schematic diagram.
Specific embodiment
Embodiments of the present invention are illustrated by particular specific embodiment below, those skilled in the art can be by this explanation
Content disclosed by book is understood other advantages and efficacy of the present invention easily.
It should be clear that this specification structure depicted in this specification institute accompanying drawings, ratio, size etc., only to cooperate specification to be taken off
The content shown is not intended to limit the invention enforceable qualifications so that those skilled in the art understands and reads, therefore
Do not have technical essential meaning, the modification of any structure, the change of proportionate relationship or the adjustment of size are not influencing the present invention
Under the effect of can be generated and the purpose that can reach, it should all still fall in disclosed technology contents and obtain the model that can cover
In enclosing.Meanwhile cited such as "upper", "lower", " left side ", the right side in this specification ", the term of " centre ", be merely convenient to chat
That states is illustrated, rather than to limit the scope of the invention, relativeness is altered or modified, and is changing skill without essence
It is held in art, when being also considered as the enforceable scope of the present invention.
Embodiment 1
The embodiment of the present invention 1 provides a kind of pair of wireless sensor network and carries out network-building method, specifically as shown in Figure 1, Fig. 1
Network-building method flow diagram is carried out for a kind of pair of wireless sensor network provided in an embodiment of the present invention, this method is mainly applied
In fining implant system, using sub-clustering form networking.Particle swarm algorithm, main thought are involved in this method are as follows:
It is Connected undigraph G=(V, E) by network communication process model building, wherein V indicates all biographies with communication capacity
Sensor equipment；E is line set, and each edge e ∈ E indicates there is the path that can be communicated between carrier sensor node.Nothing is set
" the temperature coefficient " of all the sensors node in line sensor network, the matrix that the temperature coefficient of all the sensors node is constituted can
To be interpreted as a particle, practical is exactly the corresponding wireless sensor networking process of each particle；And population is
More wheel networkings are carried out to wireless sensor network, each round group is shaped to a particle, and more wheel networkings then constitute a population.
Summarize in each round group network process, will all comprehensively consider all " the temperature coefficients ", residual energy for constituting each particle node
The factors such as amount, loss of communications carry out network struction, and the network structure that will obtain specific network lifecycle.
In the algorithm, each particle position corresponding will once organize network process, and generate a network lifecycle value.To obtain
It obtains the optimal solution of network lifecycle to need constantly to carry out mobile (i.e. continuous loop iteration) to particle position, obtains the overall situation most
Excellent solution.
Each particle fitness index is calculated with network lifecycle, and updates the locally optimal solution of particle swarm algorithm and complete
Office's optimal solution；Judge whether the number of iterations reaches preset condition, if then exporting network connection topological structure, otherwise more new particle
Swarm parameter repeats aforesaid operations until meeting some requirements.
Specific steps introduction will be described in detail below, this method comprises:
It step 110, is Connected undigraph by sensor network modeling.
Specifically, including central node and node in Connected undigraph.And node is divided into non-cluster head member node and cluster head
Node.Connected undigraph G=(V, E), V indicate all sensor devices with communication capacity；E is line set, each edge e ∈
E indicates there is the path that can be communicated between carrier sensor node.
Before introducing other methods step provided in this embodiment, illustratively node data transmission process energy consumption first,
It can be indicated with formula 1 and formula 2:
Wherein, wherein l is the length for sending data, EelecFor the energy consumption of the every bit data of the every transmission/reception of node, d is hair
Send node between receiving node at a distance from.εfsAnd εtwo-rayFor the power amplification multiple under the conditions of different transmission ranges.
Node data receive process energy consumption is indicated by formula 3:
ERX(l)=lEelec (3)
Leader cluster node power consumption:
Data fusion process is expressed as no matter receiving that cluster interior nodes how many data are all converted to a fixation in this system
The data packet of length.Since leader cluster node had both undertaken in cluster except information reception, data fusion, fused data forwarding capability, also
Adjacent cluster head data forwarding function is born, therefore sets in cluster head number of members as n, then cluster head energy consumption can be indicated by formula 4 are as follows:
ECh=lEelec(n+1)+lEDA(n+1)+lETxd2 (4)
Wherein EDAFor data fusion loss factor, ETxFor the summation of fused data in cluster and forwarding data.
It is provided in this embodiment that network-building method is carried out to wireless network sensor network, comprising:
Step 120, node of the central node into communication range sends establishing route request.
Step 130, each node obtains minimum hop count between central node, each all in accordance with request in node
The energy of a node self residual, and obtain the parameter preset letter between the node in the communication range centered on itself
Breath.
Step 140, node is according to minimum hop count, and obtains between the node in the communication range centered on itself
Parameter preset information determines the leader cluster node in node and non-cluster head member node.
Specifically, node can according to minimum hop count, and obtain node in the communication range centered on itself it
Between parameter preset information, calculate corresponding with each node cluster head coefficient of competition；
According to cluster head coefficient of competition, the leader cluster node in node and non-cluster head member node are determined.
When other nodes pair for determining that itself corresponding cluster head coefficient of competition is greater than in communication range centered on itself
When the cluster head coefficient of competition answered, nose count adds 1；Otherwise, into the communication range centered on itself, cluster head coefficient of competition is most
Big node ballot, so that the maximum node nose count of cluster head coefficient of competition adds 1 in the communication range centered on itself；Really
Determining node of the nose count more than or equal to 1 is leader cluster node.
That is, each node obtains the coefficient of competition of each node in communication range in network, thrown if itself coefficient of competition maximum
Ticket counter VotAdd 1；Otherwise " ballot " information and to the maximum node of coefficient of competition is sent, ballot ought be received by being voted-for node
By nose count device V after informationotAdd 1, all V in networkot>=1 node becomes leader cluster node, and other nodes are non-cluster head
Member node.
Wherein, it obtains centered on first node, the parameter preset information between all second nodes in communication range,
Include: the minimum hop count average value of all second node distance center nodes, all second nodes, second node number and
Any non-cluster head member node is completed consumed by a data transmission by leader cluster node in all nodes in communication range
Energy, wherein first node and second node collectively form the node in preset range, and first node is the section in preset range
Any one node in point, second node are the node in addition to first node, and the number of second node includes at least two.
Node is according to the energy of minimum hop count, each node self residual, and obtains the communication centered on itself
Parameter preset information between node in range calculates cluster head coefficient of competition corresponding with each node, specific to wrap
It includes:
According to the minimum hop count average value of all second node distance center nodes and first node distance center node
Minimum hop count, calculate the communication radius of first node.
Specific formula is as shown in formula 5:
Wherein, have is the average value of each node and central node minimum hop count in neighbor node, and α is constant, and hmin is
Minimum hop count between first node and central node.
Then, according to the communication radius R (i) of first node i, all second node dis (j, CHi), the number of second node
Mesh N calculates first node i and all second node dis (j, CHi) between discretization coefficient.
It can specifically be indicated by formula 6:
Wherein dis (j, CHi) indicate that neighbor node j, N of the i in the communication range of communication distance R (i) are neighbor node
Number, the index is smaller, and neighbor node is more concentrated with cluster head.
According to non-cluster head member section any in all nodes in the energy and communication range of first node self residual
Point completes a data by leader cluster node and transmits consumed energy, calculates the life cycle predicted value of first node.Specifically
Calculating can be indicated by formula 7:
Wherein, molecule is the dump energy of present node, and denominator is that node all in cluster communication range passes through cluster head section
Point completes energy required for a data are transmitted, and d value takes 2 times of R (i).
Finally, according to the Life Cycle of discretization coefficient and first node between first node and all second nodes
Phase predicted value calculates the corresponding cluster head coefficient of competition of first node.It can be indicated by formula 8:
Fitness (i)=DisRatio (i)βLife(i)μ(formula 8)
Wherein β and μ is the proportionality coefficient of each index, and the present embodiment takes -1,1 respectively.
And choose leader cluster node, then it can execute in the following way realization:
Each node obtains in communication range coefficient of competition corresponding with each node respectively in network, if itself competition system
The maximum then nose count device V of numberotAdd 1；Otherwise " ballot " information is sent to the maximum node of coefficient of competition, being voted-for node ought connect
It receives nose count device V after vote informationotAdd 1, all V in networkot>=1 node becomes alternative leader cluster node.
To avoid two leader cluster node interval too smalls occur during election of cluster head, if distance threshold is R between cluster head1, when
When communication distance is less than the value between two cluster heads, be handled as follows: choosing cluster head coefficient of competition numerical value maximum node becomes cluster
Head node, the lesser node of cluster head coefficient of competition numerical value are converted to non-cluster head member node；By the non-cluster head member section after conversion
Point, which is constituted, to be combined, and is carried out the ballot again of leader cluster node, the leader cluster node in set is determined, until meeting threshold range.
Step 150, according to the relationship between leader cluster node and central node, alternatively, according to leader cluster node, non-cluster head member
Functional relation between node and central node, chooses head-end site from leader cluster node.
Optionally, according to the functional relation between leader cluster node, non-cluster head member node and central node, from leader cluster node
Middle selection head-end site, specifically includes:
Each non-cluster head member node respectively according between leader cluster node in itself and communication range communication energy consumption, from
Minimum hop count and itself remaining energy information in cluster where body between leader cluster node and central node, calculate and itself
Corresponding cluster-head node selection coefficient；
Determine that non-cluster head member node selects the maximum leader cluster node of coefficient as the second head-end site.
Specifically, non-cluster head member node calculates communication energy consumption E according to the leader cluster node distance in cluster where itselftx,
And the minimum hop count between central node of leader cluster node, itself remaining energy information generate in cluster where combining itself
Cluster head selects coefficient Cchoose, and the biggish leader cluster node of coefficient is chosen as head-end site.Cluster head selection coefficient can have
Formula 9 is calculated:
Wherein, Eo (i) indicates that the energy of leader cluster node, Etx (j, i) indicate the loss of communications between two nodes, and wi is pre-
The weight coefficient first set.
Optionally, according to the relationship between leader cluster node and central node, head-end site is chosen from leader cluster node,
It specifically includes:
Each leader cluster node obtains dump energy, linking number and the central node of the leader cluster node adjacent with itself most
Small hop count and weight coefficient corresponding with itself calculate selection coefficient corresponding with itself；
Determining that all leader cluster nodes are corresponding selects the maximum leader cluster node of coefficient as head-end site.Its
In, cluster number of members that the cluster head that linking number is connected by cluster head manages.
Specifically, each leader cluster node obtains other leader cluster node set in network in communication range, if without other cluster heads
Node is then stepped up communication radius until obtaining certain amount (being more than or equal to 2) other leader cluster nodes or reaching maximum communication
Until radius, i.e. the communication capacity limit of equipment, i.e. R in above-mentioned formula 50。
Then, each leader cluster node (by taking m as an example) obtains the dump energy E of adjacent cluster head no(n), linking number Con (n),
With central node minimum hop count hminAnd the corresponding temperature coefficient w of the equipment in presetting Fe coatingsn(certain sensor section
Point " temperature coefficient " be the node become head-end site the probability coefficent factor) etc. relevant informations, calculate selection coefficient CH
(m, n) and the maximum is chosen as head-end site, coefficient is selected to be indicated by formula 10:
Wherein, EtxIndicate the loss of communications between two nodes, haveFor cluster head each in neighbours and central node minimum hop count
Average value.
Wherein, when initial network communication process models, each particle expression formula W in network is just arranged by particle swarm algorithm
={ wi| i=1 ..., N }, wherein N is sensor network interior joint number, and initialization W matrix is complete 1 vector, and wi is sensor
Node i is corresponding " temperature coefficient ", and value range is (0,2).In the algorithm, each particle position will a corresponding networking
Journey, and generate a network lifecycle value.For obtain the optimal solution of network lifecycle need constantly to particle position into
Row is mobile (iteration), obtains globally optimal solution.It is m, maximum cycle p that population in particle swarm algorithm, which is arranged, chooses net
Network optimizing index are as follows:
Wherein k indicates the networking of kth wheel, and Life is the life cycle of all nodes in network, and Lifeave indicates network internal segment
Point life cycle average value.
And the numerical value in subsequent temperature coefficient matrix may be changed according to the actual situation.Specifically will hereinafter it do
It is described in detail.
Step 160, according to head-end site, a networking is carried out to the first particle in population, is obtained and first
The corresponding network lifecycle value of particle.Wherein, the first particle is all the sensors node in a wheel wireless sensor network
The matrix that corresponding temperature coefficient is constituted.
Step 170, it until after determination carries out networking to all particles in population, calculates the network optimization and refers to
Mark, and determine this time corresponding temperature coefficient matrix of optimal networking particle.
And when the corresponding temperature coefficient matrix of this optimal networking particle is better than the temperature coefficient of the optimal networking particle of history
When matrix, it is updated this optimal networking particle as current optimal networking particle, otherwise by the optimal networking particle of history
As current optimal networking particle.
Step 180, current optimal networking particle is counted as optimal number.
Step 190, when number is less than the first preset times threshold value, to the currently corresponding temperature coefficient of optimal networking particle
Matrix is moved, and re-starts networking, until number is big greater than the first preset times threshold value, or the number of circulation networking
Terminate when the second preset times threshold value.
Specifically, central node analyzes the networking situation of each particle during every wheel circulation, concrete analysis is
Fitness function in particle swarm algorithm.Network optimization target is calculated, specific formula for calculation is as shown in formula 9.It records in the wheel
The temperature coefficient matrix W of optimal networking particlebest_perIf the particle state is better than history optimal particle temperature coefficient matrix
Wbest_groupr, then history optimal particle is updated, while the continuous optimal counter Count of history adds 1；Otherwise Count is set
It is 0.Wherein, the optimal net particle of the wheel can be calculated network optimization index f (k) according to particle swarm algorithm.
Step 10: central node judges Count, if be less than specified threshold (value need according to actual needs into
Row setting), and cycle-index is less than preset value, then moves to particle temperature coefficient matrix, new particle indicates are as follows:
W_new=W × μ+C1×(Wbest_per-W)+C2×(Wbest_groupr-W) (12)
Wherein μ is inertia coeffeicent, C1、C2For the self study factor, Wbest_per、Wbest_grouprRespectively indicate individual optimal value and
Group's optimal value.
Algorithm terminates if Count is greater than specified threshold or particle swarm algorithm iteration repeating query number is greater than maximum value, exports
The networking situation of current network.
Further, since the energy consumption of leader cluster node is far longer than non-leader cluster node, therefore uses cluster head in Cluster Networks structure
Rotation mechanism realizes the maximization of network life cycle.If the 1/10 of nodes life cycle average value is greater than specified threshold
Value then chooses 1/10 trigger condition as network reconfiguration of nodes life cycle average value, system after condition meets
Network reconfiguration is carried out according to above-mentioned steps, the data transmission for otherwise choosing predetermined number of times is used as trigger condition, i.e., according to fixed amount
The trigger condition that is recombinated as network of energy consumption.
It should be noted that being greater than 10^3 in the present embodiment when the nodes average life period, then choosing in network
Otherwise trigger condition of the 1/10 of node life cycle average value as network reconfiguration is chosen 200 whole network data transmission and is made
For trigger condition.
For the performance for verifying this algorithm, in a specific example, within the scope of 1000*1000m2 random placement 170~
300 sensor network nodes (primary power is identical) carry out above-mentioned networking experiment.With reference to universal at present to life cycle
All the sensors node is completed a data transmission and is used as a complete data transmission procedure, defines first section by definition
Data transmission times are as network lifecycle when point failure.As shown in Fig. 2, in the condition of identical network deployment and Energy distribution
Under, the algorithm and cluster radius-adaptive network-building method that the present embodiment is respectively adopted carry out experiment comparison, in network life cycle side
Face, method provided in this embodiment promote about 45% compared with cluster radius-adaptive organization algorithm in life cycle.
To analyze first time networking effect in network, as shown in figure 3, node when choosing the networking of network first time
Mean time to failure, MTTF compares and analyzes, and is substantially better than cluster radius-adaptive organization algorithm by comparison discovery the present embodiment.
A kind of pair of wireless sensor network provided in an embodiment of the present invention carries out network-building method, by the sensor of two-way communication
Network modelling is Connected undigraph, and three networking, cluster head networking processes pass through to neighbor node residual energy in election of cluster head, cluster
The factors such as amount, existing connection state are analyzed, and carry out network data forwarding section in conjunction with node life cycle and other factors
The selection of point.In head-end site optimization process, moved by temperature coefficient of the particle swarm algorithm to each node device
State adjustment, realizes the optimization adjustment of sensor node data transfer amount in network, and has been finally reached promotion network life
The purpose in period.
Embodiment 2
Corresponding with above-described embodiment 1, the embodiment of the present invention 2 provides a kind of pair of wireless sensor network and carries out networking
Device, it is specific as shown in figure 4, Fig. 4 is that a kind of pair of wireless sensor network provided in an embodiment of the present invention carries out network device knot
Structure schematic diagram, the device include: processor 10, memory 20 and one or more programs, and one by one or multiple programs are stored in
It is run in memory 20 by processor 10, to execute the method introduced such as embodiment 1.
A kind of pair of wireless sensor network provided in an embodiment of the present invention carries out function performed by each component in network device
Can a kind of pair of wireless sensor network provided by the embodiment 1 elaborate in network-building method, here will
It repeats no more.
A kind of pair of wireless sensor network provided in an embodiment of the present invention carries out network device, by the sensor of two-way communication
Network modelling is Connected undigraph, and three networking, cluster head networking processes pass through to neighbor node residual energy in election of cluster head, cluster
The factors such as amount, existing connection state are analyzed, and carry out network data forwarding section in conjunction with node life cycle and other factors
The selection of point.In head-end site optimization process, moved by temperature coefficient of the particle swarm algorithm to each node device
State adjustment, realizes the optimization adjustment of sensor node data transfer amount in network, and has been finally reached promotion network life
The purpose in period.
Embodiment 3
The embodiment of the invention provides a kind of computer storage medium, computer storage medium includes: one or more journeys
Sequence instruction, one or more program instructions carry out group for executing a kind of pair of wireless sensor network introduced such as embodiment 1
The step of network method.
Although above having used general explanation and specific embodiment, the present invention is described in detail, at this
On the basis of invention, it can be made some modifications or improvements, this will be apparent to those skilled in the art.Therefore,
These modifications or improvements without departing from theon the basis of the spirit of the present invention are fallen within the scope of the claimed invention.
Claims (8)
1. a kind of pair of wireless sensor network carries out network-building method, which is characterized in that the described method includes:
It is Connected undigraph by sensor network modeling, includes central node and node in the Connected undigraph；
Node of the central node into communication range sends establishing route request；
Minimum hop count, each section of each node all in accordance with the request, between acquisition and central node in the node
The energy of point self residual, and obtain the parameter preset information between the node in the communication range centered on itself；
Node is according to the minimum hop count, and obtains the parameter preset between the node in the communication range centered on itself
Information determines the leader cluster node in the node and non-cluster head member node；
According to the relationship between leader cluster node and central node, alternatively, according to leader cluster node, non-cluster head member node and centromere
Functional relation between point is to select in leader cluster node from head-end site head-end site is chosen in the leader cluster node
The maximum point of coefficient；
According to the head-end site, a networking is carried out to the first particle in population, is obtained and first particle
Corresponding network lifecycle value, first particle are all the sensors section during a wheel wireless sensor networking
The matrix that the corresponding temperature coefficient of point is constituted；
Until calculating network optimization index, and determine after determination carries out networking to all particles in the population
This time corresponding temperature coefficient matrix of optimal networking particle；
And when the corresponding temperature coefficient matrix of this optimal networking particle is better than the temperature coefficient matrix of the optimal networking particle of history
When, it is updated this optimal networking particle as current optimal networking particle, otherwise by the optimal networking particle of the history
As current optimal networking particle；
Current optimal networking particle is counted as optimal number；
When the number is less than the first preset times threshold value, temperature coefficient matrix corresponding to the current optimal networking particle
It is moved, and re-starts networking, until the number is big greater than the first preset times threshold value, or the number of circulation networking
Terminate when the second preset times threshold value.
2. the method according to claim 1, wherein node is according to the minimum hop count, each node itself
Remaining energy, and the parameter preset information between the node in the communication range centered on itself is obtained, described in determination
Leader cluster node and non-cluster head member node in node, specifically include:
Node is according to the minimum hop count, and obtains the parameter preset between the node in the communication range centered on itself
Information calculates cluster head coefficient of competition corresponding with each node；
Each node is respectively compared itself corresponding cluster head coefficient of competition, with the section in the communication range centered on itself
The corresponding cluster head coefficient of competition of point；
According to the cluster head coefficient of competition, the leader cluster node in the node and non-cluster head member node are determined.
3. according to method as claimed in claim 2, which is characterized in that it obtains centered on first node, it is all in communication range
Parameter preset information between second node, comprising: the minimum hop count average value of all second node distance center nodes owns
Any non-cluster head member node passes through cluster in second node, the number of the second node and all nodes in communication range
Head node completes a data and transmits consumed energy, wherein the first node and the second node collectively form institute
State the node in preset range, the first node is any one node in the node in the preset range, described second
Node is the node in addition to the first node, and the number of the second node includes at least two；
The node is according to the energy of the minimum hop count, each node self residual, and obtains centered on itself
Parameter preset information between node in communication range calculates cluster head coefficient of competition corresponding with each node, tool
Body includes:
According to the minimum hop count average value of all second node distance center nodes and the first node distance center node
Minimum hop count, calculate the communication radius of the first node；
According to the number of the communication radius of the first node, all second nodes, the second node, the first segment is calculated
Discretization coefficient between point and all second nodes；
According to non-cluster head member section any in all nodes in the energy and communication range of the first node self residual
Point completes a data by leader cluster node and transmits consumed energy, calculates the life cycle predicted value of the first node；
According to the life cycle of discretization coefficient and the first node between the first node and all second nodes
Predicted value calculates the corresponding cluster head coefficient of competition of the first node.
4. according to method as claimed in claim 2, which is characterized in that determine that the maximum node of cluster head coefficient of competition is cluster head section
After point, the method also includes:
Determine the distance between two neighboring leader cluster node；
When the distance between described two neighboring leader cluster node is less than pre-determined distance threshold value, choose in two neighboring leader cluster node
Cluster head coefficient of competition is maximum to be used as final leader cluster node, another leader cluster node is converted to non-cluster head member node；
And the non-cluster head member node after conversion is constituted into set, redefine the leader cluster node in set.
5. method according to claim 1-4, which is characterized in that it is described according to leader cluster node and central node it
Between relationship, choose head-end site from the leader cluster node, specifically include:
Each leader cluster node obtains dump energy, linking number and the central node most jete of the leader cluster node adjacent with itself
Temperature coefficient several and corresponding with the leader cluster node, calculates selection coefficient corresponding with itself；
Determining that all leader cluster nodes are corresponding selects the maximum leader cluster node of coefficient as head-end site.
6. method according to claim 1-4, which is characterized in that described according to leader cluster node, non-cluster head member
Relationship between node and central node is chosen head-end site from the leader cluster node, is specifically included:
Each non-cluster head member node is respectively according to the communication energy consumption between leader cluster node in itself and communication range, itself institute
In the minimum hop count and itself remaining energy information in cluster between leader cluster node and central node, calculate corresponding with itself
Cluster-head node selection coefficient；
Determine the maximum leader cluster node of cluster-head node selection coefficient as head-end site.
7. the device that a kind of pair of wireless sensor network carries out networking, which is characterized in that described device includes: processor, storage
Device, and one or more programs；One or more of programs are stored in the memory and are run by the processor, hold
Row as the method according to claim 1 to 6.
8. a kind of computer storage medium, which is characterized in that the computer storage medium includes: that one or more programs refer to
It enables, one or more of program instructions are for executing as the method according to claim 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811308609.XA CN109152103B (en) | 2018-11-05 | 2018-11-05 | Method and device for networking wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811308609.XA CN109152103B (en) | 2018-11-05 | 2018-11-05 | Method and device for networking wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109152103A true CN109152103A (en) | 2019-01-04 |
| CN109152103B CN109152103B (en) | 2021-02-05 |
Family
ID=64807838
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811308609.XA Active CN109152103B (en) | 2018-11-05 | 2018-11-05 | Method and device for networking wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109152103B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266423A (en) * | 2019-06-21 | 2019-09-20 | 西安电子科技大学 | Based on the averagely synchronous the smallest method for synchronizing time of series of node in communication network |
| CN112051824A (en) * | 2020-09-22 | 2020-12-08 | 吴信强 | Operation and maintenance system based on industrial Internet of things |
| CN113160537A (en) * | 2021-04-19 | 2021-07-23 | 石家庄科林电气股份有限公司 | Micropower wireless network communication method based on biological fission algorithm |
| CN116528319A (en) * | 2023-06-29 | 2023-08-01 | 中国电信股份有限公司 | Multi-hop networking method, device, electronic equipment and computer readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140185503A1 (en) * | 2012-12-28 | 2014-07-03 | Unisys Corporation | Communication protocol for wireless sensor networks using communication and energy costs |
| CN104080144A (en) * | 2014-07-18 | 2014-10-01 | 重庆邮电大学 | Gradient based energy-efficient uneven clustering data forwarding method |
| CN104113891A (en) * | 2014-07-10 | 2014-10-22 | 厦门大学 | Energy-saving clustering algorithm for wireless sensor network |
| CN105764114A (en) * | 2016-04-19 | 2016-07-13 | 浙江理工大学 | Underwater wireless sensor network topology control method based on balanced energy consumption |
| CN107690168A (en) * | 2016-08-04 | 2018-02-13 | 王莹莹 | A kind of expansible networking method of wireless sensor network |
-
2018
- 2018-11-05 CN CN201811308609.XA patent/CN109152103B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140185503A1 (en) * | 2012-12-28 | 2014-07-03 | Unisys Corporation | Communication protocol for wireless sensor networks using communication and energy costs |
| CN104113891A (en) * | 2014-07-10 | 2014-10-22 | 厦门大学 | Energy-saving clustering algorithm for wireless sensor network |
| CN104080144A (en) * | 2014-07-18 | 2014-10-01 | 重庆邮电大学 | Gradient based energy-efficient uneven clustering data forwarding method |
| CN105764114A (en) * | 2016-04-19 | 2016-07-13 | 浙江理工大学 | Underwater wireless sensor network topology control method based on balanced energy consumption |
| CN107690168A (en) * | 2016-08-04 | 2018-02-13 | 王莹莹 | A kind of expansible networking method of wireless sensor network |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266423A (en) * | 2019-06-21 | 2019-09-20 | 西安电子科技大学 | Based on the averagely synchronous the smallest method for synchronizing time of series of node in communication network |
| CN110266423B (en) * | 2019-06-21 | 2020-09-08 | 西安电子科技大学 | Time synchronization method based on minimum node average synchronization stage number in communication network |
| CN112051824A (en) * | 2020-09-22 | 2020-12-08 | 吴信强 | Operation and maintenance system based on industrial Internet of things |
| CN113160537A (en) * | 2021-04-19 | 2021-07-23 | 石家庄科林电气股份有限公司 | Micropower wireless network communication method based on biological fission algorithm |
| CN116528319A (en) * | 2023-06-29 | 2023-08-01 | 中国电信股份有限公司 | Multi-hop networking method, device, electronic equipment and computer readable storage medium |
| CN116528319B (en) * | 2023-06-29 | 2023-09-29 | 中国电信股份有限公司 | Multi-hop networking method, device, electronic equipment and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109152103B (en) | 2021-02-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109152103A (en) | A kind of pair of wireless sensor network carries out network-building method and device | |
| Chen et al. | A reinforcement learning-based sleep scheduling algorithm for desired area coverage in solar-powered wireless sensor networks | |
| CN100583900C (en) | Radio sensor network data convergence path planning method based on the intelligent agent | |
| CN106936892A (en) | A kind of self-organizing cloud multi-to-multi computation migration method and system | |
| Arikumar et al. | EELTM: An energy efficient LifeTime maximization approach for WSN by PSO and fuzzy-based unequal clustering | |
| Esmaeili et al. | EMRP: Evolutionary-based multi-hop routing protocol for wireless body area networks | |
| CN103781143A (en) | Cluster tree hierarchical wireless sensor network routing method with optimized energy efficiency | |
| CN104168661A (en) | Transmission scheduling method for network lifetime maximization that satisfies fairness condition | |
| Lu et al. | A cluster-tree-based energy-efficient routing protocol for wireless sensor networks with a mobile sink | |
| CN110049526A (en) | Based on the method for data capture and system for improving cluster algorithm in WSN | |
| CN109982452A (en) | A kind of wireless chargeable sensor network charging schedule method based on matroid | |
| Tukisi et al. | Multi-hop PSO based routing protocol for Wireless Sensor Networks with Energy Harvesting | |
| Boukerche et al. | A novel two-mode QoS-aware mobile charger scheduling method for achieving sustainable wireless sensor networks | |
| Dande et al. | Coverage-aware recharging scheduling using mobile charger in wireless sensor networks | |
| Azar et al. | Energy-and delay-efficient algorithm for large-scale data collection in mobile-sink WSNs | |
| Lekhraj et al. | Multi criteria decision making based energy efficient clustered solution for wireless sensor networks | |
| Wu et al. | Comprehensive cost optimization for charger deployment in multi-hop wireless charging | |
| CN107969008A (en) | A kind of software definition Sensor Network concentrated route computational methods | |
| Rai et al. | FEEC: fuzzy based energy efficient clustering protocol for WSN | |
| Venkateswaran et al. | Optimizing IoT Data Aggregation: Hybrid Firefly-Artificial Bee Colony Algorithm for Enhanced Efficiency in Agriculture. | |
| CN105682179A (en) | Pig house monitoring method based on mobile coordination node and data temporary storage mechanism | |
| CN109660966A (en) | A kind of Research on Vehicle Remote Monitoring System Based on GPRS and method | |
| CN113507172A (en) | Wireless sensor network node charging method based on mobile charging vehicle | |
| Sankar et al. | Efficient Data Transmission Technique for Transmitting the Diagnosed Signals and Images in WBSN | |
| Wang et al. | Charging path optimization for wireless rechargeable sensor network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |