CN113490253A - Non-uniform clustering method based on dynamic cluster radius in wireless sensor network - Google Patents

Non-uniform clustering method based on dynamic cluster radius in wireless sensor network Download PDF

Info

Publication number
CN113490253A
CN113490253A CN202110923184.9A CN202110923184A CN113490253A CN 113490253 A CN113490253 A CN 113490253A CN 202110923184 A CN202110923184 A CN 202110923184A CN 113490253 A CN113490253 A CN 113490253A
Authority
CN
China
Prior art keywords
node
nodes
radius
cluster
base station
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
CN202110923184.9A
Other languages
Chinese (zh)
Other versions
CN113490253B (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.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
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 Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN202110923184.9A priority Critical patent/CN113490253B/en
Publication of CN113490253A publication Critical patent/CN113490253A/en
Application granted granted Critical
Publication of CN113490253B publication Critical patent/CN113490253B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • 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/46—Cluster building
    • 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
    • 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
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/38—TPC being performed in particular situations
    • H04W52/46—TPC being performed in particular situations in multi hop networks, e.g. wireless relay networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a non-uniform clustering method based on dynamic cluster radius for a wireless sensor network, wherein the wireless sensor network comprises a base station and a plurality of sensor nodes; the base station is fixedly arranged in a network center and can collect data of the whole network sensor through a multi-hop routing transmission method, wherein the data comprises the collected data and the self electric quantity information. The sensor nodes are randomly deployed on the wireless sensor network to monitor the surrounding environment, and the data is transmitted among the sensor nodes through the route, so that different nodes have different energy consumption rates. The invention improves the defects in the prior art, and the cluster radius can automatically change along with the operation of the network, namely, the cluster radius is increased by the cluster head with more residual energy, more load is actively born, and tasks are shared by other cluster heads; the cluster head with small residual energy reduces the cluster radius, reduces some loads to save energy, and thus achieves the purpose of better and uniform network energy consumption.

Description

Non-uniform clustering method based on dynamic cluster radius in wireless sensor network
Technical Field
The invention relates to a non-uniform clustering method based on dynamic cluster radius for a wireless sensor network, which can be used in the technical field of wireless sensing.
Background
The Wireless Sensor Network (WSN) is composed of a large number of nodes, is deployed in a specific area according to application requirements, is self-organized to form an intelligent network for collecting data, transmitting data and processing data, changes the way of human being and object connection, and plays a great role in intelligent home, medical treatment, military precaution, industrial production and the like. The energy of the WSN is limited and is not easy to supplement, so the energy has a very important position in the WSN, and the energy consumption is an important index for measuring the quality of the WSN. The energy consumption of the nodes is related to the distribution of hardware equipment, the communication quality and the application tasks to be completed by the network, and the unbalanced distribution of data in the monitoring area causes the unbalanced phenomenon of the energy consumption of the nodes, so that the life cycle of the network is limited.
In order to reduce energy consumption and prolong the life cycle of the WSN, many researchers have studied on routing algorithms. The most classical LEACH routing protocol utilizes local cluster-head node based random selection to evenly distribute the energy load among the sensors in the network, mainly using localized coordination functions to achieve the robustness and scalability of the dynamic network, and fusing data into the routing protocol to reduce the amount of information that must be transmitted to the base station. Subsequently, a large number of scholars have improved on the basis of the LEACH protocol. Because of the instability of random selection of cluster head nodes of the LEACH protocol, a scholars provides an energy-efficient non-uniform clustering EEUC algorithm. The algorithm adopts a non-uniform clustering idea, a node selects a candidate cluster head through a threshold value, then calculates the self competition radius through the candidate cluster head, and the radius is related to the distance between the node and a base station according to the energy of the candidate cluster head in the same competition area. However, this algorithm has the following disadvantages: the cluster head selection only considers energy factors and does not consider the correlation among node space positions, so that the cluster head nodes are unevenly distributed; (2) the cluster radius of the non-uniform clustering is fixed, and along with the continuous operation of the algorithm, if the cluster radius is kept unchanged, the cluster heads with larger load can continuously bear excessive forwarding tasks, so that the death time of the cluster heads is accelerated.
The traditional non-uniform clustering routing method divides a network area into different clusters through a certain rule, and the scale of the clusters after the clusters are formed does not change any more. However, during the operation of the method, the unbalanced load of the cluster head causes the unbalanced energy consumption of the cluster head. If the cluster size is kept unchanged, that is, the cluster radius is not changed, the cluster heads with large load continuously undertake excessive forwarding tasks, and the death of the cluster heads is accelerated, so that the working time of the network is limited.
Disclosure of Invention
The invention aims to solve the problems in the prior art and provides a non-uniform clustering method based on dynamic cluster radius for a wireless sensor network.
The purpose of the invention is realized by the following technical scheme: a non-uniform clustering method based on dynamic cluster radius for a wireless sensor network comprises the following steps:
s1: the base station broadcasts a message to the nodes in the induction area to inquire the information of the nodes;
s2: after receiving the message, the node reports the node ID, the position information and the residual energy of the node to the base station;
s3: the base station receives and stores the position information of the nodes, the whole network is divided into m annular areas with equal width, the area nearest to the base station is marked as a direct transmission area, the other areas are marked as indirect transmission areas, and the base station calculates the upper and lower boundaries and the average residual energy of each area according to the following formula
Figure BDA0003206476340000021
Then, determining the area of each node according to the position of each node:
upper boundary
Figure BDA0003206476340000022
Lower boundary
Figure BDA0003206476340000023
Wherein d isminAnd dmaxRespectively the minimum and maximum distances of the node from the base station, i is the number of the area, m is the total number of the area, and then the base station broadcasts a message to the node for the second time, including the position coordinate d of the base stationmin、dmaxA competition radius adjustment value DeltaR, a total number of regions m, a total number of nodes N, upper and lower boundaries of each region, and
Figure BDA0003206476340000024
s4: after receiving the message, the node p calculates the region where the node p is located, and directly transmits the competition radius r of the node in the region1And contention radius r of indirect transmission area node2：
Figure BDA0003206476340000025
Wherein λ is1，λ2And c are each a constant greater than 0 and less than 1, dpIs the distance of the node p to the base station,
Figure BDA0003206476340000027
and EinitRespectively representing the residual energy and the initial energy, R, of the node p0Is the maximum communication radius of the node;
Figure BDA0003206476340000031
wherein, beta1And beta2Is a constant greater than 0 and less than 1, npIn order to be the area where the node p is located,
Figure BDA0003206476340000032
n nodes average residual energy of the region, m is the total number of the region, and delta R represents a competition radius adjustment value;
s5: the node p broadcasts information to other nodes in the contention radius of the node p, including the ID of the node, the contention radius and the current remaining energy
Figure BDA0003206476340000033
Other nodes q will receive
Figure BDA0003206476340000034
And
Figure BDA0003206476340000035
make a comparison if
Figure BDA0003206476340000036
The node q quits election, step S7 is carried out, and the node with the largest residual energy is selected as a cluster head node S;
s6: cluster head node S to maximum communication radius R0Inner broadcast information including ID, position coordinates, remaining energy of cluster head node S
Figure BDA0003206476340000037
Distance d from base stationsThe area position n;
s7: the nodes are dormant, if the broadcast signals of the cluster head nodes are received, the nodes quit the dormancy, cluster information is sent to the node with the strongest received signal, if a plurality of nodes with the same strength are provided, the node with the most residual energy is selected to join, if the nodes receive a plurality of broadcasts, the node is marked as a candidate relay node z, and the step S8 is switched;
s8: the candidate relay node calculates the weight of the candidate relay node and then uses the communication radius R0Broadcasting information to other candidate relay nodes, comparing the weight of the other candidate relay nodes with the weight of the other candidate relay nodes after receiving the information, quitting election if the weight of the other candidate relay nodes is small, and selecting the relay node as the relay node if the weight is maximum, wherein a calculation formula of the weight is as follows:
Figure BDA0003206476340000038
s9: counting and recording the total number of nodes in the cluster by the cluster head nodes;
s10: in the data transmission process, if cluster head node SxIn the direct transmission area, switching to the step S11, otherwise, switching to the step S12;
s11: cluster head node SxDirectly transmitting the data to a base station;
s12: cluster head node SxCalculating the communication cost of the cluster head node of the received signal, and selecting the cluster head node S with the minimum costyDefining a transmission distance threshold dis as the next hop transmission node, if d (S)x，Sy)＞dis，SxSearching the relay node between the two clusters for transmission if no relay node or d (S) existsx，Sy) If dis, directly transmitting to SyWherein the cost function is:
Figure BDA0003206476340000039
wherein u is a constant greater than 0 and less than 1, NnumberAnd N is the number of nodes in the cluster and the total number of nodes, d (S), respectivelyx，Sy) Is SxTo SyThe distance of (d);
s13: after the base station receives the data, the data integration can be carried out, after the method of one round is finished, the cluster radius can be dynamically adjusted according to the energy consumption, and the method of the next round is started.
Preferably, in the step S3, the entire network is divided into four equal-width annular regions, dminIs 10m, dmaxIs 90m, Δ R is 10m, and the total number of nodes N is 200.
Preferably, in the step S4, λ1，λ2Are all 0.5, c is 0.3, beta1And beta20.6 and 0.4, respectively, maximum transmission radius R040m, initial energy EinitIs 0.5J, lambda1，λ2，c，β1，β2Are all constants.
Preferably, the wireless sensor network comprises a base station and a plurality of sensor nodes, wherein the base station is fixedly arranged in a network center and can collect data of the whole network sensor through a multi-hop routing transmission method, including the collected data and the information of the electric quantity of the whole network sensor.
Preferably, the sensor nodes are randomly deployed on the wireless sensor network to monitor the surrounding environment, and data is transmitted among the sensor nodes through a route.
Preferably, the total energy of the batteries of all the sensor nodes in the wireless sensor network is the same.
Compared with the prior art, the invention adopting the technical scheme has the following technical effects:
(1) the method comprises the steps of partitioning a network into a direct transmission area and an indirect transmission area, numbering the areas in sequence, and selecting cluster head nodes according to node spatial positions and node energy to enable the cluster head nodes to be distributed more uniformly;
(2) the cluster scale can be adaptively changed along with the change of the network, and the cluster radius is reduced by the excessively loaded cluster heads, so that the number of members in the cluster is reduced, the communication consumption in the cluster is reduced, meanwhile, the number of the cluster heads in the whole network is increased, and the forwarding tasks are jointly borne; and the radius of the area cluster with low energy consumption is increased in a self-adaptive manner, so that more data collection tasks are actively undertaken, and the node energy in the network tends to be balanced.
The invention improves the defects in the prior art, and the cluster radius can automatically change along with the operation of the network, namely, the cluster radius is increased by the cluster head with more residual energy, more load is actively born, and tasks are shared by other cluster heads; the cluster head with small residual energy reduces the cluster radius, reduces some loads to save energy, and thus achieves the purpose of better and uniform network energy consumption.
Drawings
Fig. 1 is a network structure diagram of a non-uniform clustering method based on dynamic cluster radius for a wireless sensor network according to the present invention.
Fig. 2 is a flow chart of cluster formation of a non-uniform clustering method based on dynamic cluster radius for a wireless sensor network according to the present invention.
Detailed Description
Objects, advantages and features of the present invention will be illustrated and explained by the following non-limiting description of preferred embodiments. The embodiments are merely exemplary for applying the technical solutions of the present invention, and any technical solution formed by replacing or converting the equivalent thereof falls within the scope of the present invention claimed.
The invention discloses a non-uniform clustering method based on dynamic cluster radius for a wireless sensor network, which comprises the following steps:
s1: the base station broadcasts a message to the nodes in the induction area to inquire the information of the nodes;
s2: after receiving the message, the node reports the node ID, the position information and the residual energy of the node to the base station;
s3: the base station receives and stores the position information of the nodes, the whole network is divided into m annular areas with equal width, the area nearest to the base station is marked as a direct transmission area, the other areas are marked as indirect transmission areas, and the base station calculates the upper and lower boundaries and the average residual energy of each area according to the following formula
Figure BDA0003206476340000051
Then, determining the area of each node according to the position of each node:
upper boundary
Figure BDA0003206476340000052
Lower boundary
Figure BDA0003206476340000053
Wherein d isminAnd dmaxRespectively the minimum and maximum distances of the node from the base station, i is the number of the area, m is the total number of the area, and then the base station broadcasts a message to the node for the second time, including the position coordinate d of the base stationmin、dmaxCompetitive radius adjustment value DeltaR, total number of regionsm, total number of nodes N, upper and lower boundaries of each region, and
Figure BDA0003206476340000054
s4: after receiving the message, the node p calculates the region where the node p is located, and directly transmits the competition radius r of the node in the region1And contention radius r of indirect transmission area node2：
Figure BDA0003206476340000055
Wherein λ is1，λ2And c are each a constant greater than 0 and less than 1, dpIs the distance of the node p to the base station,
Figure BDA0003206476340000061
and EinitRespectively representing the residual energy and the initial energy, R, of the node p0Is the maximum communication radius of the node;
Figure BDA0003206476340000062
wherein, beta1And beta2Is a constant greater than 0 and less than 1, npIn order to be the area where the node p is located,
Figure BDA0003206476340000063
n nodes average residual energy of the region, m is the total number of the region, and delta R represents a competition radius adjustment value;
s5: the node p broadcasts information to other nodes in the contention radius of the node p, including the ID of the node, the contention radius and the current remaining energy
Figure BDA0003206476340000064
Other nodes q will receive
Figure BDA0003206476340000065
And
Figure BDA0003206476340000066
make a comparison if
Figure BDA0003206476340000067
The node q quits election, step S7 is carried out, and the node with the largest residual energy is selected as a cluster head node S;
s6: cluster head node S to maximum communication radius R0Inner broadcast information including ID, position coordinates, remaining energy of cluster head node S
Figure BDA0003206476340000068
Distance d from base stationsThe area position n;
s7: the nodes are dormant, if the broadcast signals of the cluster head nodes are received, the nodes quit the dormancy, cluster information is sent to the node with the strongest received signal, if a plurality of nodes with the same strength are provided, the node with the most residual energy is selected to join, if the nodes receive a plurality of broadcasts, the node is marked as a candidate relay node z, and the step S8 is switched;
s8: the candidate relay node calculates the weight of the candidate relay node and then uses the communication radius R0Broadcasting information to other candidate relay nodes, comparing the weight of the other candidate relay nodes with the weight of the other candidate relay nodes after receiving the information, quitting election if the weight of the other candidate relay nodes is small, and selecting the relay node as the relay node if the weight is maximum, wherein a calculation formula of the weight is as follows:
Figure BDA0003206476340000069
s9: counting and recording the total number of nodes in the cluster by the cluster head nodes;
s10: in the data transmission process, if cluster head node SxIn the direct transmission area, switching to the step S11, otherwise, switching to the step S12;
s11: cluster head node SxDirectly transmitting the data to a base station;
s12: cluster head node SxCalculating the communication cost of the cluster head node of the received signal, and selecting the node with the minimum costCluster head node SyDefining a transmission distance threshold dis as the next hop transmission node, if d (S)x，Sy)＞dis，SxSearching the relay node between the two clusters for transmission if no relay node or d (S) existsx，Sy) If dis, directly transmitting to SyWherein the cost function is:
Figure BDA0003206476340000071
wherein u is a constant greater than 0 and less than 1, NnumberAnd N is the number of nodes in the cluster and the total number of nodes, d (S), respectivelyx，Sy) Is SxTo SyThe distance of (d);
s13: after the base station receives the data, the data integration can be carried out, after the method of one round is finished, the cluster radius can be dynamically adjusted according to the energy consumption, and the method of the next round is started.
In the step S3, the entire network is divided into four equal-width annular regions, dminIs 10m, dmaxIs 90m, Δ R is 10m, and the total number of nodes N is 200. In the step S4, λ1，λ2Are all 0.5, c is 0.3, beta1And beta20.6 and 0.4, respectively, R0Is 40m, EinitIs 0.5J.
The routing method provided by the technical scheme is applied to a wireless sensor network deployed in a 200 x 200m two-dimensional space, and the wireless sensor network comprises a base station and a plurality of sensor nodes, wherein the base station is fixedly arranged in a network center and can collect data of the whole network sensor, including the collected data and the self electric quantity information thereof, by a multi-hop routing transmission method. The sensor nodes are randomly deployed on the wireless sensor network to monitor the surrounding environment, and the data is transmitted among the sensor nodes through the route, so that different nodes have different energy consumption rates. In this technical solution, the network is preferably divided into four equidistant regions, as shown in fig. 1, and it is assumed that the total energy of the batteries of all the sensor nodes in the wireless sensor network is the same.
A non-uniform clustering method based on dynamic cluster radius for a wireless sensor network comprises the following steps, as shown in FIG. 2:
s1: the base station broadcasts a message to the nodes in the induction area to inquire the information of the nodes;
s2: after receiving the message, the node reports the node ID, the position information and the residual energy of the node to the base station;
s3: the base station receives and stores the information of the nodes, divides the whole network into 4 annular areas with equal width, defines the area nearest to the base station as a direct transmission area, defines other areas as indirect transmission areas, numbers 1, 2, 3 and 4 for each area, and initializes the network.
In the present technical solution, the following parameters are preferably selected as dminIs 10m, dmax90m, deltaR is 10m and the total number of nodes N is 200, the upper and lower boundaries of each region and the average residual energy of the nodes in each region can be respectively obtained, and then the base station broadcasts a message to the nodes for the second time, wherein the message comprises the position coordinates of the base station and dmin，dmaxCompetition radius adjustment value Δ R, total number of regions m, total number of nodes N, upper and lower boundaries of each region, and
Figure BDA0003206476340000072
s4: after the node receives the message, the node can calculate the region where the node is located and directly transmit the competition radius r of the node in the region1And contention radius r of indirect transmission area node2In the present technical solution, the preferable value of the following parameter is λ1，λ2Are all 0.5, c is 0.3, beta1And beta20.6 and 0.4, respectively, R0Is 40m, EinitThe value is 0.5J, and the competition radius of each node can be obtained by substituting the value into a formula;
s5: the node p broadcasts information to other nodes in the contention radius of the node p, including the ID of the node, the contention radius and the current remaining energy
Figure BDA0003206476340000081
Other nodes q will receive
Figure BDA0003206476340000082
And
Figure BDA0003206476340000083
make a comparison if
Figure BDA0003206476340000084
The node q quits election, step S7 is carried out, and the node with the largest residual energy is selected as a cluster head node S;
s6: broadcasting information including the ID and residual energy of the cluster head node S to the range of the maximum communication radius of 40m by the cluster head node S
Figure BDA0003206476340000085
Distance d from base stationsInformation such as the location n of the area;
s7: and the nodes are dormant, if the broadcast signals of the cluster head nodes are received, the nodes quit the dormancy, the cluster information is sent to the node with the strongest received signal, and if a plurality of nodes with the same strength of the signal exist, the node with the largest residual energy is selected to join. If the node receives a plurality of broadcasts, the node is marked as a candidate relay node z, and the step S8 is switched to;
s8: and the candidate relay nodes calculate the own weight, then broadcast information to other candidate relay nodes within the range of 40m, compare the weight with the own weight after the other candidate relay nodes receive the information, and quit election if the own weight is small. Selecting the relay node with the maximum weight value;
s9: counting and recording the total number of nodes in the cluster by the cluster head nodes;
s10: in the data transmission process, if cluster head node SxIn the direct transmission area, switching to the step S10, otherwise, switching to the step S11;
s11: cluster head node SxDirectly transmitting the data to a base station;
s12: cluster head node SxCalculating the communication cost of the cluster head node of the received signal, in this embodimentU is 0.3, and the cluster head node S with the minimum cost is selectedxAs a next hop transmission node, if d (S)x，Sy)＞120m,SxSearching the relay node between the two clusters for transmission if no relay node or d (S) existsx，Sy) If < 120m, directly transmitting to Sy。
S13: the base station can perform data integration after receiving the data. After one round of method is finished, the cluster radius can be dynamically adjusted according to the energy consumption, and the next round of method is started.
The technical scheme provides a non-uniform clustering method of dynamic cluster radius aiming at the defects of the background technology. The method starts from two aspects of cluster head election and cluster radius adjustment, and improves the energy utilization rate of the network. According to the technical scheme, the wireless sensor network is divided into a plurality of areas, the areas are divided into a direct transmission area and an indirect transmission area, the data volume of each area is balanced, candidate cluster head nodes are selected according to probability, the node with the largest residual energy in the competition radius is selected according to the competition radius of each candidate cluster head node and serves as a cluster head node, and the degeneration of competition failure is common nodes. After the cluster head nodes are selected, the cluster head nodes are broadcast around the maximum communication semi-radial direction, and the common nodes select the cluster head nodes with the strongest received signals to join into a cluster. In addition, if a node receives a plurality of cluster head signals, it is proved that the node is at the junction of the clusters, the weight values of the nodes can be calculated, the node with the largest weight value is selected to serve as a relay node, and if the distance between the cluster heads is larger than a defined transmission distance threshold value, data can be forwarded through the relay node, so that the energy consumption of the cluster head nodes is reduced.
The invention has the innovation point that the defect that the cluster radius is not changed in the previous related research is improved, the cluster radius is not only related to the node distance, but also related to the node energy, so that the cluster radius can be dynamically changed along with the operation of the network, and in addition, a step of relaying the node is added to further reduce the energy consumption of the cluster head node, so that the energy consumption of each node is more uniform.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein, and any reference signs in the claims are not intended to be construed as limiting the claim concerned.
Furthermore, it should be understood that although the present description refers to embodiments, not every embodiment may contain only a single embodiment, and such description is for clarity only, and those skilled in the art should integrate the description, and the embodiments may be combined as appropriate to form other embodiments understood by those skilled in the art. The invention has various embodiments, and all technical solutions formed by adopting equivalent transformation or equivalent transformation are within the protection scope of the invention.

Claims (6)

1. A non-uniform clustering method based on dynamic cluster radius for a wireless sensor network is characterized in that: the method comprises the following steps:
s1: the base station broadcasts a message to the nodes in the induction area to inquire the information of the nodes;
s2: after receiving the message, the node reports the node ID, the position information and the residual energy of the node to the base station;
s3: the base station receives and stores the position information of the nodes, the whole network is divided into m annular areas with equal width, the area nearest to the base station is marked as a direct transmission area, the other areas are marked as indirect transmission areas, and the base station calculates the upper and lower boundaries and the average residual energy of each area according to the following formula
Figure FDA0003206476330000011
Then, determining the area of each node according to the position of each node:
upper boundary
Figure FDA0003206476330000012
Lower boundary
Figure FDA0003206476330000013
Wherein d isminAnd dmaxRespectively the minimum and maximum distances of the node from the base station, i is the number of the area, m is the total number of the area, and then the base station broadcasts a message to the node for the second time, including the position coordinate d of the base stationmin、dmaxA competition radius adjustment value DeltaR, a total number of regions m, a total number of nodes N, upper and lower boundaries of each region, and
Figure FDA0003206476330000014
s4: after receiving the message, the node p calculates the region where the node p is located, and directly transmits the competition radius r of the node in the region1And contention radius r of indirect transmission area node2：
Figure FDA0003206476330000015
Wherein λ is1，λ2And c are each a constant greater than 0 and less than 1, dpIs the distance of the node p to the base station,
Figure FDA0003206476330000016
and EinitRespectively representing the residual energy and the initial energy, R, of the node p0Is the maximum communication radius of the node;
Figure FDA0003206476330000017
wherein, beta1And beta2Is a constant greater than 0 and less than 1, npIn order to be the area where the node p is located,
Figure FDA0003206476330000018
n nodes average residual energy of the region, m is the total number of the region, and delta R represents a competition radius adjustment value;
s5: the node p broadcasts information to other nodes in the contention radius of the node p, including the ID of the node, the contention radius and the current remaining energy
Figure FDA0003206476330000021
Other nodes q will receive
Figure FDA0003206476330000022
And
Figure FDA0003206476330000023
make a comparison if
Figure FDA0003206476330000024
The node q quits election, step S7 is carried out, and the node with the largest residual energy is selected as a cluster head node S;
s6: cluster head node S to maximum communication radius R0Inner broadcast information including ID, position coordinates, remaining energy of cluster head node S
Figure FDA0003206476330000025
Distance d from base stationsThe area position n;
s7: the nodes are dormant, if the broadcast signals of the cluster head nodes are received, the nodes quit the dormancy, cluster information is sent to the node with the strongest received signal, if a plurality of nodes with the same strength are provided, the node with the most residual energy is selected to join, if the nodes receive a plurality of broadcasts, the node is marked as a candidate relay node z, and the step S8 is switched;
s8: the candidate relay node calculates the weight of the candidate relay node and then uses the communication radius R0Broadcasting information to other candidate relay nodes, comparing the weight value with the own weight value after the other candidate relay nodes receive the information, quitting the election if the own weight value is small,and selecting the relay node with the maximum weight value, wherein the calculation formula of the weight value is as follows:
Figure FDA0003206476330000026
s9: counting and recording the total number of nodes in the cluster by the cluster head nodes;
s10: in the data transmission process, if cluster head node SxIn the direct transmission area, switching to the step S11, otherwise, switching to the step S12;
s11: cluster head node SxDirectly transmitting the data to a base station;
s12: cluster head node SxCalculating the communication cost of the cluster head node of the received signal, and selecting the cluster head node S with the minimum costyDefining a transmission distance threshold dis as the next hop transmission node, if d (S)x，Sy)＞dis，SxSearching the relay node between the two clusters for transmission if no relay node or d (S) existsx，Sy) If dis, directly transmitting to SyWherein the cost function is:
Figure FDA0003206476330000027
wherein u is a constant greater than 0 and less than 1, NnumberAnd N is the number of nodes in the cluster and the total number of nodes, d (S), respectivelyx，Sy) Is SxTo SyThe distance of (d);
s13: after the base station receives the data, the data integration can be carried out, after the method of one round is finished, the cluster radius can be dynamically adjusted according to the energy consumption, and the method of the next round is started.
2. The non-uniform clustering method based on the dynamic cluster radius of the wireless sensor network as claimed in claim 1, wherein: in the step S3, the entire network is divided into four equal-width annular regions, dminIs 10m, dmaxIs 90m,. DELTA.R10m, and the total number of nodes N is 200.
3. The non-uniform clustering method based on the dynamic cluster radius of the wireless sensor network as claimed in claim 1, wherein: in the step S4, λ1，λ2Are all 0.5, c is 0.3, beta1And beta20.6 and 0.4, respectively, maximum transmission radius R040m, initial energy EinitIs 0.5J, lambda1，λ2，c，β1，β2Are all constants.
4. The non-uniform clustering method based on the dynamic cluster radius of the wireless sensor network as claimed in claim 1, wherein: the wireless sensor network comprises a base station and a plurality of sensor nodes, wherein the base station is fixedly arranged in a network center and can collect data of the whole network sensor through a multi-hop route transmission method, including the collected data and the self electric quantity information.
5. The non-uniform clustering method based on the dynamic cluster radius of the wireless sensor network as claimed in claim 4, wherein: the sensor nodes are randomly deployed on the wireless sensor network to monitor the surrounding environment, and data are transmitted among the sensor nodes through a route.
6. The non-uniform clustering method based on the dynamic cluster radius of the wireless sensor network as claimed in claim 1, wherein: the total energy of the batteries of all the sensor nodes in the wireless sensor network is the same.
CN202110923184.9A 2021-08-11 2021-08-11 Non-uniform clustering method based on dynamic cluster radius in wireless sensor network Active CN113490253B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110923184.9A CN113490253B (en) 2021-08-11 2021-08-11 Non-uniform clustering method based on dynamic cluster radius in wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110923184.9A CN113490253B (en) 2021-08-11 2021-08-11 Non-uniform clustering method based on dynamic cluster radius in wireless sensor network

Publications (2)

Publication Number Publication Date
CN113490253A true CN113490253A (en) 2021-10-08
CN113490253B CN113490253B (en) 2023-07-28

Family

ID=77945099

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110923184.9A Active CN113490253B (en) 2021-08-11 2021-08-11 Non-uniform clustering method based on dynamic cluster radius in wireless sensor network

Country Status (1)

Country Link
CN (1) CN113490253B (en)

Citations (5)

* 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
WO2011095884A1 (en) * 2010-02-08 2011-08-11 University Of Cape Town Medium access control in wireless sensor networks
CN102158927A (en) * 2011-05-20 2011-08-17 北京邮电大学 Efficient inhomogeneous clustering routing method of wireless sensor network
CN110662190A (en) * 2019-09-19 2020-01-07 北京交通大学 Dynamic clustering LEACH method in wireless sensor network
CN111314987A (en) * 2020-02-26 2020-06-19 国网陕西省电力公司电力科学研究院 Wireless sensor network facing smart power grid and clustering algorithm thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011095884A1 (en) * 2010-02-08 2011-08-11 University Of Cape Town Medium access control in wireless sensor networks
CN102036308A (en) * 2010-12-09 2011-04-27 江南大学 Energy balancing wireless sensor network clustering method
CN102158927A (en) * 2011-05-20 2011-08-17 北京邮电大学 Efficient inhomogeneous clustering routing method of wireless sensor network
CN110662190A (en) * 2019-09-19 2020-01-07 北京交通大学 Dynamic clustering LEACH method in wireless sensor network
CN111314987A (en) * 2020-02-26 2020-06-19 国网陕西省电力公司电力科学研究院 Wireless sensor network facing smart power grid and clustering algorithm thereof

Also Published As

Publication number Publication date
CN113490253B (en) 2023-07-28

Similar Documents

Publication Publication Date Title
CN101188444B (en) A method for distributed section networking in wireless sensing network
CN108712767B (en) Inter-cluster multi-hop routing control method with balanced energy consumption in wireless sensor network
Hani et al. A Survey on LEACH-Based Energy Aware Protocols for Wireless Sensor Networks.
CN110072265B (en) Method for realizing energy heterogeneous wireless sensor network clustering protocol
CN104410997B (en) A kind of clustering topology construction method for wireless sensor network
CN108541038B (en) Routing method and system of wireless sensor network
CN103347288B (en) A kind of wireless sensor network does not wait width hierarchical routing protocol method
Sun et al. Research on clustering routing protocol based on improved PSO in FANET
CN108566658B (en) Clustering algorithm for balancing energy consumption in wireless sensor network
CN105898764B (en) Multi-level energy heterogeneous wireless sensor network deployment method
CN104135752A (en) Cluster head node selection method and clustering method of wireless sensor network
CN105873160B (en) Cluster building and method for routing in a kind of cognition wireless sensor network without common channel
CN101959244A (en) Method for controlling hierarchical type route suitable for wireless sensor network
CN110149672B (en) Improved I-LEACH route communication method
CN109511152A (en) A kind of balanced cluster-dividing method of terminaloriented communication access net perception monitoring
Maurya et al. A survey on descendants of leach protocol
CN111372296B (en) Method for optimizing election threshold of wireless sensor network routing protocol
Azar et al. Energy-and delay-efficient algorithm for large-scale data collection in mobile-sink WSNs
Wang et al. An improved unequal cluster-based routing protocol for energy efficient wireless sensor networks
CN113595903B (en) Wireless sensor network node dormancy scheduling method based on FCM (fuzzy c-means) clustering topology
CN113490253A (en) Non-uniform clustering method based on dynamic cluster radius in wireless sensor network
CN117336818A (en) WSN clustering routing algorithm based on locust optimization FCM
Kaur et al. Comparative analysis of clustering protocols for wireless sensor networks
CN105101334A (en) Cooperative networking method of multi-WBAN coexisting network
Naghibzadeh et al. Fuzzy-based clustering solution for hot spot problem in wireless sensor networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant