CN106792973A - Cluster head election and its shift process in a kind of energy heterogeneous wireless sensor network - Google Patents

Cluster head election and its shift process in a kind of energy heterogeneous wireless sensor network Download PDF

Info

Publication number
CN106792973A
CN106792973A CN201611254285.7A CN201611254285A CN106792973A CN 106792973 A CN106792973 A CN 106792973A CN 201611254285 A CN201611254285 A CN 201611254285A CN 106792973 A CN106792973 A CN 106792973A
Authority
CN
China
Prior art keywords
node
cluster head
cluster
data
energy
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201611254285.7A
Other languages
Chinese (zh)
Other versions
CN106792973B (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.)
Wuhan Zhongyuan Electronic Information Co Ltd
Original Assignee
Wuhan Zhongyuan Electronic Information Co Ltd
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 Wuhan Zhongyuan Electronic Information Co Ltd filed Critical Wuhan Zhongyuan Electronic Information Co Ltd
Priority to CN201611254285.7A priority Critical patent/CN106792973B/en
Publication of CN106792973A publication Critical patent/CN106792973A/en
Application granted granted Critical
Publication of CN106792973B publication Critical patent/CN106792973B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10Small scale networks; Flat hierarchical networks
    • H04W84/12WLAN [Wireless Local Area Networks]
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing 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)
  • Arrangements For Transmission Of Measured Signals (AREA)

Abstract

The invention discloses the cluster head election in a kind of energy heterogeneous wireless sensor network and its shift process, including:Cluster head chooses the stage, and the node different for primary power, the threshold value of generation is also different, and the sensor node in active state can generate the random number between 01, if this number is less than its corresponding threshold values T (n), the node is elected as cluster head;The establishment stage of cluster, after cluster head node is produced, actively to this message of all node broadcasts in network;The stabilization sub stage of data is transmitted, for aggregation and processing data, route data;Data are merged by node gathered data.The present invention improves the overall equilibrium degree of offered load while WSN data transmission credibilities are ensured, effectively reduces data redundancy and reduces node energy loss, so as to extend the working life of WSN.

Description

Cluster head election and its shift process in a kind of energy heterogeneous wireless sensor network
Technical field
The invention belongs to wireless sensor network system technical field, more particularly to a kind of energy heterogeneous wireless sensor network Cluster head election and its shift process in network.
Background technology
Wireless sensor network is a kind of network of foundation-free facility, and it is by one group of sensor node with wireless Ad Hoc side Formula is constituted, the information of perceptive object the purpose is to collaborative sensing, collection and in treatment network coverage geographic area, and to these numbers According to being processed, most at last these information transmissions to the user for needing, and this requires that WSN possesses data fusion reliably and with long-term Function.The computing capability of WSN nodes, wireless bandwidth and limited battery capacity, cluster head route belong to hierarchical clustering association View, the data volume for being transferred to node is reduced by performing data aggregation and fusion, reduces each node energy consumption in class, is a kind of effective Improve the solution of energy efficiency.Data fusion technique is to be processed many numbers evidence or information, is combined into more effectively, more Meet the process of the data of user's request, it is possible to reduce the network traffics of redundancy.It is not all in most application Sensor is all isomorphism, and being directed to the routing algorithm of isomorphism can not well reduce the energy of whole network under heterogeneous network Amount consumption, easily causes local nodes overload and energy is consumed excessively, and the working life of WSN is greatly reduced.Towards In the application of data fusion, network working life and transmission reliability are primarily to pursue a goal.Sensor is data acquisition, data The critical component for the treatment of, a physical quantity in physical world can be mapped to a quantitative measured value, make people couple by it Physical world is formed and quantifies understanding.Sensor equipment has a sensing module such as sound, light, magnetic, vision etc. for perceiving surrounding generation Physical quantity in boundary a, digital signal processing module is used for the signal for processing sensing module collection and the work(for completing procotol Can, a radio transceiver chip is used to communicate and a power module is for the various operations of sensor provide energy.It is existing Technical scheme, the wireless sensor network system from special screne application.Wireless sensor network system substantially four The individual stage:1. substantial amounts of sensor node is randomly dispersed in Target monitoring area;2. pair network carries out network topology planning;3. , it is necessary to the valid data that each sensor is collected pass node and base station back in time, accurately in data-gathering process;4. pass Sensor node gathers substantial amounts of, real time data and is compressed treatment.There is following restrictive condition in technical scheme above:1. power supply It is limited:Because wireless sensor network is typically configured in remote districts or the more unattainable natural environment of staff, Therefore the power supply in sensor node is difficult to change.And the small volume of sensor node, so as to cannot be equipped with for it large-scale Energy supply device.2. disposal ability is limited:Due to the limitation of volume, processing unit adds sensor using microprocessor The limited power of node, therefore the disposal ability of processor is limited.Sensor node cannot run large-scale application program and place Manage substantial amounts of application data.3. storage capacity is limited:On the premise of volume, limited power, sensor node using capacity compared with Small microprocessor stores a small amount of sensed data and short and small application program.4. communication distance is limited:Sensor node is adopted Communicated with radio.Its communication range radius is the circle (r is maximum communication distance) of r in the ideal situation, in communication model All the sensors node in enclosing can be in communication with each other.Because communication distance is bigger, energy consumption is bigger, thus sensor node energy Amount is limited to cause its communication distance to be limited.Wireless sensor network node finite energy and typically no energy supplement, therefore road Needed efficiently to utilize energy by agreement.Energy consumption is mainly reflected in collection, communication and data processing this several respect, and energy loss Key is in network layer communication.Routing Protocol is the core technology of wireless sensor network layer, and node can only obtain local topology knot Structure information, Routing Protocol will can select suitable path in partial network information ground foundation.Traditional Routing Protocol can not be straight Connect for sensor networking, and be directed to MANET design networking and communication protocol be generally not suitable for sensor network.1. traditional The design object of Routing Protocol is mainly high-quality service, the consideration in terms of lacking to energy-conservation, and the master of sensor network protocol Be related to target be reduce energy loss, improve network lifecycle, it is considered to performance indications it is inconsistent.Conventional routing protocols are simultaneously It is inapplicable.2. legacy protocol causes to lead to the critical path for collecting node with shortest path or minimum delay as optimization aim, necessarily Node energy exhausts rapidly on footpath, shortens network lifecycle, while change in topology is too fast, does not meet the design mesh of Routing Protocol Mark.3. legacy protocol reaches the requirement of routing convergence in global scope can cause the limited sensor network nodes of computing capability Overload, same causes some node pre-mature exhaustion energy, is unfavorable for network stabilization.4. the group for being proposed for MANET Net and communication protocol, are also generally unfit in sensor network.
In sum, the consideration in terms of traditional Routing Protocol lacks to energy-conservation, and autgmentability does not reach sensor yet The requirement at networking, conventional routing protocols can not be applicable;Node energy exhausts rapidly on towards the critical path for collect node;It is limited Sensor network nodes overload.
The content of the invention
It is an object of the invention to provide the cluster head election in a kind of energy heterogeneous wireless sensor network and its rotation side Method, it is intended to solve the consideration in terms of traditional Routing Protocol lacks to energy-conservation, and autgmentability does not reach sensor networking yet It is required that, conventional routing protocols can not be applicable;Node energy exhausts rapidly on towards the critical path for collect node;Limited sensing The problem of device network node overload.
The present invention is achieved in that cluster head election and its rotation side in a kind of energy heterogeneous wireless sensor network Method, is roughly divided into startup stage and stabilization sub stage, and in startup stage, sensor node selection random number, random number is less than threshold value T (ni) node as cluster head, transmitted in stabilization sub stage, node continuous collecting data and to cluster head, cluster head is by the node in the cluster The data for transmitting are sent to sink nodes after carrying out fusion treatment.Because each node energy is different, threshold value T (ni) also different, often One wheel chooses cluster head using the method for cluster head rotation.Cluster head election and its rotation in the energy heterogeneous wireless sensor network Method is comprised the following steps:
Step one, cluster head chooses stage, the node different for primary power, the threshold value T (n of generationi) also different, it is in The sensor node of active state can generate the random number between 0-1, if this number is less than its corresponding threshold values T (n), should Node is elected as cluster head;
Step 2, the establishment stage of cluster, after cluster head node is produced, actively to this message of all node broadcasts in network; The sensor node for being not selected as cluster head selects optimal cluster head, and sends the solicited message for adding the cluster;Cluster head is received please After asking, node is set to member in cluster;After cluster is formed, cluster head informs to be each node distribution one in cluster by broadcast mode Individual tdma communication time slot;Only in one's own time slot, member node just can send data to cluster head node;
Step 3, transmits the stabilization sub stage of data, for aggregation and processing data, route data;Node gathered data is right Data are merged.
Further, the step 2 is specifically included:
(1) P is elected in each roundoptN number of leader cluster node, wherein PoptIt is optimization cluster head ratio, is also probability-weighted, N It is total nodal point number of whole network;N-thiIndividual node is by following threshold value T (ni) (probability threshold) come decide whether turn into cluster head Node:
Wherein, r is current wheel number, and G is nearestDo not have to turn into the node set of cluster head in wheel;Each Node has the opportunity to turn into the more leader cluster node of consumed energy in turn;
E0Represent the primary power of ordinary node, a1,a2,...,anThe ratio shared by n kind special joints, b are represented respectively1, b2,...,bnRepresent that special joint primary power exceedes the multiple of ordinary node primary power respectively;
a1N,a2N,...,anThe primary power of N number of special joint is respectively E0(1+b1),E0(1+b2),...,E0(1+bn), Remaining (1-a1-a2,...-an) N number of ordinary node primary power be E0(1+bn);
The total primary power of multi-tier Heterogeneous network is:
It is assumed that N number of sensor node is evenly distributed on the border circular areas that a radius is A at random, sink nodes are located at region Centre, the gross energy that is consumed is during each round sends data to cluster head:
Wherein, l is cluster head number, EelecRepresent the energy consumed per bit data during operation transmission circuit or receiving circuit Amount, EDAThe cost of data fusion is performed for cluster head,It is cluster head to the average distance of sink nodes,It is bunch member node To the average distance of leader cluster node, εampd4 sinkWithIt is the energy of amplifier consumption.
It is calculated
To EroundLocal derviation is sought on l, and it is 0 to make the partial derivative, then optimal cluster head number is
Obtain the energy sum E that network is consumed in each roundround.Meanwhile,
The initial total energy E of networktotal, it is known that RtotalIt is the estimate of network lifecycle, also can obtain
Rtatal=Etotal/Eround
Different probability-weighted P are taken according to its primary power to this n+1 kinds nodei
(2) the present energy E that node i is taken turns in riR () chooses its cluster head T turnaround timei,Represent network in r The average energy of wheel, withAs reference energy and the present energy E of nodeiR () is made comparisons, obtain:
Wherein, PoptIt is optimization cluster head ratio;
The average energy of each node of network is after r wheels:
Substitute intoIt is calculated probability-weighted Hi(r);
Obtain the probability threshold of each node.
Cluster head election and its shift process in the energy heterogeneous wireless sensor network that the present invention is provided, cluster set up rank Section, only in one's own time slot, member node just can send data to cluster head node, it is ensured that the communication in cluster is not There is conflict;The stabilization sub stage of data is transmitted, for aggregation and processing data, route data;Data are entered by node gathered data Row fusion, so can not only reduce the transmission of redundant data, while improving transmission reliability.
The present invention improves the overall equilibrium degree of offered load while WSN data transmission credibilities are ensured, effectively reduces Data redundancy and reduction node energy loss, so as to extend the working life of WSN;Combine sensor technology, embedding people's formula meter Calculation technology, modern network and wireless communication technology, distributed information processing etc., can be by all kinds of integrated miniature biographies Sensor collaboratively real-time monitoring, the data danger for perceiving and gathering various monitoring objects, data are wirelessly sent, and with User terminal is sent to from the network mode of group multi-hop, so as to realize that people study the purpose of nature.
Brief description of the drawings
Fig. 1 is cluster head election and its shift process in energy heterogeneous wireless sensor network provided in an embodiment of the present invention Flow chart.
Fig. 2 and Fig. 3 are provided in an embodiment of the present invention and LESCH algorithms contrast schematic diagram.
Specific embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to embodiments, to the present invention It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to Limit the present invention.
Application principle of the invention is explained in detail below in conjunction with the accompanying drawings.
As shown in figure 1, cluster head election and its wheel in energy heterogeneous wireless sensor network provided in an embodiment of the present invention The method of changing is comprised the following steps:
S101:Cluster head chooses the stage, and the node different for primary power, the threshold value of generation is also different, in enlivening shape The sensor node of state can generate the random number between 0-1, if this number is less than its corresponding threshold values T (n), the node is worked as Elect cluster head as;
S102:The establishment stage of cluster, after cluster head node is produced, actively to this message of all node broadcasts in network;Not The sensor node for being selected as cluster head selects optimal cluster head, and sends the solicited message for adding the cluster;Cluster head receives request Afterwards, node is set to member in cluster;After cluster is formed, cluster head informs to be each node distribution one in cluster by broadcast mode Tdma communication time slot;Only in one's own time slot, member node just can send data to cluster head node;
S103:The stabilization sub stage of data is transmitted, for aggregation and processing data, route data;Node gathered data, logarithm According to being merged.
Specifically include in step s 102:
N number of sensor node is had in network to be evenly distributed at random in the border circular areas that a radius is A, cluster covering Area size is limited in the region that radius is r, i.e., the node in cluster head communication radius r could turn into this cluster member.
Assuming that sensor network has following property:
A) sensor node is fixed.
B) Sink node is deployed in a fixed position beyond region A × A, and Sink node is unique.
C) network need not be safeguarded artificially after disposing.
D) sensor network interior joint is energy heterogeneous.
E) sensor node is in the direct communications range of other nodes, and directly can be communicated with Sink node.
F) node location has randomness, and without equipment GPS, can not know its specific position by the method for measuring Put.
The present invention is obtained on the basis of homogeneous network cluster head routing algorithm.
During isomorphism, in order to be balanced the load in all-network node, about PN leader cluster node is elected in each round, its Middle P is optimization cluster head ratio, is also herein probability-weighted.Each node is decided whether to turn into by following probability threshold Leader cluster node:
Wherein, r is current wheel number, and G is nearestDo not have to turn into the node set of cluster head in wheel;Each Node has the opportunity to turn into the more leader cluster node of consumed energy in turn.
Ordinary node (Normal node) and n kinds special joint (Special node) are included in network, they have not Same primary power.
If E0Represent the primary power of ordinary node, a1,a2,...,anThe ratio shared by n kind special joints is represented respectively, b1,b2,...,bnRepresent that special joint primary power exceedes the multiple of ordinary node primary power respectively.
a1N,a2N,...,anThe primary power of N number of special joint is respectively E0(1+b1),E0(1+b2),...,E0(1+bn), Remaining (1-a1-a2,...-an) N number of ordinary node primary power be E0(1+bn)。
The total primary power of multi-tier Heterogeneous network is:
Different probability-weighted P are taken according to its primary power to this n+1 kinds nodei
The wheel number that special joint turns into cluster head is less than ordinary node so that special joint is as the chance of cluster head more than general Logical node turns into the chance of cluster head.
First run data transfer is completed, into next round.
Changed by the energy of first round part of nodes, in addition it is also necessary to counted again with reference to the present energy situation of each node New probability-weighted Hi(r)。
The present energy E that the present invention is taken turns based on node i in riR () chooses its cluster head T turnaround timei.Due to node tool There are different present energies, the probability-weighted H of high-energy nodeiR () should be bigger than low energy node, can just make network uniform Ground consumed energy is extending the life cycle of network.
IfThe average energy that network is taken turns in r is represented, withAs reference energy and the present energy E of nodei R () is made comparisons, obtain:
Wherein, PoptIt is optimization cluster head ratio.
The present energy E of nodeiR () can directly measure, and average energyIt is difficult to obtain, it is necessary to be estimated.
It is assumed that sink nodes are located in the middle of border circular areas, the data of k bits are sent to cluster head, in the energy of each round consumption Measure and be:
Wherein, l is cluster head number, EelecRepresent the energy consumed per bit data during operation transmission circuit or receiving circuit Amount, EDAThe cost of data fusion is performed for cluster head,It is cluster head to the average distance of sink nodes,It is bunch member node To the average distance of leader cluster node, εampd4 sinkWithIt is the energy of amplifier consumption.
It is calculated
To EroundLocal derviation is sought on l, and it is 0 to make the partial derivative, then optimal cluster head number is:
Obtain the energy sum E that network is consumed in each roundround
The initial total energy E of networktotalIt is known, then the estimate of network lifecycle also can obtain:
Rtatal=Etotal/Eround
Ideally each node is roughly the same in the energy that each round is consumed, and each node of network is flat after r wheels Equal energy is:
Substitute intoIt is calculated probability-weighted Hi(r)。
Substitute into, obtain the probability threshold of each node.
To ensure that sensor node cluster head will not be overweight and dead because of traffic load, the dump energy threshold value for setting cluster head is Emin, when node present energy is less than threshold value, it is no longer participate in the selection of cluster head.
Step S104 of the invention is specifically included:
After cluster is formed, into the stabilization sub stage, stable state operation is made up of several time frames.
Each leader cluster node serves as expeditor and control centre's effect of data transfer in respective cluster, and leader cluster node is The data transmission conflict between cluster interior nodes is avoided, the packet that cluster interior nodes are gathered is received successively using time division multiplex strategy.
Be processed the data of each node in cluster such as data fusion by leader cluster node, centralized calculation etc., then will be after processing Data is activation give certain gateway node, the gateway node is transferred to s ink nodes again after data are reprocessed.
The step of data fusion, specifically includes:
Aggregators of the sensor node as the cluster, i.e. cluster head are selected in each cluster;
Determine the data fusion mode of the network, including:
(1) data fusion in layer.Data fusion is that the sensor that receives in the cluster of each cluster head of this layer is adopted in layer The all information for collecting, and the data fusion for carrying out;
(2) inter-layer data fusion.Inter-layer data fusion is that the aggregators of this layer receive other layer of all letters of transmission Breath, and the data fusion for carrying out;
Determine the data transfer mode of network, including:
The comentropy that sensor in each cluster is collected it is transferred to the aggregators of the cluster;
The cluster head of each cluster gives the information transfer after data fusion in the layer and inter-layer data fusion than bag Layer where including the cluster apart from sink nodes closer to layer aggregators;
The aggregators of each layer only have in the completion layer after data fusion and inter-layer data fusion Continue to transmit the information after the data fusion;
Comentropy after the data fusion is finally delivered to the aggregation node.
Presently preferred embodiments of the present invention is the foregoing is only, is not intended to limit the invention, it is all in essence of the invention Any modification, equivalent and improvement made within god and principle etc., should be included within the scope of the present invention.

Claims (5)

1. the cluster head in a kind of energy heterogeneous wireless sensor network is elected and its shift process, it is characterised in that the energy Cluster head election and its shift process in heterogeneous wireless sensor network are divided into startup stage and stabilization sub stage;In startup stage, Sensor node selects random number, random number to be less than threshold value T (ni) node as cluster;In stabilization sub stage, node continuous collecting Data are simultaneously transmitted to cluster head, and the data that cluster head transmits the node in the cluster are sent to sink nodes after carrying out fusion treatment;By Different, the threshold value T (n in each node energyi) also different, each round chooses cluster head using the method for cluster head rotation.
2. the cluster head in energy heterogeneous wireless sensor network as claimed in claim 1 is elected and its shift process, its feature It is that the cluster head election and its shift process in the energy heterogeneous wireless sensor network are comprised the following steps:
Step one, cluster head chooses the stage, and the node different for primary power, the threshold value of generation is also different, in active state Sensor node can generate random number between 0-1, if this number is less than its corresponding threshold values T (n), the node is elected to It is cluster head;
Step 2, the establishment stage of cluster, after cluster head node is produced, actively to this message of all node broadcasts in network;Not by The sensor node for being selected as cluster head selects optimal cluster head, and sends the solicited message for adding the cluster;After cluster head receives request, Node is set to member in cluster;After cluster is formed, cluster head informs to be each node distribution one in cluster by broadcast mode Tdma communication time slot;Only in one's own time slot, member node just can send data to cluster head node;
Step 3, transmits the stabilization sub stage of data, for aggregation and processing data, route data;Node gathered data, to data Merged.
3. the cluster head in energy heterogeneous wireless sensor network as claimed in claim 2 is elected and its shift process, its feature It is that the step 2 is specifically included:
(1) PN leader cluster node is elected in each round, wherein P is optimization cluster head ratio, is also probability-weighted;Each node Decided whether to turn into leader cluster node by following probability threshold:
T ( n i ) = P o p t 1 - P o p t [ r mod ( 1 / P o p t ) ] , ∀ n i ∈ G 0 , ∀ n i ∉ G ;
Wherein, r is current wheel number, and G is nearestDo not have to turn into the node set of cluster head in wheel;Each node Have the opportunity to turn into the more leader cluster node of consumed energy in turn;
E0Represent the primary power of ordinary node, a1,a2,...,anThe ratio shared by n kind special joints, b are represented respectively1, b2,...,bnRepresent that special joint primary power exceedes the multiple of ordinary node primary power respectively;
a1N,a2N,...,anThe primary power of N number of special joint is respectively E0(1+b1),E0(1+b2),...,E0(1+bn), it is left (1-a1-a2,...-an) N number of ordinary node primary power be E0(1+bn);
The total primary power of multi-tier Heterogeneous network is:
E t o t a l = E 0 ( 1 + b 1 ) a 1 N + E 0 ( 1 + b 2 ) a 2 N + ... + E 0 ( 1 + b n ) a n N + E 0 ( 1 - a 1 - a 2 - ... - a n ) N = E 0 N ( 1 + a 1 b 1 + a 2 b 2 + ... + a n b n ) = E 0 N ( 1 + Σ i = 1 n a i b i ) ;
N number of sensor node is evenly distributed on the border circular areas that a radius is A at random, and sink nodes are located in the middle of region, often One take turns send data to cluster head during the gross energy that is consumed be:
E r o u n d = k ( 2 NE e l e c + NE D A + lϵ a m p d 4 sin k + Nϵ f s d ‾ C H 2 )
Wherein, l is cluster head number, EelecThe energy consumed per bit data during operation transmission circuit or receiving circuit is represented, EDAThe cost of data fusion is performed for cluster head,It is cluster head to the average distance of sink nodes,It is bunch member node to cluster The average distance of head node, εampd4 sinkWithIt is the energy of amplifier consumption:
It is calculated
To EroundLocal derviation is sought on l, and it is 0 to make the partial derivative, then optimal cluster head number is:
l o p t = N 2 ϵ f s ϵ a m p A d 2 sin k ;
Obtain the energy sum E that network is consumed in each roundround;Meanwhile,
The initial total energy E of networktotal, it is known that RtotalIt is the estimate of network lifecycle, also can obtain:
Rtatal=Etotal/Eround
Different probability-weighted P are taken according to its primary power to this n+1 kinds nodei
P 1 = 1 + b 1 1 + Σ i = 1 n a i b i , P 2 = 1 + b 2 1 + Σ i = 1 n a i b i , ... , P n = 1 + b n 1 + Σ i = 1 n a i b i , P 0 = 1 1 + Σ i = 1 n a i b i ,
(2) the present energy E that node i is taken turns in riR () chooses its cluster head T turnaround timei,Represent what network was taken turns in r Average energy, withAs reference energy and the present energy E of nodeiR () is made comparisons, obtain:
H i ( r ) = P o p t E i ( r ) E ‾ ( r ) P i ;
Wherein, PoptIt is optimization cluster head ratio;
The average energy of each node of network is after r wheels:
E ‾ ( r ) = E t o t a l N ( 1 - r R t o t a l ) ;
Substitute intoIt is calculated probability-weighted Hi(r);
H 1 ( r ) = P o p t E 1 ( r ) E ‾ ( r ) 1 + b 1 1 + Σ i = 1 n a i b i , H 2 ( r ) = P o p t E 2 ( r ) E ‾ ( r ) 1 + b 2 1 + Σ i = 1 n a i b i , ... ,
H n ( r ) = P o p t E n ( r ) E ‾ ( r ) 1 + b n 1 + Σ i = 1 n a i b i , H 2 ( r ) = P o p t E 0 ( r ) E ‾ ( r ) 1 1 + Σ i = 1 n a i b i ,
Obtain the probability threshold of each node.
4. the cluster head in energy heterogeneous wireless sensor network as claimed in claim 2 is elected and its shift process, its feature It is that the step 4 data fusion is specifically included:
(1) data fusion mode of the network is determined, including:
Data fusion in layer, data fusion is the institute that collects of the sensor that receives in the cluster of each cluster head of this layer in layer There is information, and the data fusion for carrying out;
Inter-layer data is merged, and inter-layer data fusion is that the aggregators of this layer receive other layer of all information of transmission, and is entered Capable data fusion;
(2) data transfer mode of network is determined, including:
The comentropy that sensor in each cluster is collected it is transferred to the aggregators of the cluster;
The cluster head of each cluster gives the information transfer after data fusion in the layer and inter-layer data fusion than including institute Layer where stating cluster apart from sink nodes closer to layer aggregators;
The aggregators of each layer only have data fusion and the inter-layer data in the completion layer just to continue after merging Transmit the information after the data fusion;
Comentropy after the data fusion is finally delivered to the aggregation node.
5. in energy heterogeneous wireless sensor network described in a kind of utilization claim 1~2 any one cluster head election and its The wireless sensor network of shift process.
CN201611254285.7A 2016-12-30 2016-12-30 Cluster head election and rotation method in energy heterogeneous wireless sensor network Active CN106792973B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611254285.7A CN106792973B (en) 2016-12-30 2016-12-30 Cluster head election and rotation method in energy heterogeneous wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611254285.7A CN106792973B (en) 2016-12-30 2016-12-30 Cluster head election and rotation method in energy heterogeneous wireless sensor network

Publications (2)

Publication Number Publication Date
CN106792973A true CN106792973A (en) 2017-05-31
CN106792973B CN106792973B (en) 2020-06-30

Family

ID=58954284

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611254285.7A Active CN106792973B (en) 2016-12-30 2016-12-30 Cluster head election and rotation method in energy heterogeneous wireless sensor network

Country Status (1)

Country Link
CN (1) CN106792973B (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107529201A (en) * 2017-08-29 2017-12-29 武汉中原电子信息有限公司 A kind of wireless sensor network data transmission method based on LEACH agreements
CN108366409A (en) * 2018-03-13 2018-08-03 重庆邮电大学 A kind of reliable multipath polyaluminium chloride PAC algorithm based on balancing energy
CN109041161A (en) * 2018-09-05 2018-12-18 重庆邮电大学 Cognitive radio sensor network low energy adaptability cluster-dividing method based on heterogeneous nodes
CN109698982A (en) * 2017-10-23 2019-04-30 中兴通讯股份有限公司 Control channel implementation method, device, equipment, storage medium and processing method
CN110113798A (en) * 2019-05-30 2019-08-09 武汉大学 A kind of homoorganicity Routing Protocol method under multi-source wireless sensor network environment
CN110225567A (en) * 2019-04-25 2019-09-10 北京邮电大学 A kind of sensor network cluster-dividing method based on fairness and energy consumption rate
CN110460966A (en) * 2019-09-23 2019-11-15 东莞理工学院 A kind of energy consumption reduction method of wireless multi-hop network
CN110763269A (en) * 2019-09-29 2020-02-07 上海大学 Environmental safety monitoring system of transformer substation
CN111537022A (en) * 2020-04-29 2020-08-14 江西天境精藏科技有限公司 Punch forming production workshop safety monitoring system based on artificial intelligence
CN111726847A (en) * 2020-06-17 2020-09-29 荆门汇易佳信息科技有限公司 Improved grouping method of wireless sensor network based on node energy and density
CN112188518A (en) * 2020-09-07 2021-01-05 北京燧昀科技有限公司 Sensor node communication optimization method and device and readable storage medium
WO2021164791A1 (en) * 2020-02-19 2021-08-26 重庆邮电大学 Method for selecting optimal multi-hop path for wireless sensor

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110130162A1 (en) * 2009-11-30 2011-06-02 Electronics And Telecommunications Research Institute Method for cluster based data transmission in wireless sensor networks
CN103179631A (en) * 2013-04-19 2013-06-26 西安电子科技大学 Method for selecting optimal angle to perform clustering
CN104301903A (en) * 2014-09-30 2015-01-21 西安电子科技大学 Wireless sensor network cluster selection protocol for survivability analysis and on basis of coverage
CN105722174A (en) * 2016-02-01 2016-06-29 国网新疆电力公司电力科学研究院 Node link scheduling method of heterogeneous integrated power consumption information collection network
CN105898764A (en) * 2016-05-30 2016-08-24 四川大学 Multi-stage energy heterogeneous wireless sensor network deployment method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110130162A1 (en) * 2009-11-30 2011-06-02 Electronics And Telecommunications Research Institute Method for cluster based data transmission in wireless sensor networks
CN103179631A (en) * 2013-04-19 2013-06-26 西安电子科技大学 Method for selecting optimal angle to perform clustering
CN104301903A (en) * 2014-09-30 2015-01-21 西安电子科技大学 Wireless sensor network cluster selection protocol for survivability analysis and on basis of coverage
CN105722174A (en) * 2016-02-01 2016-06-29 国网新疆电力公司电力科学研究院 Node link scheduling method of heterogeneous integrated power consumption information collection network
CN105898764A (en) * 2016-05-30 2016-08-24 四川大学 Multi-stage energy heterogeneous wireless sensor network deployment method

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107529201A (en) * 2017-08-29 2017-12-29 武汉中原电子信息有限公司 A kind of wireless sensor network data transmission method based on LEACH agreements
CN109698982A (en) * 2017-10-23 2019-04-30 中兴通讯股份有限公司 Control channel implementation method, device, equipment, storage medium and processing method
CN109698982B (en) * 2017-10-23 2021-09-21 中兴通讯股份有限公司 Control channel implementation method, device, equipment, storage medium and processing method
CN108366409A (en) * 2018-03-13 2018-08-03 重庆邮电大学 A kind of reliable multipath polyaluminium chloride PAC algorithm based on balancing energy
CN109041161B (en) * 2018-09-05 2021-07-06 重庆邮电大学 Heterogeneous node-based low-energy adaptive clustering method for wireless cognitive sensor network
CN109041161A (en) * 2018-09-05 2018-12-18 重庆邮电大学 Cognitive radio sensor network low energy adaptability cluster-dividing method based on heterogeneous nodes
CN110225567A (en) * 2019-04-25 2019-09-10 北京邮电大学 A kind of sensor network cluster-dividing method based on fairness and energy consumption rate
CN110113798A (en) * 2019-05-30 2019-08-09 武汉大学 A kind of homoorganicity Routing Protocol method under multi-source wireless sensor network environment
CN110113798B (en) * 2019-05-30 2022-11-18 武汉大学 Isomorphic routing protocol method in multi-source wireless sensor network environment
CN110460966A (en) * 2019-09-23 2019-11-15 东莞理工学院 A kind of energy consumption reduction method of wireless multi-hop network
CN110763269B (en) * 2019-09-29 2020-08-14 上海大学 Environmental safety monitoring system of transformer substation
CN110763269A (en) * 2019-09-29 2020-02-07 上海大学 Environmental safety monitoring system of transformer substation
WO2021164791A1 (en) * 2020-02-19 2021-08-26 重庆邮电大学 Method for selecting optimal multi-hop path for wireless sensor
CN111537022A (en) * 2020-04-29 2020-08-14 江西天境精藏科技有限公司 Punch forming production workshop safety monitoring system based on artificial intelligence
CN111726847A (en) * 2020-06-17 2020-09-29 荆门汇易佳信息科技有限公司 Improved grouping method of wireless sensor network based on node energy and density
CN112188518A (en) * 2020-09-07 2021-01-05 北京燧昀科技有限公司 Sensor node communication optimization method and device and readable storage medium
CN112188518B (en) * 2020-09-07 2024-02-13 北京燧昀科技有限公司 Sensor node communication optimization method and device and readable storage medium

Also Published As

Publication number Publication date
CN106792973B (en) 2020-06-30

Similar Documents

Publication Publication Date Title
CN106792973A (en) Cluster head election and its shift process in a kind of energy heterogeneous wireless sensor network
CN102448138B (en) Method for clustering hierarchical routing protocols of wireless sensor network
CN108064065A (en) A kind of long-distance water quality monitoring system based on wireless sensor network
CN107529201A (en) A kind of wireless sensor network data transmission method based on LEACH agreements
CN101917750B (en) Least effort delivering zone-spanned virtual cluster multi-hop routing method
CN102970723B (en) With the Uneven Cluster routing algorithm of local cluster reconstruction
CN102438291B (en) Data aggregation method for increasing capacity of wireless sensor network
CN106973419A (en) A kind of innovatory algorithm of LEACH agreements
CN101594657A (en) In the radio sensing network based on the election of cluster head method of soft-threshold
CN103347288B (en) A kind of wireless sensor network does not wait width hierarchical routing protocol method
CN107257572A (en) A kind of cluster routing method of wireless sense network
CN104093186B (en) A kind of multi-hop wireless sensing network chance method for routing and its system
CN103095577B (en) Context-sensitive Uneven Cluster routing algorithm
CN101640944B (en) Clustering and multi-hop communication method of wireless sensor
CN101562862A (en) Routing method for balancing energy of wireless sensor network
CN103347294A (en) Wireless sensor system and data collecting method
CN104135751A (en) Non-uniform clustering routing method suitable for subway tunnel
CN107404745A (en) A kind of fire detector remote detecting system based on MANET
CN104994020A (en) Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model
CN107360612A (en) A kind of data transmission method of the wireless sensor network based on ant colony multipath
CN101252543B (en) Rapid data anastomosing algorithm used for wireless sensor network
CN106559731A (en) A kind of sewage monitoring wireless sensor network
CN107222906A (en) LEACH protocol optimization methods based on ant group algorithm
CN102983948B (en) A kind of radio sensing network self-adaption cluster transmission method and device thereof
CN106851596A (en) A kind of dynamic ad hoc network method of agricultural environment wireless sense network

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