CN104135752B - A kind of wireless sensor network cluster head node system of selection and cluster-dividing method - Google Patents
A kind of wireless sensor network cluster head node system of selection and cluster-dividing method Download PDFInfo
- Publication number
- CN104135752B CN104135752B CN201410371867.8A CN201410371867A CN104135752B CN 104135752 B CN104135752 B CN 104135752B CN 201410371867 A CN201410371867 A CN 201410371867A CN 104135752 B CN104135752 B CN 104135752B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- wireless sensor
- sensor network
- leader cluster
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- 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
- Arrangements For Transmission Of Measured Signals (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of wireless sensor network cluster head node system of selection, belong to wireless sensor network technology field.The present invention is not enough for prior art, when carrying out the selection of leader cluster node, the influence of the position distribution and dump energy of node to whole network life cycle is considered, and it is the priority argument quantified by the positional information of node and dump energy information fusion to utilize fuzzy algorithmic approach, and then realize more reasonably cluster-head node selection.The invention also discloses a kind of network clustering method of wireless sensor, the selection of leader cluster node is carried out using the above method, and adaptively enter Mobile state adjustment to leader cluster node according to the Energy Expenditure Levels of leader cluster node.Compared with prior art, the present invention can effectively improve the life cycle of wireless sensor network, and algorithm is simpler.
Description
Technical field
The present invention relates to a kind of wireless sensor network cluster head node system of selection and cluster-dividing method, belong to wireless senser
Network technique field.
Background technology
In wireless sensor network, the life cycle for weighing a sensor network is typically the residual energy according to node
Measure to determine.One sensor network is started working until wherein there is the energy of node zero from networking, and this period is just
It is the life cycle of the sensor network.So the life cycle in order to extend whole sensor network, reasonable control node
Energy ezpenditure is particularly important.
Node provides message for the neighbor node in current transmission scope according to network topology and received and forwarding service, with
The transmission of data traffic, the wireless receiving and dispatching energy consumption of node and the idle expense of communication module cause the energy content of battery of node itself
Constantly reduction.Under normal circumstances, node is in the data for being not known by needing forwarding and not communication close mould when undertaking forwarding task
Block, and the communication module of node can still intercept the occupancy situation of wireless channel in idle condition and detect the transmission of interesting data
Demand, when node in a state in which when, the energy consumption of node is approached with data transmit-receive state.This allows for whole wireless senser
Idle node in network can carry out many meaningless energy consumptions, so that the life cycle that whole wireless senser was played is obvious
Shorten.
In order to improve this problem, the energy of node is set more reasonably to use, sub-clustering mechanism meets the tendency of.Global network
Topology will be divided into several connected cluster regions, leader cluster node be elected according to set algorithm in every piece of cluster, by cluster head
Node constitutes the backbone network through whole topology, and all idle nodes of the dormancy in addition to leader cluster node, so that significantly
Degree intercepts consumption of the behavior to node energy when reducing idle condition, and then is finally reached and extends whole wireless sensor network
The purpose of network life cycle.
The leader cluster node selected according to set algorithm is in addition to the association's reconciled data forwarding task that need to undertake cluster interior nodes, typically
It should also have data fusion function.Sub-clustering mechanism has permeated the theory of clustering management, compensate for idle in common topological structure
The too high defect of the meaningless energy consumption of node of state, the network topology of sub-clustering is conducive to the application of distributed algorithm, is adapted to extensive
The network of deployment.
GAF algorithms are a kind of traditional cluster head selection algorithms of comparison, and it is the cluster algorithm based on node geo-location.Will
Target area is divided into cluster head node in several adjacent and nonoverlapping regions, region and is always maintained at regaining consciousness, non-leader cluster node
In not forwarding information in a dormant state.The selection of cluster head is that the timing for having node to produce is random in each region in the algorithm
What value was determined, the deficiency of this algorithm is that it does not take into account the dump energy of node, so as to cause some energy mistakes
Low node is chosen as cluster head, then directly shortens the life cycle of whole network.
LEACH algorithms are also a kind of very classical cluster head selection algorithm, and it is also according to random first when selecting cluster head
Count to determine cluster head, then select the cluster head nearest from oneself to be attached to form a cluster according to other nodes.LEACH algorithms
In each node to turn into the probability of cluster head be almost equal, so LEACH algorithms have reached energy well on node energy
Amount is balanced, but the deficiency of the algorithm, which is it, does not account for geographical position residing for cluster head node, and cluster head distribution is not
Uniformly, it is possible to there is the maximum communication scope that the distance between two cluster heads have exceeded node, this is possible to lead
Causing whole backbone network can not form.
In summary, existing cluster head selection algorithm generally existing Consideration is single, fail farthest to extend wireless
The deficiency of sensor network life cycle.
The content of the invention
The technical problems to be solved by the invention are to overcome prior art not enough there is provided a kind of wireless sensor network cluster
Head node system of selection and cluster-dividing method, have considered the position distribution and dump energy of node to whole network life cycle
Influence, and realize the determination of leader cluster node with reference to fuzzy algorithmic approach, be capable of the life cycle of effective prolonging wireless sensor network,
And algorithm is simple, resource consumption is small.
The present invention solves above-mentioned technical problem using following technical scheme：
A kind of wireless sensor network cluster head node system of selection, for each cluster in the wireless sensor network,
The maximum node of sum is weighed as the leader cluster node of the cluster apart from priority and energy priority using in the cluster；The distance of the node
PriorityD, energy priority powerPCalculated respectively according to below equation：
,
,
Wherein,dThe average distance of the node other each nodes into place cluster is represented,、Where representing respectively
The maximum and minimum value of each node average distance of other each nodes into place cluster in cluster,pRepresent the current surplus of the node
Complementary energy,Represent the primary power of the node.
A kind of network clustering method of wireless sensor, comprises the following steps：
Step A, the target area that wireless sensor network is covered is divided into some subregions；
Step B, the leader cluster node for selecting using cluster head system of selection as described above all subregion, selected each cluster head
Node is set up with other nodes of subregion where it be connected respectively；Each leader cluster node judges that connected nodes are respectively
It is no to exceed default maximum number of connections, in this way, then distance priority power and energy priority are rejected from these connected nodes
Several maximum preceding nodes of sum are weighed so that connected nodes are equal to the maximum number of connections, if not, the company of holding
State is connect constant, so as to be formed and several the same number of clusters of the subregion；And this that each leader cluster node is rejected
A little nodes are then weighed using wherein distance priority and weigh the maximum node of sum as leader cluster node with energy priority, constitute one it is new
Cluster；
Step C, wireless sensor network start normal operation, when the number of times for having some leader cluster node transmission data reaches
Node total number in subregion where to it in addition to leader cluster node, then go to step B；Circulate according to this, until whole wireless sensing
Device network failure.
Preferably, the target area that wireless sensor network is covered is divided into some subregions, specific as follows：
The target area that wireless sensor network is covered is divided into one group of adjacent and non-overlapping copies length of sideTimes node maximum
The square area of covering radius.
Compared with prior art, the invention has the advantages that：
（1）The present invention has more reasonably considered the dump energy of euclidean distance between node pair and node to whole network life
The influence in cycle, effectively extends the life cycle of whole wireless sensor network.
（2）The present invention, which combines fuzzy theory, can directly be judged by the calculating of a membership function and select cluster head,
So so that the selection course of whole leader cluster node is simplified.
Brief description of the drawings
Fig. 1 is the process schematic that node is rejected when leader cluster node exceedes maximum number of connections.
Embodiment
Technical scheme is described in detail below in conjunction with the accompanying drawings：
The present invention is in view of the shortcomings of the prior art, when carrying out the selection of leader cluster node, considered the position point of node
The influence of cloth and dump energy to whole network life cycle, and fuzzy algorithmic approach is utilized by the positional information and dump energy of node
Information fusion is the priority argument quantified, and then realizes the division of more reasonably cluster-head node selection and cluster, and final realize is prolonged
The purpose of long wireless sensor network life cycle.
Fuzzy rule embodies human brain understanding, judges the feature of things, and digitized, accurate judgement is changed to have and is subordinate to
Category degree, fuzzy judgement.So-called criterion is carried out obfuscation by it, exactly can be used to solve similar a variety of inhomogeneities
The fusion problem of shape parameter.Can be between choosing comprehensively parameter index and parameter index and final performance index in evaluation procedure
Between relation, auxiliary make appropriate decision-making.And fuzzy decision algorithm is simple, occupancy resource is few, is suitable for wireless senser
The application of network environment.
The cluster-dividing method of the present invention can pass through centralization（I.e. base station is participated in）Form realize, can also pass through distributed side
Formula（Independently realized by the information exchange between cluster interior joint）.Below in a distributed manner exemplified by implementation, to skill of the present invention
Art scheme is described in detail.
Assuming that in the target area of a continuous level, deploying a wireless sensor network, node therein is
Random distribution.The clustering process of the wireless sensor network is specific as follows：
Step 1, the target area that wireless sensor network is covered is divided into some subregions；Specific region division
Following methods can be used according to actual conditions sets itself in the present embodiment：
The target area covered to this wireless sensor network carries out overall division, is divided into adjacent one by one
The length of side beThe square area of times node maximal cover radius.It is spaced between each square to be that close-packed arrays do not have.
With each piece of square area diagonal intersection point（That is the center of square area）Coordinate as each square area volume
Number.When the node that all nodes in each square area constitute in an initial cluster, each region sends information
Non- leader cluster node in capital inclusion region number information, different zones cannot be connected with each other, the purpose for the arrangement is that
It is mutually distinguishable for the ease of the sensor node in the same area, while mutually dry between it also avoid different zones node
Disturb.
Step 2, each node calculate itself according to range information turns into the priority of leader cluster node, and the priority is defined
Weighed for distance priority.Due to being unevenly distributed for actual conditions lower sensor nodes, so the nodes in each region
Differ, but the mechanism that cluster head is chosen in each cluster is identical.Here illustrated with any one square area：
All nodes in step 2-1, first region（It is assumed to beNIt is individual）To other node broadcasts of one's respective area position of oneself
Information, so can know oneself with the distance between other nodes of region, being designated as any one node therein：d 1 、d 2 、d 3 、..... 、d N-1 ；
Step 2-2, set the node to same other nodes of region average distance asd, the data in previous step
Average distance can be calculatedD,Computing formula is：
For convenience of description, it is assumed herein that have 6 nodes in a square area, and calculate them each
Average distance be respectively from node 1 to node 6：4m、4m、6m、8m、12m、10m。
The information of the average distance for each node that step 2-3, basis are obtained, we obtain the region after can counting
In maximum in all average distancesd max And minimum valued min .In data assumed above,d max For 12m,d min For 4m。
Step 2-4, set node as leader cluster node distance priority weigh value asD, thenDCan be according to numerical value above
Calculated and obtained by his membership function, computing formula is：
Here useDxTo representxIndividual node thoroughly does away with the priority that average distance is determined, can calculateD 1ArriveD 6Value difference
For：1、1、0.75、0.5、0、0.25.Due todScope be [d min ,d max ], soDScope be that this is interval in [0,1]
Interior.And for whole wireless sensor network, through the life cycle of whole sensor network, this value is will not
Change.
Step 3, egress can also be calculated according to the dump energy of sensor node turn into the priority of leader cluster node, can
Referred to as energy priority is weighed.Assuming that the primary power of node isp max , the present energy of node isp, then node is surplus according to itself
Complementary energy turns into the priority of leader cluster nodePIt can be calculated and obtained by corresponding membership function, computing formula is：
Here P is equally also usedxTo represent priority that x-th of node is determined by dump energy, it is assumed that 6 nodes are worked as above
Preceding energy is respectively 40%, 30%, 70%, 80%, 90%, the 85% of primary power, by calculating it is known that P1To P6Respectively：
0.4、0.3、0.7、0.8、0.9、0.85.Becausep≤p max , so node energy priority herePValue be in [0,1] this
In individual interval.
Step 4, step 2 is added with the value of two different priority of each node drawn in step 3, i.e., (D+P), each sensor node can calculate the comprehensive priority of itself.Understand that above-mentioned node 1 arrives node 6 according to this definition
Comprehensive priority be respectively：1.4、1.3、1.45、1.3、0.9、1.1.
Step 5, each node are after the comprehensive priority of itself is calculated, it is possible to successfully select cluster head, specific as follows:
The priority information of oneself that all nodes in step 5-1, each region are sent to other nodes of one's respective area；
The maximum node of comprehensive priority is elected as leader cluster node in step 5-2, now each region；According to data above
It is known that other nodes that node 3 is elected as in leader cluster node, region first are all attached with this leader cluster node；
The node number that step 5-3, leader cluster node pair are connected with itself is counted, if the number of connection is more than set
Maximum number of connectionsn, then coupled node is rejected successively from big to small according to comprehensive priority, until the section being connected with it
Point number is reduced ton；If the number of connection is less than set maximum number of connections, then then maintain the state to keep stable.Here
Assuming thatnFor 2, then leader cluster node will reject 3 nodes, according to data it is known that the priority of non-leader cluster node from greatly to
Small order is：Node 1>Node 2>Node 4>Node 5>Node 6, so that according to above rule, node 1, node 2, node 4
The rejecting information that cluster head is sent will be received, then departs from cluster head, node revocation process is as shown in Figure 1.
Step 5-4, the node being removed for those, they will form the region according to original regular networking again
In a new cluster.It can be seen from above rule, the maximum node 1 of comprehensive priority will be chosen as second cluster head section
Point, and node 2 and node 4 will connect second cluster for forming the region with it.
Step 6, complete after leader cluster node election, sensor network starts normal operation, until being had in leader cluster node
The number of times of some leader cluster node transmission data reaches the number of non-leader cluster node in the place square area, that is to say, that when having
Some cluster head is consumed equivalent to the energy that primary information is respectively forwarded for all non-leader cluster nodes in the region, then next round cluster head choosing
Act starts, then continues to choose suitable node as cluster head according to this rule, until whole network failure.Superincumbent example
In, leader cluster node has two, and remaining non-leader cluster node has 4, the letter of any one forwarding among two leader cluster nodes
When breath number is 4, whole network will carry out next round election of cluster head.
Claims (2)
1. a kind of network clustering method of wireless sensor, it is characterised in that comprise the following steps：
Step A, the target area that wireless sensor network is covered is divided into some subregions；
Step B, the leader cluster node for selecting all subregion, selected each leader cluster node are other with subregion where it respectively
Node sets up connection；Each leader cluster node judges whether connected nodes exceed default maximum number of connections respectively, in this way,
Distance priority power and several nodes before energy priority power sum maximum are then rejected from these connected nodes so that
Connected nodes are equal to the maximum number of connections, if not, keeping connection status constant, so as to be formed and the sub-district
Several the same number of clusters of domain；And these nodes that each leader cluster node is rejected are then with wherein distance priority power and energy
The maximum node of priority sum constitutes a new cluster as leader cluster node；Wherein, in the wireless sensor network
Each cluster, weigh the maximum node of sum as the leader cluster node of the cluster apart from priority and energy priority using in the cluster, it is described
The distance priority power D of node, energy priority power P are calculated according to below equation respectively：
Wherein, d represents the average distance of the node other each nodes into place cluster, dmax、dminIt is each in cluster where representing respectively
The maximum and minimum value of node average distance of other each nodes into place cluster, p represent the current remaining of the node,
pmaxRepresent the primary power of the node；
Step C, wireless sensor network start normal operation, when the number of times for having some leader cluster node transmission data reaches it
Node total number in the subregion of place in addition to leader cluster node, then go to step B；Circulate according to this, until whole wireless sensor network
Network fails.
2. network clustering method of wireless sensor as claimed in claim 1, it is characterised in that described by wireless sensor network institute
The target area of covering is divided into some subregions, specific as follows：The target area that wireless sensor network is covered is divided
It is into one group of adjacent and non-overlapping copies length of sideThe square area of times node maximal cover radius.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410371867.8A CN104135752B (en) | 2014-07-31 | 2014-07-31 | A kind of wireless sensor network cluster head node system of selection and cluster-dividing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410371867.8A CN104135752B (en) | 2014-07-31 | 2014-07-31 | A kind of wireless sensor network cluster head node system of selection and cluster-dividing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104135752A CN104135752A (en) | 2014-11-05 |
| CN104135752B true CN104135752B (en) | 2017-07-11 |
Family
ID=51808257
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410371867.8A Active CN104135752B (en) | 2014-07-31 | 2014-07-31 | A kind of wireless sensor network cluster head node system of selection and cluster-dividing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104135752B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107360587B (en) * | 2016-05-09 | 2020-06-05 | 钱凌 | Wireless sensor network failure beacon identification method based on power grid monitoring application |
| CN106488524A (en) * | 2016-11-11 | 2017-03-08 | 北京信息科技大学 | Method is route based on the wireless sense network that energy approaches |
| CN108712760B (en) * | 2018-03-29 | 2019-11-19 | 北京邮电大学 | High-throughput relay selection method based on random Learning Automata and fuzzy algorithmic approach |
| CN108900996A (en) * | 2018-07-04 | 2018-11-27 | 中国海洋大学 | A kind of wireless sensor network data transmission method based on the double-deck fuzzy algorithmic approach |
| CN110536372B (en) * | 2019-07-17 | 2022-05-31 | 长春工业大学 | Non-uniform clustering method for annular wireless sensor network based on fuzzy control |
| CN113191505B (en) * | 2021-05-21 | 2022-05-20 | 电子科技大学 | Method for placing geographically distributed machine learning parameter server |
| CN113873611B (en) * | 2021-09-24 | 2023-10-31 | 天津津航计算技术研究所 | Adaptive competition method for wireless network cluster head |
| CN115396981B (en) * | 2022-10-28 | 2023-01-17 | 吉林信息安全测评中心 | Intelligent monitoring system based on big data technology |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102665251A (en) * | 2012-05-25 | 2012-09-12 | 重庆大学 | WSN (Wireless Sensor Network) distributed-type non-uniform clustering method |
| CN103796273A (en) * | 2014-01-20 | 2014-05-14 | 南京邮电大学 | Energy-balanced clustering routing strategy for wireless sensor networks |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20070114672A (en) * | 2007-10-15 | 2007-12-04 | 숭실대학교산학협력단 | An efficient clustering scheme for ad hoc networks with adaptive control of hello message peridos |
-
2014
- 2014-07-31 CN CN201410371867.8A patent/CN104135752B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102665251A (en) * | 2012-05-25 | 2012-09-12 | 重庆大学 | WSN (Wireless Sensor Network) distributed-type non-uniform clustering method |
| CN103796273A (en) * | 2014-01-20 | 2014-05-14 | 南京邮电大学 | Energy-balanced clustering routing strategy for wireless sensor networks |
Non-Patent Citations (2)
| Title |
|---|
| A Hierarchical Clustering Algorithm Based on Energy and Distance Balancing for WSN;Xin-fang Yan等;《Intelligent Computation Technology and Automation (ICICTA), 2012 Fifth International Conference on》;20120213;全文 * |
| 基于能量和距离的无线传感器网络分簇算法;陈浩等;《信息化纵横》;20091130;正文第2-3章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104135752A (en) | 2014-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104135752B (en) | A kind of wireless sensor network cluster head node system of selection and cluster-dividing method | |
| CN108566663B (en) | SDWSN energy consumption balance routing method based on disturbance particle swarm optimization | |
| Zhang et al. | A new clustering routing method based on PECE for WSN | |
| Abdulzahra et al. | Optimizing energy consumption in WSN-based IoT using unequal clustering and sleep scheduling methods | |
| Li et al. | Age-of-information aware scheduling for edge-assisted industrial wireless networks | |
| CN104219704B (en) | Monitoring poisonous gas and method for tracing based on double layer grid model in wireless sensor network | |
| Farman et al. | Grid‐based hybrid network deployment approach for energy efficient wireless sensor networks | |
| CN104981002B (en) | A kind of location determining method of sink nodes in wireless sensor network | |
| CN104469879B (en) | A kind of dynamic k value cluster routing methods | |
| CN101959244A (en) | Method for controlling hierarchical type route suitable for wireless sensor network | |
| CN106572513A (en) | Wireless sensor routing algorithm based on fuzzy multi-attribute decision | |
| Perera et al. | A WPT-enabled UAV-assisted condition monitoring scheme for wireless sensor networks | |
| CN113411766B (en) | Intelligent Internet of things comprehensive sensing system and method | |
| CN107690167A (en) | A kind of expansible network clustering method of wireless sensor | |
| Ko et al. | Neighbor-aware energy-efficient monitoring system for energy harvesting internet of things | |
| CN105979539B (en) | Based on the cluster-dividing method of fuzzy logic in mobile ad-hoc network | |
| CN104168661A (en) | Transmission scheduling method for network lifetime maximization that satisfies fairness condition | |
| CN103874158A (en) | Novel clustering routing algorithm | |
| CN114980252B (en) | Low-power-consumption sleep control method and system for terminal equipment of Internet of things | |
| TWI473522B (en) | Method and system for hierarchical clustering of wireless sensor networks | |
| Dai et al. | An overlapping coalitional game for cooperative spectrum sensing and access in cognitive radio networks | |
| CN103826282B (en) | Set based on dump energy divides multi-hop routing method | |
| Farahani | Energy Consumption Reduction in Wireless Sensor Network Based on Clustering | |
| Kasturi et al. | An improved energy efficient solution for routing in IoT | |
| Soni et al. | An investigation on energy efficient routing protocol for wireless 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 |