CN108307471B - Energy balance cluster head node selection method - Google Patents
Energy balance cluster head node selection method Download PDFInfo
- Publication number
- CN108307471B CN108307471B CN201810032635.8A CN201810032635A CN108307471B CN 108307471 B CN108307471 B CN 108307471B CN 201810032635 A CN201810032635 A CN 201810032635A CN 108307471 B CN108307471 B CN 108307471B
- Authority
- CN
- China
- Prior art keywords
- cluster
- cluster head
- head node
- node
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 241000854291 Dianthus carthusianorum Species 0.000 title claims abstract description 195
- 238000010187 selection method Methods 0.000 title claims description 8
- 238000005265 energy consumption Methods 0.000 claims abstract description 37
- 230000005540 biological transmission Effects 0.000 claims abstract description 33
- 238000004891 communication Methods 0.000 claims description 11
- 230000004927 fusion Effects 0.000 claims description 10
- 238000005562 fading Methods 0.000 claims description 6
- 238000005259 measurement Methods 0.000 claims 1
- 238000000034 method Methods 0.000 abstract description 6
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 238000013461 design Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000032683 aging Effects 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an energy-balanced cluster head node selection algorithm, which is characterized in that a base station sends a broadcast message to a sensor node and global clustering is carried out according to an LEACH algorithm; calculating the distance between the sensor node and the base station; the cluster head node allocates time slots for non-cluster head nodes in the cluster and calculates the energy consumption of the cluster head nodes in the process of transmitting data packets; calculating the residual energy of the sensor node if the sensor node becomes a cluster head node; selecting the sensor node with the maximum residual energy as a cluster head node, updating the distribution time slot to re-locally cluster, and further starting data packet transmission; and carrying out local clustering by the residual energy to complete all data packet transmission. Compared with the prior art, the invention reduces the cluster structure change, prolongs the life cycle of the node and is beneficial to energy balance.
Description
Technical Field
The invention relates to a wireless sensor network routing protocol, in particular to an energy balance cluster head node selection method.
Background
A Wireless Sensor Network (WSN) comprised of a plurality of battery-powered microsensor nodes may form an ad hoc network. As a new information acquisition and processing mode, it has been widely used in the fields of military, environmental, medical, industrial, and vehicle ad hoc networks. In healthcare, the aging world population has forced people to design new, more widespread, and less cost-effective medical systems. Distributed and networked embedded systems such as wireless sensor networks are the most attractive technology for continuously monitoring the safety of the elderly without affecting their daily activities. In the aspects of real-time remote monitoring and computer-assisted rehabilitation emergency response systems, wireless sensor networks have rapidly developed.
Since the energy of the sensor nodes is limited and difficult to charge, how to save the energy of the sensor nodes to prolong the service life of the network has become a research hotspot. The routing protocol is an important component of the wireless sensor network, and directly influences the energy consumption of the sensor nodes. In order to extend the network lifetime, we need to design an efficient routing protocol. Based on the network structure, the routing protocol in the wireless sensor network can be divided into a planar route and a cluster route. Cluster routing is more efficient in terms of energy consumption than planar routing. Low Energy Adaptive Clustering Hierarchy (LEACH) is a first proposed cluster routing algorithm by Heinzelman et al. In order to save energy, the number of nodes communicating with a Base Station (BS) is reduced in the algorithm, and the transmission amount of data is reduced through a data fusion technology. The algorithm takes turns as a working cycle, and a new Cluster Head (CH) is randomly selected in each turn according to the energy consumption condition distributed by all nodes in the network. However, LEACH has some disadvantages. Firstly, the cluster head selection method is unstable in terms of the number and the positions of nodes, and is not favorable for energy balance. Although some documents mention that energy consumption can be balanced by a strategy of predicting node deployment, the method needs a large amount of labor cost to deploy the sensors and is not suitable for general scenes. And secondly, the rest energy of the nodes is not considered by the cluster head selection method, so that the low-energy nodes can quickly exhaust the energy when acting as the cluster heads. Thirdly, information is sent to the sink node through a single hop, and excessive energy is consumed by long-distance communication. LEACH is not suitable for large-scale network use.
In recent years, researchers have improved LEACH, and many novel cluster routing algorithms based on LEACH are proposed. For example, DCHS, TEEN and APTEEN are designed based on clustering ideas borrowed from LEACH. The cluster routing needs to update the cluster structure frequently, and random or unreasonable cluster head selection mode can cause uneven network energy consumption.
Disclosure of Invention
In order to solve the defects in the prior art, the technical scheme of the invention is an energy-balanced cluster head node selection method. The method comprises the following steps:
step 1, deploying N sensor nodes, sending broadcast messages to the N sensor nodes through a base station, carrying out global clustering on the N sensor nodes according to an LEACH algorithm, and transmitting data packets of k times;
step 2, the sensor nodes detect the signal intensity of the received broadcast message according to hardware, and the distance between the sensor nodes and the base station is calculated by combining the signal intensity of the broadcast message sent to the N sensor nodes by the base station in the step 1;
step 3, the cluster head nodes distribute time slots for non-cluster head nodes in the cluster, the energy consumption of the cluster head nodes for receiving data packets transmitted by the non-cluster head nodes in the cluster is calculated, the energy consumption of the cluster head nodes for performing data fusion on the received data packets is calculated, the energy consumption of the cluster head nodes for transmitting the fused data packets to a base station is calculated, and the 1 st time of data packet transmission is finished;
step 4, keeping the cluster structure in the step 1 unchanged when data is transmitted for the (o 2 is more than or equal to o and less than or equal to k), sending a broadcast message to a non-cluster-head node in the cluster by the cluster-head node in the (o 2 is more than or equal to o and less than or equal to k) th time of data packet transmission, sending the broadcast message to the cluster-head node by the non-cluster-head node in the cluster after receiving the broadcast message, and further calculating the residual energy of all sensor nodes in the cluster if the sensor nodes become cluster-head nodes when the data packets are transmitted for the (o 2 is more than or equal to o and less than or equal to k) th time according to;
step 5, selecting the sensor node with the maximum residual energy as a cluster head node when the data packet is transmitted for the (o) th time, updating the non-cluster-head node distribution time slot in the cluster by judging the change of the cluster head node, and starting to transmit the data packet for the (o) th time;
and 6, repeating the step 4 and the step 5 to complete the data packet transmission for k times.
Preferably, in step 1, the base station sends a broadcast message to N sensor nodes:
messageinfo＝{cinfo，powersend，k}
wherein, cinfoRepresenting global clustering messages, powersendSending the signal strength of the broadcast message to N sensor nodes for a base station, wherein k is a clustering period of data packet transmission, namely, the LEACH algorithm global clustering in the step 1 is carried out once every k times of data packet transmission;
generating m clusters after the LEACH algorithm in the step 1 completes global clustering, wherein the serial number of the cluster is C1，C2，...，CmThe serial number of the cluster head node is H1，H2，...，HmCluster Ci(i∈[1，m]I is a positive integer) of the corresponding sensor node is
(
Represents a cluster CiThe number of the nodes of the middle sensor,
) Then si，1Is a cluster head node with the number of Hi；
Preferably, the sensor node in step 2
Distance from base station:
wherein,
as sensor node si，jBased on the hardware detecting the signal strength of the received broadcast message, α is the constant for communication:
wherein, powersendSending the signal strength of a broadcast message to N sensor nodes by the base station in the step 1, wherein c represents the light speed, and f represents the communication frequency;
preferably, the cluster C in step 3iMiddle cluster head node HiFor non-cluster head nodes in a cluster
The allocated time slot is as follows:
wherein the non-cluster head node
In a time slot
Transmitting data packets to cluster head node Hi；
Cluster head node HiReceiving cluster CiIn
The energy consumption of the data packet transmitted by each non-cluster head node is as follows:
wherein, l is the number of bits of the data packet transmitted by the sensor node, EelecCircuit power consumption for transmitting unit bit data; cluster head node HiThe energy consumption for fusing the received data packets is as follows:
wherein, l is the number of bits of the data packet transmitted by the sensor node, EfEnergy consumed for fusing unit bit data;
cluster head node HiThe energy consumption for transmitting the fused data packet to the base station is as follows:
wherein D issi，1，bFor the cluster head node s in step 2i，1Distance from base station, ∈fsAs free space model parameters, ∈mpFor a multipath fading modeType parameter, d0Threshold for first order radio transmission distance:
preferably, in step 4, the non-cluster-head node in the cluster receives the broadcast message and then sends the broadcast message to the cluster-head node HiAnd sending a broadcast message:
wherein,
is a cluster CiThe middle non-cluster-head node is selected,
is a cluster CiThe current energy of the middle non-cluster head node is measured by hardware,
is a cluster CiThe current energy of the middle non-cluster head node is measured by hardware,
for the non-cluster head node s in step 2i，jThe distance to the base station(s),
is a cluster CiMiddle non-cluster head node
If the cluster head node becomes the original cluster head node HiThe non-cluster head nodes are formed, and the energy consumption for transmitting data packets transmitted by n-1 non-cluster head nodes is as follows:
wherein,
for the non-cluster head node in step 2
Distance from base station, ∈fsAs free space model parameters, ∈mpAs are the parameters of the multi-path fading model,
a threshold value that is a first order radio communication transmission distance;
according to the energy consumption of the cluster head node in the step 3 for receiving the data packet transmitted by the non-cluster head node in the cluster, the cluster head node will receive the data packetEnergy consumption is consumed when data fusion is carried out on data packets, and energy consumption is consumed when the fused data packets are transmitted to a base station by a cluster head node
The remaining energy of all the sensor nodes in the cluster after becoming cluster head nodes is as follows:
preferably, the sensor node with the largest residual energy in step 5 is:
wherein
Is composed of
Maximum value of (2), sensor node
The cluster is Ci(i is more than or equal to 1 and less than or equal to m), if the cluster head node s of the new data transmissioni，qCluster head node H for data transmission in step 3iSame, then cluster head node HiAccording to the step 3, the non-cluster head nodes in the cluster
Allocating time slot and carrying out the data transmission, otherwise, clustering the head node HiIn cluster CiMedium broadcast cluster head change message:
wherein，
Represents a cluster CiChange of middle cluster head node, si，qIs a new cluster head node, and simultaneously si，qTime slot of
As a primary cluster head node HiTime slot of (1), said cluster C in step 1iMiddle non-cluster head node
Receiving a broadcast message
Then, judge si，qAnd carrying out data transmission at the position of the non-cluster head node.
Compared with the prior art, the invention reduces the cluster structure change, prolongs the life cycle of the node and is beneficial to energy balance.
Drawings
FIG. 1: is a method flow diagram of an embodiment of the invention.
Detailed Description
In order to facilitate the understanding and implementation of the present invention for those of ordinary skill in the art, the present invention is further described in detail with reference to the accompanying drawings and examples, it is to be understood that the embodiments described herein are merely illustrative and explanatory of the present invention and are not restrictive thereof.
Referring to fig. 1, a method flowchart of an embodiment of the present invention provides a method for selecting a cluster head node with balanced energy, including the following steps:
step 1, deploying N-100 sensor nodes, sending a broadcast message to the N-100 sensor nodes through a base station, performing global clustering on the N sensor nodes according to an LEACH algorithm, and transmitting a data packet with k-5 times;
in step 1, the base station sends broadcast messages to N-100 sensor nodes:
messageinfo＝{cinfo，powersend，k}
wherein, cinfoRepresenting global clustering messages, powersendSending the signal strength of the broadcast message to N-100 sensor nodes for the base station, where k-5 is a clustering period of data packet transmission, that is, performing the LEACH algorithm global clustering in step 1 once every time k-5 times of data packet transmission is performed;
generating m-5 clusters after the LEACH algorithm in the step 1 is subjected to global clustering, wherein the serial number of the cluster is C1，C2，...，CmThe serial number of the cluster head node is H1，H2，...，HmCluster Ci(i∈[1，m]I is a positive integer) of the corresponding sensor node is
(
Represents a cluster CiThe number of the nodes of the middle sensor,
) Then si，1Is a cluster head node with the number of Hi；
Step 2, the sensor nodes detect the signal intensity of the received broadcast message according to hardware, and calculate the distance between the sensor nodes and the base station by combining the signal intensity of the broadcast message sent by the base station to the N-100 sensor nodes in the step 1;
step 2, the sensor node
Distance from base station:
wherein,
as sensor node si，jBased on the hardware detecting the signal strength of the received broadcast message, α is the constant for communication:
wherein, powersend25dBm is the signal strength of the broadcast message sent by the base station to N100 sensor nodes in step 1, and c 3 × 108m/s represents the speed of light, and f-5 MHz represents the communication frequency;
step 3, the cluster head nodes distribute time slots for non-cluster head nodes in the cluster, the energy consumption of the cluster head nodes for receiving data packets transmitted by the non-cluster head nodes in the cluster is calculated, the energy consumption of the cluster head nodes for performing data fusion on the received data packets is calculated, the energy consumption of the cluster head nodes for transmitting the fused data packets to a base station is calculated, and the 1 st time of data packet transmission is finished;
in step 3, cluster CiMiddle cluster head node HiFor non-cluster head nodes in a cluster
The allocated time slot is as follows:
wherein the non-cluster head node
In a time slot
Transmitting data packets to cluster head node Hi；
Cluster head node HiReceiving cluster CiThe consumed energy of the data packets transmitted by the middle n-1 non-cluster-head nodes is as follows:
wherein, l is 4000bit, and E is the bit number of the data packet transmitted by the sensor nodeelec50nJ/bit is the circuit energy loss of the unit bit data;
cluster head node HiThe energy consumption for fusing the received data packets is as follows:
wherein, l is 4000bit, and E is the bit number of the data packet transmitted by the sensor nodef5nJ/bit is energy consumed by fusing unit bit data;
cluster head node HiThe energy consumption for transmitting the fused data packet to the base station is as follows:
wherein,
for the cluster head node s in step 2i，1Distance from base station, ∈fs＝10pJ/(bit·m2) As free space model parameters, ∈mp＝0.0013pJ/(bit·m4) For parameters of a multipath fading model, d087m is the threshold of the first-order radio communication transmission distance:
step 4, keeping the cluster structure in the step 1 unchanged when data is transmitted for the (o 2 is more than or equal to o and less than or equal to 5) th time, sending a broadcast message to a non-cluster-head node in the cluster by the cluster-head node in the (o 2 is more than or equal to o and less than or equal to 5) th time of data packet transmission, sending the broadcast message to the cluster-head node by the non-cluster-head node in the cluster after receiving the broadcast message, and further calculating the residual energy of all the sensor nodes in the cluster if the sensor nodes become cluster-head nodes when the data packet is transmitted for the (o 2 is more than or equal to o and less than or equal to 5);
preferably, in step 4, the non-cluster-head node in the cluster receives the broadcast message and then sends the broadcast message to the cluster-head node HiAnd sending a broadcast message:
wherein,
is a cluster CiThe middle non-cluster-head node is selected,
is a cluster CiThe current energy of the middle non-cluster head node is measured by hardware,
is a cluster CiThe current energy of the middle non-cluster head node is measured by hardware,
for the non-cluster head node s in step 2i，jThe distance to the base station(s),
is a cluster CiMiddle non-cluster head node
If the cluster head node becomes the original cluster head node HiBecome a non-cluster head node, transmit
The energy consumption of the data packet transmitted by each non-cluster head node is as follows:
wherein, l is 4000bit, and E is the bit number of the data packet transmitted by the sensor nodeelec50nJ/bit as hairCircuit power consumption to send unit bit data;
wherein, l is 4000bit, and E is the bit number of the data packet transmitted by the sensor nodef5nJ/bit is energy consumed by fusing unit bit data;
wherein,
for the non-cluster head node in step 2
Distance from base station, ∈fs＝10pJ/(bit·m2) As free space model parameters, ∈mp＝0.0013pJ/(bit·m4) For parameters of a multipath fading model, d087m is first orderA threshold value of radio communication transmission distance;
according to the energy consumption of the cluster head node for receiving the data packet transmitted by the non-cluster head node in the cluster, the energy consumption of the cluster head node for carrying out data fusion on the received data packet, and the energy consumption of the cluster head node for transmitting the fused data packet to the base station in the step 3
The remaining energy of all the sensor nodes in the cluster after becoming cluster head nodes is as follows:
step 5, selecting the sensor node with the maximum residual energy as a cluster head node when the data packet is transmitted for the (o) th time, updating the non-cluster-head node distribution time slot in the cluster by judging the change of the cluster head node, and starting to transmit the data packet for the (o) th time;
the sensor node with the maximum residual energy in the step 5 is as follows:
wherein
Is composed of
Maximum value of (2), sensor node
The cluster is Ci(i is more than or equal to 1 and less than or equal to 5), if the new data transmission cluster head node si，qCluster head node H for data transmission in step 3iSame, then cluster head node HiAccording to the step 3, the non-cluster head nodes in the cluster
Allocating time slot and carrying out the data transmission, otherwise, clustering the head node HiIn cluster CiMedium broadcast cluster head change message:
wherein,
represents a cluster CiChange of middle cluster head node, si，qIs a new cluster head node, and simultaneously si，qTime slot of
As a primary cluster head node HiTime slot of (1), said cluster C in step 1iMiddle non-cluster head node
Receiving a broadcast message
Then, judge si，qAnd carrying out data transmission at the position of the non-cluster head node.
Step 6, repeating the step 4 and the step 5 to 5 times to complete the data packet transmission;
it should be understood that the above description of the preferred embodiments is given for clarity and not for any purpose of limitation, and that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (2)
1. An energy-balanced cluster head node selection method is characterized by comprising the following steps:
step 1, deploying N sensor nodes, sending broadcast messages to the N sensor nodes through a base station, carrying out global clustering on the N sensor nodes according to an LEACH algorithm, and transmitting data packets of k times;
step 2, the sensor nodes detect the signal intensity of the received broadcast message according to hardware, and the distance between the sensor nodes and the base station is calculated by combining the signal intensity of the broadcast message sent to the N sensor nodes by the base station in the step 1;
step 3, the cluster head nodes distribute time slots for non-cluster head nodes in the cluster, the energy consumption of the cluster head nodes for receiving data packets transmitted by the non-cluster head nodes in the cluster is calculated, the energy consumption of the cluster head nodes for performing data fusion on the received data packets is calculated, the energy consumption of the cluster head nodes for transmitting the fused data packets to a base station is calculated, and the 1 st time of data packet transmission is finished;
in step 3, the cluster head node allocates time slots for non-cluster head nodes in the cluster as follows:
wherein the non-cluster head node
In a time slot
Transmitting data packets to cluster head node HiAnd the cluster in step 3 is Ci；
Cluster head node HiReceiving cluster CiIn
The energy consumption of the data packet transmitted by each non-cluster head node is as follows:
wherein, l is the number of bits of the data packet transmitted by the sensor node, EelecCircuit power consumption for transmitting unit bit data; cluster head node HiThe energy consumption for fusing the received data packets is as follows:
wherein, l is the number of bits of the data packet transmitted by the sensor node, EfEnergy consumed for fusing unit bit data; cluster head node HiThe energy consumption for transmitting the fused data packet to the base station is as follows:
wherein,
as cluster head node si,1Distance from base station, ∈fsAs free space model parameters, ∈mpFor parameters of a multipath fading model, d0Threshold for first order radio transmission distance:
step 4, keeping the cluster structure in the step 1 unchanged when data is transmitted for the (o is more than or equal to 2 and less than or equal to k) th time, sending a broadcast message to a non-cluster-head node in the cluster by the cluster-head node in the (o is more than or equal to 2 and less than or equal to k) th time when a data packet is transmitted for the (o is more than or equal to 2 and less than or equal to k) th time, sending the broadcast message to the cluster-head node by the non-cluster-head node in the cluster after the broadcast message is received, and further calculating the residual energy of all sensor nodes in the cluster if the sensor nodes become cluster-head nodes when the data packet is transmitted;
step 5, selecting the sensor node with the maximum residual energy as a cluster head node when the data packet is transmitted for the (o) th time, updating the non-cluster-head node distribution time slot in the cluster by judging the change of the cluster head node, and starting to transmit the data packet for the (o) th time;
the sensor node with the maximum residual energy in the step 5 is as follows:
wherein
Is composed of
Maximum value of (2), sensor node
The cluster is Ci(i is more than or equal to 1 and less than or equal to m), if the cluster head node s of the new data transmissioni,qCluster head node H for data transmission in step 3iSame, then cluster head node HiAccording to the step 3, the non-cluster head nodes in the cluster
Allocating time slot and carrying out the data transmission, otherwise, clustering the head node HiIn cluster CiMedium broadcast cluster head change message:
wherein,
represents a cluster CiChange of middle cluster head node, si,qIs a new cluster head node, and simultaneously si,qTime slot of
As a primary cluster head node HiTime slot of, cluster CiMiddle non-cluster head node
Receiving a broadcast message
Then, judge si,qCarrying out data transmission at the position of the non-cluster head node;
and 6, repeating the step 4 and the step 5 to complete the data packet transmission for k times.
2. The energy-balanced cluster head node selection method according to claim 1, wherein in step 1, the base station sends broadcast messages to N sensor nodes:
wherein, cInfoRepresenting global clustering messages, powersendSending the signal strength of the broadcast message to N sensor nodes for a base station, wherein k is a clustering period of data packet transmission, namely, the LEACH algorithm global clustering in the step 1 is carried out once every k times of data packet transmission;
generating m clusters after the LEACH algorithm in the step 1 completes global clustering, wherein the serial number of the cluster is C1,C2,...,CmThe serial number of the cluster head node is H1,H2,...,HmCluster Ci(i∈[1,m]I is a positive integer) of the corresponding sensor node is
(
Represents a cluster CiThe number of the nodes of the middle sensor,
) Then si,1Is a cluster head node with the number of Hi；
Step 2, the sensor node
Distance from base station:
wherein,
as sensor node si,jBased on the hardware detecting the signal strength of the received broadcast message, α is the constant for communication:
wherein, powersendSending the signal strength of a broadcast message to N sensor nodes by the base station in the step 1, wherein c represents the light speed, and f represents the communication frequency;
step 4, after the non-cluster head node in the cluster receives the broadcast message, the cluster head node HiAnd sending a broadcast message:
wherein,
is a cluster CiThe middle non-cluster-head node is selected,
is a cluster CiThe current energy of the middle non-cluster head node is measured by hardware,
is a cluster CiThe middle cluster head node obtains the current energy through hardware measurement,
for the sensor node in step 2
The distance from the base station(s) to the base station(s),
is a cluster CiMiddle non-cluster head node
If the cluster head node becomes the original cluster head node HiThe non-cluster head nodes are formed, and the energy consumption for transmitting data packets transmitted by n-1 non-cluster head nodes is as follows:
wherein,
as non-cluster head nodes
Distance from base station, ∈fsAs free space model parameters, ∈mpAs are the parameters of the multi-path fading model,
a threshold value that is a first order radio communication transmission distance;
according to the energy consumption of the cluster head node for receiving the data packet transmitted by the non-cluster head node in the cluster, the energy consumption of the cluster head node for carrying out data fusion on the received data packet, and the energy consumption of the cluster head node for transmitting the fused data packet to the base station in the step 3
The remaining energy of all the sensor nodes in the cluster after becoming cluster head nodes is as follows:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810032635.8A CN108307471B (en) | 2018-01-12 | 2018-01-12 | Energy balance cluster head node selection method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810032635.8A CN108307471B (en) | 2018-01-12 | 2018-01-12 | Energy balance cluster head node selection method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108307471A CN108307471A (en) | 2018-07-20 |
| CN108307471B true CN108307471B (en) | 2020-09-25 |
Family
ID=62868937
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810032635.8A Expired - Fee Related CN108307471B (en) | 2018-01-12 | 2018-01-12 | Energy balance cluster head node selection method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108307471B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111356039B (en) * | 2020-03-09 | 2021-07-27 | 西安电子科技大学 | Topology forming method for wireless optical communication network |
| CN114640968A (en) * | 2020-12-15 | 2022-06-17 | 北京三快在线科技有限公司 | Electric quantity sharing method, device, medium and vehicle |
| CN116828560B (en) * | 2023-08-28 | 2023-10-27 | 国网四川省电力公司电力应急中心 | Transformer substation anti-seismic state monitoring system based on wireless sensor network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104093196A (en) * | 2014-07-07 | 2014-10-08 | 北京理工大学 | LEACH alternating time dynamic optimization method based on energy consumption |
| CN104411000A (en) * | 2014-12-15 | 2015-03-11 | 南昌航空大学 | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network |
| CN107182063A (en) * | 2017-05-26 | 2017-09-19 | 上海电机学院 | A kind of Cluster-Based Routing Protocols for Wireless Sensor based on natural energy |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9461792B2 (en) * | 2011-07-28 | 2016-10-04 | Broadcom Corporation | Signaling and procedure design for cellular cluster contending on license-exempt bands |
| US10509313B2 (en) * | 2016-06-28 | 2019-12-17 | Canon Kabushiki Kaisha | Imprint resist with fluorinated photoinitiator and substrate pretreatment for reducing fill time in nanoimprint lithography |
-
2018
- 2018-01-12 CN CN201810032635.8A patent/CN108307471B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104093196A (en) * | 2014-07-07 | 2014-10-08 | 北京理工大学 | LEACH alternating time dynamic optimization method based on energy consumption |
| CN104411000A (en) * | 2014-12-15 | 2015-03-11 | 南昌航空大学 | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network |
| CN107182063A (en) * | 2017-05-26 | 2017-09-19 | 上海电机学院 | A kind of Cluster-Based Routing Protocols for Wireless Sensor based on natural energy |
Non-Patent Citations (2)
| Title |
|---|
| "基于能量均衡的无线传感器网络LEACH协议的研究";廖倩;《信息科技辑》;20131115;I136-175 * |
| "无线传感器网络动态k值簇头选择方法";吕黎兵;《华中科技大学学报（自然科学版）》;20151015;37-47 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108307471A (en) | 2018-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108966239B (en) | Method for deploying relay nodes based on energy voidage | |
| CN100373886C (en) | Wireless-sensor network distribution type cluster-dividing method based on self-adoptive retreating strategy | |
| KR101658736B1 (en) | Wsn clustering mehtod using of cluster tree structure with low energy loss | |
| CN108307471B (en) | Energy balance cluster head node selection method | |
| CN109673034A (en) | A kind of wireless sensor network cluster routing method that must be searched for based on longicorn | |
| Li et al. | Energy-efficient multipath routing in wireless sensor network considering wireless interference | |
| CN108521633A (en) | Minepit environment wireless sense network cluster routing method based on K mean values | |
| Nedham et al. | An improved energy efficient clustering protocol for wireless sensor networks | |
| Chen | Improvement of LEACH routing algorithm based on use of balanced energy in wireless sensor networks | |
| Shaji et al. | Distributed energy efficient heterogeneous clustering in wireless sensor network | |
| Zhao et al. | Energy efficient and cluster based routing protocol for WSN | |
| Nezha et al. | Energy-aware clustering and efficient cluster head selection | |
| Nguyen et al. | Prolonging of the network lifetime of WSN using fuzzy clustering topology | |
| Varma et al. | Base station initiated dynamic routing protocol for Heterogeneous Wireless Sensor Network using clustering | |
| Ebadi et al. | Energy balancing in wireless sensor networks with selecting two cluster-heads in hierarchical clustering | |
| Alnaham et al. | Improving QoS in WSN based on an optimal path from source to sink node routing algorithm | |
| Gupta et al. | Modified LEACH-DT algorithm with hierarchical extension for wireless sensor networks | |
| Nayak et al. | A novel cluster head selection method for energy efficient wireless sensor network | |
| Zytoune et al. | Stochastic low energy adaptive clustering hierarchy | |
| Thalore et al. | Performance comparison of homogeneous and heterogeneous 3D wireless sensor networks | |
| Heikalabad et al. | EBDHR: Energy Balancing and Dynamic Hierarchical Routing algorithm for wireless sensor networks | |
| Hnini et al. | W-LEACH Decentralized: Weighted LEACH with a Decentralized way | |
| KHEDIRI et al. | Fixed competition-based clustering approach wireless sensor network | |
| Sundaran et al. | Energy efficient wireless sensor networks using dual cluster head with sleep/active mechanism | |
| Sharma et al. | Energy efficient load-balanced clustering algorithm for Wireless Sensor 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200925 |