CN102572996A - Annulus-based node energy consumption balancing method in heterogeneous sensor network - Google Patents

Annulus-based node energy consumption balancing method in heterogeneous sensor network Download PDF

Info

Publication number
CN102572996A
CN102572996A CN2012100441325A CN201210044132A CN102572996A CN 102572996 A CN102572996 A CN 102572996A CN 2012100441325 A CN2012100441325 A CN 2012100441325A CN 201210044132 A CN201210044132 A CN 201210044132A CN 102572996 A CN102572996 A CN 102572996A
Authority
CN
China
Prior art keywords
cluster head
mrow
msup
hop
msub
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.)
Pending
Application number
CN2012100441325A
Other languages
Chinese (zh)
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.)
Chongqing University
Original Assignee
Chongqing University
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 Chongqing University filed Critical Chongqing University
Priority to CN2012100441325A priority Critical patent/CN102572996A/en
Publication of CN102572996A publication Critical patent/CN102572996A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses an annulus-based node energy consumption balancing method in a heterogeneous sensor network. The method comprises the following steps of: determining the cluster head level by dividing a monitoring region by rings, and arranging two types of sensor nodes with different hardware configurations in the sensor network, wherein the cluster head uses a communication mode with optimal single hop and multi-hop proportion. In the method, a sensor node energy consumption model is used, based on the difference of the energy consumption increasing speeds when transmitting data packets for different distances, and in combination with the disadvantages and advantages of the single hop and multi-hop communication modes, the single hop and multi-hop optimal proportion related to the radius of the monitoring region in a cluster head mixed communication mode is obtained, the load on the node is balanced, and the lifecycle of a wireless sensor network is prolonged effectively.

Description

Ring domain-based node energy consumption balancing method in heterogeneous sensor network
Technical Field
The invention relates to the technical field of wireless communication networks, in particular to a method for balancing node energy consumption in a heterogeneous wireless sensor network.
Background
The wireless sensor nodes are powered by batteries, and the replacement of the batteries of the sensor nodes is determined by special working environments (such as deployment in original forests, military battle fields, oceans and the like) and the huge coverage area of a wireless sensor network. Because the premature death of partial nodes in the wireless sensor network can cause the paralysis of the communication of the whole sensor network, the energy conservation and the energy consumption balance of the sensor nodes are the precondition for the effective work of the wireless sensor network.
Solving the energy problem of the sensor nodes is realized by designing an effective energy-saving routing protocol. The routing protocol of the wireless sensor network is divided into a plane route with all routes belonging to the same level and a plurality of layered routes with different levels. The energy consumption of the network can be effectively reduced by grouping adjacent sensor nodes in the network into a group (namely 'clustering'), selecting one node as the head (namely 'cluster head') of the group, and then forming the sensor network by a plurality of groups, namely hierarchical routing. Many energy efficient routing protocols are designed on the basis of a "cluster" structure.
The classical LEACH protocol, the first one using hierarchical routing, is followed by SEP protocol, DEEC protocol, etc., which improve to some extent the power saving problem of wireless sensor networks.
However, none of these protocols maximize the benefits of the network. Firstly, each node in the network has an opportunity to act as a cluster head, so that all nodes have the capabilities of fusing data, adjusting transmission power according to distance and the like, and the hardware of each sensor node is very complex. If a small amount of nodes with complex hardware and more energy are used as cluster heads forever, the nodes are called super nodes; most sensor nodes have sensing and sending capabilities only and are called ordinary nodes, so that the hardware cost of the nodes in the network is reduced. Secondly, the common nodes directly send the acquired data to the cluster heads, and the cluster heads collect the data of the common nodes and then directly send the data to the base station after fusion, so that the cluster heads far away from the base station consume more energy than the common nodes near the cluster heads and the cluster heads near the base station. On the contrary, if the multi-hop communication method is adopted, that is, the data is forwarded to the base station through the adjacent nodes, the cluster head close to the base station has more energy load because more data is forwarded. There is always a pattern of unbalanced energy consumption in the network.
Aiming at the limitations of the sensor nodes, the invention provides a method for a hybrid communication mode based on the combination of single hop and multi hop of a torus domain in a heterogeneous network, and the purpose of prolonging the service life of the network as a whole is achieved by balancing the energy load of the network.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a method for balancing the energy consumption of nodes based on a torus domain in a heterogeneous sensor network, which can balance the energy consumption of all nodes in the sensor network so as to achieve the purpose of prolonging the life cycle of the sensor network.
The technical problem to be solved by the invention is realized by the technical scheme, which comprises the following steps:
step 1, dividing a ring domain of a monitoring area: firstly, a monitoring area of a sensor network is regarded as a circular area with a radius of R, and a base station is positioned at the position of a circle center. The monitoring area is divided into a plurality of circular ring areas by taking the base station as the center of a circle. The nodes are randomly distributed in a circular domain, the positions of the sensor nodes are assumed to be fixed and unchangeable, and the nodes and the base station know the position information of the nodes in advance. Dividing cluster head nodes in the network into a plurality of levels according to the distance from the cluster head nodes to the base station, wherein the base station is level0 (level 0);
step 2, selecting a cluster head path: and a single-hop and multi-hop combined communication mode is used. After the monitoring area is divided, the cluster head nodes know the grades of the cluster head nodes, then each cluster head node selects the nearest cluster head in the previous grade as the next hop node, namely the father node of the cluster head, the father node of the first grade cluster head is a base station, and the base station is the highest grade. In single-hop communication, the cluster head fuses the received information and then directly sends the information to the base station, and in multi-hop communication, the cluster head is forwarded to the base station step by step through a father node of the cluster head;
step 3, establishing a cluster: the concept of 'round' defined in the LEACH protocol is continued, only the cluster head is not elected any more in each round, the cluster head is fixed and invariable in the life cycle of the whole network, and the super node has higher energy and acts as the cluster head all the time. Establishing the cluster by taking the minimum communication energy consumption as a standard, informing the cluster head of the establishment of the cluster by broadcasting a data packet, applying for adding to different clusters by common nodes around according to the received signal strength, and replying confirmation adding information by the cluster head;
and 4, step 4: selection of communication modes in a data transmission stage: in the stable data transmission stage, the common nodes collect effective information and directly transmit the effective information to the cluster head, and the cluster head forwards the data to the base station in a single-hop and multi-hop combination mode.
In the step 1, the area of the monitoring area is S, the number of nodes is n, the cluster head proportion is p, and the density of cluster head nodes is lambda1So that the average transmission radius of each cluster head node is r1：
<math> <mrow> <msub> <mi>r</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>2</mn> <msqrt> <mfrac> <mi>S</mi> <mi>&pi;np</mi> </mfrac> </msqrt> </mrow> </math>
The distance from the base station is less than or equal to the average transmission radius r of cluster head nodes1The cluster head is level1 (level1), and the distance from the cluster head to the base station is greater than the average transmission radius r of the cluster head node1Less than or equal to 2r1The cluster head of (2) level2, and so on, up to the border of the monitored area.
Therefore, the base station is used as the center of a circle, and r is used as the center of the circle1、2r1、3r1… …, etc. divide the monitoring area into m circular areas with radii. Wherein,
Figure BSA00000674696600022
r is the radius of the monitoring area, R1The width of the torus is also the average transmission radius of the cluster head nodes.
In step 2, the single-hop communication frequency is η (i.e. the multi-hop communication frequency is (1- η)).
η is determined by the following formula:
<math> <mrow> <mi>&eta;</mi> <mo>=</mo> <mfrac> <mrow> <mrow> <mo>(</mo> <msup> <mi>m</mi> <mn>2</mn> </msup> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mn>2</mn> <mi>k</mi> <mo>+</mo> <msup> <msub> <mi>r</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <mo>)</mo> </mrow> </mrow> <mrow> <mrow> <mo>(</mo> <msup> <mi>m</mi> <mn>2</mn> </msup> <mo>-</mo> <mn>2</mn> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>+</mo> <msup> <msub> <mi>r</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mi>m</mi> <mn>2</mn> </msup> <mi>k</mi> <mo>+</mo> <mfrac> <msub> <mi>&epsiv;</mi> <mi>mp</mi> </msub> <msub> <mi>&epsiv;</mi> <mi>fs</mi> </msub> </mfrac> <msup> <mi>R</mi> <mn>4</mn> </msup> </mrow> </mfrac> </mrow> </math>
wherein m is the number of the ring domains divided by the monitoring area,r1is the width of the torus, epsilonfsAnd εmpIs a parameter of the energy consumption of the transmitting unit, depending on the amplifier of the transmitting unit, and R is the radius of the monitoring area.
In step 3, all nodes are added into different clusters according to the power of the received cluster head.
In the step 4, each 10 rounds of stable data communication is a period, a single-hop communication mode is used from the first round to the 10 eta-1 round in one period, a multi-hop communication mode is used from the 10 eta round to the 10 th round in one period, and then the next new period is started.
Drawings
The drawings of the invention are illustrated as follows:
FIG. 1 is a flowchart of a torus-based node energy consumption balancing method in a heterogeneous sensor network according to the present invention;
FIG. 2 is a schematic diagram of a cluster of nodes in a wireless sensor network according to the present invention;
fig. 3 is a schematic view of monitoring area division according to the present invention.
Detailed Description
The invention is further illustrated with reference to the accompanying drawings and examples:
fig. 1 is a flowchart of a torus-based node energy consumption balancing method in a heterogeneous sensor network, which includes the following steps:
step 1, dividing a ring domain of a monitoring area: firstly, a monitoring area of a sensor network is regarded as a circular area with a radius of R, and a base station is positioned at the position of a circle center. The monitoring area is divided into a plurality of circular ring areas by taking the base station as the center of a circle. The nodes are randomly distributed in a circular domain, the positions of the sensor nodes are assumed to be fixed and unchangeable, and the nodes and the base station know the position information of the nodes in advance. Dividing cluster head nodes in the network into a plurality of levels according to the distance from the cluster head nodes to the base station, wherein the base station is level0 (level 0);
step 2, selecting a cluster head path: and a single-hop and multi-hop combined communication mode is used. After the monitoring area is divided, the cluster head nodes know the grades of the cluster head nodes, then each cluster head node selects the nearest cluster head in the previous grade as the next hop node, namely the father node of the cluster head, the father node of the first grade cluster head is a base station, and the base station is the highest grade. In single-hop communication, the cluster head fuses the received information and then directly sends the information to the base station, and in multi-hop communication, the cluster head is forwarded to the base station step by step through a father node of the cluster head;
step 3, establishing a cluster: the concept of 'round' defined in the LEACH protocol is continued, only the cluster head is not elected any more in each round, the cluster head is fixed and invariable in the life cycle of the whole network, and the super node has higher energy and acts as the cluster head all the time. Establishing the cluster by taking the minimum communication energy consumption as a standard, informing the cluster head of the establishment of the cluster by broadcasting a data packet, applying for adding to different clusters by common nodes around according to the received signal strength, and replying confirmation adding information by the cluster head;
and 4, step 4: selection of communication modes in a data transmission stage: in the stable data transmission stage, the common nodes collect effective information and directly transmit the effective information to the cluster head, and the cluster head forwards the data to the base station in a single-hop and multi-hop combination mode.
One embodiment of the present invention is as follows:
step 1, circular ring domain division
Firstly, a monitoring area of a sensor network is regarded as a circular area with a radius of R, and a base station is positioned at the position of a circle center. The monitoring area is divided into a plurality of circular ring areas by taking the base station as the center of a circle. The nodes are randomly distributed in a circular domain, the positions of the sensor nodes are assumed to be fixed and unchangeable, and the nodes and the base station know the position information of the nodes in advance. The clustering structure is shown in figure 2, and the density of cluster head nodes is lambda1So that the average transmission radius of each cluster head node is r1：
<math> <mrow> <msub> <mi>r</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>2</mn> <msqrt> <mfrac> <mi>S</mi> <mi>&pi;np</mi> </mfrac> </msqrt> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>
Wherein n is the number of nodes in the whole sensor network, p is the preset cluster head proportion, and the area of the monitoring area is S.
The cluster head nodes in the network are divided into a plurality of levels according to the distance from the cluster head nodes to the base station, as shown in fig. 3, the base station is level0 (level0), and the distance from the base station is less than or equal to r1The cluster head is level1 (level1), and the distance from the cluster head to the base station is more than r1Less than or equal to 2r1The cluster head of (2) level2, and so on, up to the border of the monitored area.
Therefore, the base station is used as the center of a circle, and r is used as the center of the circle1、2r1、3r1… …, etc. divide the monitoring area into m circular areas with radii. Wherein,
Figure BSA00000674696600042
r is the radius of the monitoring area, R1I.e. the width of the torus.
Step 2, selecting cluster head path
And a single-hop and multi-hop combined communication mode is used. After the monitoring area is divided, the cluster head nodes know the grades of the cluster head nodes, then each cluster head node selects the optimal cluster head in the previous level as the next hop node, namely the father node of the cluster head, the father node of the first level is the base station, and the base station is the highest level. In single-hop communication, the cluster head fuses the received information and then directly sends the information to the base station, and in multi-hop communication, the cluster head is forwarded to the base station step by step through a father node of the cluster head. A single-hop communication frequency η (i.e., a multi-hop communication frequency of (1- η)).
In the step 2, the specific process of determining the single-hop communication frequency η is as follows:
energy consumption model
In the process of transmitting l-bit data and passing through a transmission distance d, the energy consumption of a transmitting end is as follows:
<math> <mrow> <msub> <mi>E</mi> <mi>tx</mi> </msub> <mrow> <mo>(</mo> <mi>l</mi> <mo>,</mo> <mi>d</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open='{' close='' separators=''> <mtable> <mtr> <mtd> <mi>l</mi> <mo>&times;</mo> <msub> <mi>E</mi> <mi>elec</mi> </msub> <mo>+</mo> <mi>l</mi> <mo>&times;</mo> <msub> <mi>&epsiv;</mi> <mi>fs</mi> </msub> <msup> <mi>d</mi> <mn>2</mn> </msup> </mtd> <mtd> <mi>d</mi> <mo>&lt;</mo> <msub> <mi>d</mi> <mn>0</mn> </msub> </mtd> </mtr> <mtr> <mtd> <mi>l</mi> <mo>&times;</mo> <msub> <mi>E</mi> <mi>elec</mi> </msub> <mo>+</mo> <mi>l</mi> <mo>&times;</mo> <msub> <mi>&epsiv;</mi> <mi>mp</mi> </msub> <msup> <mi>d</mi> <mn>4</mn> </msup> </mtd> <mtd> <mi>d</mi> <mo>&GreaterEqual;</mo> <msub> <mi>d</mi> <mn>0</mn> </msub> </mtd> </mtr> </mtable> <mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow> </mfenced> </mrow> </math>
correspondingly, when receiving l-bit data, the energy consumption of the receiving end is:
Erx(l)＝l×Eelec (4)
the cluster head fuses l-bit data, and the consumed energy is as follows:
EDA(l)＝l×Egather (5)
wherein E iselecRepresents the energy consumed by the transmitting and receiving 1-bit data transmitting circuit and the receiving circuit; epsilonfsd2And εmpd4Respectively, the transmission distance is less than a threshold value d0And d is equal to or greater than threshold0The energy consumed by the data amplifier is amplified every time 1bit is amplified; egatherThe energy consumed for fusing 1bit data. Threshold value d in formula (3)0Is determined by formula (6), wherein ∈fsAnd εmpDepending on the amplifier of the transmitting unit:
<math> <mrow> <msub> <mi>d</mi> <mn>0</mn> </msub> <mo>=</mo> <msqrt> <mfrac> <msub> <mi>&epsiv;</mi> <mi>fs</mi> </msub> <msub> <mi>&epsiv;</mi> <mi>mp</mi> </msub> </mfrac> </msqrt> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </math>
because the distance from the common node to the cluster head is smaller than the threshold value d under the general condition0So single hop communication is also used within the cluster.
Optimal single-hop communication frequency eta
The average energy consumption of the ith-level cluster head node in each round is obtained by the energy consumption model of the wireless sensor network node, and is as follows:
PCH(i，η)＝(1-η){Etx(l，d)+Erx(l)+N(i)[Etx(l，d)+Erx(l)]}+η[Etx(l，D(i))+Erx(l)]+EDA(l)(7)
wherein N (i) is as in formula (9); d (i) ═ i × r1Is the distance from the ith cluster head to the base station in single-hop communication.
Average energy consumption of each round of common nodes is PSN：
PSN＝Etx(l，d′) (8)
Where d' is the distance of the normal node to its cluster head.
In multi-hop communication, each high-level cluster head is used as a relay node to undertake the forwarding of low-level cluster head data, and the ith-level cluster head is used for forwarding data from cluster heads other than the i-level cluster head. Assuming that the monitoring area is divided into m torus areas, and the ith level has l (i) cluster heads, the average number of data packets to be forwarded by each cluster head of the i level is n (i):
<math> <mrow> <mi>N</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <mi>L</mi> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> </mrow> <mrow> <mi>L</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>,</mo> <mn>0</mn> <mo>&lt;</mo> <mi>i</mi> <mo>&lt;</mo> <mi>m</mi> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </mrow> </math>
wherein L (i) is the number of cluster heads contained in the ith-stage torus, and is represented by the formula (10):
L(i)＝λ1π{(ir1)2-[(i-1)r1]2}，0＜i＜m (10)
λ1is the density of cluster head nodes, r1The width of each level of the torus field is also the average transmission radius of the cluster head nodes.
The formula (9) and (10) can be used for obtaining:
<math> <mrow> <mi>N</mi> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <mi>np</mi> <mo>-</mo> <mfrac> <msup> <msub> <mi>r</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <msup> <mi>R</mi> <mn>2</mn> </msup> </mfrac> <mo>&times;</mo> <mi>np</mi> </mrow> <mrow> <mfrac> <msup> <msub> <mi>r</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <msup> <mi>R</mi> <mn>2</mn> </msup> </mfrac> <mo>&times;</mo> <mi>np</mi> </mrow> </mfrac> <mo>=</mo> <mfrac> <mrow> <msup> <mi>R</mi> <mn>2</mn> </msup> <mo>-</mo> <msup> <msub> <mi>r</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> </mrow> <msup> <msub> <mi>r</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> </mfrac> <mo>=</mo> <msup> <mrow> <mo>(</mo> <mfrac> <mi>R</mi> <msub> <mi>r</mi> <mn>1</mn> </msub> </mfrac> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>-</mo> <mn>1</mn> <mo>=</mo> <msup> <mi>m</mi> <mn>2</mn> </msup> <mo>-</mo> <mn>1</mn> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>11</mn> <mo>)</mo> </mrow> </mrow> </math>
to equalize the energy consumption of the cluster head nodes in the wireless sensor network, the equation (7) is equal for the cluster head class i in the equation (7) described above, regardless of the value of i, i.e., regardless of which class the cluster head belongs to. If the single-hop communication frequency eta is 1, namely only single-hop communication is used, the cluster head at the lowest level inevitably consumes the most energy; if the single-hop communication frequency η is 0, i.e. only multi-hop communication is used, the highest level cluster head consumes the most energy. Therefore, the most sensitive to energy consumption are the nodes of the first and last stages. Is obtained by the formula (7):
PCH(1，η)＝(1-η){Etx(l，d)+Erx(l)+N(1)[Etx(l，d)+Erx(l)]}+η[Etx(l，d)+Erx(l)]+EDA(l) (12)
PCH(m，η)＝(1-η)[Etx(l，d)+Erx(l)]+η[Etx(l，D)+Erx(l)]+EDA(l) (13)
wherein d ═ r1And D ═ R. The energy consumption balance of the cluster head nodes is as follows:
PCH(1，η)＝PCH(m，η) (14)
obtained by the formula (14):
<math> <mrow> <mi>&eta;</mi> <mo>=</mo> <mfrac> <mrow> <mrow> <mo>(</mo> <msup> <mi>m</mi> <mn>2</mn> </msup> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mn>2</mn> <mi>k</mi> <mo>+</mo> <msup> <msub> <mi>r</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <mo>)</mo> </mrow> </mrow> <mrow> <mrow> <mo>(</mo> <msup> <mi>m</mi> <mn>2</mn> </msup> <mo>-</mo> <mn>2</mn> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>+</mo> <msup> <msub> <mi>r</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mi>m</mi> <mn>2</mn> </msup> <mi>k</mi> <mo>+</mo> <mfrac> <msub> <mi>&epsiv;</mi> <mi>mp</mi> </msub> <msub> <mi>&epsiv;</mi> <mi>fs</mi> </msub> </mfrac> <msup> <mi>R</mi> <mn>4</mn> </msup> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>15</mn> <mo>)</mo> </mrow> </mrow> </math>
wherein m is the number of the ring domains divided by the monitoring area,
Figure BSA00000674696600062
r1is the width of the torus, i.e. the average transmission radius of the cluster head nodes, epsilonfsAnd εmpIs a parameter of the energy consumption of the transmitting unit, depending on the amplifier of the transmitting unit, and R is the radius of the monitoring area. Obviously m 21, 2, when k < r1The formula (15) is simplified as follows:
<math> <mrow> <mi>&eta;</mi> <mo>&ap;</mo> <mfrac> <msup> <mrow> <mo>(</mo> <msub> <mi>mr</mi> <mn>1</mn> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mrow> <msup> <mrow> <mo>(</mo> <msub> <mi>mr</mi> <mn>1</mn> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <mfrac> <msub> <mi>&epsiv;</mi> <mi>mp</mi> </msub> <msub> <mi>&epsiv;</mi> <mi>fs</mi> </msub> </mfrac> <msup> <mi>R</mi> <mn>4</mn> </msup> </mrow> </mfrac> <mo>&ap;</mo> <mfrac> <msup> <mi>R</mi> <mn>2</mn> </msup> <mrow> <msup> <mi>R</mi> <mn>2</mn> </msup> <mo>+</mo> <mfrac> <msub> <mi>&epsiv;</mi> <mi>mp</mi> </msub> <msub> <mi>&epsiv;</mi> <mi>fs</mi> </msub> </mfrac> <msup> <mi>R</mi> <mn>4</mn> </msup> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>16</mn> <mo>)</mo> </mrow> </mrow> </math>
therefore, when monitoring the area radius
Figure BSA00000674696600064
I.e. R ≈ d0And meanwhile, the single-hop communication frequency eta is 1/2, and the energy consumption of the cluster head nodes is balanced when the single-hop and multi-hop ratio is 1: 1, so that the service life of the wireless sensor network can be maximized.
Step 3, establishing clusters
The concept of 'round' defined in the LEACH protocol is continued, only the cluster head is not elected any more in each round, the cluster head is fixed and invariable in the life cycle of the whole network, and the super node has higher energy and acts as the cluster head all the time. The cluster is established by taking the minimum communication energy consumption as a standard, the cluster head informs the cluster head of the cluster head by broadcasting a data packet, the surrounding common nodes apply for adding into different clusters according to the received signal strength, and the cluster head replies the confirmation adding information.
And 4, step 4: selection of communication mode in data transmission stage
In the stable data transmission phase, because the cluster head node knows all the members in the cluster, the cluster head node can be used as a local control center to cooperatively transmit information in the cluster. The cluster head establishes a TDMA list based on the information of the clustered nodes and then broadcasts the list to the nodes in the cluster, which ensures that there is no collision during information transmission and allows non-cluster head nodes to turn off the radio module during all other time periods except for self-transmitted information, thus minimizing energy consumption. The common nodes collect effective information and directly transmit the effective information to the cluster heads, and the cluster heads transmit the effective information to the base station in a mixed communication mode of combining single-hop communication frequency eta and multiple hops after fusing data. In the stable data transmission stage, the common nodes collect effective information and directly transmit the effective information to the cluster head, and the cluster head forwards the data to the base station in a single-hop and multi-hop combination mode. And every 10 rounds are a period, a single-hop communication mode is used from the first round to the 10 eta-1 round in one period, a multi-hop communication mode is used from the 10 eta round to the 10 th round in one period, and then the next new period is entered.
The technical effect of the invention is verified by simulation experiments, and the scenes are as follows: 1000 sensor nodes are deployed in a monitoring area with the radius of 180 meters at equal density, a base station is located at the position of a circle center, the proportion of cluster heads is 0.1, the initial energy of common nodes is 0.5J, and the initial energy of the cluster head nodes is 6 times that of the common nodes. The LEACH protocol and the method are respectively used under the same scene, and the result shows that the method can effectively improve the number of rounds of death of the first node and 10% of the death of the nodes by about 87%.

Claims (5)

1. A node energy consumption balancing method based on a ring domain in a heterogeneous sensor network is characterized by comprising the following steps:
step 1, dividing a ring domain of a monitoring area: firstly, a monitoring area of a sensor network is regarded as a circular area with a radius of R, and a base station is positioned at the position of a circle center. The monitoring area is divided into a plurality of circular ring areas by taking the base station as the center of a circle. Dividing cluster head nodes in the network into a plurality of levels according to the positions of the cluster head nodes, wherein the base station is level0 (level 0);
step 2, selecting a cluster head path: and a single-hop and multi-hop combined communication mode is used. After the monitoring area is divided, the cluster head nodes know the grades of the cluster head nodes, then each cluster head node selects the nearest cluster head in the previous grade as the next hop node, namely the father node of the cluster head, the father node of the first grade cluster head is a base station, and the base station is the highest grade. In single-hop communication, the cluster head fuses the received information and then directly sends the information to the base station, and in multi-hop communication, the cluster head is forwarded to the base station step by step through a father node of the cluster head;
step 3, establishing a cluster: the concept of 'round' defined in the LEACH protocol is continued, only the cluster head is not elected any more in each round, the cluster head is fixed and invariable in the life cycle of the whole network, and the super node has higher energy and acts as the cluster head all the time. Establishing the cluster by taking the minimum communication energy consumption as a standard, informing the cluster head of the establishment of the cluster by broadcasting a data packet, applying for adding to different clusters by common nodes around according to the received signal strength, and replying confirmation adding information by the cluster head;
and 4, selecting a communication mode in a data transmission stage: in the stable data transmission stage, the common nodes collect effective information and directly transmit the effective information to the cluster head, and the cluster head forwards the data to the base station in a single-hop and multi-hop combination mode.
2. The torus-based node energy consumption balancing method in the heterogeneous sensor network according to claim 1, wherein: in the step 1, a monitoring area is divided into a plurality of circular domains with equal width according to the communication radius, the monitoring area is divided into grades corresponding to the circular domains according to the distance from a cluster head to a base station, and the grade is higher when the monitoring area is closer to the base station.
3. The torus-based node energy consumption balancing method in the heterogeneous sensor network according to claim 1, wherein in step 2, the path is selected to perform data transmission with a single-hop ratio η and a multi-hop ratio 1- η, where η is determined by the following formula:
<math> <mrow> <mi>&eta;</mi> <mo>=</mo> <mfrac> <mrow> <mrow> <mo>(</mo> <msup> <mi>m</mi> <mn>2</mn> </msup> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mn>2</mn> <mi>k</mi> <mo>+</mo> <msup> <msub> <mi>r</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <mo>)</mo> </mrow> </mrow> <mrow> <mrow> <mo>(</mo> <msup> <mi>m</mi> <mn>2</mn> </msup> <mo>-</mo> <mn>2</mn> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>+</mo> <msup> <msub> <mi>r</mi> <mn>1</mn> </msub> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mi>m</mi> <mn>2</mn> </msup> <mi>k</mi> <mo>+</mo> <mfrac> <msub> <mi>&epsiv;</mi> <mi>mp</mi> </msub> <msub> <mi>&epsiv;</mi> <mi>fs</mi> </msub> </mfrac> <msup> <mi>R</mi> <mn>4</mn> </msup> </mrow> </mfrac> </mrow> </math>
wherein m is the number of the ring domains divided by the monitoring area,
Figure FSA00000674696500012
r1is the width of the torus, epsilonfsAnd εmpIs a parameter of the energy consumption of the transmitting unit, depending on the amplifier of the transmitting unit, and R is the radius of the monitoring area.
4. The torus-based node energy consumption balancing method in the heterogeneous sensor network according to claim 3, wherein: the single-hop communication frequency eta is determined according to the first-level cluster head and the last-level clusterThe head consuming an equal amount of energy, i.e. PCH(1，η)＝PCH(m, η), m being the last stage of the cluster head.
5. The method for balancing node energy consumption based on the torus domain in the heterogeneous sensor network according to claims 1, 2 and 3, wherein: in step 4, every 10 rounds are a period, a single-hop communication mode is used from the first round to the 10 eta-1 round in one period, a multi-hop communication mode is used from the 10 eta round to the 10 th round in one period, and then the next new period is started.
CN2012100441325A 2012-02-24 2012-02-24 Annulus-based node energy consumption balancing method in heterogeneous sensor network Pending CN102572996A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2012100441325A CN102572996A (en) 2012-02-24 2012-02-24 Annulus-based node energy consumption balancing method in heterogeneous sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2012100441325A CN102572996A (en) 2012-02-24 2012-02-24 Annulus-based node energy consumption balancing method in heterogeneous sensor network

Publications (1)

Publication Number Publication Date
CN102572996A true CN102572996A (en) 2012-07-11

Family

ID=46417177

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2012100441325A Pending CN102572996A (en) 2012-02-24 2012-02-24 Annulus-based node energy consumption balancing method in heterogeneous sensor network

Country Status (1)

Country Link
CN (1) CN102572996A (en)

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103391555A (en) * 2013-07-16 2013-11-13 任炬 Novel node distribution method for maximizing service lives of clustering wireless sensor networks
CN103561406A (en) * 2013-09-03 2014-02-05 南京林业大学 Wireless sensing routing algorithm with cluster cellular segmentation based on energy balance
CN103916942A (en) * 2014-04-04 2014-07-09 安徽工程大学 LEACH protocol improvement method capable of lowering energy consumption
WO2015003315A1 (en) * 2013-07-09 2015-01-15 Hua Zhong University Of Science Technology Data collection in wireless sensor network
CN104661273A (en) * 2014-11-22 2015-05-27 牡丹江师范学院 Routing method of wireless sensor network
CN104684041A (en) * 2015-02-06 2015-06-03 中国科学院上海微系统与信息技术研究所 Real-time wireless sensor network routing method supporting large-scale node application
CN105306361A (en) * 2015-09-30 2016-02-03 刘运成 Routing method and device for guaranteeing balanced node energy consumption
CN106102075A (en) * 2016-08-25 2016-11-09 广东工业大学 The cluster-dividing method divided based on hierarchical region in radio sensing network and system
CN107222906A (en) * 2017-07-03 2017-09-29 哈尔滨理工大学 LEACH protocol optimization methods based on ant group algorithm
CN108235273A (en) * 2017-12-30 2018-06-29 山东省科学院海洋仪器仪表研究所 A kind of marine mobile sensor network route maintenance method based on collection thimble mechanism
CN109041001A (en) * 2018-08-04 2018-12-18 浙江农林大学 The method of prolonging wireless sensor network life cycle in city integrated piping lane
CN109041160A (en) * 2018-08-04 2018-12-18 浙江农林大学 The method for improving wireless sensor network data transmission quality in city integrated piping lane
CN109672993A (en) * 2019-01-28 2019-04-23 苏州宏裕千智能设备科技有限公司 A kind of method of data capture, apparatus and system
CN109922448A (en) * 2018-12-28 2019-06-21 苏州华盖信息科技有限公司 A kind of data capture method, data acquisition facility and user terminal
CN109922096A (en) * 2017-12-12 2019-06-21 中国海洋大学 The communication system of multiple sensor general-purpose interfaces
CN111654439A (en) * 2020-06-02 2020-09-11 中国联合网络通信集团有限公司 Message transmission method and device, terminal equipment and computer readable storage medium
CN111770512A (en) * 2020-06-05 2020-10-13 长春工业大学 Wireless sensor network fan-out routing protocol based on fuzzy logic
CN112770283A (en) * 2019-10-21 2021-05-07 中国石油化工股份有限公司 Signal transmission method and system for discrete control system
CN115204756A (en) * 2022-09-15 2022-10-18 四川中电启明星信息技术有限公司 Energy consumption monitoring and optimizing method based on enterprise carbon metering

Citations (1)

* 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

Patent Citations (1)

* 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

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
LIHAN: "LEACH-HPR: An Energy Efficient Routing Algorithm for Heterogeneous WSN", 《INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS (ICIS), 2010 IEEE INTERNATIONAL CONFERENCE ON》, 31 October 2010 (2010-10-31), pages 507 - 511 *
R. MACHADO ET AL: "Adaptive density control in heterogeneous wireless sensor networks with and", 《COMMUNICATIONS, IET》, vol. 4, no. 7, 30 April 2010 (2010-04-30), pages 758 - 767 *
WENDI B. HEINZELMAN ET AL.: "An Application-Specific Protocol Architecture for Wireless Microsensor Networks", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS，2002》, vol. 1, no. 4, 31 October 2002 (2002-10-31), pages 660 - 670 *
王青正: "基于能量高效的WSN分簇路由协议的研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》, no. 12, 15 December 2010 (2010-12-15), pages 140 - 123 *
董杨: "基于非均匀分簇的WSNs路由协议的研究与设计", 《中国优秀硕士学位论文全文数据库 信息科技辑》, no. 10, 15 October 2009 (2009-10-15), pages 140 - 133 *

Cited By (30)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015003315A1 (en) * 2013-07-09 2015-01-15 Hua Zhong University Of Science Technology Data collection in wireless sensor network
US9584952B2 (en) 2013-07-09 2017-02-28 Hua Zhong University Of Science Technology Data collection in wireless sensor network
CN103391555B (en) * 2013-07-16 2016-08-10 任炬 A kind of node deployment method of novel cluster wireless sensor network lifetime
CN103391555A (en) * 2013-07-16 2013-11-13 任炬 Novel node distribution method for maximizing service lives of clustering wireless sensor networks
CN103561406A (en) * 2013-09-03 2014-02-05 南京林业大学 Wireless sensing routing algorithm with cluster cellular segmentation based on energy balance
CN103916942A (en) * 2014-04-04 2014-07-09 安徽工程大学 LEACH protocol improvement method capable of lowering energy consumption
CN103916942B (en) * 2014-04-04 2017-04-12 安徽工程大学 LEACH protocol improvement method capable of lowering energy consumption
CN104661273A (en) * 2014-11-22 2015-05-27 牡丹江师范学院 Routing method of wireless sensor network
CN104661273B (en) * 2014-11-22 2017-09-15 牡丹江师范学院 The method for routing of wireless sensor network
CN104684041B (en) * 2015-02-06 2018-01-12 中国科学院上海微系统与信息技术研究所 A kind of real-time wireless sensing network route method for supporting extensive node application
CN104684041A (en) * 2015-02-06 2015-06-03 中国科学院上海微系统与信息技术研究所 Real-time wireless sensor network routing method supporting large-scale node application
CN105306361A (en) * 2015-09-30 2016-02-03 刘运成 Routing method and device for guaranteeing balanced node energy consumption
CN106102075A (en) * 2016-08-25 2016-11-09 广东工业大学 The cluster-dividing method divided based on hierarchical region in radio sensing network and system
CN106102075B (en) * 2016-08-25 2019-07-09 广东工业大学 Cluster-dividing method and system based on hierarchical region division in wireless sensor network
CN107222906A (en) * 2017-07-03 2017-09-29 哈尔滨理工大学 LEACH protocol optimization methods based on ant group algorithm
CN109922096A (en) * 2017-12-12 2019-06-21 中国海洋大学 The communication system of multiple sensor general-purpose interfaces
CN109922096B (en) * 2017-12-12 2020-11-24 中国海洋大学 Communication system with multiple sensor universal interfaces
CN108235273A (en) * 2017-12-30 2018-06-29 山东省科学院海洋仪器仪表研究所 A kind of marine mobile sensor network route maintenance method based on collection thimble mechanism
CN108235273B (en) * 2017-12-30 2023-04-28 山东省科学院海洋仪器仪表研究所 Marine mobile sensor network route maintenance method based on hub ring mechanism
CN109041160A (en) * 2018-08-04 2018-12-18 浙江农林大学 The method for improving wireless sensor network data transmission quality in city integrated piping lane
CN109041160B (en) * 2018-08-04 2020-11-17 浙江农林大学 Method for improving data transmission quality of wireless sensor network in urban comprehensive pipe gallery
CN109041001A (en) * 2018-08-04 2018-12-18 浙江农林大学 The method of prolonging wireless sensor network life cycle in city integrated piping lane
CN109922448A (en) * 2018-12-28 2019-06-21 苏州华盖信息科技有限公司 A kind of data capture method, data acquisition facility and user terminal
CN109672993A (en) * 2019-01-28 2019-04-23 苏州宏裕千智能设备科技有限公司 A kind of method of data capture, apparatus and system
CN112770283A (en) * 2019-10-21 2021-05-07 中国石油化工股份有限公司 Signal transmission method and system for discrete control system
CN111654439A (en) * 2020-06-02 2020-09-11 中国联合网络通信集团有限公司 Message transmission method and device, terminal equipment and computer readable storage medium
CN111770512A (en) * 2020-06-05 2020-10-13 长春工业大学 Wireless sensor network fan-out routing protocol based on fuzzy logic
CN111770512B (en) * 2020-06-05 2023-05-23 长春工业大学 Wireless sensor network sector routing method based on fuzzy logic
CN115204756A (en) * 2022-09-15 2022-10-18 四川中电启明星信息技术有限公司 Energy consumption monitoring and optimizing method based on enterprise carbon metering
CN115204756B (en) * 2022-09-15 2022-11-29 四川中电启明星信息技术有限公司 Energy consumption monitoring and optimizing method based on enterprise carbon metering

Similar Documents

Publication Publication Date Title
CN102572996A (en) Annulus-based node energy consumption balancing method in heterogeneous sensor network
Sabet et al. A decentralized energy efficient hierarchical cluster-based routing algorithm for wireless sensor networks
Choi et al. A framework for energy-saving data gathering using two-phase clustering in wireless sensor networks
CN101394321B (en) Non-uniform clustering method for cluster wireless sensor network based on energy balance
Boyinbode et al. A survey on clustering algorithms for wireless sensor networks
Jain et al. Clustering protocols in wireless sensor networks: A survey
CN106454905B (en) A kind of improved wireless sense network hierarchical multichain path method
CN102036308B (en) Energy balancing wireless sensor network clustering method
CN108112048A (en) Recognize a kind of efficiency route protocol based on stability in sensor network
CN105376806A (en) Cluster-based routing method based on maximum energy path selection in multipath
Yinghong et al. The Diffusion Clustering Scheme and Hybrid Energy Balanced Routing Protocol (DCRP) in Multi-hop Wireless Sensor Networks.
Tan et al. SCBC: Sector-chain based clustering routing protocol for energy efficiency in heterogeneous wireless sensor network
Karmaker et al. An efficient cluster head selection strategy for provisioning fairness in wireless sensor networks
Paul et al. Effective data gathering and energy efficient communication protocol in wireless sensor network
Liu et al. Energy efficient clustering and routing scheme for wireless sensor networks
Tripathy et al. Staggered clustering protocol: SCP an efficient clustering approach for wireless sensor network
Nawaz et al. Beaconless multihop routing protocol for wireless sensor networks
Gupta et al. A novel approach to improve network lifetime in WSN by energy efficient packet optimization
Khediri et al. Multi objective clustering algorithm for maximizing lifetime in wireless sensor networks
Kumar et al. Associative zone based energy balancing routing for expanding energy efficient and routing optimization over the sensor network
Chelbi et al. An Unequal Cluster-based Routing Protocol Based on Data Controlling for Wireless Sensor Network.
KHEDIRI et al. Fixed competition-based clustering approach wireless sensor network
Sheikh et al. Cross-layer design for smart routing in wireless sensor networks
Srividhya et al. Fuzzy based hierachical unequal clustering in wireless sensor networks
Hsieh Data aggregation model using energy-efficient delay scheduling in multi-hop hierarchical wireless sensor networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20120711