CN104301965A - Wireless sensor network inhomogeneous cluster node scheduling method - Google Patents

Wireless sensor network inhomogeneous cluster node scheduling method Download PDF

Info

Publication number
CN104301965A
CN104301965A CN201410549072.1A CN201410549072A CN104301965A CN 104301965 A CN104301965 A CN 104301965A CN 201410549072 A CN201410549072 A CN 201410549072A CN 104301965 A CN104301965 A CN 104301965A
Authority
CN
China
Prior art keywords
node
cluster head
cluster
bunch
nodes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201410549072.1A
Other languages
Chinese (zh)
Other versions
CN104301965B (en
Inventor
张彤
燕丽莎
李雪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xi'an Yuheng Power Technology Co.,Ltd.
Original Assignee
Xian University of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xian University of Technology filed Critical Xian University of Technology
Priority to CN201410549072.1A priority Critical patent/CN104301965B/en
Publication of CN104301965A publication Critical patent/CN104301965A/en
Application granted granted Critical
Publication of CN104301965B publication Critical patent/CN104301965B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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 wireless sensor network inhomogeneous cluster node scheduling method. The wireless sensor network inhomogeneous cluster node scheduling method specifically comprises the following steps that firstly, the inhomogeneous cluster head is selected and inhomogeneous clustering is finished; secondly, after inhomogeneous clustering is finished in the first step, redundant nodes in a cluster are found and are closed to get into a dormant state; thirdly, after scheduling dormancy of the redundant nodes is finished in the second step, active nodes get into a stable working state; fourthly, after the active nodes finish work, the characters and states of the nodes in the cluster are adjusted; fifthly, after the characters and states of the nodes are adjusted, the third step and the fourth step are executed circularly till all node energy is consumed. According to the wireless sensor network inhomogeneous cluster node scheduling method, inhomogeneous clustering and redundant node scheduling are combined, the energy of the nodes is consumed in a balanced mode, and the service life of the network is effectively prolonged.

Description

A kind of wireless sensor network Uneven Cluster node scheduling method
Technical field
The invention belongs to wireless sensor network technology field, relate to a kind of wireless sensor network Uneven Cluster node scheduling method.
Background technology
Wireless sensor network (Wireless Sensor Network, WSN) energy of node, resource, communication capacity are very limited, how to utilize node energy to design efficient Node Scheduling Algorithms in Line and improve the key issue that network life becomes the research of current wireless sensor network.
As far back as 2000, Heinzelman W proposes first low power consumption adaptive clustering route protocol LEACH for WSN design, the load of network is assigned on each node by this algorithm, thus reduce individual node energy ezpenditure, improve network lifetime, but LEACH agreement does not consider the problems such as cluster head skewness and residue energy of node.The improved protocol of LEACH is a lot, such as, adopts centralized cluster head to produce algorithm, selects cluster head according to global information, effectively control quantity and the position of cluster head, consider dump energy simultaneously.Although LAECH agreement and innovatory algorithm thereof effectively extend network lifecycle, exist bunch between the unbalanced problem of energy ezpenditure, from the cluster head away from aggregation node, still there is larger energy consumption.
For bunch between the problem such as energy ezpenditure is unbalanced, domestic and international researcher adopts Uneven Cluster strategy to balance the energy ezpenditure of cluster head.EECS method is in order to balanced cluster head energy ezpenditure, and ordinary node not only will consider self distance from cluster head when selecting cluster head, and will consider that cluster head arrives the distance of aggregation node, thus constructs heterogeneous bunch of size.But the energy balance measure of EECS can only alleviate the energy ezpenditure unbalanced phenomena between cluster head, internodal energy balance cannot be realized on the whole.And EEUC adopt Uneven Cluster and bunch between multihop routing organically combine mode, utilize competition radius heterogeneous, make near base station bunch number of members relatively little, thus cluster head can conserve energy for bunch between data retransmission use, reach the object of balanced cluster head energy ezpenditure, but EEUC is only suitable for equally distributed network.On former methodical basis, inherit the Uneven Cluster structure of EEUC, adopt the cluster-leader selected driven based on the time machine-processed and utilize greedy algorithm to find the via node of cluster head forwarding.In above Uneven Cluster algorithm, each is taken turns all nodes and all wants in running order and carry out Data acquisition and transmit, in the wireless sensor network that Node distribution is intensive, can cause the problems such as the interference of bulk information redundancy, wireless signal, energy dissipation like this.
Summary of the invention
The object of this invention is to provide a kind of wireless sensor network Uneven Cluster node scheduling method, solve the wireless sensor network interior joint energy consumption existed in prior art unbalanced, the problem that Network morals is short.
The technical solution adopted in the present invention is, a kind of wireless sensor network Uneven Cluster node scheduling method, specifically implements according to following steps:
The election of step 1, Uneven Cluster cluster head and complete Uneven Cluster;
Step 2, after step 1 completes sub-clustering heterogeneous, bunch in search redundant node, and close redundant node and make redundant node enter resting state;
Step 3, after the scheduling dormancy of completing steps 2 redundant node, active node enters steady-working state;
Step 4, after active node work completes in step 3, bunch interior nodes role and state to be adjusted;
Step 5, after the node role of step 4 and state have adjusted, circulation step 3, step 4 are performed, until all node energies run out of.
Feature of the present invention is also,
The concrete way to elect of step 1 cluster head and complete Uneven Cluster and be: the energy that the near cluster head of distance aggregation node consumes is less, the energy consumed away from the cluster head of aggregation node is more, therefore more away from aggregation node formed bunch less, with communication consumption larger between balancing bunch; The 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 more away from aggregation node formed bunch less, to each election contest cluster head node, a competition radius R is set compete, R competeit is nodal distance convergent point distance and the function of region node density; Each election contest cluster head node competition radius N i.R competeformula be:
N i . R compete = ( 1 - c d ( N i , BS ) - d min d max - d min ) ( 1 - ρ ) R set ρ = ( N nei ( i ) - 1 ) / N all - - - ( 1 )
Wherein, wherein d maxand d minrepresent the node in network respectively to the ultimate range of convergent point and minimum range; C is the parameter for controlling span, value between 0 ~ 1; ρ is the density factor of node region; D (N i, BS) and be the distance of sensor node to aggregation node; N iit is any node in network; I is the label of any sensor node in network area; R setpreset maximum contention radius; N neii () is neighbor node number; N allit is surviving node number in whole network.
In cluster head election contest process, if candidate is cluster head N iannounce its carry an election, then at N icompetition radius N i.R competeinterior all candidate's cluster heads all can not become final cluster head, need to exit election contest process, all become ordinary node, and these nodes add final cluster head N simultaneously i, form one with N ifor cluster head, N icompetition radius in other candidate's cluster heads be bunch in bunch of rank and file.
The specific implementation process of step 2 is: bunch interior nodes sorted from small to large by energy, and the ID of node is stored in successively in the set of clusterNodes by name, in set there is an index mark in each element, when judging redundant node, cluster head distributes sequential to bunch interior nodes by the size of index+1, node all determines whether redundant node at every turn from the node that energy is minimum, if redundant node, then this node enters sleep state immediately, and send a sleep messages to its sensing node, avoid the dormancy simultaneously of adjacent two nodes and the monitoring cavitation that occurs, start a sleep timer T simultaneously sleepensure to be in active state when next round starts.
The specific implementation process of step 3 is: bunch interior nodes gathers the information in monitored area, in the sequential of oneself transmission data, adopt CSMA MAC protocol to send data to its cluster head; Cluster head node receive from bunch in the information of each node, send to convergent point in single-hop mode after being merged.
The specific implementation process of step 4 is: first redundant node sleep timer T sleeparrive, redundant node transfers operating state to from sleep state; All nodes in next bunch send the message with oneself ID and dump energy to last round of cluster head, cluster head sorts according to the dump energy of node, upgrade clusterNodes set, select the maximum node of energy and serve as epicycle cluster head, announce the ID of new cluster head to other node and send the message of carrying clusterNodes information to new cluster head; Whether the method decision node then by judging redundant node in each bunch is redundant node; If certain node is defined as redundant node, then transfer this node to sleep state immediately, if certain node determines it is not redundant node, then continue to judge another node, until all node checks are complete.
Judge that the determination methods of redundant node is: the non-cluster head node whether having more than 4 or 4 in nodal test monitoring radius R, these nodes are called N isensing node, if there is at least 4 sensing nodes angle counterclockwise between adjacent node to meet 60 ° ~ 120 ° simultaneously, then this node redundancy, now its active state transfers resting state to.
The invention has the beneficial effects as follows: Uneven Cluster is dispatched with redundant node and combined by a kind of wireless sensor network Uneven Cluster of the present invention node scheduling method, make the energy ezpenditure of each node more balanced, avoid a large amount of redundant nodes to work simultaneously and cause the problem of the wasting of resources simultaneously, effectively like this extend Network morals.
Accompanying drawing explanation
Fig. 1 is the topological schematic diagram of campaigning for cluster head node in a kind of wireless sensor network of the present invention Uneven Cluster node scheduling method;
Fig. 2 is the election contest schematic diagram of candidate cluster head N and other candidate's cluster heads in a kind of wireless sensor network Uneven Cluster of the present invention node scheduling method;
Fig. 3 is the distribution map of sensing node in a kind of wireless sensor network Uneven Cluster of the present invention node scheduling method;
Fig. 4 is the comparison diagram of the network gross energy of a kind of wireless sensor network of the present invention Uneven Cluster node scheduling method and two kinds of existing classical ways;
Fig. 5 is the comparison diagram of the network survival time of a kind of wireless sensor network of the present invention Uneven Cluster node scheduling method and two kinds of existing classical ways.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is described in detail.
A kind of wireless sensor network Uneven Cluster of the present invention node scheduling method, specifically implement according to following steps:
The election of step 1, Uneven Cluster cluster head and complete Uneven Cluster, way to elect is: the energy of the cluster head consumption that distance aggregation node is near is less, the energy consumed away from the cluster head of aggregation node is more, therefore more away from aggregation node formed bunch less, with communication consumption larger between balancing bunch; The 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 more away from aggregation node formed bunch less, to each election contest cluster head node, a competition radius R is set compete, R competeit is nodal distance convergent point distance and the function of region node density; Each election contest cluster head node competition radius N i.R competeformula be:
N i . R compete = ( 1 - c d ( N i , BS ) - d min d max - d min ) ( 1 - ρ ) R set ρ = ( N nei ( i ) - 1 ) / N all - - - ( 1 )
Wherein, wherein d maxand d minrepresent the node in network respectively to the ultimate range of convergent point and minimum range; C is the parameter for controlling span, value between 0 ~ 1; ρ is the density factor of node region; D (N i, BS) and be the distance of sensor node to aggregation node; N iit is any node in network; I is the label of any sensor node in network area; R setpreset maximum contention radius; N neii () is neighbor node number; N allit is surviving node number in whole network;
In cluster head election contest process, if candidate is cluster head N iannounce its carry an election, then at N icompetition radius N i.R competeinterior all candidate's cluster heads all can not become final cluster head, and needing to exit election contest process all becomes ordinary node, and these nodes add final cluster head N simultaneously i, form one with N ifor cluster head, N icompetition radius in other candidate's cluster heads be bunch in bunch of rank and file;
Step 2, after step 1 completes sub-clustering heterogeneous, bunch in search redundant node, and close redundant node and make redundant node enter resting state, be specially: bunch interior nodes is sorted from small to large by energy, and the ID of node is stored in successively in the set of clusterNodes by name, in set there is an index mark in each element, when judging redundant node, cluster head distributes sequential to bunch interior nodes by the size of index+1, node all determines whether redundant node at every turn from the node that energy is minimum, determination methods is: the non-cluster head node whether having more than 4 or 4 in nodal test monitoring radius R, these nodes are called the sensing node of Ni, if there is the angle of at least 4 sensing nodes counterclockwise between adjacent node to meet 60 ° ~ 120 ° simultaneously, then this node redundancy, now its active state transfers resting state to, and send a sleep messages to its sensing node, avoid the dormancy simultaneously of adjacent two nodes and the monitoring cavitation that occurs, start a sleep timer T simultaneously sleepensure to be in active state when next round starts,
Step 3, after the scheduling dormancy of completing steps 2 redundant node, active node enters steady-working state, and bunch interior nodes gathers the information in monitored area, in the sequential of oneself transmission data, adopt CSMA MAC protocol to send data to its cluster head; Cluster head node receive from bunch in the information of each node, send to convergent point in single-hop mode after being merged;
Step 4, after active node work completes in step 3, bunch interior nodes role and state are adjusted, is specially: first redundant node sleep timer T sleeparrive, redundant node transfers operating state to from sleep state; All nodes in next bunch send the message with oneself ID and dump energy to last round of cluster head, cluster head sorts according to the dump energy of node, upgrade clusterNodes set, select the maximum node of energy and serve as epicycle cluster head, announce the ID of new cluster head to other node and send the message of carrying clusterNodes information to new cluster head; Whether the method decision node then by judging redundant node in each bunch is redundant node; If certain node is defined as redundant node, then transfer this node to sleep state immediately, if certain node determines it is not redundant node, then continue to judge another node, until all node checks are complete.
Step 5, after the node role of step 4 and state have adjusted, circulation step 3, step 4 are performed, until all node energies run out of.
Embodiment
The election of step 1, Uneven Cluster cluster head and complete Uneven Cluster
In the network starting stage, convergent point broadcasts a signal with certain power in network, and each sensor node, after receiving this signal, calculates according to the intensity RSSI of Received signal strength the approximate distance that it arrives aggregation node, and this distance is designated as d (N i, BS), N irefer to any node in network, i refers to the label of any sensor node in network area.The energy consumed due to the near cluster head of distance aggregation node is less, and the energy that the cluster head away from aggregation node consumes is more, bunch less therefore more away from aggregation node formation, with communication consumption larger between balancing bunch.A kind of wireless sensor network of the present invention Uneven Cluster node scheduling method adopts all nodes to participate in the election contest of cluster head in the first run, balances the energy consumption of all nodes.In order to make more away from aggregation node formed bunch less, to each election contest cluster head node, a competition radius R is set compete, R competeit is nodal distance convergent point distance and the function of region node density.This function major function is when node density is equal, the node away from convergent point is made to have less competition radius, thus generate more cluster head, the scope of each bunch is just little, the node nearer apart from convergent point has larger competition radius, thus generating less cluster head, the scope of each bunch is just large; When node with convergent point apart from identical, node place density factor is large, bunch competition radius just little.Assuming that R setpreset maximum contention radius, each election contest cluster head node competition radius N i.R competeas shown in formula (1):
N i . R compete = ( 1 - c d ( N i , BS ) - d min d max - d min ) ( 1 - ρ ) R set ρ = ( N nei ( i ) - 1 ) / N all - - - ( 1 )
Wherein, wherein d maxand d minrepresent the node in network respectively to the ultimate range of convergent point and minimum range, c is the parameter for controlling span, value between 0 ~ 1, ρ is the density factor of node region, and it is adopted the neighbor node number N detected during Boolean sense model by node nei(i) and surviving node number N in whole network allproportion determined.As can be seen from formula (1), when two cluster head node density are identical, far away apart from aggregation node distance, bunch radius is less, saves energy for cluster head data retransmission in making bunch.When two cluster heads are equal to the distance of aggregation node, the competition radius that node region density is larger is less, reaches the object of balance each bunch of load.
Figure 1 shows that the topological schematic diagram of an election contest cluster head node, from left to right 3 circle varied in size representation node N respectively 1, N 2, N 3competition region.Suppose at node N 1competition region in, N 1carry an election, then N 1become cluster head, at N 2competition region in, N 2campaign for successfully, because N 1at N 2election contest within the scope of, therefore N 2replace N 1become cluster head.In the same manner, N 3campaign for successfully, N 3replace N again 2become cluster head.Now, in the competitive scope of 3 nodes, a cluster head is just only produced.In order to avoid above-mentioned situation occurs, the rules of competition of definition candidate cluster head is as follows:
In election contest process, if candidate is cluster head N iannounce its carry an election, then at N icompetition radius N i.R competeinterior all candidate's cluster heads all can not become final cluster head, need to exit election contest process.
Fig. 2 is the election contest schematic diagram of any candidate cluster head N and other candidate's cluster heads in monitored area, total (a), (b), (c), (d) four kinds of situations.Can directly be drawn by the rules of competition of candidate's cluster head, N 2, N 3cluster head can not be become with N simultaneously.For situation (c) Suo Shi, supposing that N campaigns for successfully becomes cluster head, if N 4also campaign for successfully, then according to the rules of competition of candidate's cluster head, candidate cluster head N 4campaign for successfully, at N 4all candidate's cluster heads in competition radius all can not become final cluster head, then illustrate that N can not become cluster head, and this campaigns for successful contradiction with hypothesis N, therefore can draw when N campaigns for successfully by the rules of competition of candidate's cluster head, N 4election contest process need be exited.For situation (d) Suo Shi, N and N 5can become cluster head, both are independent of each other simultaneously.By the candidate cluster head N in (a), (b), (c) 3 kinds of situations in Fig. 2 2, N 3, N 4be defined as the neighbor node of candidate cluster head N, each candidate's cluster head has its neighbor node collection.Formula (2) is candidate cluster head N ithe definition of neighbor node set:
N i.NN i={ N i| N i∈ { candidate's cluster head }, and d (N i, N j) < max (N i.R compete, N j.R compete) (2)
Candidate's cluster head is outwards broadcasted one and is comprised self ID, competition radius R competeand self-energy E nmessage, after other nodes receive this message, upgrade its information of neighbor nodes table by formula (2).Each candidate's cluster head and its neighbor node compare dump energy, candidate's cluster head that dump energy is larger is elected as final cluster head, and to send to its neighbor node at once oneself be oneself campaign for the message successfully becoming cluster head, the neighbours candidate cluster head receiving this message exits competition, become ordinary node, and remove from the neighbor node of other candidate's cluster heads.
After cluster head has been campaigned for, a kind of wireless sensor network of the present invention Uneven Cluster node scheduling method directly make the neighbor node of final cluster head be integrated into oneself bunch in member, simplify traditional method selecting to add certain cluster head according to the power receiving cluster head broadcast message, avoid node mutual and calculating frequently.After bunch being formed, cluster head node adopt TDMA mode be bunch in the time slot of each peer distribution transmission data finally complete the Uneven Cluster of whole network.
Step 2, bunch in search redundant node
After completing Uneven Cluster, bunch in search redundant node, and close redundant node and make it enter resting state.When detecting redundant node, in order to the energy consumption of balanced node better, bunch interior nodes is sorted from small to large by energy, and the ID of node is stored in successively in the set of clusterNodes by name, in set there is an index mark in each element, and when judging redundant node, cluster head distributes sequential to bunch interior nodes by the size of index+1, node judges according to the carrying out of the size of sequential in the sequential of oneself, i.e. each all judgements from the node that energy is minimum.Determination methods is: the non-cluster head node whether having more than 4 or 4 in nodal test monitoring radius R, these nodes are called N isensing node, if there is the angle of at least 4 sensing nodes counterclockwise between adjacent node to meet and be greater than 60 ° and be less than 120 ° simultaneously, the distribution map of overlay area sensing node as shown in Figure 3, then this node redundancy, now its active state transfers resting state to, and send a sleep messages to its sensing node, avoid the dormancy simultaneously of adjacent two nodes and the monitoring cavitation that occurs, start a sleep timer T simultaneously sleepensure 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 dormancy of redundant node, active node enters stationary operational phase.This stage mainly completes collection and the transmission of data.Within this stage bunch, the energy ezpenditure of ordinary node is mainly the energy sending data consumes, as shown in formula (3), wherein, and E elecfor the energy of circuitry consumes, d is the distance of sender and recipient, works as d<d 0shi Caiyong free space model, transmitting power is d 2decay, works as d>d 0or adopting multipath attenuation model when disturbing larger, transmitting power is d 4decay.ε fs, ε mpbe respectively the energy proportion coefficient that in these two kinds of models, power amplification consumes.
E Tx ( l , d ) = E Tx - elec ( l ) + E Tx - amp ( l , d ) = lE elec + l&epsiv; fs d 2 , d < d 0 lE elec + l&epsiv; mp d 4 , d &GreaterEqual; d 0 - - - ( 3 )
The energy that cluster head consumes is as shown in formula (4).Wherein, S iin running order ordinary node number in representing bunch.
E(CH i)＝S ikE elec+(S i+1)kE DA+k(E elec+ε mpd 4) (4)
The adjustment of step 4, bunch interior nodes role and state
First redundant node sleep timer T sleeparrive, redundant node transfers operating state to from sleep state; All nodes in next bunch send the message with oneself ID and dump energy to last round of cluster head, cluster head sorts according to the dump energy of node, upgrade clusterNodes set, select the maximum node of energy and serve as epicycle cluster head, announce the ID of new cluster head to other node and send the message of carrying clusterNodes information to new cluster head; Whether the method decision node then by judging redundant node in each bunch is redundant node; If certain node is defined as redundant node, then transfer this node to sleep state immediately, if certain node determines it is not redundant node, then continue to judge another node, until all node checks are complete.
After the node role of step 5, step 4 and state have adjusted, circulation performs step 3, step 4, until all node energies run out of.
As shown in Figure 4, the wireless sensor network (WSN) emulation time is identical, a kind of wireless sensor network of the present invention Uneven Cluster node scheduling method node is dispatched after network gross energy be far longer than the network gross energy of other two kinds of existing classical ways.
As shown in Figure 5, the wireless sensor network (WSN) emulation time is identical, a kind of wireless sensor network of the present invention Uneven Cluster node scheduling method node is dispatched after surviving node number far away more than the node amount of survival of other two kinds of existing classical ways.
A kind of wireless sensor network Uneven Cluster of the present invention node scheduling method, Uneven Cluster is dispatched with redundant node and combines, make the energy ezpenditure of each node more balanced, and improve capacity usage ratio, save network gross energy, effectively extend Network morals.

Claims (7)

1. a wireless sensor network Uneven Cluster node scheduling method, is characterized in that, specifically implements according to following steps:
The election of step 1, Uneven Cluster cluster head and complete Uneven Cluster;
Step 2, after step 1 completes sub-clustering heterogeneous, bunch in search redundant node, and close redundant node and make redundant node enter resting state;
Step 3, after the scheduling dormancy of completing steps 2 redundant node, active node enters steady-working state;
Step 4, after active node work completes in step 3, bunch interior nodes role and state to be adjusted;
Step 5, after the node role of step 4 and state have adjusted, circulation step 3, step 4 are performed, until all node energies run out of.
2. a kind of wireless sensor network Uneven Cluster node scheduling method according to claim 1, it is characterized in that, concrete way to elect and the Uneven Cluster of described step 1 cluster head are: the energy of the cluster head consumption that distance aggregation node is near is less, the energy consumed away from the cluster head of aggregation node is more, therefore more away from aggregation node formed bunch less, with communication consumption larger between balancing bunch; The 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 more away from aggregation node formed bunch less, to each election contest cluster head node, a competition radius R is set compete, R competeit is nodal distance convergent point distance and the function of region node density; Each election contest cluster head node competition radius N i.R competeformula be:
N i . R compete = ( 1 - c d ( N i , BS ) - d min d max - d min ) ( 1 - &rho; ) R set ,
ρ＝(N nei(i)-1)/N all
Wherein, wherein d maxand d minrepresent the node in network respectively to the ultimate range of convergent point and minimum range; C is the parameter for controlling span, value between 0 ~ 1; ρ is the density factor of node region; D (N i, BS) and be the distance of sensor node to aggregation node; N iit is any node in network; I is the label of any sensor node in network area; R setpreset maximum contention radius; N neii () is neighbor node number; N allit is surviving node number in whole network.
3. a kind of wireless sensor network Uneven Cluster node scheduling method according to claim 2, is characterized in that, in described cluster head election contest process, if candidate is cluster head N iannounce its carry an election, then at N icompetition radius N i.R competeinterior all candidate's cluster heads all can not become final cluster head, need to exit election contest process, and add N ibecome N ibunch in member, all become ordinary node, simultaneously these nodes add final cluster head N i, form one with N ifor cluster head, N icompetition radius in other candidate's cluster heads be bunch in bunch of rank and file.
4. a kind of wireless sensor network Uneven Cluster node scheduling method according to claim 1, it is characterized in that, the specific implementation process of described step 2 is: bunch interior nodes sorted from small to large by energy, and the ID of node is stored in successively in the set of clusterNodes by name, in set there is an index mark in each element, when judging redundant node, cluster head distributes sequential to bunch interior nodes by the size of index+1, node all determines whether redundant node at every turn from the node that energy is minimum, if redundant node, then this node enters sleep state immediately, and send a sleep messages to its sensing node, avoid the dormancy simultaneously of adjacent two nodes and the monitoring cavitation that occurs, start a sleep timer T simultaneously sleepensure to be in active state when next round starts.
5. a kind of wireless sensor network Uneven Cluster node scheduling method according to claim 1, it is characterized in that, the specific implementation process of described step 3 is: bunch interior nodes gathers the information in monitored area, in the sequential of oneself transmission data, adopt CSMA MAC protocol to send data to its cluster head; Cluster head node receive from bunch in the information of each node, send to convergent point in single-hop mode after being merged.
6. a kind of wireless sensor network Uneven Cluster node scheduling method according to claim 1, it is characterized in that, the specific implementation process of described step 4 is: first redundant node sleep timer T sleeparrive, redundant node transfers operating state to from sleep state; All nodes in next bunch send the message with oneself ID and dump energy to last round of cluster head, cluster head sorts according to the dump energy of node, upgrade clusterNodes set, select the maximum node of energy and serve as epicycle cluster head, announce the ID of new cluster head to other node and send the message of carrying clusterNodes information to new cluster head; Whether the method decision node then by judging redundant node in each bunch is redundant node; If certain node is defined as redundant node, then transfer this node to sleep state immediately, if certain node determines it is not redundant node, then continue to judge another node, until all node checks are complete.
7. a kind of wireless sensor network Uneven Cluster node scheduling method according to claim 4 or 6, it is characterized in that, describedly judge that the determination methods of redundant node is: the non-cluster head node whether having more than 4 or 4 in nodal test monitoring radius R, these nodes are called the sensing node of Ni, if there is the angle of at least 4 sensing nodes counterclockwise between adjacent node to meet 60 ° ~ 120 ° simultaneously, then this node redundancy, now its active state transfers resting state to.
CN201410549072.1A 2014-10-16 2014-10-16 A kind of wireless sensor network Uneven Cluster node scheduling method Active CN104301965B (en)

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 true CN104301965A (en) 2015-01-21
CN104301965B 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)

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107801170A (en) * 2017-11-06 2018-03-13 潘柏霖 Warmhouse booth supervising device
CN108055683A (en) * 2017-12-29 2018-05-18 东北林业大学 A kind of underwater wireless sensor network energy balance and the method for keeping covering
CN108107748A (en) * 2018-01-19 2018-06-01 赵然 A kind of smart home environment control system
CN108173346A (en) * 2018-01-19 2018-06-15 深圳市鑫汇达机械设计有限公司 Smart power grid power transmission line height monitoring warning device
CN108271136A (en) * 2018-01-19 2018-07-10 深圳市鑫汇达机械设计有限公司 Geotechnical engineering safety intelligent monitor system
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
CN110113807A (en) * 2019-05-05 2019-08-09 辽宁大学 Based on the node dormancy dispatching method of data similarity in wireless sensor network
CN111010710A (en) * 2019-12-14 2020-04-14 贵州电网有限责任公司 Sensor network transmission method based on load balancing in power equipment communication
CN109688556B (en) * 2019-01-10 2020-09-11 广东省信息网络有限公司 System and method for data transmission and processing
CN111836335A (en) * 2020-06-22 2020-10-27 中国科学院上海微系统与信息技术研究所 Event-driven-based wireless sensor network topology management method
CN112506215A (en) * 2020-11-18 2021-03-16 广州工程技术职业学院 Internet of things data acquisition method and unmanned aerial vehicle
CN110718103B (en) * 2019-09-19 2021-04-09 深圳供电局有限公司 Transformer substation electrical equipment simulation operation system based on VR simulation training
CN112888041A (en) * 2020-12-30 2021-06-01 电子科技大学 Wireless sensor network communication method based on non-uniform node deployment
CN112996078A (en) * 2021-02-04 2021-06-18 南京邮电大学 Non-uniform clustering method for energy load balancing and non-uniform clustering routing method

Citations (3)

* Cited by examiner, † Cited by third party
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

Patent Citations (3)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
凡高娟,孙力娟,王汝传,黄海平,肖甫,李靖: "非均匀分布下无线传感器网络节点调度机制", 《通信学报》 *
吴华君,张自力,李卫: "一种适用于煤矿井下无线传感网的能量均衡路由协议", 《计算机科学》 *
孙超,赵路路,张影,刘彬,郝晓辰: "无线传感器网络分簇拓扑的覆盖区域节点调度优化算法研究", 《传感技术学报》 *
李成法,陈贵海,叶懋,吴杰: "一种基于非均匀分簇的无线传感器网络路由协议", 《计算机学报》 *

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107801170A (en) * 2017-11-06 2018-03-13 潘柏霖 Warmhouse booth supervising device
CN108055683A (en) * 2017-12-29 2018-05-18 东北林业大学 A kind of underwater wireless sensor network energy balance and the method for keeping covering
CN108055683B (en) * 2017-12-29 2021-02-05 东北林业大学 Method for balancing energy consumption and keeping coverage of underwater wireless sensor network
CN108107748A (en) * 2018-01-19 2018-06-01 赵然 A kind of smart home environment control system
CN108173346A (en) * 2018-01-19 2018-06-15 深圳市鑫汇达机械设计有限公司 Smart power grid power transmission line height monitoring warning device
CN108271136A (en) * 2018-01-19 2018-07-10 深圳市鑫汇达机械设计有限公司 Geotechnical engineering safety intelligent monitor system
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
CN110113807A (en) * 2019-05-05 2019-08-09 辽宁大学 Based on the node dormancy dispatching method of data similarity in wireless sensor network
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
CN111010710A (en) * 2019-12-14 2020-04-14 贵州电网有限责任公司 Sensor network transmission method based on load balancing in power equipment communication
CN111010710B (en) * 2019-12-14 2023-06-02 贵州电网有限责任公司 Sensor network transmission method based on load balancing in power equipment communication
CN111836335A (en) * 2020-06-22 2020-10-27 中国科学院上海微系统与信息技术研究所 Event-driven-based wireless sensor network topology management method
CN112506215A (en) * 2020-11-18 2021-03-16 广州工程技术职业学院 Internet of things data acquisition method and unmanned aerial vehicle
CN112888041A (en) * 2020-12-30 2021-06-01 电子科技大学 Wireless sensor network communication method based on non-uniform node deployment
CN112888041B (en) * 2020-12-30 2022-04-15 电子科技大学 Wireless sensor network communication method based on non-uniform node deployment
CN112996078A (en) * 2021-02-04 2021-06-18 南京邮电大学 Non-uniform clustering method for energy load balancing and non-uniform clustering routing method

Also Published As

Publication number Publication date
CN104301965B (en) 2018-07-03

Similar Documents

Publication Publication Date Title
CN104301965A (en) Wireless sensor network inhomogeneous cluster node scheduling method
CN107211368B (en) Network of nodes, battery-powered node and method of managing a battery-powered node
CN102149160B (en) Energy perception routing algorithm used for wireless sensing network
CN108712767B (en) Inter-cluster multi-hop routing control method with balanced energy consumption in wireless sensor network
CN101959244B (en) Method for controlling hierarchical type route suitable for wireless sensor network
CN103298032A (en) Node energy consumption balancing method for wireless sensor network
CN102158927A (en) Efficient inhomogeneous clustering routing method of wireless sensor network
CN105636143A (en) Wireless sensor network clustering collaborative routing algorithm based on cooperative game
CN101267391A (en) Wireless sensor network topology control method based on non-uniform sections
CN103281769A (en) Energy consumption balancing method of isomerism wireless sensor network unequal clustering
CN101854666A (en) Customized trans-regional and multi-hop routing method for wireless sensor network
CN103228022A (en) Probability type wireless sensor network routing method based on energy harvesting
Cao et al. Performance evaluation of energy efficient ad hoc routing protocols
CN104410997A (en) Method for establishing hierarchical topology structure applied to wireless sensor network
CN102970723A (en) Non-uniform clustering routing algorithm with local cluster reconstruction
CN103781143A (en) Cluster tree hierarchical wireless sensor network routing method with optimized energy efficiency
CN102612083A (en) Method for constructing connected dominating set based on exclusive region in wireless sensor network
CN104602302A (en) ZigBee network energy balance routing method based on cluster structure
CN104080144A (en) Gradient based energy-efficient uneven clustering data forwarding method
CN102802230A (en) Energy-efficient wireless sensor network routing algorithm
CN108566658B (en) Clustering algorithm for balancing energy consumption in wireless sensor network
CN104994020A (en) Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model
CN101951656A (en) Method for designing wireless network routing protocol with energy efficiency and coding perception
CN103945508A (en) Wireless-sensing-network topology construction method based on probability comparison
Aziz et al. A new improved algorithm of leach protocol for wireless sensor networks

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