CN104301965B - A kind of wireless sensor network Uneven Cluster node scheduling method - Google Patents
A kind of wireless sensor network Uneven Cluster node scheduling method Download PDFInfo
- Publication number
- CN104301965B CN104301965B CN201410549072.1A CN201410549072A CN104301965B CN 104301965 B CN104301965 B CN 104301965B CN 201410549072 A CN201410549072 A CN 201410549072A CN 104301965 B CN104301965 B CN 104301965B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- cluster head
- redundant
- energy
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- 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/0209—Power saving arrangements in terminal devices
-
- 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/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
- H04W52/0219—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave where the power saving management affects multiple terminals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- 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)
- Small-Scale Networks (AREA)
Abstract
The invention discloses a kind of wireless sensor network Uneven Cluster node scheduling methods, are specifically implemented according to the following steps：Step 1, the election of Uneven Cluster cluster head and completion Uneven Cluster；Step 2, after step 1 completes sub-clustering heterogeneous, redundant node is searched in cluster, and closing redundant node makes redundant node enter dormant state；Step 3, complete step 2 redundant node scheduling suspend mode after, active node enters steady-working state；After active node work is completed in step 3, cluster interior nodes role is adjusted with state for step 4；Step 5, after the node role of step 4 and state have adjusted, cycle is performed into step 3, step 4, until all node energies run out of.Uneven Cluster is combined so that the energy expenditure of each node is more balanced, effectively extends Network morals by a kind of wireless sensor network Uneven Cluster node scheduling method of the present invention with redundant node scheduling.
Description
Technical field
The invention belongs to wireless sensor network technology fields, are related to a kind of wireless sensor network Uneven Cluster node
Dispatching method.
Background technology
The energy of wireless sensor network (Wireless Sensor Network, WSN) node, resource, communication capacity ten
Point limited, how using node energy designing efficient Node Scheduling Algorithms in Line and improving network life becomes current wireless sensor network
The critical issue of network research.
Early in 2000, Heinzelman W proposed first low power consumption adaptive clustering routing for WSN designs
The load of network is assigned on each node by agreement LEACH, the algorithm, so as to reduce individual node energy expenditure, improves net
Network life span, but LEACH agreements do not account for cluster head and are unevenly distributed and the problems such as residue energy of node.The improvement of LEACH
There are many agreement, for example, the cluster head using centralization generates algorithm, cluster head is selected according to global information, effectively controls the number of cluster head
Amount and position, while consider dump energy.Although LAECH agreements and its innovatory algorithm effectively extend network lifecycle, deposit
The unbalanced problem of energy expenditure between cluster, the cluster head remote from aggregation node still have larger energy consumption.
For the problems such as energy expenditure is unbalanced between cluster, domestic and international researcher balances cluster using Uneven Cluster strategy
First energy expenditure.EECS methods will not only consider itself for balanced cluster head energy expenditure, ordinary node when selecting cluster head
With a distance from cluster head, and cluster head is considered to the distance of aggregation node, so as to construct size cluster heterogeneous.But EECS's
Energy balance measure can only alleviate the energy expenditure unbalanced phenomena between cluster head, can not realize that the energy between node is put down on the whole
Weighing apparatus.And EEUC utilizes competition radius heterogeneous in a manner that multihop routing between Uneven Cluster and cluster organically combines so that
Number of members close to the cluster of base station is relatively small, so as to which cluster head can save energy for data forwarding use between cluster, reaches
The purpose of balanced cluster head energy expenditure, but EEUC is only suitable for equally distributed network.On the basis of original method, EEUC is inherited
Uneven Cluster structure, found in cluster head forwarding using the cluster-leader selected mechanism that is driven based on the time and using greedy algorithm
After node.In more than Uneven Cluster algorithm, all nodes of each round in running order will carry out data acquisition and transmission,
In the intensive wireless sensor network of Node distribution, bulk information redundancy, wireless signal interference, energy dissipation can be caused in this way
The problems such as.
Invention content
The object of the present invention is to provide a kind of wireless sensor network Uneven Cluster node scheduling methods, solve existing
The problem of wireless sensor network interior joint energy consumption present in technology is unbalanced, and Network morals are short.
The technical solution adopted in the present invention is a kind of wireless sensor network Uneven Cluster node scheduling method, tool
Body is implemented according to following steps：
Step 1, the election of Uneven Cluster cluster head and completion Uneven Cluster；
Step 2, after step 1 completes sub-clustering heterogeneous, redundant node is searched in cluster, and close redundant node make it is superfluous
Remaining node enters dormant state；
Step 3, complete step 2 redundant node scheduling suspend mode after, active node enters steady-working state；
After active node work is completed in step 3, cluster interior nodes role is adjusted with state for step 4；
Step 5, after the node role of step 4 and state have adjusted, cycle is performed into step 3, step 4, until institute
There is node energy to run out of.
The features of the present invention also characterized in that
It the specific way to elect of step 1 cluster head and completes Uneven Cluster and is：The cluster head consumption near apart from aggregation node
Energy is less, and the energy that the cluster head far from aggregation node consumes is more, therefore smaller further away from the cluster that aggregation node is formed, with
Larger communication consumption between balance cluster；All nodes of the first run participate in the election contest of cluster head, balance the energy consumption of all nodes；In order to make to get over
The cluster formed far from aggregation node is smaller, and a competition radius R is set to each election contest cluster head nodecompete, RcompeteIt is node
Apart from convergent point distance and the function of region node density；Each election contest cluster head node competition radius Ni.RcompeteFormula
For：
Wherein, wherein dmaxAnd dminThe node in network is represented respectively to the maximum distance and minimum range of convergent point；C is
For controlling the parameter of value range, the value between 0~1；ρ is the density factor of node region；d(Ni, BS) and it is to pass
Sensor node is to the distance of aggregation node；NiIt is any node in network；I is the mark of any sensor node in network area
Number；RsetIt is to preset maximum contention radius；Nnei(i) it is neighbor node number；NallIt is surviving node number in whole network.
During cluster head election contest, if candidate cluster head NiAnnounce its carry an election, then in NiCompetition radius Ni.Rcompete
Interior all candidate cluster heads can't be final cluster head, need to exit election contest process, as ordinary node, while these are saved
Point adds in final cluster head Ni, one is formed with NiFor cluster head, NiCompetition radius in other candidate cluster heads be rank and file in cluster
A cluster.
The specific implementation process of step 2 is：Cluster interior nodes are sorted, and the ID of node is deposited successively from small to large by energy
In the set of entitled clusterNodes, there are an index to mark for each element in set, is judging redundant node for storage
When, cluster head distributes sequential by the size of index+1 to cluster interior nodes, and node judges since the node of energy minimum every time
Whether it is redundant node, if redundant node, then this node immediately enters sleep state, and sends a sleep messages and feel to it
Know node, the monitoring cavitation for avoiding two adjacent nodes suspend mode simultaneously and occurring, while start a sleep timing
Device TsleepEnsure to be in active state when next round starts.
The specific implementation process of step 3 is：Information in cluster interior nodes acquisition monitoring region, when oneself transmitting data
CSMA MAC protocols are used in sequence to its cluster head transmission data；Cluster head node receives the information of each node in cluster, by it
Convergent point is sent to after fusion in a manner of single-hop.
The specific implementation process of step 4 is：Redundant node sleep timer T firstsleepReach, redundant node from sleep shape
State switchs to working condition；Secondly all nodes in cluster send the message with oneself ID and dump energy to last round of cluster head,
Cluster head is ranked up according to the dump energy of node, and update clusterNodes set, the node for selecting energy maximum serves as this
Cluster head is taken turns, the ID of new cluster head is announced to other nodes and the message of carrying clusterNodes information is sent to new cluster head；Then
By the method decision node for judging redundant node whether it is redundant node in each cluster；If some node is determined as redundancy
The node is then switched to sleep state by node immediately, if some node determines it is not redundant node, continues to judge another
Node, until all node checks finish.
The judgment method for judging redundant node is：It is non-with the presence or absence of 4 or 4 or more in nodal test monitoring radius R
Cluster head node, these nodes are known as NiSensing node, if there is at least four sensing node adjacent node counterclockwise
Between angle meet 60 °~120 ° simultaneously, then the node redundancy, at this time its active state switch to dormant state.
The beneficial effects of the invention are as follows：A kind of wireless sensor network Uneven Cluster node scheduling method of the present invention will be non-
Uniform sub-clustering is combined with redundant node scheduling so that the energy expenditure of each node is more balanced, while avoids a large amount of
Redundant node works at the same time the problem of causing the wasting of resources, effectively extends Network morals in this way.
Description of the drawings
Fig. 1 is to campaign for opening up for cluster head node in a kind of wireless sensor network Uneven Cluster node scheduling method of the present invention
Flutter schematic diagram；
Fig. 2 be in a kind of wireless sensor network Uneven Cluster node scheduling method of the present invention candidate cluster head N and other
The election contest schematic diagram of candidate cluster head；
Fig. 3 is the distribution of sensing node in a kind of wireless sensor network Uneven Cluster node scheduling method of the present invention
Figure；
Fig. 4 is a kind of wireless sensor network Uneven Cluster node scheduling method of the present invention and two kinds of existing classics sides
The comparison figure of the network gross energy of method；
Fig. 5 is a kind of wireless sensor network Uneven Cluster node scheduling method of the present invention and two kinds of existing classics sides
The comparison figure of the network survival time of method.
Specific embodiment
The present invention is described in detail with reference to the accompanying drawings and detailed description.
A kind of wireless sensor network Uneven Cluster node scheduling method of the present invention, is specifically implemented according to the following steps：
Step 1, the election of Uneven Cluster cluster head and completion Uneven Cluster, way to elect are：Apart from aggregation node
The energy of near cluster head consumption is less, and the energy that the cluster head far from aggregation node consumes is more, therefore further away from aggregation node shape
Into cluster it is smaller, consumed with balancing larger communication between cluster；All nodes of the first run participate in the election contest of cluster head, balance all nodes
Energy consumption；In order to make the cluster formed further away from aggregation node smaller, one competition radius is set to each election contest cluster head node
Rcompete, RcompeteIt is nodal distance convergent point distance and the function of region node density；Each election contest cluster head node competition
Radius Ni.RcompeteFormula be：
Wherein, wherein dmaxAnd dminThe node in network is represented respectively to the maximum distance and minimum range of convergent point；C is
For controlling the parameter of value range, the value between 0~1；ρ is the density factor of node region；d(Ni, BS) and it is to pass
Sensor node is to the distance of aggregation node；NiIt is any node in network；I is the mark of any sensor node in network area
Number；RsetIt is to preset maximum contention radius；Nnei(i) it is neighbor node number；NallIt is surviving node number in whole network；
During cluster head election contest, if candidate cluster head NiAnnounce its carry an election, then in NiCompetition radius Ni.Rcompete
Interior all candidate cluster heads can't be final cluster head, need to exit election contest process as ordinary node, while these are saved
Point adds in final cluster head Ni, one is formed with NiFor cluster head, NiCompetition radius in other candidate cluster heads be rank and file in cluster
A cluster；
Step 2, after step 1 completes sub-clustering heterogeneous, redundant node is searched in cluster, and close redundant node make it is superfluous
Remaining node enters dormant state, specially：Cluster interior nodes are sorted, and the ID of node is sequentially stored in from small to large by energy
In the set of entitled clusterNodes, there are an index to mark for each element in set, when judging redundant node,
Cluster head distributes sequential by the size of index+1 to cluster interior nodes, and judgement is node since the node of energy minimum every time
No is redundant node, and judgment method is：It whether there is the non-cluster head node of 4 or 4 or more in nodal test monitoring radius R,
These nodes are known as the sensing node of Ni, if there is the angle between at least four sensing node counterclockwise adjacent node
Meet 60 °~120 ° simultaneously, then the node redundancy, its active state switchs to dormant state at this time, and sends a suspend mode and disappear
It ceases and gives its sensing node, the monitoring cavitation for avoiding two adjacent nodes suspend mode simultaneously and occurring, while start one
Sleep timer TsleepEnsure to be in active state when next round starts；
Step 3, complete step 2 redundant node scheduling suspend mode after, active node enters steady-working state, cluster internal segment
Information in point acquisition monitoring region, number is sent in the sequential of oneself transmission data using CSMA MAC protocols to its cluster head
According to；Cluster head node receives the information of each node in cluster, is sent to convergent point after being merged in a manner of single-hop；
Step 4 after active node work is completed in step 3, cluster interior nodes role is adjusted with state, specifically
For：Redundant node sleep timer T firstsleepIt reaches, redundant node switchs to working condition from sleep state；Secondly the institute in cluster
There is node to send the message with oneself ID and dump energy to last round of cluster head, cluster head is arranged according to the dump energy of node
Sequence, update clusterNodes set, the node for selecting energy maximum serve as epicycle cluster head, new cluster head are announced to other nodes
ID simultaneously sends the message for carrying clusterNodes information to new cluster head；Then by judging the side of redundant node in each cluster
Whether method decision node is redundant node；If some node is determined as redundant node, the node is switched into shape of sleeping immediately
State if some node determines it is not redundant node, continues to judge another node, until all node checks finish.
Step 5, after the node role of step 4 and state have adjusted, cycle is performed into step 3, step 4, until institute
There is node energy to run out of.
Embodiment
Step 1, the election of Uneven Cluster cluster head and completion Uneven Cluster
In the network starting stage, convergent point broadcasts a signal, each sensor node with certain power into network
After this signal is received, according to receive signal intensity RSSI calculate it arrive aggregation node approximate distance, and by this away from
From being denoted as d (Ni, BS), NiRefer to any node in network, i refers to the label of any sensor node in network area.Since distance is converged
The energy of the near cluster head consumption of poly- node is less, and the energy that the cluster head far from aggregation node consumes is more, therefore further away from convergence
The cluster that node is formed is smaller, is consumed with balancing larger communication between cluster.A kind of non-homogeneous point of wireless sensor network of the present invention
Cluster node dispatching method participates in the election contest of cluster head in the first run using all nodes, balances the energy consumption of all nodes.It is more remote in order to make
It is smaller from the cluster that aggregation node is formed, to each election contest cluster head node, one competition radius R is setcompete, RcompeteIt is nodal point separation
With a distance from convergent point with the function of region node density.The function major function be in the case where node density is equal,
Make the node far from convergent point that there is smaller competition radius, so as to generate more cluster head, the range of each cluster is with regard to small, distance
The nearer node of convergent point has larger competition radius, and so as to generate less cluster head, the range of each cluster is with regard to big；In node
With convergent point in the case of identical, density factor where node is big, and the competition radius of cluster is with regard to small.It is assumed that RsetIt is to set in advance
Determine maximum contention radius, it is each to campaign for cluster head node competition radius Ni.RcompeteAs shown in formula (1)：
Wherein, wherein dmaxAnd dminThe node in network is represented respectively to the maximum distance and minimum range of convergent point, and c is
For controlling the parameter of value range, the value between 0~1, ρ is the density factor of node region, it is used by node
The neighbor node number N detected during Boolean sense modelnei(i) with whole network in surviving node number NallProportion determine
's.It can be seen from formula (1) when two cluster head node density are identical, more remote away from aggregation node distance, cluster radius is smaller,
Make to save energy in cluster for cluster head data forwarding.When the distance of two cluster heads to aggregation nodes is equal, node region
The bigger competition radius of density is smaller, achievees the purpose that each cluster load of balance.
Fig. 1 show the topological schematic diagram of an election contest cluster head node, and from left to right 3 circles of different sizes represent respectively
Node N1, N2, N3Competition region.Assuming that in node N1Competition region in, N1Carry an election, then N1As cluster head, in N2's
In competition region, N2It campaigns for successfully, because of N1In N2Election contest in the range of, therefore N2Instead of N1As cluster head.In the same manner, N3Election contest
Success, N3N is replaced again2As cluster head.At this point, a cluster head is just only produced in the competitive scope of 3 nodes.In order to avoid
The above situation occurs, and the rules of competition for defining candidate cluster head is as follows：
During election contest, if candidate cluster head NiAnnounce its carry an election, then in NiCompetition radius Ni.RcompeteInterior
All candidate's cluster heads can't be final cluster head, need to exit election contest process.
Fig. 2 is to monitor any one candidate cluster head N and the election contest schematic diagram of other candidate cluster heads in region, shared (a), (b),
(c), (d) four kinds of situations.It can be immediately arrived at by the rules of competition of candidate cluster head, N2、N3Cluster head cannot be become simultaneously with N.For
(c) situation shown in, it is assumed that N, which is campaigned for, successfully becomes cluster head, if N4Also it campaigns for successfully, then according to the rules of competition of candidate cluster head, waits
Select cluster head N4It campaigns for successfully, in N4All candidate cluster capitals in competition radius can't be final cluster head, then illustrates that N cannot be into
For cluster head, this is with assuming that N campaigns for successfully contradiction, therefore can be obtained by the rules of competition of candidate cluster head when N is campaigned for successfully, N4
Election contest process need to be exited.For situation shown in (d), N and N5Cluster head can be become simultaneously, the two is independent of each other.By (a) in Fig. 2,
(b), the candidate cluster head N in (c) 3 kinds of situations2、N3、N4The neighbor node of candidate cluster head N is defined as, each candidate cluster capital has it
Neighbor node collection.Formula (2) is candidate cluster head NiNeighbor node set definition：
Ni.NNi={ Ni|Ni∈ { candidate cluster head }, and d (Ni,Nj) ＜ max (Ni.Rcompete,Nj.Rcompete)} (2)
Broadcast one includes self ID, competition radius R to candidate cluster head outwardcompeteAnd self-energy EnMessage, other
After node receives this message, its information of neighbor nodes table is updated by formula (2).Each candidate's cluster head and its neighbor node compare
Dump energy, the larger candidate cluster head of dump energy is elected as final cluster head, and it oneself is certainly to be sent out at once to its neighbor node
Oneself campaign for successfully as the message of cluster head, and the neighbours' candidate's cluster head for receiving this message exits competition, becomes ordinary node, and from its
It is removed in the neighbor node of his candidate cluster head.
After the completion of cluster head election contest, a kind of wireless sensor network Uneven Cluster node scheduling method of the present invention directly makes
The neighbor node of final cluster head is integrated into member in the cluster of oneself, simplifies the power that traditional basis receives cluster head broadcast message
It is frequently interactive with calculating to avoid node for the method that selection adds in some cluster head.After cluster is formed, cluster head node uses TDMA side
Formula is that the time slot of each node distribution transmission data in cluster is finally completed the Uneven Cluster of whole network.
Step 2 searches redundant node in cluster
After completing Uneven Cluster, redundant node is searched in cluster, and close redundant node and make it into dormant state.
When detecting redundant node, for the energy consumption of preferably balanced node, cluster interior nodes are sorted from small to large by energy, and by node
ID be sequentially stored in the set of entitled clusterNodes, there are an index to mark for each element in set, is sentencing
During disconnected redundant node, cluster head distributes sequential by the size of index+1 to cluster interior nodes, and node is according to the size of sequential at oneself
Sequential in carry out judge, i.e., judge since the node of energy minimum every time.Judgment method is：Nodal test monitoring half
It whether there is the non-cluster head node of 4 or 4 or more in diameter R, these nodes are known as NiSensing node, if there is at least 4
The angle between adjacent node meets and is more than 60 ° and is less than 120 ° a sensing node simultaneously counterclockwise, covering as shown in Figure 3
The distribution map of region sensing node, then the node redundancy, its active state switchs to dormant state at this time, and sends a suspend mode
Message gives its sensing node, the monitoring cavitation for avoiding two adjacent nodes suspend mode simultaneously and occurring, while starts one
A sleep timer TsleepEnsure to be in active state when next round starts.
Step 3, active node steady operation
After completing the election of cluster head and the scheduling suspend mode of redundant node, active node enters stationary operational phase.This stage
The main acquisition and transmission for completing data.The energy expenditure of ordinary node is mainly the energy of transmission data consumption in this stage cluster
Amount, as shown in formula (3), wherein, EelecFor the energy of circuit consumption, d is the distance of sender and recipient, works as d<d0Shi Cai
With free space model, transmission power is in d2Attenuation, works as d>d0Or using multipath attenuation model, transmission power when interfering larger
In d4Attenuation.εfs、εmpThe energy proportion coefficient that respectively power amplification is consumed in both models.
Shown in the energy such as formula (4) of cluster head consumption.Wherein, SiRepresent ordinary node number in running order in cluster
Mesh.
E(CHi)=SikEelec+(Si+1)kEDA+k(Eelec+εmpd4) (4)
The adjustment of step 4, cluster interior nodes role and state
Redundant node sleep timer T firstsleepIt reaches, redundant node switchs to working condition from sleep state；Secondly cluster
Interior all nodes send the message with oneself ID and dump energy to last round of cluster head, and cluster head is according to the dump energy of node
It is ranked up, update clusterNodes set, the node for selecting energy maximum serves as epicycle cluster head, is announced to other nodes new
The ID of cluster head simultaneously sends the message for carrying clusterNodes information to new cluster head；Then by judging redundancy section in each cluster
Whether the method decision node of point is redundant node；If some node is determined as redundant node, the node is switched to immediately
Sleep state if some node determines it is not redundant node, continues to judge another node, until all node checks are complete
Finish.
After step 5, the node role of step 4 and state have adjusted, cycle performs step 3, step 4, until all sections
Point energy expenditure is complete.
As shown in figure 4, the wireless sensor network (WSN) emulation time is identical, a kind of non-homogeneous point of wireless sensor network of the present invention
Network gross energy after cluster node dispatching method is scheduled node is far longer than the nets of other two kinds of existing classical ways
Network gross energy.
As shown in figure 5, the wireless sensor network (WSN) emulation time is identical, a kind of non-homogeneous point of wireless sensor network of the present invention
Cluster node dispatching method node is scheduled after surviving node number far more than other two kinds of existing classical ways section
Point amount of survival.
A kind of wireless sensor network Uneven Cluster node scheduling method of the present invention, by Uneven Cluster and redundant node
Scheduling is combined so that and the energy expenditure of each node is more balanced, and improves capacity usage ratio, has saved network gross energy,
Effectively extend Network morals.
Claims (2)
- A kind of 1. wireless sensor network Uneven Cluster node scheduling method, which is characterized in that specifically according to following steps reality It applies：Step 1, the election of Uneven Cluster cluster head and completion Uneven Cluster, the specific steps are：Near apart from aggregation node The energy of cluster head consumption is less, and the energy that the cluster head far from aggregation node consumes is more, therefore formed further away from aggregation node Cluster is smaller, is consumed with balancing larger communication between cluster；All nodes of the first run participate in the election contest of cluster head, balance the energy of all nodes Consumption；In order to make the cluster formed further away from aggregation node smaller, one competition radius R is set to each election contest cluster head nodecompete, RcompeteIt is nodal distance convergent point distance and the function of region node density；Each election contest cluster head node competition radius Ni.RcompeteFormula be：Wherein, wherein dmaxAnd dminThe node in network is represented respectively to the maximum distance and minimum range of convergent point；C is to be used for Control the parameter of value range, the value between 0~1；ρ is the density factor of node region；d(Ni, BS) and it is sensor Node is to the distance of aggregation node；NiIt is any node in network；I is the label of any sensor node in network area；Rset It is to preset maximum contention radius；Nnei(i) it is neighbor node number；NallIt is surviving node number in whole network；Step 2, after step 1 completes sub-clustering heterogeneous, redundant node is searched in cluster, and close redundant node to make redundancy section Point enters dormant state, and specific implementation process is：Cluster interior nodes are sorted, and the ID of node is deposited successively from small to large by energy In the set of entitled clusterNodes, there are an index to mark for each element in set, is judging redundant node for storage When, cluster head distributes sequential by the size of index+1 to cluster interior nodes, and node judges since the node of energy minimum every time Whether it is redundant node, if redundant node, then this node immediately enters sleep state, and sends a sleep messages and feel to it Know node, the monitoring cavitation for avoiding two adjacent nodes suspend mode simultaneously and occurring, while start a sleep timing Device TsleepEnsure to be in active state when next round starts；It is described judge redundant node judgment method be：It is non-with the presence or absence of 4 or 4 or more in nodal test monitoring radius R Cluster head node, these nodes are known as NiSensing node, if there is at least four sensing node adjacent node counterclockwise Between angle meet 60 °~120 ° simultaneously, then the node redundancy, at this time its active state switch to dormant state；Step 3, complete step 2 redundant node scheduling suspend mode after, active node enters steady-working state；After active node work is completed in step 3, cluster interior nodes role is adjusted with state for step 4；Step 5, after the node role of step 4 and state have adjusted, cycle is performed into step 3, step 4, until all sections Point energy expenditure is complete；During cluster head election contest, if candidate cluster head NiAnnounce its carry an election, then in NiCompetition radius Ni.RcompeteIt is interior All candidate cluster heads can't be final cluster head, need to exit election contest process, and add in NiAs NiCluster in member, Become ordinary node, while these nodes add in final cluster head Ni, one is formed with NiFor cluster head, NiCompetition radius in Other clusters of candidate cluster head for rank and file in cluster；The specific implementation process of the step 3 is：Information in cluster interior nodes acquisition monitoring region, when oneself transmitting data CSMA MAC protocols are used in sequence to its cluster head transmission data；Cluster head node receives the information of each node in cluster, by it Convergent point is sent to after fusion in a manner of single-hop.
- 2. a kind of wireless sensor network Uneven Cluster node scheduling method according to claim 1, which is characterized in that The specific implementation process of the step 4 is：Redundant node sleep timer T firstsleepIt reaches, redundant node turns from sleep state It is in working condition；Secondly all nodes in cluster send the message with oneself ID and dump energy, cluster head to last round of cluster head It is ranked up according to the dump energy of node, update clusterNodes set, the node for selecting energy maximum serves as epicycle cluster Head announces the ID of new cluster head to other nodes and the message of carrying clusterNodes information is sent to new cluster head；Then each By the method decision node for judging redundant node whether it is redundant node in a cluster；If some node is determined as redundancy section The node is then switched to sleep state by point immediately, if some node determines it is not redundant node, continues to judge another section Point, until all node checks finish.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410549072.1A CN104301965B (en) | 2014-10-16 | 2014-10-16 | A kind of wireless sensor network Uneven Cluster node scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410549072.1A CN104301965B (en) | 2014-10-16 | 2014-10-16 | A kind of wireless sensor network Uneven Cluster node scheduling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104301965A CN104301965A (en) | 2015-01-21 |
| CN104301965B true CN104301965B (en) | 2018-07-03 |
Family
ID=52321477
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410549072.1A Active CN104301965B (en) | 2014-10-16 | 2014-10-16 | A kind of wireless sensor network Uneven Cluster node scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104301965B (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107801170A (en) * | 2017-11-06 | 2018-03-13 | 潘柏霖 | Warmhouse booth supervising device |
| CN108055683B (en) * | 2017-12-29 | 2021-02-05 | 东北林业大学 | Method for balancing energy consumption and keeping coverage of underwater wireless sensor network |
| CN108271136A (en) * | 2018-01-19 | 2018-07-10 | 深圳市鑫汇达机械设计有限公司 | Geotechnical engineering safety intelligent monitor system |
| CN108173346A (en) * | 2018-01-19 | 2018-06-15 | 深圳市鑫汇达机械设计有限公司 | Smart power grid power transmission line height monitoring warning device |
| CN108303497A (en) * | 2018-01-19 | 2018-07-20 | 深圳市晟达机械设计有限公司 | Air pollution surveillance system |
| CN108335471A (en) * | 2018-01-19 | 2018-07-27 | 深圳市鑫汇达机械设计有限公司 | Wind power plant remote real time monitoring system |
| CN108107748B (en) * | 2018-01-19 | 2018-12-11 | 赵一然 | A kind of smart home environment control system |
| CN109688556B (en) * | 2019-01-10 | 2020-09-11 | 广东省信息网络有限公司 | System and method for data transmission and processing |
| CN110113807B (en) * | 2019-05-05 | 2021-10-01 | 辽宁大学 | Node dormancy scheduling method based on data similarity in wireless sensor network |
| CN110718103B (en) * | 2019-09-19 | 2021-04-09 | 深圳供电局有限公司 | Transformer substation electrical equipment simulation operation system based on VR simulation training |
| CN111010710B (en) * | 2019-12-14 | 2023-06-02 | 贵州电网有限责任公司 | Sensor network transmission method based on load balancing in power equipment communication |
| CN111836335B (en) * | 2020-06-22 | 2022-06-24 | 中国科学院上海微系统与信息技术研究所 | Event-driven-based wireless sensor network topology management method |
| CN112506215B (en) * | 2020-11-18 | 2022-08-09 | 广州工程技术职业学院 | Internet of things data acquisition method and unmanned aerial vehicle |
| CN112888041B (en) * | 2020-12-30 | 2022-04-15 | 电子科技大学 | Wireless sensor network communication method based on non-uniform node deployment |
| CN112996078B (en) * | 2021-02-04 | 2022-08-26 | 南京邮电大学 | Non-uniform clustering method for energy load balancing and non-uniform clustering routing method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101286917A (en) * | 2008-04-25 | 2008-10-15 | 南昌大学 | Heterogeneous wireless sensor network life prolonging method based on dormancy mechanism |
| CN101827378A (en) * | 2010-03-09 | 2010-09-08 | 北京交通大学 | Blending MAC protocol design method suitable for wireless sensor network |
| CN103796273A (en) * | 2014-01-20 | 2014-05-14 | 南京邮电大学 | Energy-balanced clustering routing strategy for wireless sensor networks |
-
2014
- 2014-10-16 CN CN201410549072.1A patent/CN104301965B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101286917A (en) * | 2008-04-25 | 2008-10-15 | 南昌大学 | Heterogeneous wireless sensor network life prolonging method based on dormancy mechanism |
| CN101827378A (en) * | 2010-03-09 | 2010-09-08 | 北京交通大学 | Blending MAC protocol design method suitable for wireless sensor network |
| CN103796273A (en) * | 2014-01-20 | 2014-05-14 | 南京邮电大学 | Energy-balanced clustering routing strategy for wireless sensor networks |
Non-Patent Citations (4)
| Title |
|---|
| 一种基于非均匀分簇的无线传感器网络路由协议;李成法,陈贵海,叶懋,吴杰;《计算机学报》;20070131;第30卷(第1期);全文 * |
| 一种适用于煤矿井下无线传感网的能量均衡路由协议;吴华君,张自力,李卫;《计算机科学》;20110430;第38卷(第4期);第3节 * |
| 无线传感器网络分簇拓扑的覆盖区域节点调度优化算法研究;孙超,赵路路,张影,刘彬,郝晓辰;《传感技术学报》;20100131;第23卷(第1期);全文 * |
| 非均匀分布下无线传感器网络节点调度机制;凡高娟,孙力娟,王汝传,黄海平,肖甫,李靖;《通信学报》;20110331;第32卷(第3期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104301965A (en) | 2015-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104301965B (en) | A kind of wireless sensor network Uneven Cluster node scheduling method | |
| CN108566663B (en) | SDWSN energy consumption balance routing method based on disturbance particle swarm optimization | |
| Bagci et al. | An energy aware fuzzy approach to unequal clustering in wireless sensor networks | |
| Aslam et al. | A multi-criterion optimization technique for energy efficient cluster formation in wireless sensor networks | |
| CN105636143B (en) | Wireless sensor network clustering cooperation routing algorithm based on cooperative game | |
| CN110062432A (en) | A kind of Wireless sensor network clustering routing algorithm based on least energy consumption | |
| CN101959244B (en) | Method for controlling hierarchical type route suitable for wireless sensor network | |
| CN104093188B (en) | Novel cluster head election method for wireless sensor networks | |
| CN102026331A (en) | Distributed multi-jump energy-saving communication method in wireless sensor network | |
| CN103228022A (en) | Probability type wireless sensor network routing method based on energy harvesting | |
| CN104994554B (en) | Mobile-assisted wireless sensor network routing method based on Uneven Cluster | |
| CN102612083B (en) | Method for constructing connected dominating set based on exclusive region in wireless sensor network | |
| CN101232517B (en) | Method for disposing poly concourse nodes irrespective of geographical position | |
| CN102970723A (en) | Non-uniform clustering routing algorithm with local cluster reconstruction | |
| CN108712767A (en) | Multihop routing algorithm between a kind of cluster of Energy Consumption in Wireless Sensor Networks equilibrium | |
| Manzoor et al. | Enhanced TL-LEACH routing protocol for large-scale WSN applications | |
| CN103781143A (en) | Cluster tree hierarchical wireless sensor network routing method with optimized energy efficiency | |
| CN103945508B (en) | It is a kind of based on likelihood ratio compared with wireless sense network topological construction method | |
| CN104135752A (en) | Cluster head node selection method and clustering method of wireless sensor network | |
| CN108566658B (en) | Clustering algorithm for balancing energy consumption in wireless sensor network | |
| CN104065574A (en) | Uneven clustering routing method inside wireless sensor network layer | |
| CN103987102A (en) | Topology control method of underwater wireless sensor network based on non-cooperative game | |
| CN104168631A (en) | Wireless sensor network energy balance coverage scheduling and cross-layer routing design method | |
| CN103826282B (en) | Set based on dump energy divides multi-hop routing method | |
| CN105323817B (en) | Based on the TDMA dispatching method of cluster tree topology in heterogeneous sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210319 Address after: 710065 601, unit 2, building 5, Yinhe Science Park, No.25 Tangyan Road, Zhangba Street office, high tech Zone, Xi'an City, Shaanxi Province Patentee after: Xi'an Yuheng Power Technology Co.,Ltd. Address before: 710048 No. 5 Jinhua South Road, Shaanxi, Xi'an Patentee before: XI'AN University OF TECHNOLOGY |