Cluster head election method and device and electronic equipment

Abstract

The invention provides a cluster head election method and device and electronic equipment, and the method comprises the steps: obtaining a node set of cluster head nodes which are not selected before the cluster head election from a self-organizing network, and determining a comprehensive state evaluation value of each node in the node set, and determining a target cluster head election threshold value of the node in the current round of cluster head election according to the comprehensive state evaluation value of the node, and screening the node of which the random number is smaller than the target cluster head election threshold value from the node set based on the random number generated by each node in the node set as a target cluster head node of the current round of cluster head election. Therefore, in the cluster head election process, the comprehensive state evaluation value of the node is determined in combination with the current residual energy of the node and the total data volume of the data packets sent by other nodes received by the node, and cluster head election is performed based on the comprehensive state evaluation value of the node, so that the node in a poor state can be prevented from being selected as the cluster head node; therefore, the network operates stably and the survival time of the network is prolonged.

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and in particular to a cluster head election method, device and electronic equipment. Background Art

[0002] At present, cluster head election is usually performed for self-organizing networks based on the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. When LEACH performs cluster head election, it adopts a periodic round-by-round random election method, with the aim of making each node in the self-organizing network take on the cluster head forwarding task, balancing the energy consumption of nodes in the network, and extending the network survival time. However, in the process of performing a round of cluster head election for the self-organizing network based on LEACH, since the states corresponding to the nodes in the self-organizing network are different, if a node with a bad state in the corresponding set of nodes to be selected in this round is selected as the cluster head node, the network cannot operate stably, affecting the survival time of the network. Summary of the invention

[0003] The disclosed embodiments propose a cluster head election method, device and electronic device, which can at least solve the problem in the related art that a node in a bad state is selected as a cluster head node, the network cannot run stably, and the survival of the network is affected.

[0004] According to a first aspect of an embodiment of the present disclosure, a cluster head election method is proposed, the method comprising: when performing a current round of cluster head election for a self-organizing network to be processed, obtaining a node set that has not been elected as a cluster head node before the current round of cluster head election from the self-organizing network; for any node in the node set, determining a comprehensive state evaluation value of the node according to the current remaining energy of the node and the total amount of data packets sent by other nodes received by the node, wherein the other nodes are nodes in the node set other than the node; determining a target cluster head election threshold of the node in the current round of cluster head election according to the comprehensive state evaluation value of the node; and based on the random numbers generated by each node in the node set for the current round of cluster head election, screening out nodes whose random numbers are less than the target cluster head election threshold from the node set as target cluster head nodes for the current round of cluster head election.

[0005] According to a second aspect of an embodiment of the present disclosure, a cluster head election device is proposed, the device comprising: an acquisition module, for acquiring, when performing a current round of cluster head election for a self-organizing network to be processed, a set of nodes that have not been elected as cluster head nodes before the current round of cluster head election from the self-organizing network; a first determination module, for determining, for any node in the node set, a comprehensive state evaluation value of the node according to the current remaining energy of the node and the total amount of data packets received by the node from other nodes, wherein the other nodes are nodes in the node set other than the node; a second determination module, for determining, according to the comprehensive state evaluation value of the node, a target cluster head election threshold of the node in the current round of cluster head election; a cluster head election module, for screening out, from the node set, nodes whose random numbers are less than the target cluster head election threshold as target cluster head nodes for the current round of cluster head election, based on the random numbers generated by each node in the node set for the current round of cluster head election.

[0006] According to a third aspect of an embodiment of the present disclosure, a storage medium is proposed, which stores instructions, characterized in that when the instructions are executed on an electronic device, the electronic device executes the cluster head election method disclosed in the first aspect of the embodiment of the present disclosure.

[0007] According to the fourth aspect of the embodiments of the present disclosure, an electronic device is proposed, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the cluster head election method disclosed in the first aspect of the embodiments of the present disclosure is implemented.

[0008] According to a fifth aspect of the embodiments of the present disclosure, a program product is proposed. When the program product is executed by an electronic device, the electronic device executes the cluster head election method disclosed in the first aspect.

[0009] The scheme proposed in the embodiment of the disclosure is that when the current round of cluster head election is performed for the self-organizing network to be processed, a node set that has not been elected as a cluster head node before the current round of cluster head election is obtained from the self-organizing network; for any node in the node set, the comprehensive state evaluation value of the node is determined according to the current remaining energy of the node and the total amount of data packets sent by other nodes received by the node, wherein the other nodes are nodes other than the node in the node set; according to the comprehensive state evaluation value of the node, the target cluster head election threshold of the node in the current round of cluster head election is determined; based on the random numbers generated by each node in the node set for the current round of cluster head election, the node whose random number is less than the target cluster head election threshold is selected from the node set as the target cluster head node of the current round of cluster head election. Thus, in the process of cluster head election, the comprehensive state evaluation value of the node is determined in combination with the current remaining energy of the node and the total amount of data packets sent by other nodes received by the node, and cluster head election is performed based on the comprehensive state evaluation value of the node, which can avoid nodes with bad status from being selected as cluster head nodes, so that the network can run stably and extend the survival time of the network.

[0010] Additional aspects and advantages of the present disclosure will be given in part in the following description and in part will be obvious from the following description or learned through practice of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The above and / or additional aspects and advantages of the present disclosure will become apparent and easily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which:

[0012] Figure 1 A schematic diagram of a flow chart of a cluster head election method provided by an embodiment of the present disclosure;

[0013] Figure 2 A flowchart of another cluster head election method provided by an embodiment of the present disclosure;

[0014] Figure 3 A flowchart of another cluster head election method provided by an embodiment of the present disclosure;

[0015] Figure 4 A flowchart of another cluster head election method provided by an embodiment of the present disclosure;

[0016] Figure 5 This is an example diagram of a communication relationship diagram;

[0017] Figure 6 A schematic diagram of the structure of a cluster head election device provided by an embodiment of the present disclosure;

[0018] Figure 7 It is a block diagram of an electronic device according to an exemplary embodiment. DETAILED DESCRIPTION

[0019] Embodiments of the present disclosure are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present disclosure, and should not be construed as limiting the present disclosure.

[0020] The cluster head election method, device and electronic device according to the embodiments of the present disclosure are described below with reference to the accompanying drawings.

[0021] Figure 1 A schematic diagram of a flow chart of a cluster head election method provided in an embodiment of the present disclosure.

[0022] like Figure 1 As shown, the cluster head election method may include the following steps:

[0023] Step 101 : when performing a cluster head election for a self-organizing network to be processed, a node set that has not been elected as a cluster head node before the cluster head election is obtained from the self-organizing network.

[0024] Among them, it can be understood that the self-organizing network is a network composed of multiple nodes. Each node in the self-organizing network has an equal status in each networking behavior. Each node is not only a terminal for processing data, but also can serve as a relay router for other nodes to communicate with each other. Each node can communicate with each other through a multi-hop wireless connection link.

[0025] It should be noted that the cluster head election method is executed by a cluster head election device. The cluster head election device may be an electronic device, or may be configured in an electronic device, which is not limited in the present disclosure. The present disclosure embodiment is described by taking the cluster head election device as an electronic device as an example.

[0026] Step 102, for any node in the node set, determine the comprehensive state evaluation value of the node according to the current remaining energy of the node and the total amount of data packets received by the node from other nodes, where other nodes are nodes in the node set except the node.

[0027] In one embodiment of the present disclosure, for any node in a node set, the current remaining energy of the node can be obtained, and the total data volume of the data packets received from other nodes can be obtained, and the state of the node can be evaluated based on the current remaining energy and the total data volume to obtain a comprehensive state evaluation value of the node.

[0028] The comprehensive status evaluation value is the value obtained by evaluating the status of the node based on the current remaining energy and the total data volume.

[0029] It is understandable that the cluster head node selected from the node set will consume a lot of its own energy because it undertakes the task of data forwarding, especially when it is powered by a battery, the energy may be exhausted. Therefore, in this embodiment, the current remaining energy of the node is used as one of the factors for evaluating the state.

[0030] Among them, it is understandable that since the cluster head node needs to collect data from each ordinary node and forward it to the gateway node after processing the data, for ordinary nodes, the inability to connect with the cluster head node will cause the risk of data loss; if such ordinary nodes reach a certain number, it will also cause a large packet loss rate in the self-organizing network. Therefore, the communication situation of a node with other nodes in the node set is also one of the evaluation factors for whether the node can serve as a cluster head node.

[0031] Among them, the total amount of data packets received by the node from other nodes can reflect the communication status of the node with other nodes in the node set. If the total amount of data is relatively large, it means that the communication between the node and other nodes in the node set is relatively good.

[0032] Among them, ordinary nodes refer to nodes in the node set that are not elected as cluster head nodes.

[0033] Step 103: Determine the target cluster head election threshold of the node in this round of cluster head election according to the comprehensive state evaluation value of the node.

[0034] It should be noted that, according to the comprehensive state evaluation value of the node, determining the target cluster head election threshold of the node in this round of cluster head election can be implemented in many ways, and the exemplary description is as follows;

[0035] As a possible implementation method, after obtaining the comprehensive state evaluation value of the node, the comprehensive state evaluation value can be input into a preset calculation function to obtain the target cluster head election threshold of the node in this round of cluster head election through the calculation function, wherein the preset calculation function is a function used to calculate the cluster head election threshold.

[0036] As another possible implementation method, the correspondence between the comprehensive state evaluation value corresponding to this round of cluster head election and the cluster head election threshold can be obtained, and based on the correspondence, the cluster head election threshold corresponding to the comprehensive state evaluation value of the node is obtained, and the obtained cluster head election threshold is used as the target cluster head election threshold of the node in this round of cluster head election.

[0037] It should be noted that step 103 may also be implemented in other ways. Other possible implementations of step 103 will be exemplarily described in subsequent embodiments.

[0038] Step 104 , based on the random numbers generated by each node in the node set for the current cluster head election, select nodes whose random numbers are less than the target cluster head election threshold from the node set as target cluster head nodes for the current cluster head election.

[0039] In some embodiments, the random number generated by each node in the node set for the current round of cluster head election may be obtained, wherein the random number generated by each node for the current round of cluster head election may range from 0 to 1. In other words, each node generates a random number [0, 1] for the current round of cluster head election.

[0040] Correspondingly, for any node in the node set, the random number generated by the node can be compared with the corresponding target cluster head election threshold. If the random number generated by the node is smaller than the corresponding target cluster head election threshold, it is determined that the node can be used as the target cluster head node in this round of cluster head election.

[0041] In summary, the cluster head election method provided by the embodiment of the present disclosure, when performing the current round of cluster head election for the self-organizing network to be processed, obtains a node set that has not been elected as a cluster head node before the current round of cluster head election from the self-organizing network; for any node in the node set, determines the comprehensive state evaluation value of the node according to the current remaining energy of the node and the total amount of data packets sent by other nodes received by the node, wherein the other nodes are nodes other than the node in the node set; determines the target cluster head election threshold of the node in the current round of cluster head election according to the comprehensive state evaluation value of the node; based on the random number generated by each node in the node set for the current round of cluster head election, selects the node whose random number is less than the target cluster head election threshold from the node set as the target cluster head node of the current round of cluster head election. Thus, in the process of cluster head election, the comprehensive state evaluation value of the node is determined in combination with the current remaining energy of the node and the total amount of data packets sent by other nodes received by the node, and cluster head election is performed based on the comprehensive state evaluation value of the node, which can avoid nodes with bad status from being selected as cluster head nodes, so that the network can run stably and extend the survival time of the network.

[0042] Combine the following Figure 2 , the process of determining the comprehensive state evaluation value of a node according to the current remaining energy of the node and the total amount of data packets received by the node from other nodes in the cluster head election method proposed in the embodiment of the present disclosure is described in detail.

[0043] Figure 2 A flowchart of another cluster head election method provided by an embodiment of the present disclosure.

[0044] like Figure 2 As shown, the cluster head election method may include the following steps:

[0045] Step 201 : when performing a cluster head election for the self-organizing network to be processed, a node set that has not been elected as a cluster head node before the cluster head election is obtained from the self-organizing network.

[0046] It should be noted that, for the specific implementation of step 201, reference may be made to the relevant description of the embodiment of the present disclosure, which will not be repeated here.

[0047] Step 202: for any node in the node set, determine the energy state value of the node according to the current remaining energy of the node.

[0048] It can be understood that determining the energy state value of a node according to the current remaining energy of the node can be implemented in many ways, and an exemplary description is as follows:

[0049] As an example, the current remaining energy of the node may be input into a calculation formula for calculating the energy state value, so as to obtain the energy state value of the node through the calculation formula.

[0050] Among them, it can be understood that the larger the current remaining energy is, the larger the corresponding energy state value is. On the other hand, the smaller the current remaining energy is, the smaller the corresponding energy state value is.

[0051] The energy state value refers to a value that can characterize the current remaining energy.

[0052] As another example, based on the correspondence between the preset energy and the energy state value, the energy state value corresponding to the current remaining energy may be obtained, and the obtained energy state value is the energy state value of the node.

[0053] As an example, the average residual energy corresponding to all nodes in the node set can be determined based on the current residual energy of each node in the node set, and the energy state value of the node can be determined based on the current residual energy and the average residual energy of the node. Thus, based on the current residual energy and the average residual energy, the energy state value of the node is accurately obtained.

[0054] The average residual energy is obtained by averaging the current residual energy corresponding to each node in the node set.

[0055] In some embodiments, the ratio between the current remaining energy of the node and the average remaining energy may be used as the energy state value of the node.

[0056] For example, the node is node i in the node set, where according to the current remaining energy E of node i c (i) and the average residual energy E ave , the formula for calculating the energy state value O(i) of the node i is:

[0057]

[0058] Step 203: Determine the data collection capability value of the node according to the total amount of data packets received by the node from other nodes.

[0059] Among them, other nodes are nodes in the node set except the node.

[0060] In some embodiments, the total amount of data received by a node from data packets sent by other nodes may be directly used as the data collection capability value of the node.

[0061] For example, the node set is S = {1, 2, ..., s}, and the size of heterogeneous data generated by each node is Q = {q1, q2, ..., q s}, where q i (i∈S) is the size of the data packet generated by node i. For node i (i∈S), set a i,j ={0,1} (where i≠j) represents the on / off state of node i and node j. If node i and node j can communicate, then a i,j =1, otherwise a i,j = 0. Therefore, the total amount of data that node i can receive from all other nodes j (i.e., the data collection capability value D(i)) is:

[0062] D(i)=∑ j∈S,i≠j a i,j ×q j (2)

[0063] Step 204: Determine the comprehensive state evaluation value of the node according to the energy state value and the data collection capability value.

[0064] In one embodiment of the present disclosure, in order to accurately determine the comprehensive state evaluation value of the node, the energy state value and the data collection capability value may be weighted and summed to obtain the comprehensive state evaluation value of the node.

[0065] In some embodiments, a first weight corresponding to the energy state value can be obtained, and a second weight corresponding to the data collection capability value can be obtained, and the energy state value is weighted by the first weight, and the data collection energy value is weighted by the second weight, and the weighted energy state value and data collection energy value are summed to obtain a comprehensive status evaluation value of the node.

[0066] For example, the node is node i in the node set. Correspondingly, the calculation formula for calculating the comprehensive state evaluation value Z(i) of the i-th node is:

[0067] Z(i)=ω oO(i)+ω d D(i) (3)

[0068] Among them, O(i) represents the energy state value corresponding to node i; ω o represents the first weight corresponding to the energy state value, D(i) represents the data collection energy value corresponding to node i; ω d Indicates the second weight corresponding to the data collection energy value.

[0069] where, in this example, ω o ,ω d ∈(0,1), and ω o +ω d =1.

[0070] Step 205: Determine the target cluster head election threshold of the node in this round of cluster head election according to the comprehensive state evaluation value of the node.

[0071] It should be noted that, for the specific implementation of step 205, reference may be made to the relevant description in the embodiments of the present disclosure, which will not be repeated here.

[0072] Step 206 , based on the random numbers generated by each node in the node set for the current cluster head election, select nodes whose random numbers are less than the target cluster head election threshold from the node set as target cluster head nodes for the current cluster head election.

[0073] It should be noted that, for the specific implementation of step 206, reference may be made to the relevant description in the embodiments of the present disclosure, which will not be repeated here.

[0074] In summary, the cluster head election method provided by the embodiment of the present disclosure obtains a node set that has not been elected as a cluster head node before the current round of cluster head election from the self-organizing network, and for any node in the node set, determines the energy state value of the node according to the current remaining energy of the node, determines the data collection capability value of the node according to the total amount of data packets sent by other nodes received by the node, and determines the comprehensive state evaluation value of the node according to the energy state value and the data collection capability value, and determines the target cluster head election threshold corresponding to the node in the current round of cluster head election based on the comprehensive state evaluation value of the node, and performs cluster head election on the node set based on the target cluster head election threshold corresponding to each node. Thus, the comprehensive state evaluation value of the node is accurately determined in combination with the current remaining energy of the node and the total amount of data packets sent by other nodes, which facilitates the subsequent accurate cluster head election of the node set based on the determined comprehensive state evaluation value.

[0075] Combine the following Figure 3, the process of determining the target cluster head election threshold of a node in this round of cluster head election according to the comprehensive state evaluation value of the node in the cluster head election method proposed in the embodiment of the present disclosure is described in detail.

[0076] Figure 3 A flowchart of another cluster head election method provided by an embodiment of the present disclosure.

[0077] like Figure 3 As shown, the cluster head election method may include the following steps:

[0078] Step 301 : when performing a cluster head election for the self-organizing network to be processed, a node set that has not been elected as a cluster head node before the cluster head election is obtained from the self-organizing network.

[0079] Step 302, for any node in the node set, determine the comprehensive state evaluation value of the node according to the current remaining energy of the node and the total amount of data packets received by the node from other nodes, where other nodes are nodes in the node set except the node.

[0080] It should be noted that, for the specific implementation of step 301 and step 302, reference may be made to the relevant description of the embodiment of the present disclosure, which will not be repeated here.

[0081] Step 303: determine the probability of the node being elected as the cluster head node in this round of cluster head election.

[0082] In some examples, the probability of the node being elected as the cluster head node in the current round of cluster head election may be determined according to the total number of nodes in the node set.

[0083] For example, the total number of nodes in the node set is 40, and correspondingly, the probability of the node being elected as the cluster head node in this round of cluster head election is 1 / 40.

[0084] In some other examples, the probability of the node being elected as the cluster head node in the current round of cluster head election may also be determined in combination with the current residual energy of the node.

[0085] Step 304 , determining the initial cluster head election threshold of the node in the current round of cluster head election according to the election probability and the first round number of the current round of cluster head election.

[0086] In one embodiment, based on the election probability and the first round number of cluster head election in this round, the initial cluster head election threshold of the node in this round of cluster head election can be obtained by using the cluster head election threshold calculation method in LEACH.

[0087] Among them, it is used to calculate the initial cluster head election threshold A corresponding to node i in this round of cluster head election i The calculation formula is:

[0088]

[0089] Among them, p in the formula represents the probability of being elected, r represents the first round number of the cluster head election in this round, and mod represents the modulo function; rmod(1 / p) represents the number of nodes that have been elected as cluster head nodes in the corresponding round cycle.

[0090] Step 305: adjusting the initial cluster head election threshold according to the comprehensive state evaluation value of the node to obtain the target cluster head election threshold of the node in this round of cluster head election.

[0091] In one embodiment of the present disclosure, a possible implementation method for adjusting the initial cluster head election threshold according to the comprehensive state evaluation value of the node to obtain the target cluster head election threshold of the node in this round of cluster head election is: determining an adjustment coefficient for adjusting the initial cluster head election threshold according to the comprehensive state evaluation value of the node, the probability of being elected and the second round number of the previous round of cluster head election of this round of cluster head election; adjusting the initial cluster head election threshold according to the adjustment coefficient to obtain the target cluster head election threshold.

[0092] In some examples, when the node is node i in the node set, the calculation formula corresponding to the adjustment coefficient b is:

[0093]

[0094] Among them, Z(i) in this formula represents the comprehensive status evaluation value corresponding to node i, r s It indicates the number of rounds that the node i has not been elected as the cluster head node, p indicates the probability of being elected, and div indicates the integer divisibility function.

[0095] In some embodiments, the initial cluster head election threshold and the adjustment coefficient may be multiplied to obtain the target cluster head election threshold.

[0096] Based on the above description, it can be seen that, in one embodiment, the calculation formula for calculating the target cluster head election threshold of node i is:

[0097]

[0098] Wherein, G represents the node set obtained from the self-organizing network.

[0099] Among them, based on formula 3 and formula 6, it can be seen that when the residual energy of node i is higher and the amount of data that can be collected is more, its corresponding comprehensive state evaluation value Z(i) will also increase accordingly, so it will have a higher probability of being elected as the cluster head node in this round of cluster head election. Correspondingly, as the number of rounds in which node i itself is not elected continuously increases, its corresponding cluster head election threshold T(i) will increase, and the probability of node i being elected as the cluster head node will be higher.

[0100] Step 306 , based on the random numbers generated by each node in the node set for the current cluster head election, select nodes whose random numbers are less than the target cluster head election threshold from the node set as target cluster head nodes for the current cluster head election.

[0101] It should be noted that, for the specific implementation of step 306, reference may be made to the relevant description of the embodiment of the present disclosure, which will not be repeated here.

[0102] In summary, in this embodiment, the probability of a node being elected as a cluster head node in this round of cluster head election is determined, and the initial cluster head election threshold of the node in this round of cluster head election is determined according to the probability of being elected and the first round number of this round of cluster head election, and the initial cluster head election threshold is adjusted according to the comprehensive state evaluation value of the node to obtain the target cluster head election threshold of the node in this round of cluster head election. Thus, the initial cluster head election threshold is adjusted according to the comprehensive state evaluation value of the node, so as to accurately obtain the target cluster head election threshold of the node in this round of cluster head election.

[0103] Among them, it is understandable that the gateway node undertakes the data forwarding task of the entire self-organizing network, which also means that the gateway node will consume a lot of its own energy after a round of networking and data forwarding tasks. If the gateway node and cluster head node selected in each round of cluster head election are the same, if the number of election rounds is large enough, the probability of the corresponding node becoming a "dead node" with exhausted energy too early is also much higher than that of ordinary nodes, which will greatly restrict the stability and effective operation life of the entire self-organizing network.

[0104] In view of this, in each new round of cluster head election, the nodes that have been previously elected as gateway nodes or cluster head nodes will no longer serve as gateway nodes or cluster head nodes, so as to avoid the situation that some nodes become "dead nodes" prematurely due to excessive energy consumption. Therefore, based on any of the above embodiments, before determining the comprehensive state evaluation value of the node according to the current remaining energy of the node and the total amount of data packets sent by the node to other nodes, the nodes that have been elected as gateway nodes before the current round of cluster head election can also be deleted from the node set. Thus, the nodes that have been elected as gateway nodes before the current round of cluster head election can be deleted from the node set, which can avoid the situation of "dead nodes" in the self-organizing network, and further improve the stability and effective operation life of the self-organizing network.

[0105] Based on any of the above embodiments, for the selection of gateway nodes, considering that the demand for forwarding capability of gateway nodes in a self-organizing network is much higher than the demand for direct communication capability with other nodes, therefore, in some embodiments, based on the random numbers generated by each node in the node set for this round of cluster head election, before screening out nodes with random numbers less than the target cluster head election threshold from the node set as the target cluster head nodes for this round of cluster head election, the target node with the largest current remaining energy can also be obtained from the node set as the gateway node, and the target node in the node set can be deleted.

[0106] The target node refers to the node with the largest current remaining energy in the node set.

[0107] Among them, it can be understood that after the corresponding node is elected as the target cluster head node of this round of cluster head election, the node elected as the target cluster head node can inform the surrounding nodes that have not been elected as cluster head nodes of its election news in the form of broadcast messages. After the corresponding nodes of the non-elected cluster head nodes learn of the message, they can choose the cluster head node with the best channel conditions to join the network. Subsequently, the cluster head node will receive the data sent by the nodes that have not been elected as cluster head nodes, and select a suitable route to send the data to the gateway node.

[0108] Based on the above embodiments, when there are multiple target cluster heads, for each target cluster head node, in order to obtain the target path with the minimum transmission cost between the target cluster head node and the gateway node, so that the target cluster head node can communicate data with the gateway node based on the target path, this embodiment also provides a cluster head election method.

[0109] Figure 4 A flowchart of another cluster head election method provided by an embodiment of the present disclosure.

[0110] like Figure 4 As shown, the cluster head election method may include the following steps:

[0111] Step 401 : when performing a cluster head election for the self-organizing network to be processed, a node set that has not been elected as a cluster head node before the cluster head election is obtained from the self-organizing network.

[0112] Step 402: Delete the nodes in the node set that have been elected as gateway nodes before the current round of cluster head election.

[0113] Step 403, for any node in the node set, determine the comprehensive state evaluation value of the node according to the current remaining energy of the node and the total amount of data packets received by the node from other nodes, where other nodes are nodes in the node set except the node.

[0114] Step 404: Determine the target cluster head election threshold of the node in this round of cluster head election according to the comprehensive state evaluation value of the node.

[0115] Step 405: Obtain a target node with the largest current remaining energy from the node set as a gateway node, and delete the target node from the node set.

[0116] Step 406 , based on the random numbers generated by each node in the node set for this round of cluster head election, select nodes whose random numbers are less than the target cluster head election threshold from the node set as multiple target cluster head nodes for this round of cluster head election.

[0117] It should be noted that, for the specific implementation of steps 401 to 406, reference may be made to the relevant description of the embodiments of the present disclosure, which will not be repeated here.

[0118] Step 407, construct a communication relationship diagram.

[0119] The communication relationship diagram includes: multiple target cluster head nodes, gateway nodes, connection edges between corresponding two target cluster head nodes and corresponding transmission costs, and connection edges between the gateway node and the corresponding target cluster head node and corresponding transmission costs, wherein the connection edge between the corresponding two target cluster heads is used to indicate that the corresponding two target cluster head nodes can communicate with each other, and the connection edge between the gateway node and the corresponding target cluster head node indicates that the gateway node and the corresponding target cluster head node can communicate with each other.

[0120] In some embodiments, after obtaining multiple target cluster head nodes and gateway nodes, it is determined whether the multiple target cluster head nodes can communicate with each other, and whether the multiple target cluster head nodes can communicate with the gateway node. For two target cluster head nodes that can communicate, the transmission cost corresponding to the direct communication between the two target cluster head nodes that can communicate can be determined; for the gateway node that can communicate and the corresponding target cluster head node, the transmission cost corresponding to the direct communication between the gateway node that can communicate and the corresponding target cluster head node can be determined, and a corresponding communication relationship graph is constructed based on the two target cluster head nodes that can communicate and the corresponding transmission cost, and the gateway node that can communicate and the corresponding target cluster head node and the corresponding transmission cost.

[0121] In some examples, a possible specific implementation method for determining the transmission cost corresponding to direct communication between a gateway node capable of communicating and a corresponding target cluster head node is: obtaining the transmission energy consumption and transmission delay when the gateway node capable of communicating and the corresponding target cluster head node are directly communicating, and determining the transmission cost when the gateway node capable of communicating and the corresponding target cluster head node are directly communicating based on the transmission energy consumption and transmission delay.

[0122] In some embodiments, a weighted sum of transmission energy consumption and transmission delay may be performed to obtain a transmission cost when a gateway node capable of communication and a corresponding target cluster head node perform direct communication.

[0123] Specifically, a third weight corresponding to the transmission energy consumption can be obtained, and a fourth weight corresponding to the transmission delay can be obtained, and the transmission energy consumption is weighted by the third weight, and the transmission delay is weighted by the fourth weight, and the weighted transmission energy consumption and transmission delay are summed to obtain the transmission cost when the gateway node that can communicate and the corresponding target cluster head node communicate directly.

[0124] Among them, it should be noted that the specific implementation method of determining the corresponding outbound transmission cost when the gateway node capable of communicating and the corresponding target cluster head node communicate directly is similar to the above-mentioned implementation method of determining the corresponding outbound transmission cost when the gateway node capable of communicating and the corresponding target cluster head node communicate directly, and this embodiment will not repeat it.

[0125] For example, P AG It represents the transmission cost corresponding to the direct communication between the cluster head node A and the gateway node GN, where it is used to calculate the transmission cost P AG The calculation formula is:

[0126] P AG =ωE AG +(1-ω)T AG (7)

[0127] Among them, EAG represents the transmission energy consumption required for directly transmitting data of a specified size (e.g., D bits) between the cluster head node A and the gateway node GN, and ω represents the weight used to weight the transmission energy consumption; T AG The transmission delay required for directly transmitting data of a specified size between the cluster head node A and the gateway node GN, (1-ω) represents the weight used to weight the transmission delay.

[0128] It should be noted that the transmission energy consumption E required for the cluster head node A to directly send data of a specified size D bits to the gateway node GN is AG for:

[0129]

[0130] Among them, GN r A represents the receiving energy consumption of the gateway node GN; s represents the transmission energy consumption of cluster head node A, E elec is the circuit energy consumption coefficient; ε fs is the free space magnification factor; ε mp is the multipath fading amplification factor; d0 is the transmission distance threshold, which can be expressed as

[0131] The transmission delay T corresponding to the cluster head node A sending the specified size D bit of data directly to the gateway node GN is AG for:

[0132]

[0133] Among them, R AG It indicates the transmission rate corresponding to the direct transmission between the cluster head node A and the gateway node GN.

[0134] For example, the gateway node is represented by v1, there are four target cluster head nodes, and the four target cluster head nodes are represented by v2, v3, v4 and v5 respectively. Assume that the gateway node v1 and the target cluster head node v2 can communicate directly, and the corresponding transmission cost when the two communicate is P 12 ; The gateway node v1 and the target cluster head node v3 can communicate directly, and the corresponding transmission cost when the two communicate is P 13 ; The target cluster head node v2 and the target cluster head node v4 can communicate directly, and the corresponding transmission cost when the two communicate is P 24 ; The target cluster head node v4 and the target cluster head node v5 can communicate directly, and the corresponding transmission cost when the two communicate is P 45 ; The target cluster head node v2 and the target cluster head node v5 can communicate directly, and the corresponding transmission cost when the two communicate is P25 ; The target cluster head node v3 and the target cluster head node v5 can communicate directly, and the corresponding transmission cost when the two communicate is P 35 , based on the corresponding target cluster head nodes that can communicate and the corresponding transmission costs, as well as the gateway nodes and cluster head nodes that can communicate and the corresponding transmission costs, a communication relationship graph can be constructed. An example diagram of the communication relationship graph constructed based on the above information is shown in Figure 5 shown.

[0135] Step 408: for each target cluster head node, determine a target path with minimum transmission cost from the target cluster head node to the gateway node according to the communication relationship graph.

[0136] In one embodiment of the present disclosure, for each target cluster head node, the shortest path calculation is performed between the target cluster head node and the gateway node to obtain a target path with the minimum transmission cost from the target cluster head node to the gateway node.

[0137] In this embodiment, the Bellman-Ford algorithm can be used to determine the minimum transmission cost from the source point to each node in the communication relationship diagram, with the target cluster head node as the source point, and the minimum transmission cost from the source node to the gateway node can be obtained from the multiple minimum transmission costs determined, that is, the minimum transmission cost from the target cluster head node to the gateway node can be obtained. Then, based on the obtained minimum transmission cost, the target path corresponding to the minimum transmission cost can be obtained.

[0138] In some embodiments, for each target cluster head node, multiple candidate paths from the target cluster head node to the gateway node are obtained from the communication relationship graph; for each candidate path, the transmission costs of the connecting edges included in the candidate path are summed to obtain the total transmission cost required for the target cluster head node to transmit data to the gateway node through the candidate path; and the path with the minimum total transmission cost is selected from the multiple candidate paths as the target path. Thus, the target path with the minimum transmission cost from the target cluster head node to the gateway node is accurately determined, which facilitates the subsequent target cluster head nodes to communicate data with the gateway node through the cluster head nodes in the target path in turn.

[0139] For example, a communication relationship diagram such as Figure 5As shown below, an exemplary description of the process of using the Bellman-Ford algorithm to determine the minimum transmission cost from the target cluster head node v2 to the gateway node v1 is as follows: Assume that the source node s is the target cluster head node v2. Create an array dist[i], and record the transmission cost from the source node s to each node in the communication relationship graph through this array dist[i]. During initialization, dist[0] in the dist[i] array is 0, and the rest of the elements are infinite. For each connection edge e(u, v) in the communication relationship graph, perform a relaxation calculation. If dist[u] + P uv < dist[v], then let dist[v] = dist[u] + P uv , where P uv is the weight corresponding to the connection edge e(u, v). The above comparison and update operation of the dist[] array elements is looped n - 1 times. If the dist[] array is not updated again after the above operation is looped n - 1 times, it means that the search for the minimum transmission cost of the entire communication relationship graph has ended. Correspondingly, the minimum transmission cost from the target cluster head node v2 to the gateway node v1 can be obtained from the dist[] array. Assume that the minimum transmission cost P from the target cluster head node v2 to the gateway node v1 is P 25 + P 35 + P 13 . Based on this minimum transmission cost, the target path from the target cluster head node v2 to the gateway node v1 is: The target cluster head node v2 transmits data to the target cluster head node v5, then the target cluster head node v5 forwards the data to the target cluster head node v3, and then the target cluster head node v3 forwards the data to the gateway node v1. The total transmission cost required for data transmission between the target cluster head node V2 and the gateway node v1 through this target path is the minimum.

[0140] In summary, it can be seen that in this embodiment, the evaluation of node status (including two major indicators: the energy status value of the node and the data collection ability value of the node) is incorporated into the self-organizing network cluster head election, and considering the overall operation and maintenance life requirements of the self-organizing network in reality, this embodiment excludes the possibility of nodes that have been elected as gateways / cluster heads before being elected again in each new round of cluster head election, thereby尽可能 avoiding the premature appearance of "dead nodes" that cannot achieve relay communication in the self-organizing network, improving the overall survival time of the self-organizing network, and determining the target path with the minimum transmission cost between the target cluster head node and the gateway node, and realizing data transmission between the target cluster head node and the gateway node through the target path, so as to ensure that the transmission cost corresponding to data transmission between the target cluster head node and the gateway node is the minimum.

[0141] To implement the above embodiment, the present disclosure also proposes a cluster head election device.

[0142] Figure 6 A schematic diagram of the structure of a cluster head election device provided in an embodiment of the present disclosure.

[0143] like Figure 6 As shown, the cluster head election device 600 includes: an acquisition module 601 , a first determination module 602 , a second determination module 603 and a cluster head election module 604 .

[0144] The acquisition module 601 is used to acquire a set of nodes that have not been elected as cluster head nodes before the current round of cluster head election from the self-organizing network when the current round of cluster head election is performed for the self-organizing network to be processed.

[0145] The first determination module 602 is used to determine the comprehensive state evaluation value of any node in the node set according to the current remaining energy of the node and the total amount of data packets received by the node from other nodes, where other nodes are nodes in the node set other than the node.

[0146] The second determination module 603 is used to determine the target cluster head election threshold of the node in the current round of cluster head election according to the comprehensive state evaluation value of the node.

[0147] The cluster head election module 604 is used to select nodes whose random numbers are less than the target cluster head election threshold from the node set as target cluster head nodes for this round of cluster head election based on the random numbers generated by each node in the node set for this round of cluster head election.

[0148] In one embodiment of the present disclosure, the first determining module 602 includes:

[0149] A first determining unit, configured to determine an energy state value of a node according to a current remaining energy of the node;

[0150] A second determining unit, configured to determine a data collection capability value of a node according to a total amount of data packets received by the node and sent by other nodes;

[0151] The third determining unit is used to determine the comprehensive state evaluation value of the node according to the energy state value and the data collection capability value.

[0152] In one embodiment of the present disclosure, the first determination unit is specifically used to: determine the average residual energy corresponding to all nodes in the node set based on the current residual energy of each node in the node set; determine the energy state value of the node based on the current residual energy and the average residual energy of the node.

[0153] In one embodiment of the present disclosure, the second determination module 603 is specifically used to: determine the probability of a node being elected as a cluster head node in this round of cluster head election; determine an initial cluster head election threshold of the node in this round of cluster head election based on the election probability and the first round number of this round of cluster head election; and adjust the initial cluster head election threshold based on the comprehensive state evaluation value of the node to obtain a target cluster head election threshold of the node in this round of cluster head election.

[0154] In one embodiment of the present disclosure, the second determination module 603 is specifically used to: determine the adjustment coefficient for adjusting the initial cluster head election threshold based on the comprehensive state evaluation value of the node, the probability of being elected and the second round number of the previous round of cluster head election in this round of cluster head election; and adjust the initial cluster head election threshold according to the adjustment coefficient to obtain the target cluster head election threshold.

[0155] In one embodiment of the present disclosure, the device further includes:

[0156] The deletion module is used to delete the nodes in the node set that have been elected as gateway nodes before the current round of cluster head election.

[0157] In one embodiment of the present disclosure, the device further includes:

[0158] The processing module is used to obtain the target node with the largest current remaining energy from the node set as the gateway node; and delete the target node in the node set.

[0159] In one embodiment of the present disclosure, when there are multiple target cluster head nodes, the device further includes:

[0160] A construction module is used to construct a communication relationship graph, wherein the communication relationship graph includes: a plurality of target cluster head nodes, a gateway node, a connection edge between two corresponding target cluster head nodes and a corresponding transmission cost, and a connection edge between a gateway node and a corresponding target cluster head node and a corresponding transmission cost, wherein the connection edge between the two corresponding target cluster heads is used to indicate that the two corresponding target cluster head nodes can communicate with each other, and the connection edge between a gateway node and a corresponding target cluster head node indicates that the gateway node and the corresponding target cluster head node can communicate with each other;

[0161] The third determination module is used to determine, for each target cluster head node, a target path with the minimum transmission cost from the target cluster head node to the gateway node according to the communication relationship diagram.

[0162] In one embodiment of the present disclosure, the third determination module is specifically used to: for each target cluster head node, obtain multiple candidate paths from the target cluster head node to the gateway node from the communication relationship graph; for each candidate path, sum the transmission costs of the connection edges included in the candidate path to obtain the total transmission cost required for the target cluster head node to transmit data to the gateway node through the candidate path; select the target path with the minimum transmission cost from the multiple candidate paths.

[0163] It should be noted that the above explanation of the cluster head election method embodiment is also applicable to the cluster head election device of this embodiment, which will not be described in detail in this embodiment.

[0164] The cluster head election device of the disclosed embodiment, when performing the current round of cluster head election for the self-organizing network to be processed, obtains a node set that has not been elected as a cluster head node before the current round of cluster head election from the self-organizing network; for any node in the node set, determines the node's comprehensive state evaluation value according to the node's current remaining energy and the total amount of data packets sent by other nodes received by the node, wherein the other nodes are nodes other than the node in the node set; determines the node's target cluster head election threshold in the current round of cluster head election according to the node's comprehensive state evaluation value; based on the random numbers generated by each node in the node set for the current round of cluster head election, selects nodes whose random numbers are less than the target cluster head election threshold from the node set as the target cluster head nodes in the current round of cluster head election. Thus, in the process of cluster head election, the node's comprehensive state evaluation value is determined in combination with the node's current remaining energy and the total amount of data packets sent by other nodes received by the node, and cluster head election is performed based on the node's comprehensive state evaluation value, which can avoid nodes with bad states from being selected as cluster head nodes, so that the network can operate stably and extend the network's survival time.

[0165] In order to implement the above embodiments, the present application also proposes an electronic device, such as Figure 7 As shown, Figure 7 It is a block diagram of an electronic device according to an exemplary embodiment.

[0166] like Figure 7 As shown, the electronic device 700 includes:

[0167] The memory 710 and the processor 720, and the bus 730 connecting different components (including the memory 710 and the processor 720), the memory 710 stores a computer program, and when the processor 720 executes the program, the cluster head election method of the embodiment of the present disclosure is implemented.

[0168] Bus 730 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor or a local bus using any of a variety of bus architectures. For example, these architectures include but are not limited to Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MAC) bus, Enhanced ISA bus, Video Electronics Standards Association (VESA) local bus and Peripheral Component Interconnect (PCI) bus.

[0169] The electronic device 700 typically includes a variety of electronic device readable media. These media can be any available media that can be accessed by the electronic device 700, including volatile and non-volatile media, removable and non-removable media.

[0170] The memory 710 may also include computer system readable media in the form of volatile memory, such as random access memory (RAM) 740 and / or cache memory 750. The electronic device 700 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, the storage system 760 may be used to read and write non-removable, non-volatile magnetic media ( Figure 7 not shown, usually called a "hard drive"). Although Figure 7 Not shown, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing to a removable non-volatile optical disk (e.g., a CD-ROM, a DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to the bus 730 via one or more data medium interfaces. The memory 710 may include at least one program product having a set (e.g., at least one) of program modules that are configured to perform the functions of the various embodiments of the present disclosure.

[0171] A program / utility 780 having a set (at least one) of program modules 770 may be stored, for example, in the memory 710, such program modules 770 including but not limited to an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment. The program modules 770 generally perform the functions and / or methods of the embodiments described in the present disclosure.

[0172] The electronic device 700 may also communicate with one or more external devices 790 (e.g., keyboards, pointing devices, displays, etc.), may communicate with one or more devices that enable a user to interact with the electronic device 700, and / or may communicate with any device that enables the electronic device 700 to communicate with one or more other computing devices (e.g., network cards, modems, etc.). Such communication may be performed through an input / output (I / O) interface 792. Furthermore, the electronic device 700 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 793. Figure 7 As shown, the network adapter 793 communicates with other modules of the electronic device 700 via the bus 730. It should be understood that although Figure 7 Not shown, other hardware and / or software modules may be used in conjunction with electronic device 700, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0173] The processor 720 executes various functional applications and data processing by running the programs stored in the memory 710 .

[0174] It should be noted that the implementation process and technical principles of the electronic device of this embodiment refer to the aforementioned explanation of the scheduling of the embodiment of the present disclosure, and will not be repeated here.

[0175] In order to implement the above embodiment, the present application further proposes a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the cluster head election method of the above embodiment is implemented.

[0176] In order to implement the above embodiment, the present disclosure further provides a computer program product. When an instruction processor in the computer program product executes, the cluster head election method of the above embodiment is executed.

[0177] In the description of this specification, the terms "first" and "second" are used for descriptive purposes only and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include at least one of the features. In the description of this application, the meaning of "plurality" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0178] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, without contradiction.

[0179] Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be understood as limitations on the present application. Ordinary technicians in this field can change, modify, replace and modify the above embodiments within the scope of the present application.

Claims

1. A cluster head election method, characterized in that: The method comprises: When performing a cluster head election for the self-organizing network to be processed, obtaining a set of nodes that have not been elected as cluster head nodes before the cluster head election in the current round from the self-organizing network; For any node in the node set, determine a comprehensive state evaluation value of the node according to the current remaining energy of the node and the total amount of data packets received by the node from other nodes, wherein the other nodes are nodes in the node set other than the node; Determining a target cluster head election threshold of the node in the current round of cluster head election according to the comprehensive state evaluation value of the node; Based on the random numbers generated by each node in the node set for the current round of cluster head election, nodes whose random numbers are less than the target cluster head election threshold are selected from the node set as target cluster head nodes for the current round of cluster head election.

2. The method according to claim 1, characterized in that Determining the comprehensive state evaluation value of the node according to the current remaining energy of the node and the total amount of data packets received by the node and sent by other nodes includes: Determining an energy state value of the node according to the current remaining energy of the node; Determining a data collection capability value of the node according to a total amount of data packets received by the node and sent by other nodes; A comprehensive status evaluation value of the node is determined according to the energy status value and the data collection capability value.

3. The method according to claim 2, characterized in that The step of determining the energy state value of the node according to the current remaining energy of the node includes: Determine the average residual energy corresponding to all nodes in the node set according to the current residual energy of each node in the node set; An energy state value of the node is determined according to the current remaining energy of the node and the average remaining energy.

4. The method according to claim 1, characterized in that Determining the target cluster head election threshold of the node in the current round of cluster head election according to the comprehensive state evaluation value of the node includes: Determining the probability of the node being elected as the cluster head node in the current round of cluster head election; Determining an initial cluster head election threshold of the node in the current round of cluster head election according to the election probability and the first round number of the current round of cluster head election; The initial cluster head election threshold is adjusted according to the comprehensive state evaluation value of the node to obtain the target cluster head election threshold of the node in the current round of cluster head election.

5. The method according to claim 4, characterized in that The step of adjusting the initial cluster head election threshold according to the comprehensive state evaluation value of the node to obtain a target cluster head election threshold of the node in the current round of cluster head election includes: Determining an adjustment coefficient for adjusting the initial cluster head election threshold according to the comprehensive state evaluation value of the node, the election probability and the second round number of the previous cluster head election of the current round of cluster head election; The initial cluster head election threshold is adjusted according to the adjustment coefficient to obtain the target cluster head election threshold.

6. The method according to claim 1, characterized in that Before determining the comprehensive state evaluation value of the node according to the current remaining energy of the node and the total amount of data packets received by the node from other nodes, the method further includes: Nodes in the node set that have been elected as gateway nodes before the current round of cluster head election are deleted.

7. The method according to any one of claims 1 to 6, characterized in that Before selecting, based on the random numbers generated by each node in the node set for the current round of cluster head election, nodes having random numbers less than a target cluster head election threshold from the node set as target cluster head nodes for the current round of cluster head election, the method further includes: Acquire a target node with the largest current remaining energy from the node set as a gateway node; Delete the target node in the node set.

8. The method according to claim 7, characterized in that In the case where there are multiple target cluster head nodes, the method further includes: Constructing a communication relationship graph, wherein the communication relationship graph includes: a plurality of the target cluster head nodes, the gateway node, connection edges between two corresponding target cluster head nodes and corresponding transmission costs, and connection edges between the gateway node and the corresponding target cluster head node and corresponding transmission costs, wherein the connection edge between the two corresponding target cluster heads is used to indicate that the two corresponding target cluster head nodes can communicate with each other, and the connection edge between the gateway node and the corresponding target cluster head node indicates that the gateway node and the corresponding target cluster head node can communicate with each other; For each target cluster head node, a target path with minimum transmission cost from the target cluster head node to the gateway node is determined according to the communication relationship graph.

9. The method according to claim 8, characterized in that For each target cluster head node, determining a target path with a minimum transmission cost from the target cluster head node to the gateway node according to the communication relationship graph, including: For each target cluster head node, obtaining multiple candidate paths from the target cluster head node to the gateway node from the communication relationship graph; For each candidate path, summing up the transmission costs of the connection edges included in the candidate path to obtain a total transmission cost required for the target cluster head node to transmit data to the gateway node through the candidate path; The target path with the minimum transmission cost is selected from the multiple candidate paths.

10. A cluster head election device, characterized in that: The device comprises: An acquisition module, used for acquiring, when performing a cluster head election for a self-organizing network to be processed, a set of nodes that have not been elected as cluster head nodes before the current round of cluster head election from the self-organizing network; a first determination module, configured to determine, for any node in the node set, a comprehensive state evaluation value of the node according to a current remaining energy of the node and a total amount of data packets received by the node from other nodes, wherein the other nodes are nodes in the node set other than the node; A second determination module is used to determine a target cluster head election threshold of the node in the current round of cluster head election according to the comprehensive state evaluation value of the node; The cluster head election module is used to select nodes whose random numbers are less than the target cluster head election threshold from the node set as target cluster head nodes for the current round of cluster head election based on the random numbers generated by each node in the node set for the current round of cluster head election.

11. A storage medium storing instructions, characterized in that: When the instruction is executed on an electronic device, the electronic device executes the method according to any one of claims 1 to 9.

12. An electronic device, characterized in that: The method comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the method according to any one of claims 1 to 9 is implemented.

Images