Sensor network routing protocol method and system based on node non-uniform clustering

Abstract

The invention discloses a sensor network routing protocol method and system based on node non-uniform clustering, and the method comprises the steps: calculating the competition range of cluster head nodes according to a clustering principle, broadcasting the competition range to common nodes in the range of the cluster head nodes, and adding the common nodes to the nearest cluster head node through calculation; acquiring a first distance from a certain common node to a base station and a second distance from a cluster head node corresponding to the certain common node to the base station, and judging whether the first distance is greater than the second distance; and if the first distance is greater than the second distance, respectively calculating the energy consumption of a first path for directly transmitting the data to the base station and the energy consumption of a second path for forwarding the data to the base station through the cluster head node, and selecting a target path to transmit the data. The communication traffic can be reduced, and the data transmission efficiency is improved.

Description

Technical Field

[0001] The present invention belongs to the technical field of routing protocol design, and in particular relates to a sensor network routing protocol method and system based on non-uniform node clustering. Background Art

[0002] Wireless sensor networks are composed of a large number of cheap micro sensor nodes randomly distributed in the monitoring area. These nodes are interconnected through wireless communication to form a multi-hop, self-organizing network system. These nodes can collect various useful data such as temperature, humidity, sound, and images in the environment. After data fusion, they are transmitted to the aggregation node for user research and analysis. WSN has the characteristics of low price, rapid deployment, and large scale, and has broad application prospects in environmental detection, smart home, military defense and other fields. However, it faces some challenges, such as the energy of sensor nodes is usually provided by batteries, so the energy is limited. The computing and storage capabilities of sensor nodes are relatively weak, which limits their processing capabilities in complex tasks. The network may change its topology due to energy exhaustion, failure or movement of nodes. To this end, the present invention proposes a sensor network routing protocol based on non-uniform node clustering, which can reduce the amount of communication in the network, balance energy consumption, and thus extend the life cycle of the network.

[0003] The existing LEACH protocol is a classic clustering routing protocol, which has some obvious defects. In particular, the selection of cluster heads adopts random selection of cluster head nodes, which may cause some nodes to be frequently selected as cluster heads, so that their energy is quickly exhausted, resulting in uneven energy distribution in the network; the random selection of cluster heads may cause uneven distribution of cluster head positions in the network; the cluster head nodes communicate directly with the base station. If the distance between the cluster head and the base station is too far, the cluster head will consume a lot of energy during data transmission. Summary of the invention

[0004] Based on the problems under the above background technology, in order to achieve the purpose of balancing the energy consumption of the entire network and extending the life cycle of the network, the present invention provides a sensor network routing protocol method and system based on node non-uniform clustering.

[0005] In a first aspect, the present invention provides a sensor network routing protocol method based on non-uniform node clustering, comprising:

[0006] Deploy each sensor node in the detection area and broadcast to each sensor node so that each sensor node can obtain its own neighbor node information;

[0007] The cluster head node is elected based on the distance factor between the sensor node and the base station and the energy factor of the sensor node;

[0008] The competition range of the cluster head node is calculated according to the clustering principle and broadcasted to the common nodes within the range of the cluster head node. The common nodes join the nearest cluster head node through calculation.

[0009] Obtaining a first distance from a common node to a base station, and a second distance from a cluster head node corresponding to the common node to the base station, and determining whether the first distance is greater than the second distance;

[0010] If the first distance is greater than the second distance, the energy consumption of the first path for directly transmitting data to the base station and the energy consumption of the second path for forwarding data to the base station through the cluster head node are calculated respectively, and the target path is selected for data transmission, and the target path is the path with the lowest energy consumption between the first path and the second path.

[0011] In a second aspect, the present invention provides a sensor network routing protocol system based on non-uniform node clustering, comprising:

[0012] The acquisition module is configured to deploy each sensor node in the detection area and broadcast to each sensor node so that each sensor node can obtain its own neighbor node information;

[0013] The election module is configured to elect a cluster head node according to a distance factor between the sensor node and the base station and an energy factor of the sensor node;

[0014] The calculation module is configured to calculate the contention range of the cluster head node according to the clustering principle and broadcast it to the common nodes within the range of the cluster head node. The common nodes join the cluster head node closest to them through calculation.

[0015] A judgment module is configured to obtain a first distance from a common node to a base station, and a second distance from a cluster head node corresponding to the common node to the base station, and judge whether the first distance is greater than the second distance;

[0016] The selection module is configured to calculate the energy consumption of a first path for directly transmitting data to the base station and the energy consumption of a second path for forwarding data to the base station through a cluster head node if the first distance is greater than the second distance, and select a target path for transmitting data, wherein the target path is the path with the lowest energy consumption between the first path and the second path.

[0017] According to a third aspect, an electronic device is provided, comprising: at least one processor, and a memory communicatively connected to the at least one processor, wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can perform the steps of the sensor network routing protocol method based on non-uniform node clustering according to any embodiment of the present invention.

[0018] In a fourth aspect, the present invention further provides a computer-readable storage medium having a computer program stored thereon, wherein when the program instructions are executed by a processor, the processor executes the steps of the sensor network routing protocol method based on non-uniform node clustering according to any embodiment of the present invention.

[0019] The sensor network routing protocol method and system based on non-uniform node clustering of the present application have the following beneficial effects:

[0020] Compared with the traditional LEACH and LEACH-C protocols, it has shown significant advantages and improvements in many aspects, which are specifically reflected in the following aspects:

[0021] 1. Balance energy consumption and extend network life;

[0022] 2. Reduce communication volume and improve data transmission efficiency;

[0023] 3. Provide network stability and reliability. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0025] Figure 1 A flow chart of a sensor network routing protocol method based on non-uniform node clustering provided by an embodiment of the present invention;

[0026] Figure 2 A node deployment diagram provided for an embodiment of the present invention;

[0027] Figure 3 A clustering flow chart provided for an embodiment of the present invention;

[0028] Figure 4 A schematic diagram of the number of surviving nodes provided by an embodiment of the present invention;

[0029] Figure 5 A schematic diagram of network residual energy provided by an embodiment of the present invention;

[0030] Figure 6 A structural block diagram of a sensor network routing protocol system based on non-uniform node clustering provided by an embodiment of the present invention;

[0031] Figure 7 It is a schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0032] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0033] See also Figure 1 , which shows a flow chart of a sensor network routing protocol method based on non-uniform node clustering of the present application.

[0034] like Figure 1 As shown, the sensor network routing protocol method based on non-uniform node clustering specifically includes the following steps:

[0035] Step S101: deploy each sensor node in a detection area, and broadcast to each sensor node so that each sensor node can obtain its own neighbor node information.

[0036] In this step, the neighbor node information includes the ID information of the neighbor node, the energy information of the neighbor node, and the coordinate information of the neighbor node.

[0037] Step S102: electing a cluster head node according to the distance factor between the sensor node and the base station and the energy factor of the sensor node.

[0038] In this step, the energy factor of the sensor node is calculated, and the expression is:

[0039]

[0040] Where Node_E(i) is the energy factor of sensor node i, E(i) is the energy contained in sensor node i, Rate(i) is the energy consumption rate factor, Estimation_Time is the estimated time of energy consumption in the future, and E avg (N i ) is the average energy of the partition where the sensor node i is located;

[0041] Calculate the distance factor between the sensor node and the base station. The expression is:

[0042]

[0043] Where Node_D(i) is the distance factor between sensor node i and the base station, D maxis the maximum distance between all sensor nodes and the base station, D(i) is the distance between the sensor node and the base station, D(i) is, min is the minimum distance from all sensor nodes to the base station;

[0044] The cluster head node election is based on the weighted value of the energy factor and the distance factor. The expression is:

[0045] v(i)=α·e β·Node_E(i) +(1-α)·e -γ·Node_D(i) ,

[0046] Where v(i) is the election value of the sensor node, α, β, and γ are parameters used to adjust the influence weight and nonlinearity of the energy factor and distance factor in the weight calculation, and e is the natural base.

[0047] The v values ​​calculated by each sensor node are compared, and the top 10%-15% of sensor nodes are selected as cluster head nodes.

[0048] Step S103, the contention range of the cluster head node is calculated according to the clustering principle, and broadcasted to the common nodes within the range of the cluster head node. The common nodes join the cluster head node closest to them through calculation.

[0049] In this step, the expression for calculating the contention range of the cluster head node is:

[0050]

[0051] In the formula, R comp( i ) is the competition radius of node i, c is the competition radius between 0 and 1之 The constant between It is the pre-set maximum competition radius.

[0052] It can be seen that the closer to the base station, the more cluster head nodes there are, the smaller the competition radius, and the less energy consumed in the cluster, which is beneficial to saving energy for subsequent inter-cluster forwarding, balancing the energy consumption of the entire network, and extending the life of the network. The cluster head node broadcasts the I_AM_HEAD message to the surrounding nodes, and the ordinary nodes join the cluster head node closest to them through calculation.

[0053] Step S104: acquiring a first distance from a common node to the base station and a second distance from a cluster head node corresponding to the common node to the base station, and determining whether the first distance is greater than the second distance.

[0054] In a specific embodiment, after determining whether the first distance is greater than the second distance, if the first distance is not greater than the second distance, directly selecting a first path for directly transmitting data to the base station.

[0055] Step S105, if the first distance is greater than the second distance, the energy consumption of the first path for directly transmitting data to the base station and the energy consumption of the second path for forwarding data to the base station through the cluster head node are calculated respectively, and a target path is selected for data transmission, and the target path is the path with the lowest energy consumption between the first path and the second path.

[0056] In this step, during the data transmission phase, ordinary nodes obtain a transmission path with less energy loss when transmitting data through pre-calculations, mainly by calculating the distance between themselves and the base station and comparing it with the distance from the cluster head to the base station. If it is greater, the energy consumption of directly transmitting data to the base station and the energy consumption of forwarding to the base station through the cluster head are calculated respectively, and the path with less energy consumption is selected to transmit data. Ordinary nodes that have not transmitted data to the cluster head node can choose other cluster heads to join, and the energy consumption after joining needs to be less than the energy consumption of the ordinary node directly transmitting to the base station. The same wireless communication energy consumption model in the LEACH protocol is used here, and the energy consumption of ordinary nodes sending data is:

[0057]

[0058] In the formula, E elec is the radio frequency energy consumption, k is the number of binary bits sent, d is the sending distance, and d o is the reference distance for the change in the effect of distance on energy consumption, E fs 、E mp are the energy consumption coefficients of the power amplifier circuit under different channel propagation models, E Tx (k, d) is the energy consumption of sending data by ordinary nodes.

[0059] It can be seen that at short distances, the energy consumption of transmission is related to the square of the distance, and at long distances, the energy consumption of transmission is related to the fourth power of the distance. Therefore, when the distance from an ordinary node to the base station is smaller than the distance from the cluster head to the base station, it is more energy-saving to transmit directly to the base station, and ordinary nodes choose a more energy-saving path to transmit data.

[0060] In summary, the method of the present application deploys each sensor node in the detection area, and then each node broadcasts so that each node can obtain its own neighbor node information; the weights of the two data, the distance between the node and the base station and the remaining energy of the node, are compared to select the cluster head node; according to the clustering principle, the cluster closer to the base station has a smaller competition range, and the cluster farther from the base station has a larger competition range. The competition range of the cluster head is calculated based on the formula of the distance from the base station, and then broadcast to the ordinary nodes within its range. The ordinary nodes join the cluster head node closest to themselves through calculation; in the data transmission stage, for ordinary nodes in a cluster, the distance between itself and the base station is compared with the distance from the cluster head to the base station. If it is less than, the data does not need to be transmitted to the cluster head node. If it is greater, the energy consumption of directly transmitting data to the base station and the energy consumption of forwarding to the base station through the cluster head are calculated respectively, and the path with less energy consumption is selected to transmit data. Ordinary nodes that have not transmitted data to the cluster head node can choose other cluster heads to join, and the energy consumption after joining must be less than the energy consumption of the ordinary node directly transmitting to the base station; the cluster head node uses data fusion to compress the data of ordinary nodes and then forward it between clusters or send it directly to the base station; using inter-cluster forwarding can avoid cluster heads that are far away from the base station directly transmitting data to the base station, thereby wasting a lot of energy.

[0061] In the specific implementation process, a sensor network routing protocol method based on non-uniform node clustering is established through the following steps:

[0062] (1) Network model;

[0063] like Figure 2 As shown in the figure, assume that nodes are deployed in a 200m×200m detection area. Nodes are randomly deployed in the detection area. A total of 300 nodes are deployed in the entire area. The base station is deployed at the position (200,220). The entire network periodically transmits data and reselects cluster heads every 1 hour. Assume that the network has the following properties:

[0064] (2) The node has a unique ID;

[0065] All nodes are fixed and have limited energy, while base stations are fixed in position and have unlimited energy.

[0066] All nodes have similar data processing capabilities and have the potential to serve as cluster head nodes.

[0067] Wireless communication energy consumption model

[0068] Use the same wireless communication energy consumption model as in the LEACH protocol;

[0069] Energy consumption of node receiving data E Rx (k) is:

[0070] E Rx (k) = E elec ×k;

[0071] (2) Cluster formation;

[0072] like Figure 3 As shown, the sensor nodes are first placed in the detection area, and then each node broadcasts so that each node can get its neighbor node information. The node information includes node ID, node energy, and node coordinates.

[0073] Each node performs weighted calculation based on its distance from the base station and its remaining energy, and selects the one with the larger value as the cluster head node. Since different factors (distance, energy) have different dimensions and value ranges, directly weighting the two factors may cause one factor to dominate, so each factor is converted into a corresponding factor formula and normalized so that each factor has the same weight influence in the weight calculation, which more reasonably reflects the comprehensive performance of the node.

[0074] like Figure 4 As shown in Figure 1, the node survival curves of the three protocols under the same network load. Compared with LEACH and LEACH-C, the first node death round of the present invention is later than that of LEACH and LEACH-C protocols, and is also better than LEACH-C protocol overall; Figure 5 It is shown that the protocol of the present invention exhibits a lower energy consumption rate under the same network load.

[0075] See also Figure 6 , which shows a structural block diagram of a sensor network routing protocol system based on non-uniform node clustering of the present application.

[0076] like Figure 6 As shown, the sensor network routing protocol system 200 includes an acquisition module 210 , a campaign module 220 , a calculation module 230 , a judgment module 240 and a selection module 250 .

[0077] Among them, the acquisition module 210 is configured to deploy each sensor node in the detection area and broadcast to each sensor node so that each sensor node can obtain its own neighbor node information; the election module 220 is configured to elect the cluster head node according to the distance factor between the sensor node and the base station and the energy factor of the sensor node; the calculation module 230 is configured to calculate the competition range of the cluster head node according to the clustering principle, and broadcast it to the ordinary nodes within the cluster head node range, and the ordinary nodes join the cluster head node with the nearest distance through calculation; the judgment module 240 is configured to obtain a first distance from a certain ordinary node to the base station, and a second distance from the cluster head node corresponding to the certain ordinary node to the base station, and judge whether the first distance is greater than the second distance; the selection module 250 is configured to, if the first distance is greater than the second distance, respectively calculate the energy consumption of the first path for directly transmitting data to the base station and the energy consumption of the second path for forwarding to the base station through the cluster head node, and select the target path for transmitting data, and the target path is the path with the smallest energy consumption among the first path and the second path.

[0078] It should be understood that Figure 6 Modules and references documented in Figure 1 Therefore, the operations and features described above for the method and the corresponding technical effects are also applicable to Figure 6 The modules in it will not be described in detail here.

[0079] In some other embodiments, the embodiments of the present invention further provide a computer-readable storage medium having a computer program stored thereon, wherein when the program instructions are executed by a processor, the processor executes the sensor network routing protocol method based on non-uniform node clustering in any of the above method embodiments;

[0080] As an implementation mode, the computer-readable storage medium of the present invention stores computer-executable instructions, and the computer-executable instructions are configured as follows:

[0081] Deploy each sensor node in the detection area and broadcast to each sensor node so that each sensor node can obtain its own neighbor node information;

[0082] The cluster head node is elected based on the distance factor between the sensor node and the base station and the energy factor of the sensor node;

[0083] The competition range of the cluster head node is calculated according to the clustering principle and broadcasted to the common nodes within the range of the cluster head node. The common nodes join the nearest cluster head node through calculation.

[0084] Obtaining a first distance from a common node to a base station, and a second distance from a cluster head node corresponding to the common node to the base station, and determining whether the first distance is greater than the second distance;

[0085] If the first distance is greater than the second distance, the energy consumption of the first path for directly transmitting data to the base station and the energy consumption of the second path for forwarding data to the base station through the cluster head node are calculated respectively, and the target path is selected for data transmission, and the target path is the path with the lowest energy consumption between the first path and the second path.

[0086] The computer-readable storage medium may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created based on the use of a sensor network routing protocol system based on non-uniform node clustering, etc. In addition, the computer-readable storage medium may include a high-speed random access memory, and may also include a memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some embodiments, the computer-readable storage medium may optionally include a memory remotely arranged relative to the processor, and these remote memories may be connected to the sensor network routing protocol system based on non-uniform node clustering via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0087] Figure 7 is a schematic diagram of the structure of an electronic device provided by an embodiment of the present invention, such as Figure 7 As shown, the device includes: a processor 310 and a memory 320. The electronic device may also include: an input device 330 and an output device 340. The processor 310, the memory 320, the input device 330 and the output device 340 may be connected via a bus or other means. Figure 7 In the example, the bus connection is used. The memory 320 is the above-mentioned computer-readable storage medium. The processor 310 executes various functional applications and data processing of the server by running the non-volatile software programs, instructions and modules stored in the memory 320, that is, the sensor network routing protocol method based on non-uniform node clustering of the above-mentioned method embodiment is realized. The input device 330 can receive input digital or character information, and generate key signal input related to user settings and function control of the sensor network routing protocol system based on non-uniform node clustering. The output device 340 may include display devices such as display screens.

[0088] The electronic device can execute the method provided by the embodiment of the present invention, and has the functional modules and beneficial effects corresponding to the execution method. For technical details not described in detail in this embodiment, please refer to the method provided by the embodiment of the present invention.

[0089] As an implementation mode, the electronic device is applied to a sensor network routing protocol system based on non-uniform node clustering, and is used for a client, and includes: at least one processor; and a memory connected to the at least one processor in communication; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can:

[0090] Deploy each sensor node in the detection area and broadcast to each sensor node so that each sensor node can obtain its own neighbor node information;

[0091] The cluster head node is elected based on the distance factor between the sensor node and the base station and the energy factor of the sensor node;

[0092] The competition range of the cluster head node is calculated according to the clustering principle and broadcasted to the common nodes within the range of the cluster head node. The common nodes join the nearest cluster head node through calculation.

[0093] Obtaining a first distance from a common node to a base station, and a second distance from a cluster head node corresponding to the common node to the base station, and determining whether the first distance is greater than the second distance;

[0094] If the first distance is greater than the second distance, the energy consumption of the first path for directly transmitting data to the base station and the energy consumption of the second path for forwarding data to the base station through the cluster head node are calculated respectively, and the target path is selected for data transmission, and the target path is the path with the lowest energy consumption between the first path and the second path.

[0095] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods of each embodiment or some parts of the embodiment.

[0096] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A sensor network routing protocol method based on non-uniform node clustering, characterized in that: include: Deploy each sensor node in the detection area and broadcast to each sensor node so that each sensor node can obtain its own neighbor node information; The cluster head node is elected based on the distance factor between the sensor node and the base station and the energy factor of the sensor node; The competition range of the cluster head node is calculated according to the clustering principle and broadcasted to the common nodes within the range of the cluster head node. The common nodes join the nearest cluster head node through calculation. Obtaining a first distance from a common node to a base station, and a second distance from a cluster head node corresponding to the common node to the base station, and determining whether the first distance is greater than the second distance; If the first distance is greater than the second distance, the energy consumption of the first path for directly transmitting data to the base station and the energy consumption of the second path for forwarding data to the base station through the cluster head node are calculated respectively, and the target path is selected for data transmission. The target path is the path with the lowest energy consumption between the first path and the second path.

2. A sensor network routing protocol method based on non-uniform node clustering according to claim 1, characterized in that: The neighbor node information includes the ID information of the neighbor node, the energy information of the neighbor node, and the coordinate information of the neighbor node.

3. A sensor network routing protocol method based on non-uniform node clustering according to claim 1, characterized in that: The election of cluster head nodes according to the distance factor between the sensor node and the base station and the energy factor of the sensor node comprises: Calculate the energy factor of the sensor node, the expression is: Where Node_E(i) is the energy factor of sensor node i, E(i) is the energy contained in sensor node i, Rate(i) is the energy consumption rate factor, Estimation_Time is the estimated time of energy consumption in the future, and E avg (N i ) is the average energy of the partition where the sensor node i is located; Calculate the distance factor between the sensor node and the base station. The expression is: Where Node_D(i) is the distance factor between sensor node i and the base station, D max is the maximum distance between all sensor nodes and the base station, D(i) is the distance between the sensor node and the base station, D(i) is, min is the minimum distance from all sensor nodes to the base station; The cluster head node election is based on the weighted value of the energy factor and the distance factor. The expression is: v(i)=α·e β·Node_E(i) +(1-a)·e -γ·Node_D(i) , Where v(i) is the election value of the sensor node, α, β, and γ are parameters used to adjust the influence weight and nonlinearity of the energy factor and distance factor in the weight calculation, and e is the natural base.

4. A sensor network routing protocol method based on non-uniform node clustering according to claim 1, characterized in that: in, The expression for calculating the contention range of the cluster head node is: In the formula, R comp (i) is the competitive radius of node i, c is a constant between 0 and 1, It is the pre-set maximum competition radius.

5. The sensor network routing protocol method based on non-uniform node clustering according to claim 1, characterized in that: The energy consumption of sending data by the common node is expressed as: In the formula, E elec is the radio frequency energy consumption, k is the number of binary bits sent, d is the sending distance, and d o is the reference distance for the change in the effect of distance on energy consumption, E fs 、E mp are the energy consumption coefficients of the power amplifier circuit under different channel propagation models, E Tx (k, d) is the energy consumption of sending data by ordinary nodes.

6. A sensor network routing protocol method based on non-uniform node clustering according to claim 1, characterized in that: After determining whether the first distance is greater than the second distance, the method further includes: If the first distance is not greater than the second distance, a first path for directly transmitting data to a base station is directly selected.

7. A sensor network routing protocol system based on non-uniform node clustering, characterized in that: include: The acquisition module is configured to deploy each sensor node in the detection area and broadcast to each sensor node so that each sensor node can obtain its own neighbor node information; The election module is configured to elect a cluster head node according to a distance factor between the sensor node and the base station and an energy factor of the sensor node; The calculation module is configured to calculate the contention range of the cluster head node according to the clustering principle and broadcast it to the common nodes within the range of the cluster head node. The common nodes join the cluster head node closest to them through calculation. A judgment module is configured to obtain a first distance from a common node to a base station, and a second distance from a cluster head node corresponding to the common node to the base station, and judge whether the first distance is greater than the second distance; The selection module is configured to calculate the energy consumption of a first path for directly transmitting data to the base station and the energy consumption of a second path for forwarding data to the base station through a cluster head node if the first distance is greater than the second distance, and select a target path for transmitting data, wherein the target path is the path with the lowest energy consumption between the first path and the second path.

8. An electronic device, characterized in that: include: At least one processor, and a memory communicatively connected to the at least one processor, wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method described in any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images