CN114363988B - Clustering method and device and electronic equipment - Google Patents
Clustering method and device and electronic equipment Download PDFInfo
- Publication number
- CN114363988B CN114363988B CN202111504480.1A CN202111504480A CN114363988B CN 114363988 B CN114363988 B CN 114363988B CN 202111504480 A CN202111504480 A CN 202111504480A CN 114363988 B CN114363988 B CN 114363988B
- Authority
- CN
- China
- Prior art keywords
- nodes
- communication
- cluster head
- relation
- node
- 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.)
- Active
Links
Images
Classifications
-
- 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
- Mobile Radio Communication Systems (AREA)
Abstract
The application provides a clustering method, a clustering device and electronic equipment, and relates to the technical field of communication. The clustering method comprises the following steps: firstly, according to the communication quality parameters between each node and each first relation node in the network, the communication score of each node can be respectively determined, and the first relation node is the node with direct communication connection. Then, according to the communication scores, a plurality of cluster head nodes can be determined from the nodes, and the plurality of cluster head nodes are not first relation nodes. Finally, first indication information can be sent to the plurality of cluster head nodes respectively for the plurality of cluster head nodes to confirm the cluster head identities and construct cluster members. Therefore, the data interaction among the network nodes in the clustering process can be greatly reduced, the clustering efficiency is improved, and the energy loss generated in the clustering process is reduced.
Description
[ field of technology ]
The present disclosure relates to the field of communications technologies, and in particular, to a clustering method, a clustering device, and an electronic device.
[ background Art ]
A wireless sensor network is a network consisting of a large number of nodes that possess data processing and communication capabilities. When the wireless sensor network performs networking, in order to improve energy utilization efficiency and reduce transmission delay, a "clustering" manner is generally adopted, that is, nodes in the network are divided into a plurality of clusters, and each cluster is responsible for communication with other clusters or external terminals by a "cluster head".
At present, a common clustering method, such as a self-adaptive low-power-consumption hierarchical clustering algorithm, needs a large amount of data exchange for each node in a network when clustering, and therefore a large amount of computing resources are used, and node energy consumption is large.
[ invention ]
The embodiment of the application provides a clustering method, a clustering device and electronic equipment, which can greatly reduce data interaction among network nodes in a clustering process, improve the clustering efficiency and reduce energy loss generated in the clustering process.
In a first aspect, an embodiment of the present application provides a clustering method, including: according to communication quality parameters between each node and each first relation node in the network, communication scores of the nodes are respectively determined, and the first relation nodes are nodes with direct communication connection; determining a plurality of cluster head nodes from the nodes according to the communication scores, wherein the plurality of cluster head nodes are not first relation nodes; and respectively sending first indication information to the plurality of cluster head nodes, wherein the first indication information is used for the plurality of cluster head nodes to confirm the cluster head identities and construct cluster members.
In one possible implementation manner, the communication quality parameter includes any one or a combination of the following parameters: a success rate of communication; a communication retransmission rate; communication throughput; communication delay.
In one possible implementation manner, according to a communication quality parameter between each node and each first relation node in the network, determining a communication score of each node, where the first relation node is a node with direct communication connection, and the method includes: establishing an adjacency matrix according to the communication connection relation among all nodes in a network, and establishing a communication quality matrix according to the communication quality parameters among all nodes; obtaining a communication score matrix according to the adjacent matrix and the communication quality matrix; and summing the communication score matrix according to columns to obtain the communication score of each node.
In one possible implementation manner, the method further includes: and determining the number N of cluster head nodes to be selected according to the product of the total number of all nodes in the network and the set proportion, wherein N is a positive integer.
In one possible implementation manner, according to the communication score, a plurality of cluster head nodes are determined from the nodes, where the plurality of cluster head nodes are not first relation nodes, and the method includes: and determining N nodes which have the highest communication scores and are not first relation nodes as cluster head nodes.
In one possible implementation manner, before sending the first indication information to the plurality of cluster head nodes respectively, the method further includes: respectively dividing first relation nodes of the plurality of cluster head nodes into cluster members of the plurality of cluster head nodes in a simulation mode; determining a number of remaining non-clustered nodes in the network; and if the number of the remaining non-clustered nodes is smaller than a set threshold value, newly increasing the remaining non-clustered nodes to be cluster head nodes.
In one possible implementation manner, if the number of the remaining non-clustered nodes is greater than the set threshold, the method further includes: newly adding M nodes which have the highest communication scores and are not first relation nodes in the rest non-clustered nodes as cluster head nodes; simulating and dividing cluster members for each newly added cluster head node and confirming that the number of new remaining non-clustered nodes is smaller than the set threshold; and determining the value of M according to the number of the remaining non-clustered nodes.
In a second aspect, an embodiment of the present application provides a clustering apparatus, including: the determining module is used for determining communication scores of all nodes according to communication quality parameters between all nodes and respective first relation nodes in the network, wherein the first relation nodes are nodes with direct communication connection; the selecting module is used for determining a plurality of cluster head nodes from the nodes according to the communication scores, wherein the plurality of cluster head nodes are not first relation nodes; the indication module is used for respectively sending first indication information to the plurality of cluster head nodes, wherein the first indication information is used for the plurality of cluster head nodes to confirm the cluster head identities and construct cluster members.
In a third aspect, an embodiment of the present application provides an electronic device, including: at least one processor; and at least one memory communicatively coupled to the processor, wherein: the memory stores program instructions executable by the processor, the processor invoking the program instructions capable of performing the method according to the first aspect.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium storing computer instructions that cause the computer to perform the method according to the first aspect.
Through the technical scheme, data interaction among all network nodes in the clustering process can be greatly reduced, the clustering efficiency is improved, and energy loss generated in the clustering process is reduced.
[ description of the drawings ]
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a clustering method provided in an embodiment of the present application;
FIG. 2 is a flowchart of another clustering method according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a clustering device according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
[ detailed description ] of the invention
For a better understanding of the technical solutions of the present application, embodiments of the present application are described in detail below with reference to the accompanying drawings.
It should be understood that the described embodiments are merely some, but not all, of the embodiments of the present application. All other embodiments, based on the embodiments herein, which would be apparent to one of ordinary skill in the art without making any inventive effort, are intended to be within the scope of the present application.
The terminology used in the embodiments of the application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
The embodiment of the application can provide a clustering device for executing the clustering method provided by the embodiment of the application. The clustering device may be any one of wireless sensor nodes in the wireless sensor network, or may be a control device independent of the wireless sensor network. The embodiments of the present application are not limited in this regard.
Fig. 1 is a flowchart of a clustering method according to an embodiment of the present application, where, as shown in fig. 1, the clustering method may include:
and step 101, determining the communication scores of all the nodes according to the communication quality parameters between all the nodes and the first relation nodes in the network.
In this embodiment of the present application, the first relational node refers to a node having a direct communication connection, that is, data transmission between the nodes does not need an intermediate node to forward.
For any node in the network, the embodiment of the application can determine each first relation node of the node, and determine the communication score of the node according to the communication quality parameters between the node and each first relation node. The communication quality parameter may include any one or more of a combination of a communication success rate, a communication retransmission rate, a communication throughput, and a communication delay within a set time length. The communication score may be used to characterize the degree of association between each node and the remaining nodes, with higher communication scores being more closely related to the greater degree of association between the remaining nodes.
In the embodiment of the present application, the adjacency matrix H may be established according to a communication connection relationship between each node in the network, and the communication quality matrix P may be established according to a communication quality parameter between each node. Then, a communication score matrix C can be calculated from the adjacency matrix H and the communication quality matrix P. And finally, summing the communication score matrix C according to columns, wherein the sum value of each column is the communication score of the node corresponding to the column. The communication score matrix C may be calculated according to the following formula:
C＝PH(I-PH) -1
wherein I is an identity matrix.
In the embodiment of the present application, first, the number of cluster head nodes to be selected may be determined according to the total number of nodes in the network. In one possible implementation manner, the total number of the nodes may be multiplied by a set proportion, and the obtained product N is taken as the number of cluster head nodes to be selected. Wherein, the value of the set proportion can be determined according to an empirical value.
And traversing each node according to the communication scores of each node in the order from high to low until N nodes which are not first relation nodes are determined. The N nodes may then be determined to be cluster head nodes.
In this embodiment of the present application, a specific implementation manner of cluster head node to construct cluster members may refer to the prior art, for example, the cluster head node may send a cluster request to each respective first relationship node, and receive a cluster response.
Through the technical scheme, a large amount of computation flows for determining the cluster head nodes can be concentrated in the clustering equipment, so that data interaction among all network nodes in the clustering process can be greatly reduced, the clustering efficiency is improved, and energy loss generated in the clustering process is reduced.
Fig. 2 is a flowchart of another clustering method according to an embodiment of the present application. As shown in fig. 2, the clustering method provided in the embodiment of the present application may include:
In this embodiment of the present application, before sending the first indication information to each cluster head node, it may be first determined whether the number of allocation of the cluster head nodes is reasonable. Specifically, the cluster members can be simulated and divided for each cluster head node according to the conditions of the cluster head node for constructing the cluster members. The condition for the cluster head node to construct the cluster member may be that the cluster head node is the first relation node. It should be noted that, the simulation of dividing the cluster members refers to performing a simulation calculation on the cluster members of each cluster head node, and is not an actual building cluster member.
After the simulation of the cluster members is completed, there may still be remaining non-clustered nodes in the network based on the limitations of the communication connection relationship. It will be appreciated that the remaining non-clustered nodes are not the first relationship nodes of any one cluster head node and cannot become cluster members of any one cluster head node. At this time, the number of remaining non-clustered nodes in the network may be counted.
If the number of the remaining non-clustered nodes in the network is smaller than the set threshold, the current clustered node allocation number can be considered reasonable. If the number of remaining non-clustered nodes is not 0 at this time, step 205 may be executed to newly increase the remaining non-clustered nodes to cluster head nodes. The set threshold may be determined according to the total number of nodes in the network, for example, may be 5% of the total number of nodes.
Conversely, if the number of remaining non-clustered nodes in the network is greater than the set threshold, then the number of current cluster head nodes may be considered unreasonable. At this point, step 202 may be re-executed to increase the number of cluster head nodes.
In re-executing step 202, to improve cluster head determination efficiency, each cluster head node that has been previously determined may be retained. The cluster head node to be newly added can be selected from the rest of non-cluster nodes.
Specifically, the number of cluster head nodes to be newly added may be determined according to the number of currently remaining non-clustered nodes. For example, the product M of the number of remaining non-clustered nodes and the aforementioned set ratio may be determined as the number of cluster head nodes to be newly added. When selecting, M nodes which have the highest communication scores in the rest non-clustered nodes and are not first relation nodes can be newly added as cluster head nodes.
And step 205, newly adding the rest of non-clustered nodes into cluster head nodes.
Through the technical scheme, the rationality verification of the cluster head node distribution can be finished locally at the clustering equipment before the first indication information is sent to each cluster head node. Thus, unnecessary energy consumption can be avoided, and the clustering efficiency can be improved.
Fig. 3 is a schematic structural diagram of a clustering device according to an embodiment of the present application. As shown in fig. 3, the clustering apparatus may include: a determining module 31, a selecting module 32 and an indicating module 33.
The determining module 31 is configured to determine communication scores of the nodes according to communication quality parameters between the nodes in the network and respective first relationship nodes, where the first relationship nodes are nodes with direct communication connection.
The selecting module 32 is configured to determine a plurality of cluster head nodes from the nodes according to the communication scores, where the plurality of cluster head nodes are not first relationship nodes.
The indication module 33 is configured to send first indication information to the plurality of cluster head nodes, where the first indication information is used for the plurality of cluster head nodes to perform cluster head identity confirmation and construct cluster members.
In a specific implementation, the communication quality parameter includes any one or a combination of the following parameters: a success rate of communication; a communication retransmission rate; communication throughput; communication delay.
In a specific implementation manner, the determining module 31 is specifically configured to establish an adjacency matrix according to a communication connection relationship between nodes in the network, and establish a communication quality matrix according to a communication quality parameter between the nodes; obtaining a communication score matrix according to the adjacent matrix and the communication quality matrix; and summing the communication score matrix according to columns to obtain the communication score of each node.
In a specific implementation manner, the selecting module 32 is further configured to determine, according to a product of the total number of each node in the network and the set proportion, the number N of cluster head nodes to be selected, where N is a positive integer.
In a specific implementation manner, the selecting module 32 is specifically configured to determine, as the cluster head node, N nodes that have the highest communication scores and are not the first relationship nodes from each other.
In a specific implementation manner, the apparatus further includes a dividing module 34, configured to divide, in a simulation manner, the first relationship nodes of the plurality of cluster head nodes into cluster members of the plurality of cluster head nodes before the indicating module 33 sends the first indication information to the plurality of cluster head nodes, respectively; determining the number of remaining non-clustered nodes in the network; and if the number of the remaining non-clustered nodes is smaller than the set threshold value, newly increasing the remaining non-clustered nodes to be cluster head nodes.
In a specific implementation manner, if the number of the remaining non-clustered nodes is greater than the set threshold, the dividing module 34 is further configured to newly add M nodes that have the highest communication scores among the remaining non-clustered nodes and are not first relationship nodes to be cluster head nodes; simulating and dividing cluster members for each newly added cluster head node and confirming that the number of new remaining non-clustered nodes is smaller than a set threshold; wherein, the value of M is determined according to the number of the remaining non-clustered nodes.
In the above technical solution, first, the determining module 31 may determine the communication scores of the nodes according to the communication quality parameters between the nodes and the first relationship nodes in the network. Then, the selecting module can determine a plurality of cluster head nodes from all the nodes according to the communication scores. Finally, the indication module can respectively send first indication information to the plurality of cluster head nodes so that the plurality of cluster head nodes can carry out cluster head identity confirmation and construct cluster members. Therefore, the data interaction among the network nodes in the clustering process can be greatly reduced, the clustering efficiency is improved, and the energy loss generated in the clustering process is reduced.
Fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application. As shown in fig. 4, the electronic device may include at least one processor; and at least one memory communicatively coupled to the processor, wherein: the memory stores program instructions executable by the processor, and the processor invokes the program instructions to execute the clustering method provided in the embodiment of the present application.
The electronic device may be a clustering device, and the specific form of the electronic device is not limited in this embodiment.
Fig. 4 illustrates a block diagram of an exemplary electronic device suitable for use in implementing embodiments of the present application. The electronic device shown in fig. 4 is only an example and should not be construed as limiting the functionality and scope of use of the embodiments herein.
As shown in fig. 4, the electronic device is in the form of a general purpose computing device. Components of an electronic device may include, but are not limited to: one or more processors 410, a memory 430, and a communication bus 440 that connects the different system components (including the memory 430 and the processor 410).
The communication bus 440 represents one or more of any 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. By way of example, and not limitation, such architectures include industry Standard architecture (Industry Standard Architecture; hereinafter ISA) bus, micro channel architecture (Micro Channel Architecture; hereinafter MAC) bus, enhanced ISA bus, video electronics standards Association (Video Electronics Standards Association; hereinafter VESA) local bus, and peripheral component interconnect (Peripheral Component Interconnection; hereinafter PCI) bus.
Electronic devices typically include a variety of computer system readable media. Such media can be any available media that can be accessed by the electronic device and includes both volatile and nonvolatile media, removable and non-removable media.
A program/utility having a set (at least one) of program modules may be stored in the memory 430, such program modules including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment. Program modules generally perform the functions and/or methods in the embodiments described herein.
The electronic device may also communicate with one or more external devices (e.g., keyboard, pointing device, display, etc.), with one or more devices that enable a user to interact with the electronic device, and/or with any device (e.g., network card, modem, etc.) that enables the electronic device to communicate with one or more other computing devices. Such communication may occur through communication interface 420. Moreover, the electronic device may also communicate with one or more networks (e.g., local area network (Local Area Network; hereinafter: LAN), wide area network (Wide Area Network; hereinafter: WAN) and/or a public network, such as the Internet) via a network adapter (not shown in FIG. 4) that may communicate with other modules of the electronic device via the communication bus 440. It should be appreciated that although not shown in fig. 4, other hardware and/or software modules may be used in connection with an electronic device, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, disk arrays (Redundant Arrays of Independent Drives; hereinafter RAID) systems, tape drives, data backup storage systems, and the like.
The processor 410 executes various functional applications and data processing by running programs stored in the memory 430, for example, implementing the clustering method provided in the embodiments of the present application.
The embodiment of the application also provides a computer readable storage medium, which stores computer instructions for causing the computer to execute the clustering method provided by the embodiment of the application.
Any combination of one or more computer readable media may be utilized as the above-described computer readable storage media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a Read-Only Memory (ROM), an erasable programmable Read-Only Memory (Erasable Programmable Read Only Memory; EPROM) or flash Memory, an optical fiber, a portable compact disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present application. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In the description of the present application, the meaning of "plurality" is at least two, such as two, three, etc., unless explicitly defined otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and additional implementations are included within the scope of the preferred embodiment of the present application in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the embodiments of the present application.
Depending on the context, the word "if" as used herein may be interpreted as "at … …" or "at … …" or "in response to a determination" or "in response to detection". Similarly, the phrase "if determined" or "if detected (stated condition or event)" may be interpreted as "when determined" or "in response to determination" or "when detected (stated condition or event)" or "in response to detection (stated condition or event), depending on the context.
In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the elements is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple elements or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in hardware plus software functional units.
The foregoing description of the preferred embodiments of the present invention is not intended to limit the invention to the precise form disclosed, and any modifications, equivalents, improvements and alternatives falling within the spirit and principles of the present invention are intended to be included within the scope of the present invention.
Claims (7)
1. A method of clustering, comprising:
according to communication quality parameters between each node and each first relation node in the network, communication scores of the nodes are respectively determined, and the first relation nodes are nodes with direct communication connection;
determining a plurality of cluster head nodes from the nodes according to the communication scores, wherein the plurality of cluster head nodes are not first relation nodes;
respectively sending first indication information to the plurality of cluster head nodes, wherein the first indication information is used for the plurality of cluster head nodes to confirm the cluster head identities and construct cluster members;
wherein, according to the communication quality parameter between each node and each first relation node in the network, confirm the communication score of each said node separately, including:
establishing an adjacency matrix according to the communication connection relation among all nodes in a network, and establishing a communication quality matrix according to the communication quality parameters among all nodes;
obtaining a communication score matrix according to the adjacent matrix and the communication quality matrix;
summing the communication score matrixes according to columns to obtain the communication score of each node;
according to the communication score, determining a plurality of cluster head nodes from the nodes, wherein the plurality of cluster head nodes are not first relation nodes, and the method comprises the following steps:
determining N nodes which have the highest communication scores and are not first relation nodes as cluster head nodes;
the method further comprises the steps of:
and determining the number N of cluster head nodes to be selected according to the product of the total number of all nodes in the network and the set proportion, wherein N is a positive integer.
2. The method of claim 1, wherein the communication quality parameter comprises any one or a combination of the following parameters:
a success rate of communication;
a communication retransmission rate;
communication throughput;
communication delay.
3. The method of claim 1, wherein before sending the first indication information to the plurality of cluster head nodes, respectively, the method further comprises:
respectively dividing first relation nodes of the plurality of cluster head nodes into cluster members of the plurality of cluster head nodes in a simulation mode;
determining a number of remaining non-clustered nodes in the network;
and if the number of the remaining non-clustered nodes is smaller than a set threshold value, newly increasing the remaining non-clustered nodes to be cluster head nodes.
4. The method of claim 3, wherein if the number of remaining non-clustered nodes is greater than the set threshold, the method further comprises:
newly adding M nodes which have the highest communication scores and are not first relation nodes in the rest non-clustered nodes as cluster head nodes;
simulating and dividing cluster members for each newly added cluster head node and confirming that the number of new remaining non-clustered nodes is smaller than the set threshold;
and determining the value of M according to the number of the remaining non-clustered nodes.
5. A clustering device, comprising:
the determining module is used for determining communication scores of all nodes according to communication quality parameters between all nodes and respective first relation nodes in the network, wherein the first relation nodes are nodes with direct communication connection;
the selecting module is used for determining a plurality of cluster head nodes from the nodes according to the communication scores, wherein the plurality of cluster head nodes are not first relation nodes;
the indication module is used for respectively sending first indication information to the plurality of cluster head nodes, wherein the first indication information is used for the plurality of cluster head nodes to confirm the cluster head identities and construct cluster members;
the determining module is specifically configured to:
establishing an adjacency matrix according to the communication connection relation among all nodes in a network, and establishing a communication quality matrix according to the communication quality parameters among all nodes;
obtaining a communication score matrix according to the adjacent matrix and the communication quality matrix;
summing the communication score matrixes according to columns to obtain the communication score of each node;
the selecting module is specifically configured to:
determining N nodes which have the highest communication scores and are not first relation nodes as cluster head nodes;
the selecting module is further configured to:
and determining the number N of cluster head nodes to be selected according to the product of the total number of all nodes in the network and the set proportion, wherein N is a positive integer.
6. An electronic device, comprising:
at least one processor; and
at least one memory communicatively coupled to the processor, wherein:
the memory stores program instructions executable by the processor, the processor invoking the program instructions to perform the method of any of claims 1-4.
7. A computer readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111504480.1A CN114363988B (en) | 2021-12-10 | 2021-12-10 | Clustering method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111504480.1A CN114363988B (en) | 2021-12-10 | 2021-12-10 | Clustering method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114363988A CN114363988A (en) | 2022-04-15 |
| CN114363988B true CN114363988B (en) | 2023-07-07 |
Family
ID=81100232
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111504480.1A Active CN114363988B (en) | 2021-12-10 | 2021-12-10 | Clustering method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114363988B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115086325A (en) * | 2022-06-30 | 2022-09-20 | 蚂蚁区块链科技(上海)有限公司 | Block link point grouping method and block link points |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101594271A (en) * | 2008-05-27 | 2009-12-02 | 华为技术有限公司 | Wireless self-organization network establishment and method of work and network of relation and equipment |
| WO2015135561A1 (en) * | 2014-03-10 | 2015-09-17 | Nokia Solutions And Networks Oy | Distribution of popular content between user nodes of a social network community via direct proximity-based communication |
| CN107657797A (en) * | 2017-08-21 | 2018-02-02 | 胡书恺 | A kind of multilist centralized meter-reading system |
| CN110650512A (en) * | 2018-06-26 | 2020-01-03 | 云南电网有限责任公司 | Fuzzy theory-based low-power-consumption wide-area heterogeneous sensor network clustering algorithm |
| CN113194031A (en) * | 2021-04-23 | 2021-07-30 | 西安交通大学 | User clustering method and system combining interference suppression in fog wireless access network |
Family Cites Families (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101227413B (en) * | 2008-02-22 | 2011-09-07 | 北京交通大学 | Cluster energy saving route algorithm applied in wireless sensor network |
| CN101360051B (en) * | 2008-07-11 | 2011-07-20 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| KR101022876B1 (en) * | 2009-03-20 | 2011-03-16 | 주식회사 건지소프트 | Clustreing method and system in wireless sensor networks |
| EP2908597B1 (en) * | 2014-02-14 | 2016-09-14 | Alcatel Lucent | Wireless communication network node and method |
| CN104320823B (en) * | 2014-10-24 | 2018-03-06 | 西安电子科技大学 | Network clustering method of wireless sensor based on Sink trust evaluation values |
| CN106412820B (en) * | 2016-05-23 | 2020-02-07 | 北京邮电大学 | Method and device for determining cluster head of mobile ad hoc network |
| US11067710B2 (en) * | 2016-10-31 | 2021-07-20 | Atomic Energy Of Canada Limited / Energie Atomique Du Canada Limitee | System and method for indirectly monitoring one or more environmental conditions |
| WO2018098753A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Management method for distributed network, node and system |
| CN107295597B (en) * | 2017-07-28 | 2019-07-19 | 北京邮电大学 | A kind of adaptive cluster routing method, device and electronic equipment |
| CN107659974B (en) * | 2017-11-03 | 2021-08-13 | 广东工业大学 | Wireless sensor network routing method, device, equipment and computer readable storage medium |
| CN109560885A (en) * | 2018-12-24 | 2019-04-02 | 广东理致技术有限公司 | A kind of wireless sensor network quality data communication means and device |
| CN110121200B (en) * | 2019-05-09 | 2020-08-11 | 江南大学 | Energy-efficient networking method in heterogeneous sensor network |
| CN110248393B (en) * | 2019-06-17 | 2022-07-05 | 西北工业大学 | Clustering method based on traffic weight |
| CN110381560B (en) * | 2019-07-30 | 2023-05-02 | 广东电网有限责任公司 | Wireless sensor network communication method suitable for power field |
| CN111093201B (en) * | 2019-12-23 | 2023-04-18 | 内蒙古大学 | Wireless sensor network and clustering method thereof |
| CN111405634B (en) * | 2020-02-26 | 2022-03-04 | 中国空间技术研究院 | Method and device for self-adaptive clustering of wireless sensor network |
| CN111698728B (en) * | 2020-06-15 | 2021-09-03 | 西安电子科技大学 | Topology control system for dynamic network and control method thereof |
-
2021
- 2021-12-10 CN CN202111504480.1A patent/CN114363988B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101594271A (en) * | 2008-05-27 | 2009-12-02 | 华为技术有限公司 | Wireless self-organization network establishment and method of work and network of relation and equipment |
| WO2015135561A1 (en) * | 2014-03-10 | 2015-09-17 | Nokia Solutions And Networks Oy | Distribution of popular content between user nodes of a social network community via direct proximity-based communication |
| CN107657797A (en) * | 2017-08-21 | 2018-02-02 | 胡书恺 | A kind of multilist centralized meter-reading system |
| CN110650512A (en) * | 2018-06-26 | 2020-01-03 | 云南电网有限责任公司 | Fuzzy theory-based low-power-consumption wide-area heterogeneous sensor network clustering algorithm |
| CN113194031A (en) * | 2021-04-23 | 2021-07-30 | 西安交通大学 | User clustering method and system combining interference suppression in fog wireless access network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114363988A (en) | 2022-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109710405B (en) | Block chain intelligent contract management method and device, electronic equipment and storage medium | |
| CN108960797B (en) | Block generation and verification method, device, equipment and storage medium | |
| CN112558875B (en) | Data verification method and device, electronic equipment and storage medium | |
| CN111752691B (en) | Method, device, equipment and storage medium for sorting AI (advanced technology attachment) calculation graphs | |
| CN114363988B (en) | Clustering method and device and electronic equipment | |
| CN114172819B (en) | Method, system, electronic equipment and storage medium for predicting demand resources of NFV network element | |
| CN112433844B (en) | Resource allocation method, system, equipment and computer readable storage medium | |
| CN113347238A (en) | Message partitioning method, system, device and storage medium based on block chain | |
| CN107797758B (en) | Date storage method, data access method and device | |
| CN116367223B (en) | XR service optimization method and device based on reinforcement learning, electronic equipment and storage medium | |
| CN112835691A (en) | Edge data processing method and system for communication of Internet of things | |
| CN112527559A (en) | Internet of things data backup method and device | |
| CN115840649A (en) | Method and device for allocating partitioned capacity block type virtual resources, storage medium and terminal | |
| CN115189910A (en) | Network digital twin-based deliberate attack survivability evaluation method | |
| CN114115818A (en) | Micro-service dividing method, device, equipment and medium | |
| CN109189746B (en) | Method, device, equipment and storage medium for realizing universal stream type Shuffle engine | |
| CN115987998B (en) | Micro-service system leader election method, system, storage medium and electronic equipment | |
| CN114528893A (en) | Machine learning model training method, electronic device and storage medium | |
| CN102253940B (en) | Method and device for processing data by tree view | |
| CN112181604B (en) | Capacity-shrinking target selection method and device | |
| CN113079179B (en) | Efficient block chain consensus method, system, computer equipment and storage medium | |
| CN116755866B (en) | Resource scheduling method and device, electronic equipment and readable storage medium | |
| CN117519996B (en) | Data processing method, device, equipment and storage medium | |
| CN114372238B (en) | Distributed state estimation method | |
| CN113778764B (en) | Hbase data dual-activity system and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |