CN107333314A - A kind of wireless sense network cluster is built and its cluster head update method - Google Patents
A kind of wireless sense network cluster is built and its cluster head update method Download PDFInfo
- Publication number
- CN107333314A CN107333314A CN201710527350.7A CN201710527350A CN107333314A CN 107333314 A CN107333314 A CN 107333314A CN 201710527350 A CN201710527350 A CN 201710527350A CN 107333314 A CN107333314 A CN 107333314A
- Authority
- CN
- China
- Prior art keywords
- cluster
- node
- mrow
- cluster head
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- 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/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Built the invention discloses a kind of wireless sense network cluster and cluster head update method, belong to wireless sensor network field, which solve the problem of existing wireless sense network clustering architecture stability is not high.The construction method of the present invention is built by using aggregation node as starting point, from the close-by examples to those far off completing the multi-level cluster of the whole network；The 0th layer of cluster network is divided into specifically centered on aggregation node, by the sensor node in sensor node radio communication radius, the structure of the 1st layer of cluster network is then carried out using node energy consumption equilibrium strategy；Again from upper layer network bunch member node, election possesses the node of maximum cluster head ability value as the cluster head of lower floor's cluster network and builds lower floor's cluster network, and iteration builds the 2nd layer and other layer of cluster network successively.The hierarchy type clustering architecture that the present invention is constructed has stability high, distributed the characteristics of cluster updates on demand, overcomes conventional method periodicity the whole network cluster and updates brought great number cluster maintenance costs.
Description
Technical field
The invention belongs to wireless sensor network field, specifically, it is related to a kind of multi-level cluster of wireless sense network and builds
With cluster head update method.
Background technology
Clustering topology is easy to management, is conducive to the application of distributed routing algorithm, with preferable scalability, fits
Close massive wireless sensor application.Clustering route protocol generally splits the network into cluster, and each cluster is by cluster head and multiple
Cluster member composition, cluster head manages or controls member node in whole cluster, and data pass through multi-hop transmission between cluster head to aggregation node.Point
The primary goal of cluster Design of Routing Protocol is to form rational network structure by efficient cluster algorithm, passes through effective cluster head
Rotation mechanism ensures network connectivty, extends Network morals.Therefore, cluster stability into communication connection performance it is good and bad,
The height of cluster maintenance costs and the main determining factor of network operation cycle length, improve cluster stability, reduction cluster and rebuild frequency
It is the important goal of cluster developing algorithm with maintenance costs.
For Wireless sensor network clustering route, the formation of generation, cluster and the data transfer of cluster around cluster head and set
Many wireless sense network Clustering Routings are counted.《The wireless sensor network data of Energy-aware collects agreement》, software
Report, 2007,18 (5)：1092-1109, author Liu Ming, Cao Jiannong, Chen Guihai etc., are disclosed based on node itself and its neighbours' section
Point dump energy design election of cluster head and cluster constructing plan, the subgraph formed by adjusting cluster head covering radius to ensure by cluster head connect
The general character, then build convergence tree transmission data.But when network load is larger, the data transfer between different cluster members is easily produced
Conflict so that cluster head is collected data efficiency and declined, so as to be easily caused network congestion.《efficient routing
algorithm based on unequal clustering and connected graph in wireless sensor
networks》, International Journal of Wireless Information Networks, 2016,23 (2):
141-150, author Xia H, Zhang R, Yu J, are disclosed by adjusting the communication radius of sensor node by sensor network
Uneven Cluster is carried out, then using connected graph Theoretical Design route selection algorithm.But only consider that Energy volution is avoided, and is made during sub-clustering
Obtain cluster network topology frequently to change to save energy consumption, cause the cost for safeguarding network stabilization excessive, cause under network performance
Drop.Data transfer is route between graph theory design cluster head is used only in routing algorithm between cluster head, ignores the letter of wireless sense network protocol stack
Breath is shared and sensor node data transmission feature, and effect of optimization is limited.
It was found from above-mentioned prior art, existing wireless sense network clustering architecture and method for routing performance is unstable, performance is uneven
Weighing apparatus；The characteristics of how using wireless-sensor network distribution type, sets up more efficient Self-configuring, by the limited model of regional area
Enclose the interaction between interior nodes and feedback of the information carrys out sub-clustering, in the interference of reduction inter-node communication, ensure the same of network operation cycle
When, improve cluster stability and network data transmission performance still needs further innovation.
The content of the invention
1st, the problem of solving
For existing wireless sense network clustering architecture stability it is not high the problem of, the present invention provides a kind of wireless sense network cluster structure
Build and cluster head update method, it is possible to increase cluster stability, improve network service performance.
2nd, technical scheme
To solve the above problems, the present invention is adopted the following technical scheme that.
A kind of multi-level clustering architecture construction method of wireless sense network,
The adjacent information of neighbor nodes of Hello message collections is regularly sent after sensor node deployment, between node, is used
Beaconing nodes location algorithm based on RSSI rangings, using aggregation node as beaconing nodes, sets up relative coordinate system, each node is protected
Deposit its coordinate information；Built by the multi-level cluster for using aggregation node as starting point, from the close-by examples to those far off completing the whole network；
Specifically include following steps,
Step A, in the netinit stage, centered on aggregation node, by sensor node radio communication radius
Sensor node is divided into the 0th layer of cluster network；Whether cluster head or cluster member are had become according to node, by all nodes in network
Be divided into cluster node and blank node, cluster node is the node for having become cluster head or cluster member, it is on the contrary then for blank node；
Step B, the 1st layer of cluster network is built using sensor node On Schemes Of Energy Balance method；
Step C, using cluster head ability value as foundation, sets up lower floor's cluster network of the 1st layer of cluster network successively, that is, sets up the 2nd,
3rd ... n-th layer cluster network, N >=2.
Preferably, sensor node On Schemes Of Energy Balance method includes in step B,
Each sensor node energy-consuming balance value in step B1, the 0th layer of cluster network described in calculation procedure A, and broadcast cluster
Request message is built, the energy-consuming balance value calculating method of node i is as follows：
The primary power of node i is represented, J is all neighbor node j of node i set；| | represent element in set
Number；D () represents the Euclidean distance between two nodes；
Step B2, after the cluster of neighbor node in receiving all 0th layer of cluster networks builds message, blank node selection has
The neighbor node of maximum energy consumption equilibrium valve adds clustering architecture by replying as cluster head into cluster message request；
Step B3, the 0th layer of cluster nodes receive blank node enter cluster message after, detect its own whether be
Destination node, if from as destination node, itself will be set to cluster head and broadcast cluster message, notifies bunch member node to enter
Enter sleep state；If node is not received from the request into clusters message as destination node yet after cluster network struction duration T time-out,
Then the node is ordinary node and enters sleep state；So far, the structure of the 1st layer of cluster network is completed.
Preferably, in step C,
Using cluster head ability value as foundation, set up the 2nd successively, the 3rd ... n-th layer cluster network, N >=2,
Concretely comprise the following steps,
Each cluster member calculates itself cluster head ability value in step C1, N-1 layers of cluster network, and then broadcast cluster builds request and disappeared
Breath；
Step C2, when blank node receives the cluster from N-1 layers of neighbor node and builds message, its cluster head ability value is protected
Deposit into neighbor table；After the cluster for receiving all upper strata neighbours cluster heads builds message, selection wherein has maximum cluster head ability
Itself cluster head of the conduct of value, is replied into cluster message；
Step C3, N-1 node layers receive n-th layer node enter cluster message after, whether detect its own is target
Node, if from as destination node, itself will be set to cluster head and broadcast cluster message, notifies bunch member node to enter to fall asleep
Dormancy state；If node is not received from the request into clusters message as destination node yet after cluster network struction duration T time-out, should
Node is ordinary node and enters sleep state.All nodes as cluster head are included in n-th layer.So far, n-th layer cluster net is completed
The structure of network；
Step C4, repeat step C1-C3, until completing the cluster network struction of whole wireless sense network.
Preferably, in step C1, the computational methods of cluster head ability value are as follows,
First, it is determined that when node i serves as cluster head role the cluster stationary value Si, calculation formula is as follows：
SiFor node i neighbor node set in same layer cluster network, r is communication radius, and d () is represented between two nodes
Euclidean distance,WithNode j dump energy and primary power is represented respectively；
Then, calculate node cluster head ability value,
ZiFor the blank node set in the range of node i communication radius；Rj(j∈Zi) it is ZiInterior joint j reported data amounts
Mathematic expectaion；PiFor in node i communication radius, and belong to the set of cluster head in N-2 layers of cluster network；| | represent set
The number of middle element.
A kind of multi-level clustering architecture of wireless sense network, is built using the above method.
Cluster head update method in a kind of multi-level clustering architecture of above-mentioned wireless sense network, comprises the following steps,
Step A, cluster head i assess whether to disclosure satisfy that continuation is carried on a shoulder pole according to factors such as dump energy, flow loads using following formula
Appoint cluster head, if following formula is unsatisfactory for, goes to step B and carry out cluster renewal；
Cluster head i dump energy is represented,Represent that the cluster head i consumed energy in a wheel data transfer is averaged
Value, CiFor cluster head i submanifold head set, UiThe member node set of cluster where cluster head i；RjWith cluster head i bunch member node j
The mathematic expectaion of reported data amount, Li、LjThe mathematic expectaion of cluster head i and its submanifold head j flow load is represented respectively；
Above-described submanifold head is relative concept, is referred in current cluster head communication radius, and belong to current cluster head
Cluster head in next layer network of place network layer；
Step B, cluster head i are by broadcasting cluster new information, and notifying its neighbor node, this enters cluster head more new state；It is then adjacent
Node j is occupied according to neighbours' cluster head information in the adjacent two layers of both sides position, j dump energy and place level, is counted as the following formula
The cluster head ability value of itself is calculated,
D () represents cluster head i and node j Euclidean distance,Represent node j dump energy, CjRepresent node j
Communication radius in cluster head set, P in lower floor's networkjRepresent cluster head set, P in upper layer network in node j communication radiuskRepresent
In node j communication radius in lower floor's network cluster head father's cluster head set, J be all neighbor node j of cluster head i set；| | table
Show the number of element in set；
Above-described father's cluster head is relative concept, is referred in current cluster head communication radius, and belong to current cluster head
Cluster head in the last layer network of place network layer；
Step C, cluster head i elect the node with maximum cluster head ability value as new cluster head, then respectively by cluster head i, new cluster
Head broadcasts cluster head in respective communication radius and changes message, and completes role transforming；
Step D, the cluster head for receiving cluster head i changes message but does not receive the node that the cluster head from new cluster head changes message
Judge whether there are cluster head neighbours in its communication range according to neighbor table, if any then to the maximum neighbours' cluster head transmission of cluster head ability value
Request adds message, otherwise into isolated node state；The maximum neighbor node relaying data of isolated node selection dump energy,
During the later stage network operation, the cluster with maximum cluster head ability value is added when such as receiving new cluster head broadcast message.
3rd, beneficial effect
Compared to prior art, beneficial effects of the present invention are：
(1) the hierarchy type clustering architecture that the present invention is constructed, forms a multi-link virtual cluster head on original network
Aggregation node is sent data to by multi-hop mode between network, cluster head, the agreements such as LEACH are overcome using single-hop transmission mode
The high energy consumption brought；
(2) the hierarchy type clustering architecture that constructs of the present invention has stability high, distributed the characteristics of cluster updates on demand, and overcomes
Conventional method periodicity the whole network cluster updates brought high costs.
Brief description of the drawings
Fig. 1 is wireless sense network cluster network structure of the present invention；
A-K is each cluster head structure in figure；It is the 0th layer of cluster network in short dash line；It is the 1st layer of cluster network in solid line；Long dotted line
It is inside the 2nd layer of cluster network；It is the 3rd layer of cluster network outside long dotted line；
Fig. 2 is the logic connecting relation figure between cluster head of the present invention (by taking cluster head i as an example)；
I in figurepThe father's cluster head for being cluster head i in upper layer network；icFor the cluster head i submanifold head in lower floor's network；iqFor
Same layer cluster head in cluster head i communication radius；
Interference scene of the data transfer that Fig. 3 is cluster head i in the specific embodiment of the invention to its all father's cluster head；
Fig. 4 is interference scenes of the cluster head i in the specific embodiment of the invention to its all submanifold head data transfer；
Fig. 5 is interference scene of the cluster head i data transfers in the specific embodiment of the invention to same layer cluster head data transfer.
Embodiment
The present invention is further described below with reference to specific embodiment.
As depicted in figs. 1 and 2, there is A-K totally 11 cluster head structures, by net in the multi-level clustering architecture of a kind of wireless sense network
Network is divided into 4 layers, respectively the 0th layer cluster network, the 1st layer of cluster network, the 2nd layer of cluster network and the 3rd layer of cluster network；Data pass through cluster
Head node is transmitted between cluster until aggregation node.
The present invention builds the cluster network completed, and logic connecting relation is existed only between the cluster head of adjacent layer, with layer network
Logic connecting relation is not present between cluster head.In the cluster head that there is logic connecting relation, the cluster head in upper layer network is referred to as father's cluster
Cluster head in head, lower floor's network is referred to as submanifold head.
Its construction method is, after sensor node deployment, and the adjacent neighbours of Hello message collections are regularly sent between node
Nodal information, using the beaconing nodes location algorithm based on RSSI rangings, using aggregation node as beaconing nodes, sets up relative coordinate
System, each node preserves its coordinate information；By the multi-level cluster structure for using aggregation node as starting point, from the close-by examples to those far off completing the whole network
Build；
Specifically include following steps,
Step A, in the netinit stage, centered on aggregation node, by sensor node radio communication radius
Sensor node is divided into the 0th layer of cluster network；Whether cluster head or cluster member are had become according to node, by all nodes in network
Be divided into cluster node and blank node, cluster node is the node for having become cluster head or cluster member, it is on the contrary then for blank node；
Step B, the 1st layer of cluster network is built using sensor node On Schemes Of Energy Balance method；
Sensor node On Schemes Of Energy Balance method comprises the following steps in this step：
Each sensor node energy-consuming balance value in step B1, the 0th layer of cluster network described in calculation procedure A, and broadcast cluster
Request message is built, the energy-consuming balance value calculating method of node i is as follows：
The primary power of node i is represented, J is all neighbor node j of node i set；| | represent element in set
Number；D () represents the Euclidean distance between two nodes.
Step B2, after the cluster of neighbor node in receiving all 0th layer of cluster networks builds message, blank node selection has
The neighbor node of maximum energy consumption equilibrium valve adds clustering architecture by replying as cluster head into cluster message request；
Step B3, the 0th layer of cluster nodes receive blank node enter cluster message after, detect its own whether be
Destination node, if from as destination node, itself will be set to cluster head and broadcast cluster message, notifies bunch member node to enter
Enter sleep state；If node is not received from the request into clusters message as destination node yet after cluster network struction duration T time-out,
Then the node is ordinary node and enters sleep state；So far, the structure of the 1st layer of cluster network is completed；
T is taken 2 seconds in this step, but T can be carried out according to network size, sensor distribution characteristics, sensor communication radius etc.
Adjustment；
The member node that the 1st layer of cluster head and the covering of these cluster heads are undertaken in this step constitutes the 1st layer of cluster network；
Step C, using cluster head ability value as foundation, sets up lower floor's cluster network of the 1st layer of cluster network successively, that is, sets up the 2nd,
3rd ... n-th layer cluster network, N >=2；Concretely comprise the following steps：
Each cluster member calculates itself cluster head ability value in step C1, N-1 layers of cluster network, and then broadcast cluster builds request and disappeared
Breath；
The computational methods of cluster head ability value are as follows,
First, it is determined that when node i serves as cluster head role the cluster stationary value Si, calculation formula is as follows：
SiFor node i neighbor node set in same layer cluster network, r is communication radius, and d () is represented between two nodes
Euclidean distance,WithNode j dump energy and primary power is represented respectively；
Then, calculate node cluster head ability value,
ZiFor the blank node set in the range of node i communication radius；Rj(j∈Zi) it is ZiInterior joint j reported data amounts
Mathematic expectaion；PiFor in node i communication radius, and belong to the set of cluster head in N-2 layers of cluster network；| | represent set
The number of middle element；
Step C2, when blank node receives the cluster from N-1 layers of neighbor node and builds message, its cluster head ability value is protected
Deposit into neighbor table；After the cluster for receiving all upper strata neighbours cluster heads builds message, selection wherein has maximum cluster head ability
Itself cluster head of the conduct of value, is replied into cluster message；
Step C3, N-1 node layers receive n-th layer node enter cluster message after, whether detect its own is target
Node, if from as destination node, itself will be set to cluster head and broadcast cluster message, notifies bunch member node to enter to fall asleep
Dormancy state；If node is not received from the request into clusters message as destination node yet after cluster network struction duration T time-out, should
Node is ordinary node and enters sleep state.All nodes as cluster head are included in n-th layer.So far, n-th layer cluster net is completed
The structure of network；
T is taken 2 seconds in this step, but T can be carried out according to network size, sensor distribution characteristics, sensor communication radius etc.
Adjustment；
Step C4, repeat step C1-C3, until completing the cluster network struction of whole wireless sense network；
The member node that n-th layer cluster head and the covering of these cluster heads are undertaken in this step constitutes n-th layer cluster network.
This method has considered the stability of cluster network, leader cluster node load with transmittability and to other clustering architectures
Influence.The definition of cluster head ability value provides support to build rational initialization cluster network.Cluster head ability value by with section
The related route number of point efficiently controls the influence that the cluster of neotectonics is produced to other already present clusters, at the same stability in use and
Father node number judges the ability that cluster head transmits data.
After the multi-level clustering architecture initialization construction schedule of above-mentioned wireless sense network terminates, aggregation node exists each node
State in network is by broadcasting sub-clustering message informing each node；Each leader cluster node after network operation message is received, then
Forwarded, notify its neighbor node, thus, all nodes can receive the message in network；Node is receiving broadcast
After sub-clustering message, the cycle of operation is opened, until depleted of energy；Each cycle is including data are passed between data transfer phase and cluster in cluster
The defeated stage；First, data transfer phase in cluster, bunch member node is by the media access control layer agreement based on competition by data
Transmit to leader cluster node into sleep state, until the arrival of data transfer phase in the cluster of next cycle；Then, in cluster
Between data transfer phase, leader cluster node carries out data fusion, and by data by being forwarded to aggregation node between leader cluster node；
Leader cluster node at the end of data transfer cycle, judges itself whether can continue to serve as cluster head between cluster.Work as cluster head
When dump energy is not enough to continue to serve as cluster head, into the cluster head more new stage.When selecting new cluster head, candidate cluster head is taken into full account
Dump energy and the distance between former cluster head, avoid causing network topology excessive variation as far as possible.Meanwhile, node is in net
The network load and the transmittability of itself undertaken in network is also critically important factor.The network load and father node of node
It is bigger than normal or less than normal easily cause network congestion or resource allocation imbalance and cause channel resource that any one in number compares another
Waste.
Cluster head update method in a kind of multi-level clustering architecture of above-mentioned wireless sense network, comprises the following steps,
Step A, cluster head i assess whether to disclosure satisfy that continuation is carried on a shoulder pole according to factors such as dump energy, flow loads using following formula
Appoint cluster head, if following formula is unsatisfactory for, goes to step B and carry out cluster renewal；
Cluster head i dump energy is represented,Represent that the cluster head i consumed energy in a wheel data transfer is averaged
Value, CiFor cluster head i submanifold head set, UiThe member node set of cluster where cluster head i；RjWith cluster head i bunch member node j
The mathematic expectaion of reported data amount, Li、LjThe mathematic expectaion of cluster head i and its submanifold head j flow load is represented respectively；
Step B, cluster head i are by broadcasting cluster new information, and notifying its neighbor node, this enters cluster head more new state；It is then adjacent
Node j is occupied according to neighbours' cluster head information in the adjacent two layers of both sides position, j dump energy and place level, is counted as the following formula
The cluster head ability value of itself is calculated,
D () represents cluster head i and node j Euclidean distance,Represent node j dump energy, CjRepresent node j
Communication radius in cluster head set, P in lower floor's networkjRepresent cluster head set, P in upper layer network in node j communication radiuskRepresent
In node j communication radius in lower floor's network cluster head father's cluster head set, J be all neighbor node j of cluster head i set；| | table
Show the number of element in set；
Step C, cluster head i elect the node with maximum cluster head ability value as new cluster head, then respectively by cluster head i, new cluster
Head broadcasts cluster head in respective communication radius and changes message, and completes role transforming；
Step D, the cluster head for receiving cluster head i changes message but does not receive the node that the cluster head from new cluster head changes message
Judge whether there are cluster head neighbours in its communication range according to neighbor table, if any then to the maximum neighbours' cluster head transmission of cluster head ability value
Request adds message, otherwise into isolated node state；The maximum neighbor node relaying data of isolated node selection dump energy,
During the later stage network operation, the cluster with maximum cluster head ability value is added when such as receiving new cluster head broadcast message；Cluster, which updates, to be made
Into isolated cluster perform step B and C and carry out cluster renewal.
The present embodiment is by based on a kind of above-mentioned distributed routing method of the multi-level clustering architecture of wireless sense network, with explanation
The advantage that its stability is good, performance is high；
The present invention is the probability selected according to calculating next-hop using interference factor.Concrete scheme is as follows：
Between step A, cluster head by the mutual logic connecting relation of Hello message exchanges, cluster head load estimation value and from
The interference factor of body, and be recorded into respective neighbor table；In neighbor table, mark what is formed during cluster network struction
Father, son between cluster head, with layer relation；
The calculation formula of cluster head i load estimation values is as follows in this step,
Li、LjCluster head i and its submanifold head j load estimation value, P are represented respectivelyj、CjRepresent respectively cluster head j father's cluster head with
Submanifold head set；UiThe member node set of cluster, R where cluster head ijRepresent using i as count off on member node j in the cluster of cluster head
According to the mathematic expectaion of amount；| | represent the number of element in set；
Step B, updates and safeguards interference factor of the cluster head i data transfers to neighbours' cluster head data transfer；
Renewal and maintenance of the cluster head i data transfers to the data transmission interference factor of neighbours' cluster head, meter are determined in this step
Calculate formula as follows,
The right Section 1 calculates annoyance levels of the cluster head i to the submanifold head data transfer of all members in his father's cluster head set
(Fig. 3)；Section 2 calculates annoyance levels (Fig. 4) of the cluster head i to all member data transmission in its submanifold head；Section 3 calculates cluster
Annoyance levels (Fig. 5) of the head i to all same layer neighbour cluster head data transfers；
Pi、PkRespectively cluster head i and k father's cluster head set, CjFor cluster head j submanifold head set, MiFor cluster head i communications half
With layer cluster head set, L in the range of footpathkRepresent cluster head k flow load predicted value；| | represent the number of element in set；
Each father's cluster head interference factor of step C, lower floor network cluster head j to be calculated is foundation, under determining that each father's cluster head is
One probability jumped；
Computational methods are as follows,
PjRepresent cluster head j father's cluster head set, IFi、IFkThe respectively interference factor of cluster head j father's cluster head i, k；X is cluster
Head j has obtained neighbours' cluster head quantity of interference factor value by Hello message, and the cluster head i interference factors of interference factor are not obtained
Value IFiFor 0, and it is selected as the probability of next-hop and is| | represent the number of element in set.
Embodiments of the invention are the foregoing is only, are not intended to limit the invention.The present invention can have various conjunctions
Suitable change and change.Any modification, equivalent substitution and improvements made within the spirit and principles of the invention etc., all should
Within protection scope of the present invention.
Claims (6)
1. a kind of multi-level clustering architecture construction method of wireless sense network, it is characterised in that：
The adjacent information of neighbor nodes of Hello message collections is regularly sent after sensor node deployment, between node, using based on
The beaconing nodes location algorithm of RSSI rangings, using aggregation node as beaconing nodes, sets up relative coordinate system, each node preserves it
Coordinate information；Built by the multi-level cluster for using aggregation node as starting point, from the close-by examples to those far off completing the whole network；
Specifically include following steps,
Step A, in the netinit stage, centered on aggregation node, by the sensing in sensor node radio communication radius
Device node division is the 0th layer of cluster network；Whether cluster head or cluster member are had become according to node, by all node divisions in network
For cluster node and blank node, cluster node is the node for having become cluster head or cluster member, it is on the contrary then for blank node；
Step B, the 1st layer of cluster network is built using sensor node On Schemes Of Energy Balance method；
Step C, using cluster head ability value as foundation, sets up lower floor's cluster network of the 1st layer of cluster network successively, that is, sets up the 2nd,
3rd ... n-th layer cluster network, N >=2.
2. the multi-level clustering architecture construction method of a kind of wireless sense network according to claim 1, it is characterised in that：Step B
Middle sensor node On Schemes Of Energy Balance method includes,
Each sensor node energy-consuming balance value in step B1, the 0th layer of cluster network described in calculation procedure A, and broadcast cluster structure
Request message, the energy-consuming balance value calculating method of node i is as follows：
<mrow>
<msub>
<mi>EB</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<msubsup>
<mi>E</mi>
<mi>i</mi>
<mrow>
<mi>i</mi>
<mi>n</mi>
<mi>i</mi>
<mi>t</mi>
</mrow>
</msubsup>
<mo>&times;</mo>
<mfrac>
<mrow>
<mo>|</mo>
<mi>J</mi>
<mo>|</mo>
<mo>&times;</mo>
<mi>d</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>,</mo>
<mi>B</mi>
<mi>S</mi>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mi>r</mi>
<mo>&times;</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>&Element;</mo>
<mi>J</mi>
</mrow>
</munder>
<mfrac>
<mrow>
<mi>d</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mi>d</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>,</mo>
<mi>B</mi>
<mi>S</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
</mrow>
</mfrac>
</mrow>
The primary power of node i is represented, J is all neighbor node j of node i set；| | represent of element in set
Number；D () represents the Euclidean distance between two nodes；
Step B2, after the cluster of neighbor node in receiving all 0th layer of cluster networks builds message, blank node selection has maximum
The neighbor node of energy-consuming balance value adds clustering architecture by replying as cluster head into cluster message request；
Step B3, the 0th layer of cluster nodes receive blank node enter cluster message after, whether detect its own is target
Node, if from as destination node, itself will be set to cluster head and broadcast cluster message, notifies bunch member node to enter to fall asleep
Dormancy state；If node is not received from the request into clusters message as destination node yet after cluster network struction duration T time-out, should
Node is ordinary node and enters sleep state；So far, the structure of the 1st layer of cluster network is completed.
3. the multi-level clustering architecture construction method of a kind of wireless sense network according to claim 2, it is characterised in that：Step C
In, using cluster head ability value as foundation, set up the 2nd successively, the 3rd ... n-th layer cluster network；N >=2,
Concretely comprise the following steps,
Each cluster member calculates itself cluster head ability value in step C1, N-1 layers of cluster network, and then broadcast cluster builds request message；
Step C2, when blank node receives the cluster from N-1 layers of neighbor node and builds message, by its cluster head ability value preserve to
In neighbor table；After the cluster for receiving all upper strata neighbours cluster heads builds message, selection wherein has maximum cluster head ability value
As itself cluster head, reply into cluster message；
Step C3, N-1 node layers receive n-th layer node enter cluster message after, whether detect its own is destination node,
If from as destination node, itself will be set to cluster head and broadcast cluster message, bunch member node is notified to enter sleep shape
State；If node is not received from the request into clusters message as destination node, the node yet after cluster network struction duration T time-out
For ordinary node and enter sleep state.All nodes as cluster head are included in n-th layer.So far, n-th layer cluster network is completed
Build；
Step C4, repeat step C1-C3, until completing the cluster network struction of whole wireless sense network.
4. the multi-level clustering architecture construction method of a kind of wireless sense network according to claim 3, it is characterised in that：Step C1
In, the computational methods of cluster head ability value are as follows,
First, it is determined that when node i serves as cluster head role the cluster stationary value Si, calculation formula is as follows：
<mrow>
<msub>
<mi>S</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>&Element;</mo>
<msub>
<mi>M</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<mrow>
<mo>(</mo>
<mfrac>
<mrow>
<mi>d</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
</mrow>
<mi>r</mi>
</mfrac>
<mo>&times;</mo>
<mfrac>
<msubsup>
<mi>E</mi>
<mi>j</mi>
<mrow>
<mi>l</mi>
<mi>e</mi>
<mi>f</mi>
<mi>t</mi>
</mrow>
</msubsup>
<msubsup>
<mi>E</mi>
<mi>j</mi>
<mrow>
<mi>i</mi>
<mi>n</mi>
<mi>i</mi>
<mi>t</mi>
</mrow>
</msubsup>
</mfrac>
<mo>)</mo>
</mrow>
</mrow>
MiFor node i neighbor node set in same layer cluster network, r is communication radius, in d () represents that the Europe between two nodes is several
Obtain distance,WithNode j dump energy and primary power is represented respectively；
Then, calculate node cluster head ability value,
<mrow>
<msub>
<mi>V</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mi>j</mi>
<mo>&Element;</mo>
<msub>
<mi>Z</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<msub>
<mi>R</mi>
<mi>j</mi>
</msub>
<mo>+</mo>
<mrow>
<mo>|</mo>
<msub>
<mi>P</mi>
<mi>i</mi>
</msub>
<mo>|</mo>
</mrow>
<mo>&times;</mo>
<msub>
<mi>S</mi>
<mi>i</mi>
</msub>
<mo>,</mo>
<mrow>
<mo>|</mo>
<msub>
<mi>Z</mi>
<mi>i</mi>
</msub>
<mo>|</mo>
</mrow>
<mo>&NotEqual;</mo>
<mn>0</mn>
</mrow>
ZiFor the blank node set in the range of node i communication radius；Rj(j∈Zi) it is ZiThe mathematics of interior joint j reported data amounts
Expect；PiFor in node i communication radius, and belong to the set of cluster head in N-2 layers of cluster network；| | represent member in set
The number of element.
5. a kind of multi-level clustering architecture of wireless sense network, it is characterised in that：Using the method structure described in claim 1,2,3 or 4
Build.
6. the update method of cluster head, comprises the following steps in the multi-level clustering architecture of wireless sense network described in a kind of claim 5,
Step A, cluster head i are assessed whether disclosure satisfy that and are continued to serve as cluster according to factors such as dump energy, flow loads using following formula
Head, if following formula is unsatisfactory for, goes to step B and carries out cluster renewal；
<mrow>
<mo>(</mo>
<mfrac>
<msubsup>
<mi>E</mi>
<mi>i</mi>
<mrow>
<mi>l</mi>
<mi>e</mi>
<mi>f</mi>
<mi>t</mi>
</mrow>
</msubsup>
<msubsup>
<mi>E</mi>
<mi>i</mi>
<mrow>
<mi>a</mi>
<mi>v</mi>
<mi>g</mi>
</mrow>
</msubsup>
</mfrac>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
<mo>&GreaterEqual;</mo>
<mfrac>
<mrow>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mi>j</mi>
<mo>&Element;</mo>
<msub>
<mi>C</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<msub>
<mi>L</mi>
<mi>j</mi>
</msub>
<mo>+</mo>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mi>j</mi>
<mo>&Element;</mo>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<msub>
<mi>R</mi>
<mi>j</mi>
</msub>
</mrow>
<msub>
<mi>L</mi>
<mi>i</mi>
</msub>
</mfrac>
</mrow>
Cluster head i dump energy is represented,Represent the average value of cluster head i consumed energies in a wheel data transfer, CiFor
Cluster head i submanifold head set, UiThe member node set of cluster where cluster head i；RjWith cluster head i bunch member node j reported datas
The mathematic expectaion of amount, Li、LjThe mathematic expectaion of cluster head i and its submanifold head j flow load is represented respectively；
Above-described submanifold head is relative concept, is referred in current cluster head communication radius, and is belonged to where current cluster head
Cluster head in next layer network of network layer；
Step B, cluster head i are by broadcasting cluster new information, and notifying its neighbor node, this enters cluster head more new state；Subsequent neighbours' section
Point j according to neighbours' cluster head information in the adjacent two layers of both sides position, j dump energy and place level, be calculated as follows from
The cluster head ability value of body,
<mrow>
<msub>
<mi>H</mi>
<mi>j</mi>
</msub>
<mo>=</mo>
<mfrac>
<msubsup>
<mi>E</mi>
<mi>j</mi>
<mrow>
<mi>l</mi>
<mi>e</mi>
<mi>f</mi>
<mi>t</mi>
</mrow>
</msubsup>
<mrow>
<mi>d</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>&times;</mo>
<mfrac>
<mrow>
<mrow>
<mo>|</mo>
<msub>
<mi>P</mi>
<mi>j</mi>
</msub>
<mo>|</mo>
</mrow>
<mo>&times;</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>&Element;</mo>
<msub>
<mi>C</mi>
<mi>j</mi>
</msub>
</mrow>
</munder>
<mrow>
<mo>|</mo>
<msub>
<mi>P</mi>
<mi>k</mi>
</msub>
<mo>|</mo>
</mrow>
</mrow>
<mrow>
<mrow>
<mo>|</mo>
<msub>
<mi>P</mi>
<mi>j</mi>
</msub>
<mo>|</mo>
</mrow>
<mo>+</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>&Element;</mo>
<msub>
<mi>C</mi>
<mi>j</mi>
</msub>
</mrow>
</munder>
<mrow>
<mo>|</mo>
<msub>
<mi>P</mi>
<mi>k</mi>
</msub>
<mo>|</mo>
</mrow>
</mrow>
</mfrac>
<mo>,</mo>
<mi>j</mi>
<mo>&Element;</mo>
<mi>J</mi>
</mrow>
D () represents cluster head i and node j Euclidean distance,Represent node j dump energy, CjRepresent that node j's is logical
Believe cluster head set, P in lower floor's network in radiusjRepresent cluster head set, P in upper layer network in node j communication radiuskRepresent node j
Communication radius in lower floor's network cluster head father's cluster head set, J is all neighbor node j of cluster head i set；| | represent set
The number of middle element；
Above-described father's cluster head is relative concept, is referred in current cluster head communication radius, and is belonged to where current cluster head
Cluster head in the last layer network of network layer；
Step C, cluster head i elect the node with maximum cluster head ability value as new cluster head, then are existed respectively by cluster head i, new cluster head
Broadcast cluster head changes message in respective communication radius, and completes role transforming；
Step D, receive cluster head i cluster head change message but do not receive cluster head from new cluster head change the node of message according to
Neighbor table judges whether there are cluster head neighbours in its communication range, is asked if any then being sent to the maximum neighbours' cluster head of cluster head ability value
Message is added, otherwise into isolated node state；The maximum neighbor node relaying data of isolated node selection dump energy, later stage
During the network operation, the cluster with maximum cluster head ability value is added when such as receiving new cluster head broadcast message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710527350.7A CN107333314B (en) | 2017-06-30 | 2017-06-30 | A kind of building of wireless sense network cluster and its cluster head update method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710527350.7A CN107333314B (en) | 2017-06-30 | 2017-06-30 | A kind of building of wireless sense network cluster and its cluster head update method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107333314A true CN107333314A (en) | 2017-11-07 |
| CN107333314B CN107333314B (en) | 2019-10-29 |
Family
ID=60198666
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710527350.7A Active CN107333314B (en) | 2017-06-30 | 2017-06-30 | A kind of building of wireless sense network cluster and its cluster head update method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107333314B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108934054A (en) * | 2018-06-19 | 2018-12-04 | 昆明理工大学 | A kind of Ad-hoc network cluster dividing algorithm based on node data value |
| CN109362048A (en) * | 2018-08-15 | 2019-02-19 | 杭州电子科技大学 | Underground pipe gallery detection method based on wireless sensor network |
| CN110943920A (en) * | 2019-12-12 | 2020-03-31 | 电子科技大学 | Distributed cluster head election method based on wireless self-organizing network |
| CN111132257A (en) * | 2019-12-24 | 2020-05-08 | 中国联合网络通信集团有限公司 | C-V2X communication method and device |
| CN112105072A (en) * | 2020-10-21 | 2020-12-18 | 国网思极紫光(青岛)微电子科技有限公司 | Internet of things communication system and construction method thereof |
| CN113573392A (en) * | 2021-07-13 | 2021-10-29 | 电子科技大学中山学院 | Energy-saving communication method under abnormal state of gateway of Internet of things |
| CN113746823A (en) * | 2021-08-26 | 2021-12-03 | 国网山东省电力公司 | Method for constructing cluster routing comprehensive trust management model of distributed power monitoring network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070019569A1 (en) * | 2005-07-22 | 2007-01-25 | Park Il G | Methods for automatically selecting a cluster header in a wireless sensor network and for dynamically configuring secure wireless sensor network |
| CN102036308A (en) * | 2010-12-09 | 2011-04-27 | 江南大学 | Energy balancing wireless sensor network clustering method |
| CN104010336A (en) * | 2014-06-12 | 2014-08-27 | 河海大学常州校区 | Two-stage isomerism clustering underwater wireless sensor network and routing method thereof |
| CN104093183A (en) * | 2014-07-18 | 2014-10-08 | 东北电力大学 | Wireless sensor network uneven clustering method based on optimal clustering number |
-
2017
- 2017-06-30 CN CN201710527350.7A patent/CN107333314B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070019569A1 (en) * | 2005-07-22 | 2007-01-25 | Park Il G | Methods for automatically selecting a cluster header in a wireless sensor network and for dynamically configuring secure wireless sensor network |
| CN102036308A (en) * | 2010-12-09 | 2011-04-27 | 江南大学 | Energy balancing wireless sensor network clustering method |
| CN104010336A (en) * | 2014-06-12 | 2014-08-27 | 河海大学常州校区 | Two-stage isomerism clustering underwater wireless sensor network and routing method thereof |
| CN104093183A (en) * | 2014-07-18 | 2014-10-08 | 东北电力大学 | Wireless sensor network uneven clustering method based on optimal clustering number |
Non-Patent Citations (1)
| Title |
|---|
| 党小超等: "基于移动Agent的WSN多层分簇算法", 《移动互联与通信技术》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108934054A (en) * | 2018-06-19 | 2018-12-04 | 昆明理工大学 | A kind of Ad-hoc network cluster dividing algorithm based on node data value |
| CN108934054B (en) * | 2018-06-19 | 2021-07-16 | 昆明理工大学 | Ad-hoc network clustering algorithm based on node data values |
| CN109362048A (en) * | 2018-08-15 | 2019-02-19 | 杭州电子科技大学 | Underground pipe gallery detection method based on wireless sensor network |
| CN109362048B (en) * | 2018-08-15 | 2021-05-25 | 杭州电子科技大学 | Underground pipe gallery detection method based on wireless sensor network |
| CN110943920A (en) * | 2019-12-12 | 2020-03-31 | 电子科技大学 | Distributed cluster head election method based on wireless self-organizing network |
| CN111132257A (en) * | 2019-12-24 | 2020-05-08 | 中国联合网络通信集团有限公司 | C-V2X communication method and device |
| CN112105072A (en) * | 2020-10-21 | 2020-12-18 | 国网思极紫光(青岛)微电子科技有限公司 | Internet of things communication system and construction method thereof |
| CN112105072B (en) * | 2020-10-21 | 2023-02-24 | 国网思极紫光(青岛)微电子科技有限公司 | Internet of things communication system and construction method thereof |
| CN113573392A (en) * | 2021-07-13 | 2021-10-29 | 电子科技大学中山学院 | Energy-saving communication method under abnormal state of gateway of Internet of things |
| CN113573392B (en) * | 2021-07-13 | 2022-11-22 | 电子科技大学中山学院 | Energy-saving communication method under abnormal state of gateway of Internet of things |
| CN113746823A (en) * | 2021-08-26 | 2021-12-03 | 国网山东省电力公司 | Method for constructing cluster routing comprehensive trust management model of distributed power monitoring network |
| CN113746823B (en) * | 2021-08-26 | 2023-01-24 | 国网山东省电力公司 | Method for constructing cluster routing comprehensive trust management model of distributed power monitoring network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107333314B (en) | 2019-10-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107333314A (en) | A kind of wireless sense network cluster is built and its cluster head update method | |
| Sabet et al. | An energy efficient multi-level route-aware clustering algorithm for wireless sensor networks: A self-organized approach | |
| CN102448138B (en) | Method for clustering hierarchical routing protocols of wireless sensor network | |
| CN101394321B (en) | Non-uniform clustering method for cluster wireless sensor network based on energy balance | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN103024814B (en) | Wireless sensor network energy conservation method based on redundancy controlling and clustering routing | |
| CN104135751B (en) | A kind of Uneven Cluster method for routing suitable for subway tunnel | |
| CN104185242B (en) | A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method | |
| CN101600227B (en) | Distributed network routing method and routing device | |
| Agrawal et al. | GCRP: Grid-cycle routing protocol for wireless sensor network with mobile sink | |
| CN107318142A (en) | Distributed routing method between a kind of wireless sense network cluster | |
| CN109862612B (en) | Data collection and wireless charging method based on dual-function trolley moving path planning | |
| CN108112048A (en) | Recognize a kind of efficiency route protocol based on stability in sensor network | |
| Pattnaik et al. | Assimilation of fuzzy clustering approach and EHO‐Greedy algorithm for efficient routing in WSN | |
| CN104469879B (en) | A kind of dynamic k value cluster routing methods | |
| CN105898764A (en) | Multi-stage energy heterogeneous wireless sensor network deployment method | |
| CN103281741B (en) | A kind of wireless sensor network clustering routing divided based on hexagonal area | |
| Azar et al. | Energy-and delay-efficient algorithm for large-scale data collection in mobile-sink WSNs | |
| Anees et al. | Delay aware energy-efficient opportunistic node selection in restricted routing | |
| CN103987102A (en) | Topology control method of underwater wireless sensor network based on non-cooperative game | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| Han et al. | CTRA: A complex terrain region-avoidance charging algorithm in Smart World | |
| Anitha et al. | Scenario-based diameter-bounded algorithm for cluster creation and management in mobile ad hoc networks | |
| Anitha et al. | SCAM: Scenario-based clustering algorithm for mobile ad hoc networks | |
| CN113162638A (en) | SDWSN (software development station network) topology control algorithm based on non-cooperative game |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |