CN111770543A - Cluster head selection method, system, terminal device and computer readable storage medium - Google Patents

Cluster head selection method, system, terminal device and computer readable storage medium Download PDF

Info

Publication number
CN111770543A
CN111770543A CN202010605225.5A CN202010605225A CN111770543A CN 111770543 A CN111770543 A CN 111770543A CN 202010605225 A CN202010605225 A CN 202010605225A CN 111770543 A CN111770543 A CN 111770543A
Authority
CN
China
Prior art keywords
cluster head
node
candidate cluster
head node
round
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010605225.5A
Other languages
Chinese (zh)
Inventor
程刚
赵文东
王源野
邹贵祥
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN202010605225.5A priority Critical patent/CN111770543A/en
Publication of CN111770543A publication Critical patent/CN111770543A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Sources (AREA)

Abstract

The present disclosure provides a cluster head selection method, a system, a terminal device and a computer readable storage medium, wherein the method comprises: respectively calculating the benefit values of the candidate cluster head nodes in the current round and the benefit values of the candidate cluster head nodes in the previous round; judging whether the difference value between the benefit value of the candidate cluster head node in the current round and the benefit value of the candidate cluster head node in the previous round is smaller than a preset threshold value or not based on the calculation result; and if the candidate cluster head node is smaller than a preset threshold value, selecting the candidate cluster head node as a cluster head. The cluster head is selected based on the benefit value difference value of the node between the current round and the previous round, energy in the network can be effectively balanced, and the survival time of the network is prolonged.

Description

Cluster head selection method, system, terminal device and computer readable storage medium
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a cluster head selection method, a cluster head selection system, a terminal device, and a computer-readable storage medium.
Background
Energy of nodes in a wireless sensor network is very important for network connectivity, how to balance network energy consumption becomes a key point for research in the wireless sensor network, and clustering is used as one of effective methods for saving network energy.
The current common cluster head selection schemes mainly include a low-power consumption adaptive cluster head selection scheme and a centralized cluster head selection scheme. The basic idea of the low-power-consumption self-adaptive cluster head selection scheme is that a cluster head is selected according to the comparison between a random number generated by a node in a network and a system threshold value, and because the residual energy of the node is not considered in the method, the node with low residual energy can possibly become the cluster head, so that the node with low residual energy is prematurely dead, and the connectivity of the network is influenced; the basic idea of the centralized cluster head selection scheme is to manage nodes by using a base station, and make the nodes with high residual energy become cluster heads.
Current cluster head selection schemes may either cause nodes with low remaining energy to become cluster heads, leading to premature node death, or cause cluster heads to be unevenly distributed throughout the network. Based on the above problems, it is an urgent need to provide a cluster head selection method capable of effectively balancing network energy.
Disclosure of Invention
The present disclosure provides a cluster head selection method, system, terminal device, and computer-readable storage medium to at least solve the above-mentioned problems.
According to an aspect of the embodiments of the present disclosure, there is provided a cluster head selection method, including:
respectively calculating the benefit values of the candidate cluster head nodes in the current round and the benefit values of the candidate cluster head nodes in the previous round;
judging whether the difference value between the benefit value of the candidate cluster head node in the current round and the benefit value of the candidate cluster head node in the previous round is smaller than a preset threshold value or not based on the calculation result;
and if the candidate cluster head node is smaller than a preset threshold value, selecting the candidate cluster head node as a cluster head.
In one embodiment, the separately calculating the benefit value of the candidate cluster head node in the current round and the benefit value of the candidate cluster head node in the previous round includes:
respectively calculating the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round, and the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round;
calculating the benefit value of the candidate cluster head node in the current round based on the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round; and the number of the first and second groups,
and calculating the benefit value of the candidate cluster head node in the previous round based on the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round.
In one embodiment, the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round and the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round are respectively calculated according to the following formulas:
En(k,d)＝Ec-(Efkd+Ejk)
Dn(S,Z)＝(Si-Za)2+(Se-Zb)2
Figure BDA0002560817150000021
in the formula, En(k, d) represents the remaining energy of the candidate cluster head node in the n-th round, EcRepresenting initial energy of candidate cluster head nodes, EfRepresents the energy consumed by the candidate cluster head node in transmitting unit data, and k represents the candidate cluster head nodeThe length of the point in the nth round message, d represents the transmission distance of the candidate cluster head node in the nth round message, EjRepresenting the energy consumed by the candidate cluster head node in receiving the unit data;
Dn(S, Z) represents the node centripetal force of the candidate cluster head node in the nth turn, SiAbscissa representing candidate cluster head node in n-th round, SeOrdinate, Z, representing candidate cluster head node in n-th roundaAbscissa, Z, representing the center of the clusterbA ordinate representing the cluster center;
Hn(t) represents the node temperature of the candidate cluster head node in the nth turn, β represents the weight of the heat capacity value of the candidate cluster head node, ExRepresents the energy consumption of the candidate cluster head node in the n-th turn, HcIndicating the initial temperature of the candidate cluster head node.
In one embodiment, the benefit value of the candidate cluster head node in the current round is calculated based on the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round, and the benefit value of the candidate cluster head node in the previous round is calculated based on the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round, which is obtained according to the following formula:
Pn＝α1En(k,d)+α2Dn(S,Z)+α3Hn(t)
in the formula, PnRepresents the benefit value of the candidate cluster head node in the nth turn, En(k, D) represents the remaining energy of the candidate cluster head node in the n-th round, Dn(S, Z) represents the node centripetal force of the candidate cluster head node in the nth turn, HnAnd (t) represents the node temperature of the candidate cluster head node in the nth turn.
According to another aspect of the embodiments of the present disclosure, there is provided a cluster head selection system including:
the calculation module is arranged for calculating the benefit value of the candidate cluster head node in the current round and the benefit value of the candidate cluster head node in the previous round respectively;
the judging module is used for judging whether the difference value between the benefit value of the candidate cluster head node in the current round and the benefit value of the candidate cluster head node in the previous round is smaller than a preset threshold value or not;
and the selecting module is set to select the candidate cluster head node as the cluster head when the judging module judges that the candidate cluster head node is smaller than the preset threshold value.
In one embodiment, the computing module includes:
a first calculation unit, configured to calculate the residual energy, the node centripetal force and the node temperature of a candidate cluster head node in a current round, and the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in a previous round respectively;
a second calculation unit, configured to calculate a benefit value of the candidate cluster head node in the current round based on the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round; and the number of the first and second groups,
the second calculating unit is further configured to calculate a benefit value of the candidate cluster head node in the previous round based on the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round.
In one embodiment, the first calculation unit is obtained according to the following formula:
En(k,d)＝Ec-(Efkd+Ejk)
Dn(S,Z)＝(Si-Za)2+(Se-Zb)2
Figure BDA0002560817150000031
in the formula, En(k, d) represents the remaining energy of the candidate cluster head node in the n-th round, EcRepresenting initial energy of candidate cluster head nodes, EfRepresenting the energy consumed by the candidate cluster head node when sending unit data, k representing the length of the candidate cluster head node in the nth round message, d representing the transmission distance of the candidate cluster head node in the nth round message, EjRepresenting the energy consumed by the candidate cluster head node in receiving the unit data;
Dn(S, Z) represents the node centripetal force of the candidate cluster head node in the nth turn, SiAbscissa representing candidate cluster head node in n-th round, SeOrdinate, Z, representing candidate cluster head node in n-th roundaAbscissa, Z, representing the center of the clusterbA ordinate representing the cluster center;
Hn(t) represents the node temperature of the candidate cluster head node in the nth turn, β represents the weight of the heat capacity value of the candidate cluster head node, ExRepresents the energy consumption of the candidate cluster head node in the n-th turn, HcIndicating the initial temperature of the candidate cluster head node.
In one embodiment, the second calculation unit is obtained according to the following formula:
Pn＝α1En(k,d)+α2Dn(S,Z)+α3Hn(t)
in the formula, PnRepresents the benefit value of the candidate cluster head node in the nth turn, En(k, D) represents the remaining energy of the candidate cluster head node in the n-th round, Dn(S, Z) represents the node centripetal force of the candidate cluster head node in the nth turn, HnAnd (t) represents the node temperature of the candidate cluster head node in the nth turn. According to still another aspect of the embodiments of the present disclosure, there is provided a terminal device, including a memory and a processor, where the memory stores a computer program, and when the processor runs the computer program stored in the memory, the processor executes the cluster head selection method.
According to yet another aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the processor executes the cluster head selection method.
The technical scheme provided by the embodiment of the disclosure can have the following beneficial effects:
according to the cluster head selection method provided by the embodiment of the disclosure, the benefit values of candidate cluster head nodes in the current round and the benefit value of the candidate cluster head nodes in the previous round are respectively calculated; and judging whether the difference value between the benefit value of the candidate cluster head node in the current round and the benefit value of the candidate cluster head node in the previous round is smaller than a preset threshold value or not based on the calculation result. The cluster head is selected based on the benefit value difference value of the node between the current round and the previous round, energy in the network can be effectively balanced, and the survival time of the network is prolonged.
Additional features and advantages of the disclosure will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the disclosure. The objectives and other advantages of the disclosure may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
The accompanying drawings are included to provide a further understanding of the disclosed embodiments and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the example serve to explain the principles of the disclosure and not to limit the disclosure.
Fig. 1 is a schematic flow chart of a cluster head selection method according to an embodiment of the present disclosure;
fig. 2 is a flowchart illustrating a cluster head selection method according to another embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of a cluster head selection system according to an embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of a terminal device according to an embodiment of the present disclosure.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, specific embodiments of the present disclosure are described below in detail with reference to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating the present disclosure, are given by way of illustration and explanation only, not limitation.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order; also, the embodiments and features of the embodiments in the present disclosure may be arbitrarily combined with each other without conflict.
In the following description, suffixes such as "module", "component", or "unit" used to denote elements are used only for the convenience of explanation of the present disclosure, and have no specific meaning in themselves. Thus, "module", "component" or "unit" may be used mixedly.
The energy of the nodes in the wireless sensor network is very important for the connectivity of the network. And how to balance network energy consumption becomes a key point of research in wireless sensor networks. The final purpose of energy balance is to balance energy consumption among nodes in the network and guarantee normal operation of the network. Therefore, the embodiment of the present disclosure provides an energy balancing cluster head selection method, which can effectively balance energy in a network and prolong the lifetime of the network.
Referring to fig. 1, fig. 1 is a schematic flowchart illustrating a cluster head selection method according to an embodiment of the present disclosure, where the method includes steps S11-S13.
In step S11, the benefit values of the candidate cluster head nodes in the current round and the previous round are calculated respectively.
Specifically, the network initialization is performed first, and then benefit values of candidate cluster head nodes in the current round and the last round are calculated, it can be understood that the benefit values of the nodes represent the capability of the nodes to transmit data, in this embodiment, the benefit values of the nodes may include node residual energy, node centripetal force, node temperature, and the like, and the rounds represent the running rounds of the network.
It should be noted that the candidate cluster head node may be any node in the network, or may be a related node that is subjected to preliminary screening, for example, to avoid selecting a cluster head due to too low node energy, all nodes in the network may be preliminarily screened according to the current remaining energy values of the nodes before step S11, and a node that meets the requirement of an energy threshold is selected as the candidate cluster head node.
In step S12, based on the calculation result, it is determined whether the difference between the benefit value of the candidate cluster head node in the current round and the benefit value of the previous round is smaller than a preset threshold, if yes, step S13 is executed, otherwise, the candidate cluster head node is deleted and the process is ended.
In step S13, the candidate cluster head node is selected as a cluster head.
In the related art, usually, a cluster head is selected through a low-power-consumption adaptive cluster head selection scheme and a centralized cluster head selection scheme, which easily causes the problems of premature death of a cluster head node or uneven selection of the cluster head, in order to solve the related problems, in this embodiment, a cluster head is selected by calculating a difference between benefit values of candidate cluster head nodes in a current round and a previous round, when the difference between the two is smaller, the change of the benefit values is smaller, that is, the energy consumption between the two is smaller, the node is more stable, when a cluster head node is selected, energy in a network can be more balanced, and by setting a preset threshold, the cluster head can be selected only when the difference between the two is smaller than the preset threshold, so as to realize the balance of energy in the network.
It should be noted that, a person skilled in the art can set the size of the preset threshold value by combining the prior art and the practical situation. And when the difference value between the two is greater than or equal to a preset threshold value, deleting the candidate cluster head node, namely limiting the qualification of the candidate cluster head node in the current turn of electing the cluster head.
Referring to fig. 2, fig. 2 is a flowchart illustrating a method for selecting a cluster head according to another embodiment of the present disclosure, where on the basis of the previous embodiment, the present disclosure further divides step S11 into S11a-S11c, and this embodiment calculates a node benefit value by using factors such as residual energy of nodes, centrality, and node problems, and the like, and further selects a cluster head, while ensuring network connectivity, to balance network energy consumption to the maximum extent and prolong network lifetime. In particular, the amount of the solvent to be used,
in step S11a, the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round, and the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round are calculated respectively.
Further, step S11 is obtained according to the following formula:
En(k,d)＝Ec-(Efkd+Ejk)
Dn(S,Z)＝(Si-Za)2+(Se-Zb)2
Figure BDA0002560817150000071
in the formula, En(k, d) represents the remaining energy of the candidate cluster head node in the n-th round, EcRepresenting initial energy of candidate cluster head nodes, EfRepresenting the energy consumed by the candidate cluster head node when sending unit data, k representing the length of the candidate cluster head node in the nth round message, d representing the transmission distance of the candidate cluster head node in the nth round message, EjRepresenting the energy consumed by the candidate cluster head node in receiving the unit data;
Dn(S, Z) represents the node centripetal force of the candidate cluster head node in the nth turn, SiAbscissa representing candidate cluster head node in n-th round, SeOrdinate, Z, representing candidate cluster head node in n-th roundaAbscissa, Z, representing the center of the clusterbA ordinate representing the cluster center;
Hn(t) represents the node temperature of the candidate cluster head node in the nth turn, β represents the weight of the heat capacity value of the candidate cluster head node, ExRepresents the energy consumption of the candidate cluster head node in the n-th turn, HcIndicating the initial temperature of the candidate cluster head node.
It will be appreciated that the cluster center is the center of a cluster, e.g., a cluster is as large as a circle, the cluster center is at the center of the circle, and node centripetal force is used to indicate the distance of a node from the cluster center. In the formula, the abscissa Z of the cluster centeraOrdinate ZbInitial energy E of candidate cluster head nodecEnergy E consumed when cluster head node transmits unit datafEnergy E consumed by candidate cluster head node receiving unit datajInitiation of candidate cluster head nodesTemperature HcIs constant from run to run, and k, d, Si、SeAnd ExVariations in the number of rounds may occur.
In step S11b, calculating a benefit value of the candidate cluster head node in the current round based on the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round; and the number of the first and second groups,
in step S11c, a benefit value of the candidate cluster head node in the previous round is calculated based on the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round.
Further, step S11b and step S11c are obtained according to the following formula:
Pn＝α1En(k,d)+α2Dn(S,Z)+α3Hn(t)
in the formula, pnRepresents the benefit value of the candidate cluster head node in n rounds, En(k, D) represents the remaining energy of the candidate cluster head nodes in n rounds, Dn(S, Z) represents the node centripetal force of the candidate cluster head node in n rounds, HnAnd (t) represents the node temperature of the candidate cluster head node in n rounds.
It will be appreciated that P may be used for the previous pass of n based on the above formulan-1And (4) showing. In this example, Pn-Pn-1And ≧ T (n) by determining whether the node holds. T (n) represents a specified threshold, and if true, the node is deleted. If not, selecting the node as a cluster head node.
Based on the same technical concept, the embodiment of the present disclosure correspondingly provides a cluster head selection system, as shown in fig. 3, the system includes a calculating module 31, a judging module 32, and a selecting module 33, wherein,
the calculating module 31 is configured to calculate the benefit values of the candidate cluster head nodes in the current round and the previous round respectively;
the judging module 32 is configured to judge whether a difference value between the benefit value of the candidate cluster head node in the current round and the benefit value in the previous round is smaller than a preset threshold value based on the calculation result;
and the selecting module 33 is configured to select the candidate cluster head node as the cluster head when the judging module judges that the candidate cluster head node is smaller than the preset threshold.
In one embodiment, the calculation module 31 includes:
a first calculation unit, configured to calculate the residual energy, the node centripetal force and the node temperature of a candidate cluster head node in a current round, and the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in a previous round respectively;
a second calculation unit, configured to calculate a benefit value of the candidate cluster head node in the current round based on the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round; and the number of the first and second groups,
the second calculating unit is further configured to calculate a benefit value of the candidate cluster head node in the previous round based on the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round.
In one embodiment, the first calculation unit is obtained according to the following formula:
En(k,d)＝Ec-(Efkd+Ejk)
Dn(S,Z)＝(Si-Za)2+(Se-Zb)2
Figure BDA0002560817150000091
in the formula, En(k, d) represents the remaining energy of the candidate cluster head node in the n-th round, EcRepresenting initial energy of candidate cluster head nodes, EfRepresenting the energy consumed by the candidate cluster head node when sending unit data, k representing the length of the candidate cluster head node in the nth round message, d representing the transmission distance of the candidate cluster head node in the nth round message, EjRepresenting the energy consumed by the candidate cluster head node in receiving the unit data;
Dn(S, Z) represents a candidateNode centripetal force of cluster head node in n-th turn, SiAbscissa representing candidate cluster head node in n-th round, SeOrdinate, Z, representing candidate cluster head node in n-th roundaAbscissa, Z, representing the center of the clusterbA ordinate representing the cluster center;
Hn(t) represents the node temperature of the candidate cluster head node in the nth turn, β represents the weight of the heat capacity value of the candidate cluster head node, ExRepresents the energy consumption of the candidate cluster head node in the n-th turn, HcIndicating the initial temperature of the candidate cluster head node.
In one embodiment, the second calculation unit is obtained according to the following formula:
Pn＝α1En(k,d)+α2Dn(S,Z)+α3Hn(t)
in the formula, PnRepresents the benefit value of the candidate cluster head node in the nth turn, En(k, D) represents the remaining energy of the candidate cluster head node in the n-th round, Dn(S, Z) represents the node centripetal force of the candidate cluster head node in the nth turn, HnAnd (t) represents the node temperature of the candidate cluster head node in the nth turn. It should be noted that, in this embodiment, each module is used to execute each step in the foregoing method embodiment, and details are not described here again.
Based on the same technical concept, the embodiment of the present disclosure correspondingly provides a terminal device, which is characterized by comprising a memory and a processor, wherein the memory stores a computer program, and when the processor runs the computer program stored in the memory, the processor executes the cluster head selection method.
According to yet another aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the processor executes the cluster head selection method.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
In summary, the cluster head is selected based on the benefit value difference value of the node between the current round and the previous round, so that the energy in the network can be effectively balanced, and the survival time of the network is prolonged; furthermore, the embodiment calculates the benefit value of the node by using the residual energy, the centrality of the node, the problem of the node and other factors, and then selects the cluster head, while ensuring the network connectivity, aiming at balancing the energy consumption in the network, so that the network energy consumption can be balanced to a greater extent, and the network survival time can be prolonged.
Finally, it should be noted that: the above embodiments are only used for illustrating the technical solutions of the present disclosure, and not for limiting the same; while the present disclosure has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art will understand that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present disclosure.

Claims (10)

1. A method for cluster head selection, comprising:
respectively calculating the benefit values of the candidate cluster head nodes in the current round and the benefit values of the candidate cluster head nodes in the previous round;
judging whether the difference value between the benefit value of the candidate cluster head node in the current round and the benefit value of the candidate cluster head node in the previous round is smaller than a preset threshold value or not based on the calculation result;
and if the candidate cluster head node is smaller than a preset threshold value, selecting the candidate cluster head node as a cluster head.
2. The method according to claim 1, wherein the separately calculating the benefit value of the candidate cluster head node in the current round and the benefit value of the candidate cluster head node in the previous round comprises:
respectively calculating the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round, and the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round;
calculating the benefit value of the candidate cluster head node in the current round based on the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round; and the number of the first and second groups,
and calculating the benefit value of the candidate cluster head node in the previous round based on the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round.
3. The method according to claim 2, wherein the calculating the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round and the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round are respectively obtained according to the following formulas:
En(k,d)＝Ec-(Efkd+Ejk)
Dn(S,Z)＝(Si-Za)2+(Se-Zb)2
Figure FDA0002560817140000011
in the formula, En(k, d) represents the remaining energy of the candidate cluster head node in the n-th round, EcRepresenting initial energy of candidate cluster head nodes, EfRepresenting the energy consumed by the candidate cluster head node when sending unit data, k representing the length of the candidate cluster head node in the nth round message, d representing the transmission distance of the candidate cluster head node in the nth round message, EjRepresenting the energy consumed by the candidate cluster head node in receiving the unit data;
Dn(S, Z) represents the node centripetal force of the candidate cluster head node in the nth turn, SiAbscissa representing candidate cluster head node in n-th round, SeOrdinate, Z, representing candidate cluster head node in n-th roundaAbscissa, Z, representing the center of the clusterbA ordinate representing the cluster center;
Hn(t) represents the node temperature of the candidate cluster head node in the nth turn, β represents the weight of the heat capacity value of the candidate cluster head node, ExRepresents the energy consumption of the candidate cluster head node in the n-th turn, HcIndicating the initial temperature of the candidate cluster head node.
4. The method according to claim 2 or 3, wherein the benefit value of the candidate cluster head node in the current round is calculated based on the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round, and the benefit value of the candidate cluster head node in the previous round is calculated based on the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round, according to the following formula:
Pn＝α1En(k,d)+α2Dn(S,Z)+α3Hn(t)
in the formula, PnRepresents the benefit value of the candidate cluster head node in the nth turn, En(k, D) represents the remaining energy of the candidate cluster head node in the n-th round, Dn(S, Z) represents the node centripetal force of the candidate cluster head node in the nth turn, HnAnd (t) represents the node temperature of the candidate cluster head node in the nth turn.
5. A cluster head selection system, comprising:
the calculation module is arranged for calculating the benefit value of the candidate cluster head node in the current round and the benefit value of the candidate cluster head node in the previous round respectively;
the judging module is used for judging whether the difference value between the benefit value of the candidate cluster head node in the current round and the benefit value of the candidate cluster head node in the previous round is smaller than a preset threshold value or not;
and the selecting module is set to select the candidate cluster head node as the cluster head when the judging module judges that the candidate cluster head node is smaller than the preset threshold value.
6. The system of claim 5, wherein the computing module comprises:
a first calculation unit, configured to calculate the residual energy, the node centripetal force and the node temperature of a candidate cluster head node in a current round, and the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in a previous round respectively;
a second calculation unit, configured to calculate a benefit value of the candidate cluster head node in the current round based on the remaining energy, the node centripetal force and the node temperature of the candidate cluster head node in the current round; and the number of the first and second groups,
the second calculating unit is further configured to calculate a benefit value of the candidate cluster head node in the previous round based on the residual energy, the node centripetal force and the node temperature of the candidate cluster head node in the previous round.
7. The system according to claim 5 or 6, wherein the first calculation unit is obtained according to the following formula:
En(k,d)＝Ec-(Efkd+Ejk)
Dn(S,Z)＝(Si-Za)2+(Se-Zb)2
Figure FDA0002560817140000031
in the formula, En(k, d) represents the remaining energy of the candidate cluster head node in the n-th round, EcRepresenting initial energy of candidate cluster head nodes, EfRepresenting the energy consumed by the candidate cluster head node when sending unit data, k representing the length of the candidate cluster head node in the nth round message, d representing the transmission distance of the candidate cluster head node in the nth round message, EjRepresenting the energy consumed by the candidate cluster head node in receiving the unit data;
Dn(S, Z) represents the node centripetal force of the candidate cluster head node in the nth turn, SiAbscissa representing candidate cluster head node in n-th round, SeOrdinate, Z, representing candidate cluster head node in n-th roundaAbscissa, Z, representing the center of the clusterbA ordinate representing the cluster center;
Hn(t) represents the node temperature of the candidate cluster head node in the nth turn, β represents the weight of the heat capacity value of the candidate cluster head node, ExRepresents the energy consumption of the candidate cluster head node in the n-th turn, HcIndicating the initial temperature of the candidate cluster head node.
8. The system of claim 6, wherein the second computing unit is derived according to the following formula:
Pn＝α1En(k,d)+α2Dn(S,Z)+α3Hn(t)
in the formula, PnRepresents the benefit value of the candidate cluster head node in the nth turn, En(k, D) represents the remaining energy of the candidate cluster head node in the n-th round, Dn(S, Z) represents the node centripetal force of the candidate cluster head node in the nth turn, HnAnd (t) represents the node temperature of the candidate cluster head node in the nth turn.
9. A terminal device comprising a memory and a processor, the memory having stored therein a computer program, the processor, when executing the computer program stored by the memory, performing the cluster head selection method according to any one of claims 1 to 4.
10. A computer readable storage medium having stored thereon a computer program, wherein the computer program, when executed by a processor, causes the processor to perform a cluster head selection method according to any of claims 1 to 4.
CN202010605225.5A 2020-06-29 2020-06-29 Cluster head selection method, system, terminal device and computer readable storage medium Pending CN111770543A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010605225.5A CN111770543A (en) 2020-06-29 2020-06-29 Cluster head selection method, system, terminal device and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010605225.5A CN111770543A (en) 2020-06-29 2020-06-29 Cluster head selection method, system, terminal device and computer readable storage medium

Publications (1)

Publication Number Publication Date
CN111770543A true CN111770543A (en) 2020-10-13

Family

ID=72723196

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010605225.5A Pending CN111770543A (en) 2020-06-29 2020-06-29 Cluster head selection method, system, terminal device and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN111770543A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009112937A1 (en) * 2008-03-14 2009-09-17 The University Of Cape Town Wireless sensor network model
CN102711206A (en) * 2012-05-14 2012-10-03 南京邮电大学 Simulated annealing-based wireless sensor network (WSN) hierarchical routing method
CN109587753A (en) * 2018-11-26 2019-04-05 河南大学 The cluster head selection algorithm of improvement LEACH agreement based on targets threshold constraint

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009112937A1 (en) * 2008-03-14 2009-09-17 The University Of Cape Town Wireless sensor network model
CN102711206A (en) * 2012-05-14 2012-10-03 南京邮电大学 Simulated annealing-based wireless sensor network (WSN) hierarchical routing method
CN109587753A (en) * 2018-11-26 2019-04-05 河南大学 The cluster head selection algorithm of improvement LEACH agreement based on targets threshold constraint

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
马德朋: "面向无线传感器网络路由协议的簇首选择研究", 《中国优秀硕士论文全文数据库》 *

Similar Documents

Publication Publication Date Title
US8762461B2 (en) Method, system and device for searching active peer in P2P streaming media system
CN109246229A (en) A kind of method and apparatus of distribution resource acquisition request
CN104243405A (en) Request processing method, device and system
CN102291836A (en) Random access control method and system
CN112261135A (en) Node election method, system, device and equipment based on consistency protocol
CN110933178B (en) Method for adjusting node configuration in cluster system and server
WO2018233679A1 (en) Load-balancing method and apparatus
CN111601268A (en) Cluster head selection method and device, terminal equipment and storage medium
CN115002238A (en) Traffic transmission method, device, equipment and storage medium
CN108459926B (en) Data remote backup method and device and computer readable medium
CN112075102B (en) Bluetooth low energy networking method, electronic equipment, network and storage medium
CN111770543A (en) Cluster head selection method, system, terminal device and computer readable storage medium
CN114208255A (en) Communication method and apparatus, electronic apparatus, and computer-readable storage medium
CN111711930B (en) Cluster head election method, system, terminal equipment and computer readable storage medium
CN112087521B (en) Block chain link point authority control method based on big data and block chain system
US8369352B1 (en) Scheduling access terminals via one or more wireless schedulers
CN110134547B (en) Middleware-based repeated data deleting method and related device
US10177929B1 (en) System for distributing data to multiple devices
CN111711976A (en) Node clustering method, system, terminal equipment and computer readable storage medium
CN113347672A (en) Efficient transfer of access context for user equipment between network nodes
KR102146696B1 (en) Method And Apparatus for Scheduling Wireless Resource of Mobile Terminal
CN111711975A (en) Data transmission method, system, terminal device and computer readable storage medium
CN111510989A (en) Relay node selection method, data transmission method, terminal device, and storage medium
CN113396573A (en) Migration of computing services
CN114124686B (en) Method and device for distributing user plane function network element UPF for UE session

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20201013