CN107333314B - A kind of building of wireless sense network cluster and its cluster head update method - Google Patents

A kind of building of wireless sense network cluster and its cluster head update method Download PDF

Info

Publication number
CN107333314B
CN107333314B CN201710527350.7A CN201710527350A CN107333314B CN 107333314 B CN107333314 B CN 107333314B CN 201710527350 A CN201710527350 A CN 201710527350A CN 107333314 B CN107333314 B CN 107333314B
Authority
CN
China
Prior art keywords
cluster
node
cluster head
network
head
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
Application number
CN201710527350.7A
Other languages
Chinese (zh)
Other versions
CN107333314A (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.)
Anhui Agricultural University AHAU
Original Assignee
Anhui Agricultural University AHAU
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 Anhui Agricultural University AHAU filed Critical Anhui Agricultural University AHAU
Priority to CN201710527350.7A priority Critical patent/CN107333314B/en
Publication of CN107333314A publication Critical patent/CN107333314A/en
Application granted granted Critical
Publication of CN107333314B publication Critical patent/CN107333314B/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
    • 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

The invention discloses a kind of building of wireless sense network cluster and cluster head update methods, belong to wireless sensor network field, which solve the not high problems of existing wireless sense network clustering architecture stability.Construction method of the invention is constructed by using aggregation node as starting point, completing the multi-level cluster of the whole network from the near to the distant；The sensor node in radius is wirelessly communicated specifically centered on aggregation node, by sensor node and is divided into the 0th layer of cluster network, and the building 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, the node for possessing maximum cluster head ability value is elected as the cluster head of lower layer's cluster network and constructs lower layer's cluster network, successively iteration constructs the 2nd layer and other layer of cluster network.The hierarchy type clustering architecture that the present invention constructs has the characteristics that stability is high, cluster updates distribution on demand, overcomes great number cluster maintenance costs brought by the update of conventional method periodicity the whole network cluster.

Description

A kind of building of wireless sense network cluster and its cluster head update method
Technical field
The invention belongs to wireless sensor network fields, specifically, being related to a kind of multi-level cluster building of wireless sense network With cluster head update method.
Background technique
Clustering topology is conducive to the application of distributed routing algorithm convenient for management, has preferable scalability, fits Close massive wireless sensor application.Clustering route protocol usually splits the network into cluster, and each cluster is by cluster head and multiple Member node in cluster member composition, cluster head management or the entire cluster of control, 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 reasonable network structure by efficient cluster algorithm, passes through effective cluster head Rotation mechanism guarantees network connectivty, extends Network morals.Therefore, cluster stability at communication connection performance superiority and inferiority, The main determining factor of the height of cluster maintenance costs and network operation period length improves cluster stability, reduces cluster reconstruction frequency It is the important goal of cluster developing algorithm with maintenance costs.
It routes, transmitted around the data of the generation of cluster head, the formation of cluster and cluster and sets for Wireless sensor network clustering Many wireless sense network Clustering Routings are counted." 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 are connected by adjusting the subgraph that cluster head covering radius ensures to be formed by cluster head The general character, then construct convergence tree transmission data.But when network load is larger, the data transmission between different cluster members is easy to produce Conflict, so that cluster head collects data efficiency decline, to be easy to cause 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 disclose the communication radius by adjusting sensor node for sensor network Uneven Cluster is carried out, then uses connected graph Theoretical Design route selection algorithm.But only consider that Energy volution avoids, and makes when sub-clustering Obtaining cluster network topology is to save energy consumption and frequently change, and causes to safeguard that the cost of network stabilization is excessive, cause under network performance Drop.Data transmission route is by ignoring the letter of wireless sense network protocol stack between graph theory design cluster head is used only in routing algorithm between cluster head Breath is shared and sensor node data transmission feature, effect of optimization are limited.
From the above-mentioned prior art it is found that existing wireless sense network clustering architecture and method for routing performance is unstable, performance is uneven Weighing apparatus；How using the characteristics of wireless-sensor network distribution type more efficient Self-configuring is established, by the limited model of regional area Interaction and the information feedback enclosed between interior nodes carry out sub-clustering, are reducing inter-node communication interference, are guaranteeing the same of network operation period When, it improves cluster stability and network data transmission performance still needs further to be innovated.
Summary of the invention
1, it to solve the problems, such as
For the not high problem of existing wireless sense network clustering architecture stability, the present invention provides a kind of wireless sense network cluster structure Build with cluster head update method, can be improved cluster stability, improve network service performance.
2, technical solution
To solve the above problems, the present invention adopts 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 collection is regularly sent after sensor node deployment, between node, is used Beaconing nodes location algorithm based on RSSI ranging establishes relative coordinate system using aggregation node as beaconing nodes, and each node is protected Deposit its coordinate information；Multi-level cluster by using aggregation node as starting point, completing the whole network from the near to the distant constructs；
Specifically comprise the following steps,
Step A is wirelessly communicated in radius centered on aggregation node, by sensor node in the netinit stage Sensor node is divided into the 0th layer of cluster network；Whether have become cluster head or cluster member according to node, by nodes all 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 be blank node；
Step B constructs the 1st layer of cluster network using sensor node On Schemes Of Energy Balance method；
Step C successively establishes lower layer's cluster network of the 1st layer of cluster network using cluster head ability value as foundation, that is, establishes the 2nd, 3 ... n-th layer cluster network, N >=2.
Preferably, sensor node On Schemes Of Energy Balance method includes in step B,
Step B1 calculates each sensor node energy-consuming balance value in the 0th layer of cluster network described in step A, and broadcasts cluster Request message is constructed, the energy-consuming balance value calculating method of node i is as follows:
Indicate the primary power of node i, J is the set of all neighbor node j of node i；| | indicate element in set Number；D () indicates the Euclidean distance between two nodes；R is node communication radius；BS indicates aggregation node；
Step B2, in receiving all 0th layer of cluster networks after the cluster building message of neighbor node, blank node selection has Clustering architecture is added into cluster message request as cluster head, by replying in the neighbor node of maximum energy consumption equilibrium valve；
Step B3, the 0th layer of cluster nodes receive blank node enter cluster message after, detect its own whether be Destination node, if itself be destination node, itself will be set as cluster head and broadcast cluster message, notice bunch member node into Enter sleep state；If node does not receive the request into clusters message that itself is destination node after cluster network struction duration T time-out yet, Then the node is ordinary node and enters sleep state；So far, the building of the 1st layer of cluster network is completed.
Preferably, in step C,
Using cluster head ability value as foundation, successively establish the 2nd, the 3rd ... n-th layer cluster network, N >=2,
The specific steps are,
Step C1, each cluster member calculates itself cluster head ability value in N-1 layers of cluster network, then broadcasts cluster building request and disappears Breath；
Step C2 protects its cluster head ability value when blank node receives the cluster building message from N-1 layers of neighbor node It deposits into neighbor table；After the cluster for receiving all upper layer neighbours cluster heads constructs 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 layer receive n-th layer node enter cluster message after, detect whether its own is target Node itself will be set as cluster head and broadcast cluster message if itself is destination node, and notice bunch member node, which enters, sleeps Dormancy state；If node does not receive the request into clusters message that itself is destination node after cluster network struction duration T time-out yet, should Node is ordinary node and enters sleep state.All nodes as cluster head are divided into n-th layer.So far, n-th layer cluster net is completed The building of network；
Step C4 repeats step C1-C3, until completing the cluster network struction of entire wireless sense network.
Preferably, in step C1, the calculation method of cluster head ability value is 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, r are communication radius in same layer cluster network, and d () is indicated between two nodes Euclidean distance,WithRespectively indicate the dump energy and primary power of node j；
Then, the cluster head ability value of cluster building stage node is calculated；
ZiFor the blank node set within the scope of node i communication radius；Rj(j∈Zi) it is ZiInterior joint j reported data amount Mathematic expectaion；QiFor in node i communication radius, and belong to the set of cluster head in N-2 layers of cluster network；| | indicate set The number of middle element.
The update method of cluster head, is constructed using the above method in a kind of multi-level clustering architecture of wireless sense network.
Cluster head update method in a kind of multi-level clustering architecture of above-mentioned wireless sense network, includes the following steps,
Step A, cluster head i are assessed whether can satisfy and are continued to carry on a shoulder pole according to the factors such as dump energy, flow load using following formula Appoint cluster head, if following formula is unsatisfactory for, goes to step B and carry out cluster update；
Indicate the dump energy of cluster head i,Indicate that cluster head i consumes being averaged for energy in a wheel data transmission Value, CiFor the submanifold head set of cluster head i, UiFor the member node set of cluster where cluster head i；It indicates with the cluster member of cluster head i The mathematic expectaion of node j reported data amount, Li、CMjRespectively indicate the mathematic expectaion of the flow load of cluster head i and its submanifold head j；
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 by broadcast cluster update message, notify its neighbor node this enter 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, the dump energy of j and place level, is counted as the following formula Cluster more new stage node cluster head ability value is calculated,
D (i, j) indicates the Euclidean distance of cluster head i and node j,Indicate the dump energy of node j, CHjIt indicates Cluster head set, P in lower layer's network in the communication radius of node jjCluster head set in upper layer network in expression node j communication radius, CSjIndicate father's cluster head set of cluster head in lower layer's network in the communication radius of node j, J is the collection of all neighbor node j of cluster head i It closes；| | indicate 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 a upper layer network for 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 replaces message, and completes role transforming；
Step D receives the cluster head replacement message of cluster head i but does not receive the node of the cluster head replacement message from new cluster head 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 Message is added in request, otherwise enters isolated node state；Isolated node selects the maximum neighbor node of dump energy to relay data, During the later period network operation, the cluster with maximum cluster head ability value is added when such as receiving new cluster head broadcast message.
3, beneficial effect
Compared with the prior art, the invention has the benefit that
(1) the hierarchy type clustering architecture that the present invention constructs forms the virtual cluster head of a multi-connection on original network Network sends data to aggregation node by multi-hop mode between cluster head, overcomes the agreements such as LEACH using single-hop transmission mode Brought high energy consumption；
(2) the hierarchy type clustering architecture that the present invention constructs has the characteristics that stability is high, cluster updates distribution on demand, and overcomes Conventional method periodicity the whole network cluster update brought by high costs.
Detailed description of the invention
Fig. 1 is wireless sense network cluster network structure of the present invention；
A-K is each cluster head structure in figure；Solid line is the 1st layer of cluster network；Solid line inside is close to the first dotted line of A, B location 0th layer of cluster network；The second dotted line on the outside of solid line close to the position D, E, F is the 2nd layer of cluster network；It is the 3rd layer of cluster outside second dotted line Network；
Logic connecting relation figure of the Fig. 2 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 submanifold head in lower layer's network of cluster head i；iqFor Same layer cluster head in cluster head i communication radius；
Interference scene of the data transmission that Fig. 3 is cluster head i in the specific embodiment of the invention to its all father's cluster head；
Fig. 4 is the interference scene that cluster head i transmits its all submanifold head data in the specific embodiment of the invention；
Fig. 5 is that cluster head i data transmit the interference scene transmitted to same layer cluster head data in the specific embodiment of the invention.
Specific embodiment
The present invention is further described below combined with specific embodiments below.
As depicted in figs. 1 and 2, the multi-level clustering architecture of a kind of wireless sense network, there are A-K totally 11 cluster head structures, by net Network is divided into 4 layers, respectively the 0th layer of 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 transmits between cluster until aggregation node.
The present invention constructs the cluster network completed, and logic connecting relation exists only between the cluster head of adjacent layer, with layer network Logic connecting relation is not present between cluster head.There are in the cluster head of logic connecting relation, the cluster head in upper layer network is known as father's cluster Head, the cluster head in lower layer's network are known as submanifold head.
Its construction method is, the adjacent neighbours of Hello message collection are regularly sent after sensor node deployment, between node Nodal information establishes relative coordinate using aggregation node as beaconing nodes using the beaconing nodes location algorithm based on RSSI ranging System, each node save its coordinate information；By the multi-level cluster structure for using aggregation node as starting point, completing the whole network from the near to the distant It builds；
Specifically comprise the following steps,
Step A is wirelessly communicated in radius centered on aggregation node, by sensor node in the netinit stage Sensor node is divided into the 0th layer of cluster network；Whether have become cluster head or cluster member according to node, by nodes all 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 be blank node；
Step B constructs the 1st layer of cluster network using sensor node On Schemes Of Energy Balance method；
Sensor node On Schemes Of Energy Balance method includes the following steps: in this step
Step B1 calculates each sensor node energy-consuming balance value in the 0th layer of cluster network described in step A, and broadcasts cluster Request message is constructed, the energy-consuming balance value calculating method of node i is as follows:
Indicate the primary power of node i, J is the set of all neighbor node j of node i；| | indicate element in set Number；D () indicates the Euclidean distance between two nodes；R is node communication radius；BS indicates aggregation node；
Step B2, in receiving all 0th layer of cluster networks after the cluster building message of neighbor node, blank node selection has Clustering architecture is added into cluster message request as cluster head, by replying in the neighbor node of maximum energy consumption equilibrium valve；
Step B3, the 0th layer of cluster nodes receive blank node enter cluster message after, detect its own whether be Destination node, if itself be destination node, itself will be set as cluster head and broadcast cluster message, notice bunch member node into Enter sleep state；If node does not receive the request into clusters message that itself is destination node after cluster network struction duration T time-out yet, Then the node is ordinary node and enters sleep state；So far, the building of the 1st layer of cluster network is completed；
T takes 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 successively establishes lower layer's cluster network of the 1st layer of cluster network using cluster head ability value as foundation, that is, establishes the 2nd, 3 ... n-th layer cluster network, N >=2；Specific steps are as follows:
Step C1, each cluster member calculates itself cluster head ability value in N-1 layers of cluster network, then broadcasts cluster building request and disappears Breath；
The calculation method of cluster head ability value is 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, r are communication radius in same layer cluster network, and d () is indicated between two nodes Euclidean distance,WithRespectively indicate the dump energy and primary power of node j；
Then, the cluster head ability value of cluster building stage node is calculated；
|Zi|≠0ZiFor the blank node set within the scope of node i communication radius；Rj(j∈ Zi) it is ZiThe mathematic expectaion of interior joint j reported data amount；QiFor in node i communication radius, and belong to N-2 layers of cluster net The set of cluster head in network；| | indicate the number of element in set；
Step C2 protects its cluster head ability value when blank node receives the cluster building message from N-1 layers of neighbor node It deposits into neighbor table；After the cluster for receiving all upper layer neighbours cluster heads constructs 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 layer receive n-th layer node enter cluster message after, detect whether its own is target Node itself will be set as cluster head and broadcast cluster message if itself is destination node, and notice bunch member node, which enters, sleeps Dormancy state；If node does not receive the request into clusters message that itself is destination node after cluster network struction duration T time-out yet, should Node is ordinary node and enters sleep state.All nodes as cluster head are divided into n-th layer.So far, n-th layer cluster net is completed The building of network；
T takes 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 repeats step C1-C3, until completing the cluster network struction of entire 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 comprehensively 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 construct reasonable initialization cluster network.Cluster head ability value by with section The relevant routing number of point efficiently controls the influence that the cluster of neotectonics generates other already present clusters, at the same stability in use and Father node number judges the ability of cluster head transmission data.
After above-mentioned wireless sense network multi-level clustering architecture initialization construction schedule, aggregation node exists each node State in network passes through the broadcast each node of sub-clustering message informing；Each leader cluster node after receiving network operation message, then It is forwarded, notifies its neighbor node, all nodes can receive the message in network as a result,；Node is receiving broadcast After sub-clustering message, the cycle of operation is opened, until depleted of energy；Each period includes that data pass between data transfer phase and cluster in cluster The defeated stage；Firstly, data transfer phase in cluster, bunch member node is by media access control layer agreement competition-based by data Enter sleep state after being transmitted to leader cluster node, 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 fully considered 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 network congestion or resource allocation imbalance is be easy to cause to lead to channel resource that any of number compares another Waste.
Cluster head update method in a kind of multi-level clustering architecture of above-mentioned wireless sense network, includes the following steps,
Step A, cluster head i are assessed whether can satisfy and are continued to carry on a shoulder pole according to the factors such as dump energy, flow load using following formula Appoint cluster head, if following formula is unsatisfactory for, goes to step B and carry out cluster update；
Indicate the dump energy of cluster head i,Indicate that cluster head i consumes being averaged for energy in a wheel data transmission Value, CiFor the submanifold head set of cluster head i, UiFor the member node set of cluster where cluster head i；It indicates with the cluster member of cluster head i The mathematic expectaion of node j reported data amount, Li、CMjRespectively indicate the mathematic expectaion of the flow load of cluster head i and its submanifold head j；
Step B, cluster head i by broadcast cluster update message, notify its neighbor node this enter 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, the dump energy of j and place level, is counted as the following formula Calculate cluster more new stage node cluster head ability value
D (i, j) indicates the Euclidean distance of cluster head i and node j,Indicate the dump energy of node j, CHjIt indicates Cluster head set, P in lower layer's network in the communication radius of node jjCluster head set in upper layer network in expression node j communication radius, CSjIndicate father's cluster head set of cluster head in lower layer's network in the communication radius of node j, J is the collection of all neighbor node j of cluster head i It closes；| | indicate 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 replaces message, and completes role transforming；
Step D receives the cluster head replacement message of cluster head i but does not receive the node of the cluster head replacement message from new cluster head 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 Message is added in request, otherwise enters isolated node state；Isolated node selects the maximum neighbor node of dump energy to relay data, During the later period network operation, the cluster with maximum cluster head ability value is added when such as receiving new cluster head broadcast message；Cluster update is made At isolated cluster execute step B and C carry out cluster update.
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 according to the probability for calculating next-hop selection using interference factor.Concrete scheme is as follows:
Step A, between cluster head by the mutual logic connecting relation of Hello message exchange, cluster head load estimation value and from The interference factor of body, and be recorded into respective neighbor table；In neighbor table, mark what cluster network struction was formed in the process Father, son, same layer relationship between cluster head；
The calculation formula of cluster head i load estimation value is as follows in this step,
Li、LjRespectively indicate the load estimation value of cluster head i and its submanifold head j, Pj、CjRespectively indicate father's cluster head of cluster head j with Submanifold head set；UiFor the member node set of cluster where cluster head i, RjIt indicates using i as count off on member node j in the cluster of cluster head According to the mathematic expectaion of amount；| | indicate the number of element in set；
Step B updates and transmits the interference factor transmitted to neighbours' cluster head data with maintenance cluster head i data；
Update and maintenance of the cluster head i data transmission to the data transmission interference factor of neighbours' cluster head, meter are determined in this step It is as follows to calculate formula,
The right first item calculates cluster head i to the annoyance level of the submanifold head data transmission of all members in his father's cluster head set (Fig. 3)；Section 2 calculates the annoyance level (Fig. 4) that cluster head i transmits member datas all in its submanifold head；Section 3 calculates cluster The annoyance level (Fig. 5) that head i transmits all same layer neighbours cluster head data；
Pi、PkFather's cluster head set of respectively cluster head i and k, CjFor the submanifold head set of cluster head j, MiFor cluster head i communication half Same layer cluster head set, L within the scope of diameterkIndicate the flow load predicted value of cluster head k；| | indicate the number of element in set；
Step C, lower layer network cluster head j are using each father's cluster head interference factor calculated as foundation, under determining that each father's cluster head is One probability jumped；
Calculation method is as follows,
PjIndicate father's cluster head set of cluster head j, IFi、IFkThe respectively interference factor of father's cluster head i, k of cluster head j；X is cluster Head j has obtained neighbours' cluster head quantity of interference factor value by Hello message, and the cluster head i interference factor of interference factor has not been obtained Value IFiIt is 0, and the probability for being selected as next-hop is| | indicate the number of element in set.
The above description is only an embodiment of the present invention, is not intended to restrict the invention.The present invention can have various conjunctions Suitable change and variation.Any modification, equivalent substitution, improvement and etc. done within the spirit and principles of the present invention, should all It is included 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 collection is regularly sent after sensor node deployment, between node, using being based on The beaconing nodes location algorithm of RSSI ranging establishes relative coordinate system using aggregation node as beaconing nodes, and each node saves it Coordinate information；Multi-level cluster by using aggregation node as starting point, completing the whole network from the near to the distant constructs；
Specifically comprise the following steps,
Step A wirelessly communicates the sensing in radius centered on aggregation node, by sensor node in the netinit stage Device node division is the 0th layer of cluster network；Whether have become cluster head or cluster member according to node, by node divisions all 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 be blank node；
Step B constructs the 1st layer of cluster network using sensor node On Schemes Of Energy Balance method；
Step C successively establishes lower layer's cluster network of the 1st layer of cluster network using cluster head ability value as foundation, that is, establishes the 2nd, 3 ... 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,
Step B1 calculates each sensor node energy-consuming balance value in the 0th layer of cluster network described in step A, and broadcasts cluster building The energy-consuming balance value calculating method of request message, node i is as follows:
Indicate the primary power of node i, J is the set of all neighbor node j of node i；| | indicate of element in set Number；D () indicates the Euclidean distance between two nodes；R is node communication radius；BS indicates aggregation node；
Step B2, in receiving all 0th layer of cluster networks after the cluster building message of neighbor node, blank node selection has maximum Clustering architecture is added into cluster message request as cluster head, by replying in the neighbor node of energy-consuming balance value；
Step B3, the 0th layer of cluster nodes receive blank node enter cluster message after, detect whether its own is target Node itself will be set as cluster head and broadcast cluster message if itself is destination node, and notice bunch member node, which enters, sleeps Dormancy state；If node does not receive the request into clusters message that itself is destination node after cluster network struction duration T time-out yet, should Node is ordinary node and enters sleep state；So far, the building 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, successively establish the 2nd, the 3rd ... n-th layer cluster network；N >=2,
The specific steps are,
Step C1, each cluster member calculates itself cluster head ability value in N-1 layers of cluster network, then broadcasts cluster and constructs request message；
When step C2, blank node receive the cluster from N-1 layers of neighbor node and construct message, by its cluster head ability value save to In neighbor table；After the cluster for receiving all upper layer neighbours cluster heads constructs message, selection wherein has maximum cluster head ability value As itself cluster head, reply into cluster message；
Step C3, N-1 node layer receive n-th layer node enter cluster message after, detect whether its own is destination node, If itself is destination node, it itself will be set as cluster head and broadcast cluster message, notice bunch member node enters sleep shape State；If node does not receive the request into clusters message that itself is destination node, the node after cluster network struction duration T time-out yet For ordinary node and enter sleep state；All nodes as cluster head are divided into n-th layer；So far, n-th layer cluster network is completed Building；
Step C4 repeats step C1-C3, until completing the cluster network struction of entire 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 calculation method of cluster head ability value is 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:
MiFor node i, neighbor node set, r are communication radius in same layer cluster network, in the Europe between d () two nodes of expression is several Distance is obtained,WithRespectively indicate the dump energy and primary power of node j；
Then, the cluster head ability value of cluster building stage node is calculated,
ZiFor the blank node set within the scope of node i communication radius；Rj(j∈Zi) it is ZiThe mathematics of interior joint j reported data amount It is expected that；QiFor in node i communication radius, and belong to the set of cluster head in N-2 layers of cluster network；| | it indicates in set The number of element.
5. the update method of cluster head in a kind of multi-level clustering architecture of wireless sense network, it is characterised in that: use claim 1,2,3 Or the building of method described in 4.
6. the update method of cluster head, includes the following steps in a kind of multi-level clustering architecture of wireless sense network described in claim 5,
Step A, cluster head i are assessed whether can satisfy and are continued to serve as cluster according to the factors such as dump energy, flow load using following formula Head goes to step B and carries out cluster update if following formula is unsatisfactory for；
Indicate the dump energy of cluster head i,Indicate that cluster head i consumes the average value of energy, C in a wheel data transmissioniFor The submanifold head set of cluster head i, UiFor the member node set of cluster where cluster head i；It indicates on the bunch member node j of cluster head i Report the mathematic expectaion of data volume, Li、CMjRespectively indicate the mathematic expectaion of the flow load of cluster head i and its submanifold head j；
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 by broadcast cluster update message, notify its neighbor node this enter cluster head more new state；Subsequent neighbours' section Cluster is calculated as follows according to neighbours' cluster head information in the adjacent two layers of both sides position, the dump energy of j and place level in point j More new stage node cluster head ability value,
D (i, j) indicates the Euclidean distance of cluster head i and node j,Indicate the dump energy of node j, CHjIndicate node j Communication radius in cluster head set, P in lower layer's networkjIndicate in node j communication radius cluster head set, CS in upper layer networkjIt indicates In the communication radius of node j in lower layer'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 is belonged to where current cluster head Cluster head in a upper layer network for network layer；
Step C, cluster head i elect the node with maximum cluster head ability value to be existed as new cluster head, then respectively by cluster head i, new cluster head Broadcast cluster head replaces message in respective communication radius, and completes role transforming；
Step D, receive cluster head i cluster head replacement message but do not receive from new cluster head cluster head replacement message node according to Neighbor table judges whether there are cluster head neighbours in its communication range, requests if any then sending to the maximum neighbours' cluster head of cluster head ability value Message is added, otherwise enters isolated node state；Isolated node selects the maximum neighbor node of dump energy to relay data, later period During the network operation, the cluster with maximum cluster head ability value is added when such as receiving new cluster head broadcast message.
CN201710527350.7A 2017-06-30 2017-06-30 A kind of building of wireless sense network cluster and its cluster head update method Active CN107333314B (en)

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 CN107333314A (en) 2017-11-07
CN107333314B true 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)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108934054B (en) * 2018-06-19 2021-07-16 昆明理工大学 Ad-hoc network clustering algorithm based on node data values
CN109362048B (en) * 2018-08-15 2021-05-25 杭州电子科技大学 Underground pipe gallery detection method based on wireless sensor network
CN110943920B (en) * 2019-12-12 2020-10-27 电子科技大学 Distributed cluster head election method based on wireless self-organizing network
CN111132257B (en) * 2019-12-24 2022-02-15 中国联合网络通信集团有限公司 C-V2X communication method and device
CN112105072B (en) * 2020-10-21 2023-02-24 国网思极紫光(青岛)微电子科技有限公司 Internet of things communication system and construction method thereof
CN113573392B (en) * 2021-07-13 2022-11-22 电子科技大学中山学院 Energy-saving communication method under abnormal state of gateway of Internet of things
CN113746823B (en) * 2021-08-26 2023-01-24 国网山东省电力公司 Method for constructing cluster routing comprehensive trust management model of distributed power monitoring network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100679250B1 (en) * 2005-07-22 2007-02-05 한국전자통신연구원 Method for automatically selecting a cluster header in a wireless sensor network and for dynamically configuring a secure wireless sensor network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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)

* Cited by examiner, † Cited by third party
Title
基于移动Agent的WSN多层分簇算法;党小超等;《移动互联与通信技术》;20131023;全文 *

Also Published As

Publication number Publication date
CN107333314A (en) 2017-11-07

Similar Documents

Publication Publication Date Title
CN107333314B (en) A kind of building of wireless sense network cluster and its cluster head update method
Shah et al. Energy and interoperable aware routing for throughput optimization in clustered IoT-wireless sensor networks
Anupama et al. Survey of cluster based routing protocols in mobile adhoc networks
Long et al. Energy-aware real-time routing for large-scale industrial internet of things
Agarwal et al. Survey of clustering algorithms for MANET
CN101600227B (en) Distributed network routing method and routing device
CN104135751B (en) A kind of Uneven Cluster method for routing suitable for subway tunnel
CN102497679B (en) Static clustering algorithm for wireless sensor network
CN109862612B (en) Data collection and wireless charging method based on dual-function trolley moving path planning
CN104469879B (en) A kind of dynamic k value cluster routing methods
Elhabyan et al. PSO-HC: Particle swarm optimization protocol for hierarchical clustering in Wireless Sensor Networks
Wen et al. DEDC: Joint density-aware and energy-limited path construction for data collection using mobile sink in WSNs
CN107318142B (en) Distributed routing method between a kind of wireless sense network cluster
CN103024814A (en) Wireless sensor network energy conservation method based on redundancy controlling and clustering routing
Boughanmi et al. A new routing metric for satisfying both energy and delay constraints in wireless sensor networks
Zhu et al. A high-available and location predictive data gathering scheme with mobile sinks for wireless sensor networks
Zhong et al. EMPC: Energy-minimization path construction for data collection and wireless charging in WRSN
CN102238683A (en) Routing information acquisition and transmission method for wireless mesh network
Biabani et al. EE-MSWSN: Energy-efficient mobile sink scheduling in wireless sensor networks
Liu et al. Intelligent routing algorithm for wireless sensor networks dynamically guided by distributed neural networks
Leu et al. Adaptive power-aware clustering and multicasting protocol for mobile ad hoc networks
Kim et al. Survey on communication for mobile sinks in wireless sensor networks: Mobility pattern perspective
Pitchai Determination of energy efficient optimal sojourn location of mobile sinks in clustered corona-based wireless sensor networks
Han et al. CTRA: A complex terrain region-avoidance charging algorithm in Smart World
Savyanavar et al. Survey of clustering schemes in mobile ad hoc networks

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