An energy-saving routing method for wireless sensor networks based on hybrid evolutionary algorithm
By adopting hybrid evolution algorithms and hierarchical clustering structures in wireless sensor networks, the transmission path and cluster head selection are optimized, and the problems of energy exhaustion and communication cost imbalance in sensor networks are solved, which extends the network life and realizes energy-saving transmission.
Patent Information
- Application Number
- CN202211685843.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-12-26
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2042-12-26
AI Technical Summary
Existing wireless sensor networks end their life cycle prematurely when the node energy is exhausted, especially due to excessive energy consumption caused by cluster head rotation and uneven communication costs, which affects the network life.
Adopt the energy-saving routing method of wireless sensor network based on hybrid evolution algorithm, optimize the transmission path through layered and clustered structures, and use diffusion method and hybrid evolution algorithm to establish layer structure and cluster structure, optimize cluster head selection and data transmission routing, and reduce communication chain Road length and energy consumption.
It extends the life cycle of the wireless sensor network, balances energy consumption, avoids the early ending problem caused by uneven distribution of cluster heads and high-energy transmission, and realizes energy-saving transmission.
Smart Images

Figure CN116074789B_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the field of wireless communications, and in particular relates to an energy-saving routing method for a wireless sensor network based on a hybrid evolutionary algorithm. Background Art
[0002] Wireless sensor networks consist of a group of battery-powered sensor nodes, which are generally deployed in mission scenarios that are difficult to reach manually. When a single sensor runs out of battery power, the node can only exit the network. When a large number of nodes run out of energy, the sensor network will find it difficult to continue working. Therefore, the endurance of sensor nodes is one of the key issues that determine the life cycle of wireless sensor networks. In most scenarios, sensor nodes are deployed by randomly scattering them in the air by aircraft, so the location of sensors is relatively random, and sensor nodes need to self-organize into a usable network after landing. How information communicates between sensor nodes is determined by the routing method. Therefore, the routing method determines the performance of wireless sensor networks.
[0003] The actual deployment environment is complex. The premature end of the life cycle of wireless sensor networks due to the exhaustion of key node energy is a thorny problem. Although the current cluster-based LEACH algorithm and chain-based PEGASIS method can extend the life of the network to a certain extent, the following problems still exist:
[0004] (1) Although cluster head rotation can balance the load to a certain extent, for nodes at the edge of the network, the communication cost is greatly increased because the distance from the base station is too far. Therefore, this simple load balancing method is not friendly to nodes far away from the base station;
[0005] (2) Although the cluster head election method can ensure fairness, it cannot take into account the communication cost. It is possible that cluster head nodes will appear in a certain area, which greatly increases the energy consumption in the network and further reduces the network life.
[0006] (3) The communication cost is too high or the communication link is too long due to poor cluster head election, which also causes excess energy consumption in the network and causes the network to end its life cycle prematurely. Summary of the invention
[0007] In order to solve the problem of excessive transmission energy consumption of remote nodes and uneven energy consumption during link transmission caused by cluster head rotation, the present invention proposes an energy-saving routing method for wireless sensor networks based on a hybrid evolutionary algorithm. The hybrid evolutionary algorithm is used to save energy consumption in the network data transmission process and extend the life cycle of the wireless sensor network.
[0008] The technical solution of the present invention is as follows:
[0009] A wireless sensor network energy-saving routing method based on a hybrid evolutionary algorithm comprises the following steps:
[0010] Step 1: The aircraft deploys sensor nodes in a random manner in the monitoring area;
[0011] Step 2: Use the diffusion method to layer all sensor nodes and establish the layer structure of the wireless sensor network;
[0012] Step 3: After obtaining the hierarchical information, clustering is performed within each layer to establish a cluster structure of the wireless sensor network;
[0013] Step 4: Based on the established wireless sensor network structure, the data monitored by the sensors are transmitted in an energy-saving routing manner until the end of the network life cycle.
[0014] Furthermore, in step 1, the base station location in the monitoring area is recorded as s 0 , the number of sensor nodes deployed by random scattering is s i , i∈1,2,3…,n, where n represents the total number of sensor nodes; positioning devices are set on a small number of sensor nodes, and then a positioning algorithm is used to infer the positions of other sensor nodes without positioning devices based on the positions obtained by a small number of nodes with positioning devices, thereby obtaining the specific location information of each sensor node.
[0015] Furthermore, in step 2, stratification includes two stages: pre-stratification and fine-tuning; the specific process is as follows:
[0016] Step 2.1: Use the diffusion method to determine the first layer according to the maximum communication radius of each sensor node and assign a layer number. Then, continue to diffuse based on the first layer to determine the second layer, and so on, until all sensor nodes have their own layer numbers, completing the pre-stratification.
[0017] Step 2.2, each sensor node fine-tunes the layer number according to the three nodes closest to itself and the upper and lower nodes; the fine-tuning process is: if two of the three nearest nodes have layer numbers greater than the current node, the layer number of the current node is increased by 1; if two nodes have layer numbers less than the current node, the layer number of the current node is reduced by 1; otherwise, no change is made.
[0018] Furthermore, in step 3, clustering includes two stages: pre-clustering and global re-clustering. The specific process is as follows:
[0019] Step 3.1, establish a set of adjacent sensor nodes, and pre-cluster them in a way that the links approach a straight line;
[0020] Step 3.2: Use the hybrid evolutionary algorithm to perform global re-clustering on the pre-clustering results to obtain the final cluster structure.
[0021] Furthermore, the specific process of step 3.1 is:
[0022] Step 3.1.1: Let the set of sensor nodes in each layer be s l , l∈1,2,…,L, where L represents the total number of layers; each sensor node maintains its own layer number s i .l; Except for the first layer, each layer of sensor nodes stores the set s of sensor node numbers of the previous layer i .n l-1 =[s p1 ,s p2 ,…], where s p1 ,s p2 ,…∈s l-1 ; Except for the last layer, each layer of sensor nodes needs to save the set s of the sensor node numbers of the next layer i .n l+1 =[s q1 ,s q2 ,…], where s q1 ,s q2 ,…∈s l+1 ;
[0023] Step 3.1.2: All sensor nodes broadcast their own layer number. Each sensor node only receives the data packet with the same layer number as itself and communicates with it to confirm the link; thus, each sensor node s i Get the set s of adjacent nodes on the same layer i .adj;
[0024] Step 3.1.3, starting from the base station, randomly select the three closest points in the outermost layer as the end points to make three straight lines. The sensor nodes in each layer close to these three straight lines are used as cluster heads, and the remaining nodes are based on the sensor s i The set of adjacent nodes s i .adj chooses whether to join the cluster; continue to search for three other adjacent nodes in a counterclockwise direction to draw a straight line, excluding nodes that have become cluster heads and nodes that have joined other clusters. The nodes closest to these three straight lines in the remaining layers are elected as cluster heads. Sensor nodes that have not joined any cluster choose whether to join the cluster based on the set of adjacent nodes; if there are no such sensor nodes, skip the allocation of cluster heads and continue to search for three adjacent points in the outermost layer until all sensor nodes have become cluster heads or have joined a cluster; if the outermost nodes have been traversed at this time and there are still nodes that are not cluster heads or have not joined any cluster, continue to select three nodes in the previous layer to draw a straight line.
[0025] Furthermore, the specific process of step 3.2 is:
[0026] Based on the current pre-clustering scheme, the member nodes in the cluster save the cluster head node number. Except for the first layer, the cluster head nodes of each layer maintain a set of cluster head nodes that can be connected to the previous layer. Except for the last layer, each layer of cluster head nodes needs to maintain a set of cluster head nodes that can be connected to the next layer.
[0027] A hybrid evolutionary algorithm is used to perform global re-clustering to further optimize the cluster structure; the algorithm uses the location of the sensor node as an individual, and the location Where n represents the total number of sensors. as well as represents the three-dimensional coordinates of the i-th sensor node; the objective function optimized by the hybrid evolutionary algorithm is:
[0028]
[0029] Among them, dist(s i ,s j ) represents the sensor node s i With sensor nodes j The distance between them, len(·) represents the number of sensor nodes in the set, α, β, γ, η, All represent the balance factor; j represents the jth sensor node, a n Represents the size of the neighboring node set of the sensor node, s i .adj j represents the i-th sensor node s i The jth sensor node in the adjacent node set of represents the i-th sensor node s i The upper layer of can reach the jth sensor node in the cluster head node set, represents the i-th sensor node s i The lower layer of can reach the jth sensor node in the cluster head node set;
[0030] After the optimization is completed, the final cluster structure is obtained, and the layer structure and cluster structure of the entire wireless sensor network are established.
[0031] Furthermore, the specific process of step 4 is as follows:
[0032] Step 4.1: When the data packet arrives at the cluster head, use the round-robin method to Select the next layer of reachable cluster head; specifically: when the data packet fails to send, retry twice. If it still fails to send successfully, the selected cluster head node is removed from If the next reachable cluster head set of the cluster head node is empty, the node will no longer serve as the cluster head, and other nodes in the cluster will be randomly selected as the cluster head. The new cluster head will re-establish and If the two sets are not empty, the node successfully serves as the cluster head, otherwise it continues to select other cluster heads;
[0033] Step 4.2: Monitor the global sensor nodes. When it is detected that more than 5% of the global nodes are not working, the network will be globally re-clustered according to the hybrid evolutionary algorithm to ensure that as many areas as possible in the network can still work until the end of the network life cycle.
[0034] Beneficial technical effects brought by the present invention:
[0035] The layer structure and cluster structure established by this method can achieve the purpose of energy-saving transmission, extend the life cycle of the wireless sensor network, effectively shorten the length of the communication link, balance the energy consumption, and use the hybrid evolutionary algorithm to save energy consumption in the network data transmission process and extend the overall life cycle of the network due to the uneven distribution of cluster heads and the need for high-energy transmission of some nodes, which causes some nodes to end their life cycle prematurely due to energy exhaustion. BRIEF DESCRIPTION OF THE DRAWINGS
[0036] Figure 1 It is a flow chart of the energy-saving routing method of wireless sensor networks based on the hybrid evolutionary algorithm of the present invention;
[0037] Figure 2 This is a schematic diagram of the intra-layer clustering routing method proposed by the present invention. DETAILED DESCRIPTION
[0038] The present invention is further described in detail below with reference to the accompanying drawings and specific embodiments:
[0039] like Figure 1 As shown, the present invention proposes an energy-saving routing method for wireless sensor networks based on a hybrid evolutionary algorithm. The nodes in the network are first divided into a hierarchical structure, and then the nodes in each layer are clustered. In this way, there is no forwarding of data packets between two different cluster heads in the same layer. Data is transmitted from the source node to the destination node in a manner as close to a straight line as possible, ensuring that the link length during the transmission process will not be too long. At the same time, this method ensures that the data packet will not be transmitted across layers, avoiding high-energy transmission of remote nodes. Since the stratification based on spatial location information also ensures that the cluster head nodes will not appear in a certain area, the balance of energy consumption during data transmission is guaranteed. In the stratification process, the energy consumption of each node on the data transmission link is taken into account, ensuring that high-energy transmission will not occur in the link every time a data packet is transmitted. Specifically, the following steps are included:
[0040] Step 1: The aircraft deploys sensor nodes in a randomly scattered manner in the monitoring area.
[0041] The location of the base station in the monitoring area is s 0 , the number of sensor nodes deployed by random scattering is s i , i∈1,2,3…,n, where n represents the total number of sensor nodes.
[0042] In the deployment process of the present invention, the number of sensor nodes deployed each time is hundreds or thousands. Due to the high cost, in actual application, there will not be a GPS positioning device on each sensor node. Therefore, a positioning algorithm is used to infer the positions of other sensor nodes without GPS based on the positions obtained by a small number of nodes with GPS, and then the specific location information of each sensor node is obtained.
[0043] In the embodiment of the present invention, the specifically adopted positioning algorithm is the DV-Hop algorithm.
[0044] Step 2: Use the diffusion method to stratify all sensor nodes and establish the layer structure of the wireless sensor network. The stratification includes two stages: pre-stratification and fine-tuning. Fine-tuning each sensor node after pre-stratification can achieve a better stratification effect. First, pre-stratify the nodes according to the position relationship between the nodes and the data accessibility, and then fine-tune the layer to which the node belongs according to the relationship with other nodes. This can avoid cross-layer transmission between nodes, reduce the energy consumption of nodes by high-energy transmission, and avoid premature exhaustion of energy in some cluster heads. The specific process of stratification is:
[0045] Step 2.1: Use the diffusion method to determine the first layer according to the maximum communication radius of each sensor node and assign a layer number. Then, continue to diffuse based on the first layer to determine the second layer, and so on, until all sensor nodes have their own layer numbers, completing the pre-stratification.
[0046] Step 2.2, each sensor node fine-tunes the layer number according to the three nodes closest to itself and the upper and lower nodes, to ensure the balance of transmission energy consumption in the link as much as possible. The fine-tuning process is: if two of the three nearest nodes have a layer number greater than the current node, the layer number of the current node is increased by 1; if two nodes have a layer number less than the current node, the layer number of the current node is reduced by 1; otherwise, no change is made.
[0047] Step 3: After obtaining the hierarchical information, clustering is performed in each layer to establish the cluster structure of the wireless sensor network. Clustering is divided into two stages: pre-clustering and global re-clustering. The pre-clustering stage can quickly cluster while ensuring that the communication link is as short as possible. In the global re-clustering stage, the proposed hybrid evolutionary algorithm is used to fine-tune the cluster head nodes in the cluster. Each cluster head node maintains the set of reachable cluster head nodes in the lower layer, and selects other cluster heads when the set of reachable cluster head nodes in the lower layer is empty.
[0048] In the pre-clustering stage, each sensor node broadcasts the layer number and location information to obtain the set of adjacent nodes in the same layer; after the pre-clustering is completed, it should be ensured that each sensor node stores the current layer number information and the information of the adjacent nodes in the same layer, and during the data packet transmission process, two nodes with non-adjacent layer numbers cannot communicate directly to avoid high-energy transmission. Pre-clustering can make the links between cluster head nodes as short as possible, which can avoid unnecessary energy consumption in the transmission link. The specific process of clustering is:
[0049] Step 3.1: Establish a set of adjacent sensor nodes and perform pre-clustering by satisfying the link approach straight line. The specific process of this stage is as follows:
[0050] Step 3.1.1: Let the set of sensor nodes in each layer be s l , l∈1,2,…,L, where L represents the total number of layers. Each sensor node needs to maintain its own layer number s i Except for the first layer, each layer of sensor nodes needs to save the set s of sensor node numbers of the previous layer. i .n l-1 =[s p1 ,s p2 ,…], where s p1 ,s p2 ,…∈s l-1 Except for the last layer, each layer of sensor nodes needs to save the set s of sensor node numbers of the next layer i .n l+1 =[s q1 ,s q2 ,…], where s q1 ,s q2 ,…∈s l+1 ;
[0051] Step 3.1.2: All sensor nodes broadcast their own layer number. Each sensor node only receives data packets with the same layer number as itself and communicates with it to confirm the link. i The set s of adjacent nodes in the same layer can be obtained i .adj;
[0052] Step 3.1.3, starting from the base station, randomly select the three closest points in the outermost layer as the end points to make three straight lines. The sensor nodes in each layer close to these three straight lines are used as cluster heads, and the remaining nodes are based on the sensor s i The set of adjacent nodes s i .adj chooses whether to join the cluster. Continue to search for three other adjacent nodes in a counterclockwise direction, draw a straight line, exclude the nodes that have become cluster heads and nodes that have joined other clusters, and the nodes closest to these three straight lines in the remaining layers of nodes are selected as cluster heads. Sensor nodes that have not joined any cluster choose whether to join the cluster based on the set of adjacent nodes. If there is no such sensor node, skip the allocation of cluster heads and continue to search for three adjacent points in the outermost layer until all sensor nodes have become cluster heads or have joined a cluster. If the outermost nodes have been traversed at this time, and there are still nodes that are not cluster heads or have not joined any cluster, continue to select three nodes in the previous layer to draw a straight line.
[0053] Step 3.2: Use the hybrid evolutionary algorithm to perform global re-clustering on the results of pre-clustering to obtain a more appropriate cluster structure. After the global re-clustering is completed, it should be ensured that each cluster head node stores the information of the upper and lower layer reachable cluster head nodes. The routing process determines which cluster head nodes the data packet passes through during transmission based on this information.
[0054] During the data packet transmission process, when the set of lower-level reachable cluster head nodes of a cluster head node is empty, another cluster head is reselected. When all nodes in the cluster cannot meet the demand, the cluster is disbanded, and all sensors that can be connected to other cluster head nodes join the nearest cluster structure. Isolated nodes sleep and wait for a new round of global re-clustering.
[0055] In this step, when each data transmission occurs, after the data packet passes through a certain cluster, the cluster head in the cluster will be replaced using a round-robin method to balance the load during the next data transmission. When the cluster head nodes are exhausted, the cluster head should be replaced and the reachable cluster head node information of the node in the upper and lower layers should be modified. When the set of reachable cluster head nodes of any node in a cluster is not empty, the cluster should be dissolved and merged with other cluster structures to form a new cluster structure.
[0056] The specific process of the global re-clustering stage is as follows:
[0057] After pre-clustering in the basic layer, the existing cluster members are kept unchanged, and all cluster head nodes are globally re-clustered using the proposed hybrid evolutionary algorithm. When clustering, their own s i.adj, the distance between itself and the adjacent cluster heads, the number of upper-layer reachable cluster head nodes, the number of lower-layer reachable nodes, and the average distance to the upper and lower-layer reachable cluster heads. Based on the current pre-clustering scheme, the member nodes in the cluster save the cluster head node numbers. Except for the first layer, the cluster head nodes of each layer maintain a set of cluster head nodes that can be connected to the upper layer. Except for the last layer, each layer of cluster head nodes needs to maintain a set of cluster head nodes that can be connected to the next layer.
[0058] The hybrid evolutionary algorithm is used to perform global re-clustering to further optimize the cluster structure and obtain a more suitable cluster structure. The algorithm takes the position of the sensor node as an individual, that is, Where n represents the total number of sensors. as well as Represents the three-dimensional coordinates of the i-th sensor node. The objective function optimized by the hybrid evolutionary algorithm is:
[0059]
[0060] Among them, dist(s i ,s j ) represents the sensor node s i With sensor nodes j The distance between them, len(·) represents the number of sensor nodes in the set, α, β, γ, η, Both represent the balance factor. j represents the jth sensor node, a n Represents the size of the neighboring node set of the sensor node, s i .adj j represents the i-th sensor node s i The jth sensor node in the adjacent node set of represents the i-th sensor node s i The upper layer of can reach the jth sensor node in the cluster head node set, represents the i-th sensor node s i The lower layer can reach the jth sensor node in the cluster head node set.
[0061] After the above steps, a reasonable cluster structure is finally formed, and the sensor nodes complete the network deployment, which can avoid a large amount of unnecessary energy consumption in the transmission link. At this time, the layer structure and cluster structure of the entire wireless sensor network have been established, and energy-saving routing transmission is then carried out.
[0062] Step 4: Based on the established wireless sensor network structure, the data monitored by the sensors is transmitted in an energy-saving routing manner until the network life cycle ends. The specific process is as follows:
[0063] Step 4.1: When the data packet arrives at the cluster head, use the round-robin method to Select the next layer of reachable cluster head. When the data packet fails to send, retry twice. If it still fails to send successfully, the selected cluster head node will be removed from If the next reachable cluster head set of the cluster head node is empty, the node will no longer serve as the cluster head, and other nodes in the cluster will be randomly selected as the cluster head. The new cluster head will re-establish and If the two sets are not empty, the node successfully serves as the cluster head, otherwise it continues to select other cluster heads. After this step, the wireless sensor network can bypass the sensor nodes that are no longer working properly and re-network in the local area, ensuring the stability of the wireless sensor network, achieving energy-saving effects, and extending the network life cycle.
[0064] Step 4.2: Monitor the global sensor nodes. When it is detected that more than 5% of the global nodes are not working, the network will be globally re-clustered according to the proposed hybrid evolutionary algorithm to ensure that as many areas as possible in the network can still work until the end of the network life cycle.
[0065] Failure to work usually means that the sensor node cannot forward data packets due to power exhaustion, or the sensor node may be damaged due to external force. The present invention mainly determines that the next-hop node cannot work through multiple packet sending failures.
[0066] like Figure 2 As shown, the present invention adopts an intra-layer clustering routing method, taking the clustering of three-layer nodes as an example, taking the base station as the starting point, selecting the sensor nodes within the communication range of the base station as the first-layer nodes, and then obtaining the second-layer nodes according to the communication range of the first-layer nodes, and continuing to obtain the third-layer nodes according to the communication range of the second-layer nodes. Then, the layer numbers of all current nodes are fine-tuned according to the method described in step 2.2. Then, the nodes in each layer are clustered according to the method described in step 3.1, and the method described in step 3.2 is used for global re-clustering, and finally the cluster structure in each layer is determined. Finally, the data packet is transmitted according to the method described in step 4, and energy-saving routing transmission is performed until the end of the network life cycle.
[0067] In the present invention, the sensor nodes are mainly powered by dry batteries, and their working environment determines that the batteries of the sensor nodes cannot be replaced, so the energy-saving routing method proposed in the present invention is of great significance.
[0068] Of course, the above description is not a limitation of the present invention, and the present invention is not limited to the above examples. Changes, modifications, additions or substitutions made by technicians in this technical field within the essential scope of the present invention should also fall within the protection scope of the present invention.
Claims
1. An energy-saving routing method for wireless sensor networks based on hybrid evolutionary algorithm, It is characterized in that The steps include: Step 1: The aircraft deploys sensor nodes in a random manner in the monitoring area; Step 2: Use the diffusion method to layer all sensor nodes and establish the layer structure of the wireless sensor network; Step 3: After obtaining the hierarchical information, clustering is performed within each layer to establish a cluster structure of the wireless sensor network; In step 3, clustering includes two stages: pre-clustering and global re-clustering. The specific process is as follows: Step 3.1: Establish a set of adjacent sensor nodes and pre-cluster them by satisfying the link approach straight line. The specific process is as follows: Step 3.1.1: Let the set of sensor nodes in each layer be s l , l∈1,2,…,L, where L represents the total number of layers; each sensor node maintains its own layer number s i .l; Except for the first layer, each layer of sensor nodes stores the set s of sensor node numbers of the previous layer i .n l-1 =[s p1 ,s p2 ,…], where s p1 ,s p2 ,…∈s l-1 ; Except for the last layer, each layer of sensor nodes needs to save the set s of the sensor node numbers of the next layer i .n l+1 =[s q1 ,s q2 ,…], where s q1 ,s q2 ,…∈s l+1 ; Step 3.1.2: All sensor nodes broadcast their own layer number. Each sensor node only receives the data packet with the same layer number as itself and communicates with it to confirm the link; thus, each sensor node s i Get the set s of adjacent nodes on the same layer i .adj; Step 3.1.3, starting from the base station, randomly select the three closest points in the outermost layer as the end points to make three straight lines. The sensor nodes in each layer close to these three straight lines are used as cluster heads, and the remaining nodes are based on the sensor s i The set of adjacent nodes s i .adj chooses whether to join the cluster; continue to search for three other adjacent nodes in a counterclockwise direction, draw a straight line, exclude the nodes that have become cluster heads and nodes that have joined other clusters, and the nodes closest to these three straight lines in the remaining layers of nodes are elected as cluster heads. Sensor nodes that have not joined any cluster choose whether to join the cluster based on the set of adjacent nodes; if there is no such sensor node, skip the allocation of cluster heads and continue to search for three adjacent points in the outermost layer until all sensor nodes have become cluster heads or have joined a cluster; if the outermost nodes have been traversed at this time, and there are still nodes that are not cluster heads or have not joined any cluster, continue to select three nodes in the previous layer to draw a straight line; Step 3.2: Use the hybrid evolutionary algorithm to perform global re-clustering on the pre-clustering results to obtain the final cluster structure; the specific process is as follows: Based on the current pre-clustering scheme, the member nodes in the cluster save the cluster head node number. Except for the first layer, the cluster head nodes of each layer maintain a set of cluster head nodes that can be connected to the previous layer. Except for the last layer, each layer of cluster head nodes needs to maintain a set of cluster head nodes that can be connected to the next layer. A hybrid evolutionary algorithm is used to perform global re-clustering to further optimize the cluster structure; the algorithm uses the location of the sensor node as an individual, and the location Where n represents the total number of sensors. as well as represents the three-dimensional coordinates of the i-th sensor node; the objective function optimized by the hybrid evolutionary algorithm is: Among them, dist(s i ,s j ) represents the sensor node s i With sensor nodes j The distance between them, len(·) represents the number of sensor nodes in the set, α, β, γ, η, All represent the balance factor; j represents the jth sensor node, a n Represents the size of the neighboring node set of the sensor node, s i .adj j represents the i-th sensor node s i The jth sensor node in the adjacent node set of represents the i-th sensor node s i The upper layer of can reach the jth sensor node in the cluster head node set, represents the i-th sensor node s i The lower layer of can reach the jth sensor node in the cluster head node set; After the optimization is completed, the final cluster structure is obtained, and the layer structure and cluster structure of the entire wireless sensor network are established; Step 4: Based on the established wireless sensor network structure, the data monitored by the sensors are transmitted in an energy-saving routing manner until the end of the network life cycle.
2. According to the energy-saving routing method for wireless sensor networks based on hybrid evolutionary algorithm according to claim 1, It is characterized in that In step 1, the base station position in the monitoring area is recorded as s 0 , the number of sensor nodes deployed by random scattering is s i , i∈1,2,3…,n, where n represents the total number of sensor nodes; positioning devices are set on a small number of sensor nodes, and then a positioning algorithm is used to infer the positions of other sensor nodes without positioning devices based on the positions obtained by a small number of nodes with positioning devices, thereby obtaining the specific location information of each sensor node.
3. According to the energy-saving routing method for wireless sensor networks based on hybrid evolutionary algorithm according to claim 1, It is characterized in that In step 2, the stratification includes two stages: pre-stratification and fine-tuning; the specific process is as follows: Step 2.1: Use the diffusion method to determine the first layer according to the maximum communication radius of each sensor node and assign a layer number. Then, continue to diffuse based on the first layer to determine the second layer, and so on, until all sensor nodes have their own layer numbers, completing the pre-stratification. Step 2.2, each sensor node fine-tunes the layer number according to the three nodes closest to itself and the upper and lower nodes; the fine-tuning process is: if two of the three nearest nodes have layer numbers greater than the current node, the layer number of the current node is increased by 1; if two nodes have layer numbers less than the current node, the layer number of the current node is reduced by 1; otherwise, no change is made.
4. According to the energy-saving routing method for wireless sensor networks based on hybrid evolutionary algorithm according to claim 1, It is characterized in that The specific process of step 4 is as follows: Step 4.1: When the data packet arrives at the cluster head, use the round-robin method to Select the next layer of reachable cluster head; specifically: when the data packet fails to send, retry twice. If it still fails to send successfully, the selected cluster head node is removed from If the next reachable cluster head set of the cluster head node is empty, the node will no longer serve as the cluster head, and other nodes in the cluster will be randomly selected as the cluster head. The new cluster head will re-establish and If the two sets are not empty, the node successfully serves as the cluster head, otherwise it continues to select other cluster heads; Step 4.2: Monitor the global sensor nodes. When it is detected that more than 5% of the global nodes are not working, the network will be globally re-clustered according to the hybrid evolutionary algorithm to ensure that as many areas as possible in the network can still work until the end of the network life cycle.
