CN107786960A - Network cluster dividing method, device, electronic equipment and computer-readable storage medium - Google Patents
Network cluster dividing method, device, electronic equipment and computer-readable storage medium Download PDFInfo
- Publication number
- CN107786960A CN107786960A CN201711042010.1A CN201711042010A CN107786960A CN 107786960 A CN107786960 A CN 107786960A CN 201711042010 A CN201711042010 A CN 201711042010A CN 107786960 A CN107786960 A CN 107786960A
- Authority
- CN
- China
- Prior art keywords
- cluster
- node
- true
- sub
- leader cluster
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- 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/0209—Power saving arrangements in terminal devices
- H04W52/0225—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
-
- 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 embodiments of the invention provide a kind of network cluster dividing method, device, electronic equipment and computer-readable storage medium.Wherein, the network cluster dividing method is applied to wireless sensor network；Wireless sensor network includes multiple nodes；The network cluster dividing method includes：For each node, and by each node alternately leader cluster node, and determine a virtual cluster respectively with predetermined radii；The quantity of any alternatively virtual cluster of leader cluster node will be included, be defined as the sub-clustering score of any alternative leader cluster node；Based on the sub-clustering score of each alternative leader cluster node, determine whether each virtual cluster is true cluster；If it is determined that true cluster, then be defined as true leader cluster node by the alternative leader cluster node corresponding to identified true cluster；Repeat above-mentioned steps.The embodiment of the present invention is advantageous to the energy-conservation of node by taking above-mentioned technical proposal；Moreover, avoid prior art because be changed without leader cluster node and caused by leader cluster node energy consume excessively, so as to the balanced energy expenditure of WSN interior nodes.
Description
Technical field
The present invention relates to internet of things field, more particularly to a kind of network cluster dividing method, device, electronic equipment and meter
Calculation machine storage medium.
Background technology
WSN (Wireless Sensor Network, wireless sensor network) refers to by a large amount of microsensor nodes
The network that (abbreviation node) large scale deployment is formed, it is the multi-hop formed by communication specifically
Self-organizing intelligent network.Wherein, sensor node is generally randomly dispersed in search coverage, to measure in the surrounding environment of region
Heat, the Data Collection of perception got up, transmitted in a manner of multihop routing by sonar, signal, the sensor node such as infrared, radar
To Sink node (aggregation node)；Finally, then by aggregation node send to management node or user.
Wherein, sensor node is generally divided into leader cluster node and the class of non-leader cluster node two.The basic composition of sensor node
Including power supply.In actual applications, because the capacity of power supply is small, is not easy to change, and leader cluster node needs compared to non-leader cluster node
Handle more data manipulations.So the energy expenditure of leader cluster node is much larger than non-leader cluster node, so as to cause leader cluster node
Energy exhausted too quickly.
Therefore, in existing WSN, because the energy of leader cluster node can be exhausted too quickly, so, existing WSN is deposited
Unbalanced defect is consumed in node energy.
The content of the invention
The purpose of the embodiment of the present invention is to provide a kind of network cluster dividing method, device, electronic equipment and computer storage
Medium, to realize the equilibrium of WSN interior joint energy expenditures.
To achieve these goals, first aspect, there is provided following technical scheme：
A kind of network cluster dividing method, applied to wireless sensor network；The wireless sensor network includes multiple nodes；
Methods described includes：
For each node, and by each node alternately leader cluster node, and one is determined respectively with predetermined radii
Virtual cluster；
By the quantity of the virtual cluster comprising any alternative leader cluster node, it is defined as the sub-clustering of any alternative leader cluster node
Score；
Based on the sub-clustering score of each alternative leader cluster node, determine whether each virtual cluster is true cluster；
If it is determined that true cluster, then be defined as true cluster head section by the alternative leader cluster node corresponding to identified true cluster
Point；
Repeat above-mentioned steps.
Preferably, the sub-clustering score based on each alternative leader cluster node, determine each virtual cluster whether be true cluster step
Suddenly, including：
According to order from big to small, the sub-clustering score of each alternative leader cluster node is ranked up；
Virtual cluster corresponding to the maximum alternative leader cluster node of sub-clustering score is defined as true cluster；
The node outside alternative leader cluster node for removing the sub-clustering score maximum corresponding to the true cluster determined,
The step of repeating the sequence step and determining true cluster.
Preferably, the virtual cluster corresponding to the alternative leader cluster node that sub-clustering score is maximum is defined as the step of true cluster
Suddenly, including：
Judge whether the residual energy value of the maximum alternative leader cluster node of the sub-clustering score is more than predetermined residual energy value；
If so, the maximum alternative leader cluster node of the sub-clustering score is then defined as true leader cluster node；
Virtual cluster corresponding to the true leader cluster node is defined as the true cluster.
Preferably, if there is the maximum alternative leader cluster node of multiple sub-clustering scores, then at described in the judgement points
After the step of whether the residual energy value of the maximum alternative leader cluster node of cluster score is more than predetermined residual energy value, if described
It is the step of the maximum alternative leader cluster node of the sub-clustering score then is defined as into true leader cluster node, including：
If so, then calculate the cluster head probability factor of the maximum alternative leader cluster node of each sub-clustering score；Wherein, the cluster
Head probability factor is residual energy value and the business of its maximum energy value of the maximum alternative leader cluster node of the sub-clustering score；
The maximum alternative leader cluster node of sub-clustering score corresponding to the cluster head probability factor of maximum is defined as true cluster head
Node.
Preferably, if there is the node not included by the virtual cluster and the true cluster, then described based on each
The sub-clustering score of alternative leader cluster node, after determining the step of whether each virtual cluster is true cluster, methods described also includes：
The node not included by virtual cluster and the true cluster is defined as remaining node；
Based on the remaining node, it is determined that including the true cluster of the remaining node；Wherein, it is described to include the remaining section
The number of nodes that the true cluster of point is included is minimum.
To achieve these goals, second aspect, following technical scheme is additionally provided：
A kind of network cluster dividing device, applied to wireless sensor network；The wireless sensor network includes multiple nodes；
Described device includes：
First determining module, for for each node, and by each node alternately leader cluster node, and with pre-
Determine radius and determine a virtual cluster respectively；
Scoring module, for the quantity of any alternatively virtual cluster of leader cluster node will to be included, it is defined as described any alternative
The sub-clustering score of leader cluster node；
Judge module, for the sub-clustering score based on each alternative leader cluster node, determine whether each virtual cluster is true cluster；
Second determining module, in the case where determining true cluster, will be corresponding to identified true cluster it is alternative
Leader cluster node is defined as true leader cluster node；
Replicated blocks, for triggering first determining module, the scoring module, the judge module and described second
Determining module reruns.
Preferably, the judge module includes：
Sequencing unit, for according to order from big to small, arranging the sub-clustering score of each alternative leader cluster node
Sequence；
Determining unit, for the virtual cluster corresponding to the maximum alternative leader cluster node of sub-clustering score to be defined as into true cluster；
Repeat unit, for the alternative cluster head section for removing the sub-clustering score maximum corresponding to the true cluster determined
Node outside point, the step of repeating the sequence step and determine true cluster.
Preferably, the determining unit includes：
Judgment sub-unit, for judging whether the residual energy value of the maximum alternative leader cluster node of the sub-clustering score is more than
Predetermined residual energy value；
First determination subelement, for when the judgment sub-unit is judged as YES, by maximum standby of the sub-clustering score
Leader cluster node is selected to be defined as true leader cluster node；
Second determination subelement, for the virtual cluster corresponding to the true leader cluster node to be defined as into the true cluster.
To achieve these goals, the third aspect, following technical scheme is additionally provided：
A kind of electronic equipment, it includes processor, communication interface, memory and communication bus, wherein, the processor,
The communication interface and the memory complete mutual communication by the communication bus；
The memory, for depositing computer program；
The processor, during for performing the program deposited on memory, realize the method and step described in first aspect.
To achieve these goals, fourth aspect, following technical scheme is additionally provided：
A kind of computer-readable recording medium, the computer-readable recording medium internal memory contains computer program, described
The method and step described in first aspect is realized when computer program is executed by processor.
The embodiment of the present invention provides a kind of network cluster dividing method, device, electronic equipment and computer-readable storage medium.Wherein,
The network cluster dividing method is applied to wireless sensor network；Wireless sensor network includes multiple nodes；The network cluster dividing method
Including：For each node, and by each node alternately leader cluster node, and determine a virtual cluster respectively with predetermined radii；Will bag
The quantity of virtual cluster containing any alternative leader cluster node, it is defined as the sub-clustering score of any alternative leader cluster node；Based on each alternative
The sub-clustering score of leader cluster node, determine whether each virtual cluster is true cluster；If it is determined that true cluster, then will determined by true cluster
Corresponding alternative leader cluster node is defined as true leader cluster node；Repeat above-mentioned steps.
The embodiment of the present invention is by taking above-mentioned technical proposal, based on the sub-clustering score of each alternative leader cluster node, it is determined that respectively
Whether virtual cluster is true cluster, and the alternative leader cluster node corresponding to the true cluster then is defined as into true leader cluster node, is realized
Reasonable sub-clustering to WSN interior joints, reduces the overlapping region between cluster and cluster, improves the homogenization journey of the distribution of cluster
Degree, so that the leader cluster node into cluster where it sends identical number to the non-leader cluster node in overlapping region as few as possible
According to, reduce the redundancy of identical data in overlapping region, and then reduce because of energy loss caused by duplicate message, thus have
Beneficial to the energy-conservation of node；Moreover, also determining the steps such as true leader cluster node by repeating, realize and moved in a manner of round
Change leader cluster node to state, avoid prior art because be changed without leader cluster node and caused by leader cluster node energy consume excessively,
So as to the balanced energy expenditure of WSN interior nodes.
Other features and advantages of the present invention will be illustrated in the following description, also, partly becomes from specification
Obtain it is clear that or being emerged from by implementing the present invention.The purpose of the present invention and other advantages can by specification,
Specifically noted structure is realized and obtained in claims and accompanying drawing.
Certainly, any product or method for implementing the present invention it is not absolutely required to reach all the above excellent simultaneously
Point.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is the topological structure schematic diagram according to the wireless sensor network of the embodiment of the present invention；
Fig. 2 is the schematic flow sheet according to the network cluster dividing method of the embodiment of the present invention；
Fig. 3 is the schematic diagram according to the determination virtual cluster of the embodiment of the present invention；
Fig. 4 is the schematic flow sheet according to the network cluster dividing method of another embodiment of the present invention；
Fig. 5 a are the schematic diagram according to the remaining node of the embodiment of the present invention；
Fig. 5 b are the schematic diagram that true cluster is added for remaining node according to the embodiment of the present invention；
Fig. 6 is the F value comparative result schematic diagrams of technical scheme provided in an embodiment of the present invention and SP algorithmic technique schemes；
Fig. 7 is that technical scheme provided in an embodiment of the present invention is illustrated compared with the node energy consumption of SP algorithmic technique schemes
Figure；
Fig. 8 is that the comparison of technical scheme provided in an embodiment of the present invention and the mean cluster number of SP algorithmic technique schemes is illustrated
Figure；
Fig. 9 is the division frog subgroup schematic diagram according to the embodiment of the present invention；
Figure 10 is the mobile route schematic diagram according to the gathered data of the aggregation node of the embodiment of the present invention；
Figure 11 is the structural representation according to the network cluster dividing device of the embodiment of the present invention；
Figure 12 is the structural representation according to the judge module of the embodiment of the present invention；
Figure 13 is the structural representation according to the electronic equipment of the embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is only part of the embodiment of the present invention, rather than whole embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other under the premise of creative work is not made
Embodiment, belong to the scope of protection of the invention.
The network application environment of the embodiment of the present invention is described in detail with reference to Fig. 1.
As shown in figure 1, wireless sensor network includes sensor node, Sink node (aggregation node, for example, network is assisted
Adjust device), external network and task management node and user etc..Wherein, sensor node includes processor, memory, interface, electricity
Source etc..Sensor node meets discrete Distribution Principles, and density is big.Sensor node is respectively provided with perception, receives, forwards and melt
The function of data is closed, indifference between each sensor node, has the opportunity to turn into leader cluster node.Wherein, sensor node is quiet
Only motionless, Sink node has mobility and energy is sufficient.The primary power of sensor node is identical.Sensor node is to prison
Survey area's object interested within domains perceived, the processing such as data acquisition and data fusion.Specifically, it is non-after the completion of sub-clustering
Leader cluster node transfers data to leader cluster node by way of single-hop, and then, leader cluster node leads to treated effective information
The mode for crossing single-hop or multi-hop is transmitted to Sink node, finally, Sink node by external network by the effective information transmit to
Effective information further can also be transferred to user by task management node, the task management node.The energy of sensor node
Consumption is relevant with transmitting range and the information content of transmission.When the dump energy of sensor node is too low, for example, dump energy is small
Then the sensor node can not participate in the election contest of cluster head after the 1% of primary power.If passed in wireless sensor network
During the situation of sensor node depleted of energy, then it is considered as wireless sensor network life termination.
Wherein, each cluster includes leader cluster node and non-leader cluster node.Sink node has relative to sensor node deposits
The characteristics of capacity is big, arithmetic speed is high and communication capacity is strong is stored up, and for receiving task from task management node, and will
The data monitored in WSN are transmitted back to task management node by external network.Task management node is used to receiving and storing prison
Survey the sensed data in region.
In actual applications, because the capacity of sensor node power supply (for example, battery) is small, is not easy to change, and cluster head section
Point needs to handle more data manipulations compared to non-leader cluster node.So the energy expenditure of leader cluster node is much larger than non-cluster head
Node, so as to cause the energy of leader cluster node to be exhausted too quickly, it is unbalanced to thereby result in sensor node energy expenditure.In view of
This, the embodiment of the present invention provides a kind of network cluster dividing method.This method is applied to wireless sensor network；The wireless sensor network
Network includes multiple nodes；As shown in Fig. 2 network cluster dividing method comprises the following steps S200 to step S240.
S200：For each node, and by each node alternately leader cluster node, and determine that one is virtual respectively with predetermined radii
Cluster.
Wherein, node can be used for setting for data acquisition, data processing and data fusion etc. in wireless sensor network
It is standby, for example, embedded device, gateway etc..Each node preserves respective information.The information includes node serial number, identity shape
State, node coordinate etc..Node generally use battery powered.
Here, virtual cluster is a kind of interim cluster, and it is represented centered on node coordinate, communication distance is generated by radius
Border circular areas.
Citing describes the process for determining virtual cluster in detail below.
Present embodiment assumes that the node total number in wireless sensor network is n, predetermined radii (alternatively referred to as communication radius,
Communication distance) it is R.
As shown in figure 3, being origin with any one node 32, using R as radius, a border circular areas is formed, as virtual cluster
31.Each node can be as the leader cluster node of the virtual cluster corresponding to it.
S210：By the quantity of the virtual cluster comprising any alternative leader cluster node, it is defined as dividing for any alternative leader cluster node
Cluster score.
Wherein, the quantity of the virtual cluster comprising any alternative leader cluster node also is understood as some node and wrapped by virtual cluster
The number contained.
In this step, the quantity of the virtual cluster comprising any alternative leader cluster node that is any alternative leader cluster node quilt
The number that virtual cluster is included.The sub-clustering score that this step obtains can according to predetermined rule (for example, from big to small, from small
To big etc.) storage is in lists.
Example shown in Fig. 3 is continued to use, therefrom visible, some nodes are included by multiple virtual clusters.So in order to ensure wireless
The topological structure of sensor network includes all nodes, and the overlapping possibility between cluster and cluster is minimum, and this step is wrapped by determining
The quantity of virtual cluster containing any alternative leader cluster node ensures rational network cluster dividing.
S220：Based on the sub-clustering score of each alternative leader cluster node, determine whether each virtual cluster is true cluster.
In certain embodiments, as shown in figure 4, this step comprises the following steps S221 to step S223.
S221：According to order from big to small, the sub-clustering score of each alternative leader cluster node is ranked up.
This step can sort the sub-clustering score stored in lists according to sequential lines from big to small.
S222：Virtual cluster corresponding to the maximum alternative leader cluster node of sub-clustering score is defined as true cluster.
Use the example above, in actual applications, this step by virtual cluster while true cluster is changed into, by the virtual cluster institute
Comprising the information of other nodes (node in addition to the maximum alternative leader cluster node of sub-clustering score) be removed from the list.
In certain embodiments, this step S222 specifically comprises the following steps a1 to step a4.
Step a1：Judge whether the residual energy value of the maximum alternative leader cluster node of sub-clustering score is more than predetermined dump energy
Value；If so, then perform step a2；Otherwise, step a3 is performed.
Wherein, residual energy value can be obtained by following formula：
Wherein, EavePredetermined residual energy value is represented, it is chosen as average residual energy value in practice；Represent the
The dump energy of i node；I represents node serial number, takes positive integer；N represents the sum of wireless sensor network interior joint.
Step a2：The maximum alternative leader cluster node of sub-clustering score is defined as true leader cluster node.
Step a3：The alternative leader cluster node is defined as true leader cluster node by refusal.
In certain embodiments, if there is the maximum alternative leader cluster node of multiple sub-clustering scores, then this step is including walking
Rapid b1 and step b2.
Step b1：If the maximum alternative leader cluster node of multiple sub-clustering scores be present, the standby of each sub-clustering score maximum is calculated
Select the cluster head probability factor of leader cluster node；Wherein, cluster head probability factor is the residue of the maximum alternative leader cluster node of sub-clustering score
Energy value and the business of its maximum energy value.
This step has sub-clustering score that is identical and being all higher than predetermined residual energy value for multiple alternative leader cluster nodes
Situation, leader cluster node is chosen by cluster head probability factor.
Wherein, cluster head probability factor can be calculated by following formula：
Wherein,Represent that i-th of node is chosen as the probability (also referred to as cluster head probability factor) of cluster head；EmaxRepresent node
Maximum energy value.
Certainly, if node energy very little (for example, dump energy is less than the 1% of primary power), the energy of the node
It cannot be guaranteed that processing data.Therefore, the node can be excluded outside the election contest of leader cluster node.
Step b2：The maximum alternative leader cluster node of sub-clustering score corresponding to the cluster head probability factor of maximum is defined as very
Real leader cluster node.
By this step, embodiment improves the fairness of selection leader cluster node, does not cause extra substantial amounts of calculating,
And without increase time complexity, maximumlly balanced node energy.
Step a4：Virtual cluster corresponding to true leader cluster node is defined as true cluster.
Wherein, in actual applications, this step is it is determined that can also be by the section corresponding to the true cluster while true cluster
The information of point is removed from the list.
In order to ensure having connectedness between all nodes in wireless sensor network, in certain embodiments, if
In the presence of the node not included by virtual cluster and true cluster, then after step S222, network cluster dividing method also includes following step
Rapid c1 and step c2.
Step c1：The node not included by virtual cluster and true cluster is defined as remaining node.
As shown in Figure 5 a, the node not included by virtual cluster and true cluster is defined as remaining node 51.
Step c2：Based on remaining node, it is determined that the true cluster comprising remaining node；Wherein, comprising the true of remaining node
The number of nodes that cluster is included is minimum.
As shown in Figure 5 b, based on remaining node 51, it is determined that including the true cluster 52 of remaining node 51.Wherein, true cluster 52
Comprising node minimum number.
This step comprising remaining node and comprising the minimum cluster of number of nodes by will be defined as true cluster, so as to be residue
Node adds true cluster so that the network topology of wireless sensor network contains all nodes, it is ensured that wireless senser
Connectedness in network between all nodes, the effect of energy-conservation can also be realized.
S223：Outside alternative leader cluster node for removing the sub-clustering score maximum corresponding to the true cluster determined
Node, the step of repeating sequence step and determine true cluster.
Aforementioned exemplary is continued to use, if during first round minor sort, determining the maximum alternative leader cluster node of sub-clustering score；Then exist
During the second wheel minor sort, this step forecloses the node, and remaining node is ranked up, and according to the big of sub-clustering score
It is small that list is updated, the step of repeating sequence step and determine true cluster, then select the standby of sub-clustering score maximum
Leader cluster node is selected, and the virtual cluster corresponding to it is changed into true cluster, by that analogy, until list is sky.
S230：If it is determined that the alternative leader cluster node corresponding to identified true cluster, then be defined as truly by true cluster
Leader cluster node.
S240：Above-mentioned steps S200 is repeated to step S230.
Realized this step and leader cluster node is updated in a manner of round, it, which can also be considered as, is updated periodically cluster head
Node.In actual applications, it is T that can set initial timeS, and it is T to set the cycle per roundr.When time T reaches TS+k+
TrWhen, perform technical scheme provided in an embodiment of the present invention.
Thus, the embodiment of the present invention is not easy prematurely to exhaust the energy of leader cluster node, enables to wireless sensor network
Load it is more balanced, also cause wireless sensor network in each node energy expenditure it is more balanced, so as to extend nothing
The life cycle of line sensor network.
The embodiment of the present invention by the S200 that takes steps to step S240 technical scheme, based on each alternative leader cluster node
Sub-clustering score, determine whether each virtual cluster is true cluster, is then defined as the alternative leader cluster node corresponding to the true cluster very
Real leader cluster node, the reasonable sub-clustering to WSN interior joints is realized, reduces the overlapping region between cluster and cluster, improves cluster
The homogenization degree of distribution, so that non-leader cluster node in the overlapping region cluster head section into cluster where it as few as possible
Point sends identical data, reduces the redundancy of identical data in overlapping region, and then reduce because caused by duplicate message
Energy loss, thus be advantageous to the energy-conservation of node；Moreover, also determining the steps such as true leader cluster node by repeating, realize
Leader cluster node is dynamically changed in a manner of round, avoid prior art because be changed without leader cluster node and caused by leader cluster node
Energy consumes excessively, has delayed the death time of first node, the energy expenditure of all nodes is balanced, so as to balanced
The energy expenditure of WSN interior nodes, extend WSN life cycle.
Technical scheme provided in an embodiment of the present invention is described in detail in a manner of verifying embodiment below.
Present embodiment assumes that channel is ideal communication channel, so, the present embodiment does not consider noise and error transmissions.Here, exist
In 1000m × 1000m square simulating area, respectively to technical scheme provided in an embodiment of the present invention and SP (Set
Packing, set compression) algorithm arrangement carries out contrast under identical environment.
Table one schematically illustrates the parameter in the present embodiment.
Table one：
| Parameter | Numerical value (unit) |
| Area size | 1000m×1000m |
| Node number | 100-300 |
| Node communication radius | 10m |
| Unit data transfer energy consumption | 0.5uJ/bit |
| Node generation information rate per second | Rand (200,300) bit/s |
| Node primary power | 20J |
| Often take turns the cycle | 1h |
For the situation that calculate node balancing energy utilizes, the present embodiment is weighed by fairness index.The fairness index
Calculated by following formula：
Wherein, F represents fairness index；diRepresent the data message received by i-th of node；N represents wireless senser
The sum of nodes；I represents node serial number.
By the visible information content that is received when all nodes of above formula it is equal when, F value is 1.The use of this explanation node is most
It is fair.F value more levels off to 1, illustrates that the load of wireless sensor network more balances, node is more fair.And when node receives
Information content difference great disparity when, F value can level off to 0.It can so cause the extreme of network load uneven, so as to which portion can be caused
The phenomenon that partial node energy is depleted too early.It can be seen that it can interpolate that whether network topology structure of wireless sensor closes by F value
Reason.
Fig. 6 schematically illustrates technical scheme provided in an embodiment of the present invention compared with the F values of SP algorithmic technique schemes
Result schematic diagram.It is therefrom visible, because the embodiment of the present invention chooses leader cluster node by the way of round, so, the present invention is real
Apply example and make it that the load of wireless sensor network is more balanced than SP algorithmic technique schemes, there is more preferable fairness, can be favourable
The life cycle of ground prolonging wireless sensor network.
Fig. 7 schematically illustrates the node energy of technical scheme provided in an embodiment of the present invention and SP algorithmic technique schemes
Consume comparison schematic diagram.Therefrom visible, in SP algorithmic technique schemes, the energy expenditure of node is uneven；And the embodiment of the present invention
In the technical scheme of offer, the energy expenditure of node focuses mostly in 19J or so.As can be seen here, skill provided in an embodiment of the present invention
Art scheme has more preferable fairness, can make it that the load of wireless sensor network is more balanced, and can ensure own
Node is in network topology.
Fig. 8 schematically illustrates the mean cluster of technical scheme provided in an embodiment of the present invention and SP algorithmic technique schemes
Several comparison schematic diagrams.Wherein, in triangular representation SP algorithmic techniques scheme, corresponding in the case of different node numbers
Mean cluster number；Star represents mean cluster number corresponding in the case of different node numbers in the embodiment of the present invention；It is empty
Line represents the cluster number of maximum possible.It can be seen that the curve for representing the embodiment of the present invention, which is higher than, represents SP algorithmic technique sides
The curve of case, therefore, it is more balanced that the embodiment of the present invention with a small amount of increase of cluster number has exchanged energy of wireless sensor network for
Effect.
It is applied to be described in detail exemplified by route prediction aspect below by by the embodiment of the present invention.
The present embodiment provides a kind of route determining methods based on above-mentioned network cluster dividing method embodiment, the route determination side
Method is applied to the wireless sensor network；Wireless sensor network includes multiple aggregation nodes, and multiple aggregation nodes are used to hold
Operation of the row in addition to data collection operations；
The route determining methods include：
Step 1：For each node, and by each node alternately leader cluster node, and determine that one is empty respectively with predetermined radii
Intend cluster；
Step 2：By the quantity of the virtual cluster comprising any alternative leader cluster node, it is defined as dividing for any alternative leader cluster node
Cluster score；
Step 3：According to order from big to small, the sub-clustering score of each alternative leader cluster node is ranked up；
Step 4：If there is the alternative leader cluster node that multiple sub-clustering scores are maximum, then the alternative of sub-clustering score maximum is judged
Whether the residual energy value of leader cluster node is more than predetermined residual energy value；If it is not, perform step step 5；If so, then perform step
6；
Step 5：The alternative leader cluster node is chosen for leader cluster node by refusal；
Step 6：Calculate the cluster head probability factor of the maximum alternative leader cluster node of each sub-clustering score；Wherein, cluster head probability because
Residual energy value and the business of its maximum energy value of the son for the maximum alternative leader cluster node of sub-clustering score；
Step 7：The maximum alternative leader cluster node of sub-clustering score corresponding to the cluster head probability factor of maximum is defined as very
Real leader cluster node.
Step 8：Virtual cluster corresponding to true leader cluster node is defined as true cluster.
Step 9：, then will be not by virtual cluster and true cluster institute if there is the node not included by virtual cluster and true cluster
Comprising node be defined as remaining node；
Step 10：Based on remaining node, it is determined that the true cluster comprising remaining node；Wherein, comprising the true of remaining node
The number of nodes that cluster is included is minimum.
Step 11：Outside alternative leader cluster node for removing the sub-clustering score maximum corresponding to the true cluster determined
Node, repeat sequence step and determine true cluster the step of.
Step 12：If it is determined that the alternative leader cluster node corresponding to identified true cluster, then be defined as very by true cluster
Real leader cluster node；
Step 13：Above-mentioned steps are repeated, wireless sensor network is divided into more sub-regions；Wherein, all subregion
Include multiple true leader cluster nodes and an aggregation node respectively；Multiple true leader cluster nodes are served only for collecting its own place very
The data of other nodes in real cluster；
Step 14：Based on SFLA, it is multiple true in access all subregion to determine that multiple aggregation nodes travel through in a parallel fashion
The mobile route of leader cluster node；Wherein mobile route is TSP (Traveling Salesman Problem, traveling salesman problem) road
Footpath.
At step 14, SFLA (Shuffled Frog Leaping Algorithm, shuffled frog leaping algorithm) be by
A kind of rear heuristic Swarm Evolution algorithm that Eusuff et al. is proposed.It is in combination with MA (Mimetic Algorithm, gene
Algorithm) with PSO (Particle Swarm Optimization, particle swarm optimization) it is respective the advantages of, have calculating speed it is fast,
Parameter is simple, global search optimizing ability is strong, the features such as being easily achieved.SFLA can be used for solving multi-objective optimization question, for example,
The problems such as Breakdown Maintenance, resource allocation, flow arrangement, plant working.
Illustrate below multiple true in access all subregion to determining that multiple aggregation nodes travel through in a parallel fashion based on SFLA
The process of the mobile route of real leader cluster node is described in detail.
Assuming that：Z1Represent subregion；N represents leader cluster node quantity；Z1Including N number of leader cluster node；I represents that leader cluster node is compiled
Number；siRepresent i-th of leader cluster node；{s1,s2,...siRepresent Z1The set of interior leader cluster node；M represents subregion quantity；Convergence
The quantity of node is M；msiRepresent j-th of aggregation node；J represents the numbering of aggregation node, takes positive integer；{ms1,
ms2...msiRepresent aggregation node set；TjRepresent msiMobile route track.
In the present embodiment, the Path selection that M aggregation node accesses leader cluster node in subregion can be considered as TSP problems.
Because SFLA has the characteristics of fast convergence rate, time complexity is low, so, it is suitable to solve the problems, such as that requirement of real-time is high.
The method for the determination mobile route that the present embodiment provides comprises the following steps 1 to step 7.Wherein：
Step 1：Initialization；
Wherein, random F' frog individual of generation；The frog quantity in frog group, population quantity and each population is determined, and
And frog group quantity is equal to the product of population quantity and frog quantity in each population；Each frog individual represents one of problem
Solution；The fitness (namely fitness of feasible solution, abbreviation fitness) of each frog individual is calculated, while according to the fitness
Size, frog individual is sorted from big to small.Finally, using the maximum frog individual of fitness as globally optimal solution.
For example, in SFLA, each path that leapfrogs can be described as a feasible solution, then feasible solution can pass through following formula
Obtain：
Y={ y1, y2..., yk};（Formula 4）
| y |=k；(formula 6)
Wherein, y represents feasible solution (namely feasible solution of aggregation node mobile route)；K represents the number for the node that T is included
Amount；T represents the mobile route in subregion；ykRepresent the numbering of each node on the mobile route in subregion.
Feasible solution set and the set of set of feasible solution zygote can be obtained by following formula：
Y={ Y1, Y2..., Ym}；(formula 7)
Wherein, Y represents feasible solution set；YmRepresent the subclass of feasible solution set；M represents the quantity of subclass；N is represented
The quantity of feasible solution.
The present embodiment will meet feasible solution set of the set Y as T of formula 7 and formula 9, and formula 8 will be met to public affairs
Subclass Y of the set of formula 11 as feasible solution set Ym；It follows that Y and YmIt is the set of T feasible solution.
The fitness of frog individual can be obtained by following formula：
Wherein, f (q) represents the fitness of frog individual；LTRepresent the total length of the mobile route T in subregion；lK-1, k
Represent the Euclidean distance between upper two adjacent nodes of T.
From formula 12 and formula 13, fitness is T total length LTInverse.Therefore, T each feasible solution y
A corresponding fitness fy(q), fitness fy(q) it is bigger, LTIt is bigger, so as to which the feasible solution is better.
If meeting the y of formula 5 and formula 6 simultaneously in the presence of one, one using y as the mobile route in T subregions
Feasible solution.One group of feasible solution corresponding to mobile route in T subregions is numbered for a group node.
Because for a T, multiple combinations are certainly existed.So the embodiment of the present invention is suitable by determining optimal numbering
Sequence can be obtained by the mobile route that most short aggregation node accesses multiple true leader cluster nodes in all subregion.
Step 2：Divide frog subgroup；
In this step, by the frog individual of drained sequence according to predetermined division rule, several frog subgroups are divided into.
For example, as shown in figure 9, the element in the subclass of feasible solution set is entered according to fitness from big to small
Row sequence, and frog subgroup is divided, so as to obtain following relational expression：
Yk={ y (i), fi(q) | y (i)=y [k+m × (i-1)], fi(q)=fk+m×(i-1)(q)}；(formula 14)
Wherein, Y represents feasible solution set；YkRepresent from frog group；F represents frog group's quantity；M represents population quantity；N represents every
Frog quantity in individual population；Q represents frog quantity；F (q) represents the fitness of q-th of frog；I=1,2 ... ..., n；K=
1,2 ... ... m.
Step 3：Local updating is carried out to each frog subgroup according to predetermined more new strategy；
Wherein, for each frog subgroup, the frog individual that fitness is maximum and fitness is minimum is determined, meanwhile, by office
Portion's optimal solution frog individual maximum as fitness, using the frog individual that local worst solution is minimum as fitness.Wherein, it is right
Updated several times according to predetermined renewal rule in local worst solution, while the frog obtained after renewal individual is replaced into original
The worst solution of part come.
In certain embodiments, this step comprises the following steps 31 and step 32.Wherein：
Step 31：Fitness maximum, fitness minimum value and respective feasible solution are determined in every sub- frog group；
Step 32：The frog individual of fitness minimum value in sub- frog group is updated according to following strategy：
Wherein, PqRepresent the worst solution after renewal；PwRepresent local worst solution；S' represents the adjustment vector of frog individual；
SmaxMaximum allowable bounce step-length is represented, i.e.,：Mobile route feasible solution allows the maximum step-length changed；Rand represent (0,1] model
Enclose an interior random number.
As an example it is assumed that：Pw=[13542], Pb=[21534], Smax=3, rand=0.5；
Then, Pq(1)=1+min { int [0.5 × (2-1)], 3 }=1；
Pq(2)=3+max { int [0.5 × (1-3)], -3 }=2；
By that analogy, it is updated, is obtained according to formula 15：Pq=[12543].
Wherein, int represents the logarithm using e the bottom of as, wherein, e ≈ 2.71828.
The effect for optimizing local frog individual can be realized by this step.
Step 4：All frog individuals are mixed according to predetermined more new strategy, carry out global renewal；
In this step, all frog individuals are mixed, will each sub- frog group mixed.When every sub- frog group all
After completing a wheel renewal, according to the fitness of frog individual, according to descending order (namely by each sub- frog group
Frog is ranked up according to fitness, order from big to small again), by the frog individual and globally optimal solution that fitness is maximum
It is compared；If frog individual is better than the globally optimal solution, the globally optimal solution is replaced using frog individual.
Specifically, globally optimal solution can be obtained by following formula：
PX={ y1, y2... yk|fy(q)=fmax(q)}；(formula 16)
Wherein, PXRepresent globally optimal solution；fmax(q) maximum (namely corresponding T beeline) of fitness is represented.
In the subclass of feasible solution set, local worst solution is determined with locally optimal solution by its corresponding fitness, i.e.,：
Minimum fitness corresponds to worst solution, and highest fitness corresponds to optimal solution.So local worst solution and locally optimal solution can lead to
Following formula is crossed to obtain：
Wherein, PwRepresent local worst solution；PbRepresent locally optimal solution；YkRepresent the subclass of feasible solution set；K represents T
Comprising node quantity；Represent YkThe fitness of middle feasible solution；Feasible solution in expression
The maximum of fitness；The minimum value of the fitness of feasible solution in expression.
Step 5：Judge whether globally optimal solution is optimal solution；If so, then perform step 6；Otherwise, step 3 is performed；
Any one of this step in the following condition of convergence, it is optimal to judge whether the globally optimal solution after renewal exports
Solution：
(1) after the global renewal of nearest setting number, whether globally optimal solution is better than the optimal solution set；
(2) global update times or maximal function evaluation number reach setting number.
When this step meets any one condition in the above-mentioned condition of convergence, then by the globally optimal solution after current renewal
PXIt is considered as optimal solution, i.e., as optimal path sequence, that is, shortest path.
Step 6：Using globally optimal solution as optimal solution；
This step is by globally optimal solution PXMost short mobile route as the optimal solution of final output, i.e. aggregation node.
In the present embodiment, road is realized using the shuffled frog leaping algorithm that time complexity is low, parameter is few, global optimizing ability is strong
By selecting, finally leader cluster node on mobile route is concurrently traveled through in the aggregation node using movement, data acquisition, such as
In Figure 10 shown in line segment with the arrow.So repeat, until this round terminates, then start next one leader cluster node again
Selection.When there is the depleted situation of node energy, the end of life of wireless sensor network is determined.
In summary, compared with the mode for not having to regularly replace leader cluster node in existing SP algorithmic techniques scheme, the present invention
The route determining methods that embodiment provides can ensure the connectedness of all nodes in wireless sensor network as much as possible, realize
The scalability of node, thus the cluster generated is distributed；Moreover, by taking above-mentioned technical proposal, it is possible to achieve cluster
Distribution uniformity, so as to advantageously reduce the Duplication between cluster and cluster, avoid the repetition of identical information from sending, save section
The energy of point；In addition, also avoid leader cluster node by the reasonable selection to leader cluster node and prematurely run out of energy, and
Leader cluster node is chosen in a manner of round, realizes the effect of balanced node energy expenditure.
In order to realize the equilibrium of WSN interior joint energy expenditures, the embodiment of the present invention also provides a kind of network cluster dividing device, should
For wireless sensor network；Wireless sensor network includes multiple nodes；As shown in figure 11, the network cluster dividing device includes：
First determining module 111, for for each node, and by each node alternately leader cluster node, and with predetermined half
Footpath determines a virtual cluster respectively；
Scoring module 112, for the quantity of any alternatively virtual cluster of leader cluster node will to be included, it is defined as any alternative cluster
The sub-clustering score of head node；
Judge module 113, for the sub-clustering score based on each alternative leader cluster node, determine whether each virtual cluster is true
Cluster；
Second determining module 114, in the case where determining true cluster, will be corresponding to identified true cluster it is standby
Leader cluster node is selected to be defined as true leader cluster node；
Replicated blocks 115, determined for triggering the first determining module 111, scoring module 112, judge module 113 and second
Module 114 reruns.
The present embodiment is by taking above-mentioned technical proposal, sub-clustering score of the scoring module 112 based on each alternative leader cluster node,
Next, it is determined that whether each virtual cluster that module 113 determines to be determined by the first determining module 111 is true cluster, then, second is true
Alternative leader cluster node corresponding to the true cluster is defined as true leader cluster node by cover half block 114, and finally, replicated blocks 115 touch
Send out the first determining module 111, scoring module 112, the determining module 114 of judge module 113 and second to rerun, thus achieve
Reasonable sub-clustering to WSN interior joints, reduces the overlapping region between cluster and cluster, improves the homogenization degree of the distribution of cluster,
So that the leader cluster node into cluster where it sends identical data to the non-leader cluster node in overlapping region as few as possible,
Reduce the redundancy of identical data in overlapping region, and then reduce because of energy loss caused by duplicate message, thus favorably
In the energy-conservation of node；Moreover, also determining the steps such as true leader cluster node by repeating, the dynamic in a manner of round is realized
Leader cluster node is changed on ground, avoid prior art because be changed without leader cluster node and caused by leader cluster node energy consume excessively, prolong
The death time of first node is delayed, has balanced the energy expenditure of all nodes, so as to which the energy of balanced WSN interior nodes disappears
Consumption, extend WSN life cycle.
In certain embodiments, as shown in figure 12, above-mentioned judge module includes：
Sequencing unit 121, for according to order from big to small, arranging the sub-clustering score of each alternative leader cluster node
Sequence；
Determining unit 122, for the virtual cluster corresponding to the maximum alternative leader cluster node of sub-clustering score to be defined as truly
Cluster；
Repeat unit 123, for the alternative cluster for removing the sub-clustering score maximum corresponding to the true cluster determined
Node outside head node, the step of repeating sequence step and determine true cluster.
In certain embodiments, above-mentioned determining unit includes：
Judgment sub-unit, it is predetermined whether the residual energy value for judging the maximum alternative leader cluster node of sub-clustering score is more than
Residual energy value；
First determination subelement, for when judgment sub-unit is judged as YES, by the alternative cluster head section that sub-clustering score is maximum
Point is defined as true leader cluster node；
Second determination subelement, for the virtual cluster corresponding to true leader cluster node to be defined as into true cluster.
In addition, be based on additionally providing a kind of electronic equipment with embodiment of the method identical technical concept, the embodiment of the present invention,
As shown in figure 13, including processor 131, communication interface 132, memory 133 and communication bus 134, wherein, processor 131, lead to
Believe interface 132, memory 133 completes mutual communication by communication bus 134,
Memory 133, for depositing computer program；
Processor 131, during for performing the program deposited on memory 133, realize any of the above-described network cluster dividing method
Method and step described in embodiment.
The communication bus 134 that above-mentioned electronic equipment is mentioned can be Peripheral Component Interconnect standard (Peripheral
Component Interconnect, PCI) bus or EISA (Extended Industry Standard
Architecture, EISA) bus etc..The communication bus can be divided into address bus, data/address bus, controlling bus etc..For just
Only represented in expression, Figure 13 with a thick line, it is not intended that an only bus or a type of bus.
The communication that above-mentioned communication interface 132 is used between above-mentioned electronic equipment and other equipment.
Above-mentioned memory 133 can include random access memory (Random Access Memory, RAM), can also
Including nonvolatile memory (non-volatile memory, NVM), for example, at least a magnetic disk storage.Optionally, deposit
Reservoir can also be at least one storage device for being located remotely from aforementioned processor.
Above-mentioned processor 131 can be general processor, including central processing unit (Central Processing
Unit, abbreviation CPU), network processing unit (Ne twork Processor, NP) etc.；It can also be digital signal processor
(Digital Signal Processing, DSP), application specific integrated circuit (Applica tion Specific Integrated
Circuit, ASIC), field programmable gate array (Field-Programmable Gate Array, FPGA) or other can
Programmed logic device, discrete gate or transistor logic, discrete hardware components.
In the present embodiment, the program deposited on memory 133 is performed by processor 131, based on each alternative cluster head section
The sub-clustering score of point, determines whether each virtual cluster is true cluster, then determines the alternative leader cluster node corresponding to the true cluster
For true leader cluster node, the reasonable sub-clustering to WSN interior joints is realized, reduces the overlapping region between cluster and cluster, improves
The homogenization degree of the distribution of cluster, so that non-leader cluster node in the overlapping region cluster into cluster where it as few as possible
Head node sends identical data, reduces the redundancy of identical data in overlapping region, and then reduce because of duplicate message institute band
The energy loss come, thus be advantageous to the energy-conservation of node；Moreover, the steps such as true leader cluster node also are determined by repeating,
Realize and leader cluster node dynamically changed in a manner of round, avoid prior art because be changed without leader cluster node and caused by cluster head
Node energy consumes excessively, has delayed the death time of first node, the energy expenditure of all nodes is balanced, so as to balanced
The energy expenditures of WSN interior nodes, extend WSN life cycle.
Furthermore based on embodiment of the method identical technical concept, the embodiment of the present invention additionally provides a kind of computer can
Read storage medium.The computer-readable recording medium internal memory contains computer program, real when computer program is executed by processor
Method and step described in existing above method embodiment.
It will be understood by those skilled in the art that above computer program can include some instructions, so as to obtain computing device
(for example, personal computer, server etc.) performs the method and step described in any of the above-described embodiment of the method.
Above computer readable storage medium storing program for executing can include but is not limited to random access memory (RAM), dynamic random is deposited
Access to memory (DRAM), static RAM (SRAM), read-only storage (ROM), programmable read only memory
(PROM), Erarable Programmable Read only Memory (EPROM), EEPROM (EEPROM), flash memory (example
Such as, NOR-type flash memory or NAND-type flash memory), Content Addressable Memory (CAM), polymer memory is (for example, ferroelectric polymers
Memory), phase transition storage, ovonic memory, silicon-oxide-nitride silicon-silica-silicon (Silicon-
Oxide-Nitride-Oxide-Silicon, SONOS) memory, magnetic card or light-card, also or other any suitable types
Computer-readable recording medium.
In the present embodiment, when computer program is executed by processor, based on the sub-clustering score of each alternative leader cluster node, it is determined that
Whether each virtual cluster is true cluster, and the alternative leader cluster node corresponding to the true cluster then is defined as into true leader cluster node, real
Show the reasonable sub-clustering to WSN interior joints, reduced the overlapping region between cluster and cluster, improve the homogenization journey of the distribution of cluster
Degree, so that the leader cluster node into cluster where it sends identical number to the non-leader cluster node in overlapping region as few as possible
According to, reduce the redundancy of identical data in overlapping region, and then reduce because of energy loss caused by duplicate message, thus have
Beneficial to the energy-conservation of node；Moreover, also determining the steps such as true leader cluster node by repeating, realize and moved in a manner of round
Change leader cluster node to state, avoid prior art because be changed without leader cluster node and caused by leader cluster node energy consume excessively,
The death time of first node is delayed, has balanced the energy expenditure of all nodes, so as to which the energy of balanced WSN interior nodes disappears
Consumption, extend WSN life cycle.
It should be noted that herein, such as first and second or the like relational terms are used merely to a reality
Body or operation make a distinction with another entity or operation, and not necessarily require or imply and deposited between these entities or operation
In any this actual relation or order.Moreover, term " comprising ", "comprising" or its any other variant are intended to
Nonexcludability includes, so that process, method, article or equipment including a series of elements not only will including those
Element, but also the other element including being not expressly set out, or it is this process, method, article or equipment also to include
Intrinsic key element.In the absence of more restrictions, the key element limited by sentence "including a ...", it is not excluded that
Other identical element also be present in process, method, article or equipment including the key element.
Each embodiment in this specification is described by the way of related, what each embodiment stressed be with
The difference of other embodiment, between each embodiment identical similar part mutually referring to.It is real especially for device
For applying example, because it is substantially similar to embodiment of the method, so description is fairly simple, related part is referring to embodiment of the method
Part explanation.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the scope of the present invention.It is all
Any modification, equivalent substitution and improvements made within the spirit and principles in the present invention etc., are all contained in protection scope of the present invention
It is interior.
Claims (10)
- A kind of 1. network cluster dividing method, applied to wireless sensor network；The wireless sensor network includes multiple nodes；Its It is characterised by, methods described includes：For each node, and by each node alternately leader cluster node, and determine that one is virtual respectively with predetermined radii Cluster；By the quantity of the virtual cluster comprising any alternative leader cluster node, the sub-clustering for being defined as any alternative leader cluster node obtains Point；Based on the sub-clustering score of each alternative leader cluster node, determine whether each virtual cluster is true cluster；If it is determined that true cluster, then be defined as true leader cluster node by the alternative leader cluster node corresponding to identified true cluster；Repeat above-mentioned steps.
- 2. according to the method for claim 1, it is characterised in that the sub-clustering score based on each alternative leader cluster node, really The step of whether fixed each virtual cluster is true cluster, including：According to order from big to small, the sub-clustering score of each alternative leader cluster node is ranked up；Virtual cluster corresponding to the maximum alternative leader cluster node of sub-clustering score is defined as true cluster；The node outside alternative leader cluster node for removing the sub-clustering score maximum corresponding to the true cluster determined, is repeated The step of performing the sequence step and determining true cluster.
- 3. according to the method for claim 2, it is characterised in that the alternative leader cluster node institute that sub-clustering score is maximum is right The step of virtual cluster answered is defined as true cluster, including：Judge whether the residual energy value of the maximum alternative leader cluster node of the sub-clustering score is more than predetermined residual energy value；If so, the maximum alternative leader cluster node of the sub-clustering score is then defined as true leader cluster node；Virtual cluster corresponding to the true leader cluster node is defined as the true cluster.
- 4. according to the method for claim 3, it is characterised in that if there is the alternative cluster that multiple sub-clustering scores are maximum Head node, then whether it is more than predetermined residue in the residual energy value of the alternative leader cluster node for judging that the sub-clustering score is maximum It is described if so, the maximum alternative leader cluster node of the sub-clustering score then is defined as into true cluster head section after the step of energy value The step of point, including：If so, then calculate the cluster head probability factor of the maximum alternative leader cluster node of each sub-clustering score；Wherein, the cluster head is general The rate factor is residual energy value and the business of its maximum energy value of the maximum alternative leader cluster node of the sub-clustering score；The maximum alternative leader cluster node of sub-clustering score corresponding to the cluster head probability factor of maximum is defined as true leader cluster node.
- 5. according to any described method in claim 1-4, it is characterised in that if there is not by the virtual cluster and described The node that true cluster is included, then in the sub-clustering score based on each alternative leader cluster node, determine whether each virtual cluster is true After the step of real cluster, methods described also includes：The node not included by virtual cluster and the true cluster is defined as remaining node；Based on the remaining node, it is determined that including the true cluster of the remaining node；Wherein, it is described comprising the remaining node The number of nodes that true cluster is included is minimum.
- A kind of 6. network cluster dividing device, applied to wireless sensor network；The wireless sensor network includes multiple nodes；Its It is characterised by, described device includes：First determining module, for for each node, and by each node alternately leader cluster node, and with predetermined half Footpath determines a virtual cluster respectively；Scoring module, for the quantity of any alternatively virtual cluster of leader cluster node will to be included, it is defined as any alternative cluster head The sub-clustering score of node；Judge module, for the sub-clustering score based on each alternative leader cluster node, determine whether each virtual cluster is true cluster；Second determining module, in the case where determining true cluster, by the alternative cluster head corresponding to identified true cluster Node is defined as true leader cluster node；Replicated blocks, determined for triggering first determining module, the scoring module, the judge module and described second Module reruns.
- 7. device according to claim 6, it is characterised in that the judge module includes：Sequencing unit, for according to order from big to small, being ranked up to the sub-clustering score of each alternative leader cluster node；Determining unit, for the virtual cluster corresponding to the maximum alternative leader cluster node of sub-clustering score to be defined as into true cluster；Repeat unit, for for remove the maximum alternative leader cluster node of sub-clustering score corresponding to the true cluster determined it Outer node, the step of repeating the sequence step and determine true cluster.
- 8. device according to claim 7, it is characterised in that the determining unit includes：Judgment sub-unit, it is predetermined whether the residual energy value for judging the maximum alternative leader cluster node of the sub-clustering score is more than Residual energy value；First determination subelement, for when the judgment sub-unit is judged as YES, by the alternative cluster that the sub-clustering score is maximum Head node is defined as true leader cluster node；Second determination subelement, for the virtual cluster corresponding to the true leader cluster node to be defined as into the true cluster.
- 9. a kind of electronic equipment, it is characterised in that including processor, communication interface, memory and communication bus, wherein, it is described Processor, the communication interface and the memory complete mutual communication by the communication bus；The memory, for depositing computer program；The processor, during for performing the program deposited on memory, realize any described method steps of claim 1-5 Suddenly.
- 10. a kind of computer-readable recording medium, it is characterised in that the computer-readable recording medium internal memory contains computer Program, the computer program realize claim 1-5 any described method and steps when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711042010.1A CN107786960A (en) | 2017-10-30 | 2017-10-30 | Network cluster dividing method, device, electronic equipment and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711042010.1A CN107786960A (en) | 2017-10-30 | 2017-10-30 | Network cluster dividing method, device, electronic equipment and computer-readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107786960A true CN107786960A (en) | 2018-03-09 |
Family
ID=61431931
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711042010.1A Pending CN107786960A (en) | 2017-10-30 | 2017-10-30 | Network cluster dividing method, device, electronic equipment and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107786960A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109195130A (en) * | 2018-09-04 | 2019-01-11 | 广州市花林景观工程有限公司 | The farm environment of high-precision low cost monitors system |
| CN109362048A (en) * | 2018-08-15 | 2019-02-19 | 杭州电子科技大学 | Underground pipe gallery detection method based on wireless sensor network |
| CN111356201A (en) * | 2018-12-20 | 2020-06-30 | 电信科学技术研究院有限公司 | Method and device for grouping great coverage and network node |
| CN113015118A (en) * | 2019-12-20 | 2021-06-22 | 中国科学院沈阳计算技术研究所有限公司 | Low-power-consumption communication device and system for industrial Internet of things |
-
2017
- 2017-10-30 CN CN201711042010.1A patent/CN107786960A/en active Pending
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109362048A (en) * | 2018-08-15 | 2019-02-19 | 杭州电子科技大学 | Underground pipe gallery detection method based on wireless sensor network |
| CN109362048B (en) * | 2018-08-15 | 2021-05-25 | 杭州电子科技大学 | Underground pipe gallery detection method based on wireless sensor network |
| CN109195130A (en) * | 2018-09-04 | 2019-01-11 | 广州市花林景观工程有限公司 | The farm environment of high-precision low cost monitors system |
| CN111356201A (en) * | 2018-12-20 | 2020-06-30 | 电信科学技术研究院有限公司 | Method and device for grouping great coverage and network node |
| CN111356201B (en) * | 2018-12-20 | 2022-04-15 | 大唐移动通信设备有限公司 | Method and device for grouping great coverage and network node |
| CN113015118A (en) * | 2019-12-20 | 2021-06-22 | 中国科学院沈阳计算技术研究所有限公司 | Low-power-consumption communication device and system for industrial Internet of things |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107786960A (en) | Network cluster dividing method, device, electronic equipment and computer-readable storage medium | |
| Gong et al. | Task assignment in mobile crowdsensing: Present and future directions | |
| Gai et al. | Reinforcement learning-based content-centric services in mobile sensing | |
| Luo et al. | Minimizing the delay and cost of computation offloading for vehicular edge computing | |
| Lin et al. | A hybrid multi-verse optimization for the fuzzy flexible job-shop scheduling problem | |
| CN104394236B (en) | Node combines the distributed collaborative caching method perceived with message status | |
| CN107071852B (en) | Can society's perception of community network and the method for routing of probabilistic forecasting towards moving machine | |
| Yu et al. | Optimizing bus transit network with parallel ant colony algorithm | |
| CN106102079A (en) | Based on the C RAN carrier wave emigration resource requirement Forecasting Methodology improving PSO | |
| CN109636213A (en) | Order splitting, evaluation method and device, electronic equipment and storage medium | |
| CN107708089A (en) | Data forwarding method and data forwarding device based on sub-clustering | |
| CN110118566A (en) | Robot operating path generation method and device | |
| Hirsch et al. | A resource-efficient adaptive caching scheme for mobile ad hoc networks | |
| Pankaj et al. | Self-adaptive cuckoo search algorithm for optimal design of water distribution systems | |
| Zhang et al. | Multi-population ant colony optimization algorithm based on congestion factor and co-evolution mechanism | |
| Punriboon et al. | Fuzzy logic-based path planning for data gathering mobile sinks in WSNs | |
| Chen et al. | An improved honey badger algorithm for electric vehicle charge orderly planning | |
| Taseen et al. | An Innovative Method for Energy Intensive Routing and Transmission Network Positioning in Integrated Wireless Detector Networks | |
| Singh et al. | Designing an energy efficient network using integration of KSOM, ANN and data fusion techniques | |
| CN107135155B (en) | A kind of opportunistic network routing method based on node social relationships | |
| Vu et al. | Combining trust and self-organization for robust maintaining of information coherence in disturbed mas | |
| CN116321189A (en) | Server deployment method based on deep reinforcement learning in edge-oriented computing | |
| Nguyen et al. | Multi-agent task assignment in vehicular edge computing: A regret-matching learning-based approach | |
| Meng et al. | Optimization and application of artificial intelligence routing algorithm | |
| Bastani et al. | A social node model for realising information dissemination strategies in delay tolerant networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20191127 Address after: 100842 Hospital No. 22, Fuxing Road, Haidian District, Beijing Applicant after: Information Center of the Logistics Support Department of the Central Military Commission Address before: 100036 No. 22 Fuxing Road, Beijing, Haidian District Applicant before: Wu Hao Applicant before: Lv Xuefeng |
|
| TA01 | Transfer of patent application right | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180309 |
|
| WD01 | Invention patent application deemed withdrawn after publication |