Clustering method and device for pure directional self-organizing network

Abstract

The application provides a clustering networking method and device for pure directional self-organizing networks, and relates to the technical field of networks, wherein the method comprises the following steps: initializing nodes, dividing the nodes into clusters through a clustering and cluster head consensus mechanism, and selecting cluster head nodes of the clusters; constructing a star network with each cluster head node as a center node through a fast networking mechanism combining wide and narrow beams; and in response to the cluster head nodes being unable to continue to serve as cluster heads, reselecting cluster head nodes and reconstructing the network. By determining the cluster head nodes and constructing the star network, the robustness, invulnerability and communication efficiency of the network are improved. The directional antenna is adopted to improve the network capacity and communication distance, to enhance the concealment, security and anti-interference capability, and to ensure certain robustness and invulnerability.

Description

Technical Field

[0001] This application relates to the field of network technology, and in particular to a clustering networking method and apparatus for purely directional self-organizing networks. Background Technology

[0002] Wireless ad hoc networks can be divided into two categories: centralized and decentralized. Centralized wireless ad hoc networks are easy to implement, but they rely too heavily on a central node, resulting in insufficient robustness and resilience. Decentralized networks, while having high robustness, require additional consensus mechanisms and convergence time to achieve consistency among network nodes, making them difficult to meet the needs of highly dynamic and low-latency scenarios. Summary of the Invention

[0003] This application aims to at least partially address one of the technical problems in the related art.

[0004] Therefore, the first objective of this application is to propose a clustering networking method for purely directional self-organizing networks.

[0005] The second objective of this application is to provide an apparatus.

[0006] The third objective of this application is to propose an electronic device.

[0007] The fourth objective of this application is to provide a computer-readable storage medium.

[0008] The fifth objective of this application is to provide a computer program product.

[0009] To achieve the above objectives, the first aspect of this application proposes a clustering method for purely directional self-organizing networks, comprising:

[0010] Obtain the topology and voting information of all nodes in the network through a distributed topology consensus mechanism and a voting consensus mechanism;

[0011] The cluster head selection mechanism selects the preferred cluster head node that the current node deems capable of fulfilling its role.

[0012] The cluster head node is jointly elected through a voting consensus mechanism among the nodes.

[0013] Optionally, the distributed topology consensus mechanism and voting consensus mechanism include:

[0014] All nodes are in directional antenna wide-beam scanning and listening mode by default, and the number of directional antenna wide-beam sectors is set to k. c The transmission time for each frame is τ;

[0015] Set the antenna of the node in the listening state to the receiving state, every k cτ time switches to the next sector, after Time can traverse all sectors;

[0016] Control all the nodes with probability The process transitions from a listening state to a directional antenna wide-beam broadcast state, where N is the number of nodes in the entire network.

[0017] Set the antenna of the node in broadcast state to transmit state, and switch to the next sector every τ time intervals. Time can send broadcast frames to all listening nodes within the airspace at the furthest transmission distance; each Time is called a listening round or broadcast round, and each node continuously cycles through listening rounds and broadcast rounds.

[0018] Optionally, obtaining the network-wide node topology information and voting information through a distributed topology consensus mechanism and a voting consensus mechanism includes:

[0019] Controls nodes in broadcast state to continuously broadcast popular frames; node N i The popular frames of a broadcast contain consensus information G. i ;

[0020] G i ={g i A i B i b i}, where g i For identification information, A i It is node N i Corresponding topology information; B i Let b be the ticket box vector. i Let be the vote vector.

[0021] Optionally, the distributed topology consensus mechanism includes:

[0022] During the listening rounds, the control node discovers new topology information, updates its local topology information using the newly discovered topology information, and shares the local topology information during the broadcast rounds, ultimately achieving topology consensus among all nodes in the network.

[0023] Optionally, the step of selecting a preferred cluster head node that the current node deems capable through a cluster head selection mechanism includes:

[0024] For node N i Each neighbor node N j ∈Vi, calculate Where V i and V j Represents node N i and node N jThe set of neighboring nodes, w k Represents node N j To node N k The weights;

[0025] W j Sort in descending order and take the first S values ​​W. j1 W j2 , ..., W jS As the preferred cluster head node Where S represents the number of clusters, which can be expressed by the formula Calculated; ||A||1 represents the total number of nodes in the entire network; C max Indicates the maximum capacity of each cluster; This represents the preferred cluster head set.

[0026] Optionally, the final cluster head node is selected through a voting consensus mechanism among the nodes, including:

[0027] The control node receives the latest ballot vector during the listening round and updates its local ballot vector using the latest ballot vector and new votes.

[0028] Control nodes share their local ballot vectors during broadcast rounds, ultimately achieving voting consensus among all nodes in the network;

[0029] According to the consensus information G i The ticket box vector B i Count the number of votes for each node and sort the nodes in descending order of the number of votes;

[0030] The first S nodes are selected as preferred cluster head nodes and become the final cluster head nodes.

[0031] Optionally, constructing a star network with each of the cluster head nodes as the central node includes:

[0032] The cluster head node is controlled to perform wide-beam calling and traverse to select sectors. And send a summon frame in this sector, For all wide-beam sectors;

[0033] Control ordinary nodes to perform wide-beam fast scanning, scan and select cluster head nodes that are being summoned in the surrounding airspace, and traverse the selected sectors. And listen in this sector, the ordinary node being any node other than the cluster head node;

[0034] After the cluster head node completes wide-beam calling, it performs wide-beam alignment and traverses the selected sectors. Send an alignment frame in this sector and wait for a reply. Once a reply alignment frame is received, the wide beam alignment is considered successful, and the wide beam is added to the set.

[0035] Control the ordinary node in the sector Upon receiving a call frame, immediately stop traversing and perform wide beam alignment in this sector, switch to listening mode to wait for an alignment frame, and immediately return an alignment frame once an alignment frame is received;

[0036] After the cluster head node completes wide beam alignment, it performs narrow beam summoning and traverses the set. Each wide beam in the spectrum, and the set of all narrow beams within the coverage area of ​​the wide beam are: Traverse and select sectors And send a summon frame in this sector;

[0037] After the ordinary node completes the wide beam alignment, in the wide beam... Narrow beam fast scanning within the range, wide beam The set of all narrow beams within the coverage area is Traverse and select sectors And listen in this sector;

[0038] After the cluster head node completes narrow beam calling, it performs narrow beam alignment and traverses the selected sectors. Send an alignment frame in this sector and wait for a reply. Once a reply alignment frame is received, the narrow beam alignment is considered successful.

[0039] Control the ordinary node in the sector Upon receiving a call frame, the traversal immediately stops and narrow beam alignment is performed in this sector. It then switches to listening mode to wait for an alignment frame. Once an alignment frame is received, an alignment frame is immediately returned, and the ordinary node and the cluster head node are aligned.

[0040] Optionally, the step of responding to the cluster head node being unable to continue serving as the cluster head, reselecting a cluster head node and reconstructing the network includes:

[0041] The ordinary nodes and their corresponding cluster head nodes are periodically maintained.

[0042] If the periodic maintenance of ordinary nodes and cluster head nodes fails and cannot be recovered by conventional means, then the cluster head node is determined to be damaged or interfered with.

[0043] The ordinary nodes are controlled to reassign nodes to each cluster and select the cluster head node of each cluster. Through a fast networking mechanism combining wide and narrow beams, a star network with each cluster head as the central node is constructed.

[0044] To achieve the above objectives, a second aspect of this application provides a clustering networking device for purely directional self-organizing networks, comprising:

[0045] The cluster head selection module is used to initialize nodes, and through the clustering and cluster head consensus mechanism, it assigns nodes to various clusters and selects the cluster head node for each cluster.

[0046] The networking module is used to construct a star network with each cluster head node as the central node through a fast networking mechanism that combines wide and narrow beams;

[0047] The correction module is used to reselect a new cluster head node and reconstruct the network in response to the cluster head node being unable to continue serving as the cluster head.

[0048] To achieve the above objectives, a third aspect of this application provides an electronic device, including: a processor, and a memory communicatively connected to the processor;

[0049] The memory stores computer-executed instructions;

[0050] The processor executes computer execution instructions stored in the memory to implement the method as described in any one of the first aspects.

[0051] To achieve the above objectives, a fourth aspect of this application provides a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, are used to implement the method as described in any one of the first aspects.

[0052] To achieve the above objectives, a fifth aspect of this application provides a computer program product that, when executed by a processor, implements the method described in any one of the first aspects.

[0053] The clustering networking method, apparatus, electronic equipment, and storage medium provided in this application for purely directional self-organizing networks improve network robustness, survivability, and communication efficiency by determining the cluster head node and constructing a star network. The use of directional antennas increases network capacity and communication distance, enhancing concealment, security, and anti-interference capabilities while also ensuring a certain level of robustness and survivability.

[0054] Additional aspects and advantages of this application will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of this application. Attached Figure Description

[0055] The above and / or additional aspects and advantages of this application will become apparent and readily understood from the following description of the embodiments taken in conjunction with the accompanying drawings, wherein:

[0056] Figure 1 A schematic flowchart illustrating a clustering and networking method for purely directional self-organizing networks provided in an embodiment of this application;

[0057] Figure 2This is a schematic diagram of the clustering and cluster head consensus mechanism according to an embodiment of the present invention;

[0058] Figure 3 This is a flowchart of a fast networking mechanism combining wide / narrow beams according to an embodiment of the present invention;

[0059] Figure 4 This is a schematic diagram of a star network with each cluster head as the central node according to an embodiment of the present invention;

[0060] Figure 5 This is a schematic diagram of a clustering and networking device for purely directional self-organizing networks provided in an embodiment of this application. Detailed Implementation

[0061] The embodiments of this application are described in detail below. Examples of these embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and intended to explain this application, and should not be construed as limiting this application.

[0062] Distributed cluster collaboration is a typical working mode for unmanned aerial vehicles (UAVs), unmanned vehicles, and other unmanned vehicles. Wireless ad hoc networks provide communication capabilities between distributed nodes in the distributed cluster.

[0063] Traditional wireless ad hoc networks use omnidirectional antennas, which have a wide coverage area, low equipment cost, and mature and simple existing network protocols. However, omnidirectional antennas have shortcomings in terms of communication distance, energy efficiency, electromagnetic concealment, anti-interference ability, and anti-interception ability.

[0064] Thanks to advancements in antenna technology, the use of directional antennas in wireless ad hoc networks can significantly improve network capacity, increase communication distance, and enhance concealment, security, and anti-interference capabilities.

[0065] Current directional ad hoc networks mostly employ a combination of directional and omnidirectional antennas, with the omnidirectional channel providing necessary auxiliary information for the directional channel. This incurs additional costs and fails to completely eliminate the drawbacks of the omnidirectional antenna. Pure directional ad hoc networks completely abandon the dependence on the omnidirectional channel, maximizing the advantages of directional antennas, but also posing greater challenges to network protocol design.

[0066] Wireless ad hoc networks can be divided into two categories: centralized and decentralized. Centralized wireless ad hoc networks are easy to implement, but their over-reliance on a central node results in insufficient robustness and resilience. Decentralized networks, while offering higher robustness, require additional consensus mechanisms and convergence time to achieve consensus among network nodes. For scenarios with high dynamics and low latency requirements, such as unmanned vehicles, these costs are intolerable; especially for networks using purely directional antennas, the "deafness problem" makes implementing traditional consensus mechanisms extremely difficult.

[0067] To address this issue, embodiments of this application provide a clustering networking method for purely directional self-organizing networks. Figure 1 This is a flowchart illustrating a clustering and networking method for purely directional self-organizing networks provided in an embodiment of this application. Figure 1 As shown, the method includes the following steps:

[0068] Step 101: Initialize the nodes. Through the clustering and cluster head consensus mechanism, the nodes are assigned to various clusters and the cluster head node of each cluster is selected.

[0069] Step 102: Construct a star network with each cluster head node as the central node through a fast networking mechanism that combines wide and narrow beams;

[0070] Step 103: In response to the cluster head node being unable to continue serving as the cluster head, a new cluster head node is selected and the network is reconstructed.

[0071] Optionally, step 101, through clustering and cluster head consensus mechanisms, assigns nodes to various clusters and selects the cluster head node for each cluster, including:

[0072] Step 201: Obtain the topology information and voting information of all network nodes through the distributed topology consensus mechanism and the voting consensus mechanism;

[0073] Step 202: Select the preferred cluster head node that this node deems capable through the cluster head selection mechanism;

[0074] Step 203: Through the voting consensus mechanism of each node, the cluster head node is jointly selected.

[0075] Optionally, the distributed topology consensus mechanism and voting consensus mechanism in step 201 include:

[0076] All nodes are in directional antenna wide-beam scanning and listening mode by default, and the number of directional antenna wide-beam sectors is set to k. c The transmission time for each frame is τ;

[0077] Set the antenna of the node in the listening state to the receiving state, every k c τ time switches to the next sector, after Time can traverse all sectors;

[0078] Control all the nodes with probability The process transitions from a listening state to a directional antenna wide-beam broadcast state, where N is the number of nodes in the entire network.

[0079] Set the antenna of the node in broadcast state to transmit state, and switch to the next sector every τ time intervals. Time can send broadcast frames to all listening nodes within the airspace at the furthest transmission distance;

[0080] Every Time is called a listening round or broadcast round, and each node continuously cycles through listening rounds and broadcast rounds.

[0081] Optionally, step 201 obtains the topology information and voting information of all network nodes through a distributed topology consensus mechanism and a voting consensus mechanism, including:

[0082] The node in the broadcast state is controlled to continuously broadcast popular frames (Gossip frames), node N i The popular frames of a broadcast contain consensus information G. i ;

[0083] G i ={g i A i B i b i}, where g i For identification information, A i It is node N i Corresponding topology information; B i Let b be the ticket box vector. i Let g be the vote vector. i It is a scalar, used as a label to avoid G. i It is received repeatedly, and its value increments by 1 at the beginning of each broadcast round.

[0084] Preferably, node N is in a listening state. r Continuously listen for Gossip frames, via g i Filter out duplicate consensus information. If g i (t)=g i (t-1), then discard G i Otherwise, retain it as a valid G. i .

[0085] Optionally, the distributed topology consensus mechanism includes: a control node discovering new topology information in a listening round, updating its local topology information using the newly discovered topology information, and the control node sharing its local topology information in a broadcast round, ultimately achieving topology consensus among all nodes in the network.

[0086] Preferably, node N is in a listening state. r To obtain a valid G i Then, using A i Update A r The update method is as follows: Among them, A r and A i It is node N r and node N i A known adjacency matrix represents the known topological information of the nodes; operators This indicates a fusion operation; here, the max() function is used to select the larger value of the matrix elements. r It is a and A r A matrix of the same shape, representing nodes N r The resulting increment. Specifically, if node N r With node N i There has been no prior communication, meaning there are no edges (N) in the topological undirected graph. i N j ), that is (A r ) r，i =(A r ) i，r =0, then node N r First time with N i After communication, a new edge (N) will be added. i N j ), that is, let (a r ) r，i =(a r ) i，r = w. w is the edge weight, which can be the signal-to-noise ratio (SNR) of this reception.

[0087] Preferably, the "node N in the listening state" r To obtain a valid G i Then, using A i Update A r "It will eventually converge and reach a consensus with each round of listening. A" r The convergence value A r =A consensus It equals the adjacency matrix of all nodes in the network.

[0088] In the phrase "finally converges and reaches consensus with each round of listening", A r The convergence criterion is: if ||A r (t)||1=||A r If (t-1)||1, then A is considered to be... r In t con It converges at time T. That is, if at time T max Within a time period, A r If no new edges are added, then A is considered to be... r Convergence. The T... max Indicates the maximum convergence time. Where T delta Indicates the time difference between the earliest and latest entry into the consensus mechanism; Δ G The value represents the network radius; α represents the significance level, which is usually taken as 0.1 or 0.05.

[0089] Preferably, all nodes are in A r The convergence value A r =A consensus This equals the adjacency matrix of all nodes in the network. Once the distributed topology consensus is reached, the distributed voting consensus mechanism begins. Each node initially holds N votes. B In each broadcast round, a node selects a preferred cluster head from its neighbors and casts its vote. A node stops voting once it has zero votes. r The nodes will eventually converge and reach a consensus, and the preferred cluster head node will become the cluster head node.

[0090] Optionally, step 202 selects a preferred cluster head node that the current node deems capable through a cluster head selection mechanism, including:

[0091] For node N i Each neighbor node N j ∈Vi, calculate Where V i and V j Represents node N i and node N j The set of neighboring nodes, w k Represents node N j To node N k The weights;

[0092] W j Sort in descending order and take the first S values ​​W. j1 W j2 , ..., W jS As the preferred cluster head node Where S represents the number of clusters, which can be expressed by the formula Calculated; ||A||1 represents the total number of nodes in the entire network; C max Indicates the maximum capacity of each cluster; This represents the preferred cluster head set.

[0093] Figure 2 This is a schematic diagram of the clustering and cluster head consensus mechanism according to an embodiment of the present invention, as shown below. Figure 2 As shown, step 203, through a voting consensus mechanism among the nodes, jointly selects the final cluster head node, including:

[0094] The process of electing the final cluster head node through a consensus voting mechanism among the nodes includes:

[0095] The control node receives the latest ballot vector during the listening round and updates its local ballot vector using the latest ballot vector and new votes.

[0096] Control nodes share their local ballot vectors during broadcast rounds, ultimately achieving voting consensus among all nodes in the network;

[0097] According to the consensus information G i The ticket box vector B i Count the number of votes for each node and sort the nodes in descending order of the number of votes;

[0098] The first S nodes are selected as preferred cluster head nodes and become the final cluster head nodes.

[0099] Preferably, after the node selects the preferred cluster head node from its neighboring nodes, it casts its vote. Specifically, node N... i New ballot b i If N j If it is the preferred cluster head node, then let (b i ) j It is 1, that is:

[0100]

[0101] Preferably, nodes in broadcast mode continuously broadcast Gossip frames. Node N i The broadcast Gossip frame contains consensus information G i ={g i A i B i b i}. Where g i It is a scalar, used as a label to avoid G. i It is repeatedly received, increments by 1 at the beginning of each broadcast round, and remains unchanged during the broadcast round; B i The vote counting information is represented in vector form (called the ticket box vector), B i The element (B) i ) j Represents node N j Number of votes received; b iThe voting information is represented in vector form (called the vote vector), b i element (b) i ) j This indicates that in this broadcast round, node N i Projected to node N j The number of votes.

[0102] Preferably, node N is in a listening state. r Continuously listen for Gossip frames, via g i Filter out duplicate consensus information. If g i (t)=g i (t-1), then discard G i Otherwise, retain it as a valid G. i .

[0103] Preferably, node N is in a listening state. r To obtain a valid G i Then, using B i and b i Update B r The update method is as follows: Among them, B r and B i It is node N r and node N i Known ticket box vector; operators This indicates a fusion operation; the `max()` function is used here to select the larger value of the vector elements. i It is a and B i A vector of the same shape, representing node N i The resulting increment, specifically, b i element (b) i ) j Represents node N i Newly allocated to node N j The number of votes.

[0104] Preferably, the "node N in the listening state" r To obtain a valid G i Then, using B i and b i Update B r "It will eventually converge and reach a consensus with each round of listening." (B) r The convergence value B r =B consensus The result is equivalent to a vote across the entire network; the node selected as the cluster head will become the cluster head node. The specific method is as follows: (Vote Box B) i The S nodes with the most votes can become cluster heads.

[0105] Figure 3The flowchart of the fast networking mechanism combining wide / narrow beams according to an embodiment of the present invention is as follows: Figure 3 Step 102, as shown, constructs a star network with each cluster head node as the central node, including:

[0106] Step 301: Control the cluster head node to perform wide-beam calling and traverse and select sectors. And send a call frame in this sector; the time interval for the cluster head node to traverse each sector is τ, and the total duration of the wide-beam call is T. WH This behavior aims to draw the attention of other nodes within the cluster by sending a call frame across the entire airspace. For all wide-beam sectors;

[0107] Step 302: Control the ordinary nodes to perform wide-beam fast scanning, scan and select cluster head nodes that are being summoned in the surrounding airspace, and traverse the selected sectors. And listen in this sector, the ordinary node being any node other than the cluster head node;

[0108] In this embodiment, preferably, ordinary nodes perform wide-beam fast scanning to scan the surrounding airspace for any cluster head nodes that are currently being summoned. Specifically, ordinary nodes traverse and select sectors. And listen in this sector. The time interval for a normal node to traverse each sector is k. c τ, the total duration of wide-beam fast scanning is T WS Once in the sector Upon receiving a call frame, immediately stop traversing and perform wide beam alignment in this sector. If no call node is found, repeat this process until a timeout occurs.

[0109] Step 303: After the cluster head node completes wide beam calling, it performs wide beam alignment and traverses the selected sectors. Send an alignment frame in this sector and wait for a reply. Once a reply alignment frame is received, the wide beam alignment is considered successful, and the wide beam is added to the set.

[0110] Step 304: Control the ordinary node in the sector Upon receiving a call frame, immediately stop traversing and perform wide-beam alignment in this sector, then switch to listening mode and wait for the alignment frame; the specific method is as follows: the cluster head node traverses and selects the sector. Send an alignment frame in this sector and wait for a reply. The time interval for the cluster head node to traverse each sector is C. max τ. Once in the sector Upon receiving an alignment frame from a regular node, immediately return an alignment frame and add this sector to the set. Cluster head node traversed That is, it ends, with a total duration of

[0111] Preferably, once a normal node is in a sector Upon receiving a call frame, immediately stop traversing and perform wide beam alignment in this sector. Specifically, for ordinary nodes in the sector... Switch to listen mode and wait for an alignment frame. Once an alignment frame is received from the cluster head node, immediately return an alignment frame. Before returning an alignment frame, a backoff operation can be performed based on the node number to avoid collisions.

[0112] Step 305: After the cluster head node completes wide beam alignment, it performs narrow beam summoning and traverses the set. Each wide beam in the spectrum, and the set of all narrow beams within the coverage area of ​​the wide beam are: Traverse and select sectors And send a summon frame in this sector;

[0113] Preferably, after the cluster head node completes wide beam alignment, it iterates through each successfully aligned wide beam and performs narrow beam calling within the wide beam range. Specifically, the cluster head node iterates through the set... Select sector Get the set f() maps a wide beam to a set of narrow beams covering the same range. The cluster head node traverses and selects sectors. And send a summon frame in this sector.

[0114] Step 306: After controlling the ordinary node to complete wide beam alignment, in the wide beam... Narrow beam fast scanning within the range, wide beam The set of all narrow beams within the coverage area is Traverse and select sectors And listen in this sector;

[0115] Preferably, after the ordinary node completes wide beam alignment, it performs a narrow beam fast scan within this wide beam range. Specifically, the ordinary node acquires the set... Traverse and select sectors And listen in this sector. Once in the sector Upon receiving a call frame, immediately stop traversing and perform narrow beam alignment in this sector.

[0116] Step 307: After the cluster head node completes narrow beam calling, it performs narrow beam alignment and traverses the selected sectors. The alignment frame is sent within this sector and a reply is awaited. Once a reply alignment frame is received, the narrow beam alignment is considered successful. The specific method is as follows: the cluster head node traverses and selects sectors. Send an alignment frame in this sector and wait for a reply. Once in the sector... Received from ordinary node N i If the alignment frame is returned, then narrow beam alignment is successful. Sector N is marked as a normal node i The sector in question.

[0117] Step 308: Control the ordinary node in the sector Upon receiving a call frame, the traversal immediately stops and narrow-beam alignment is performed in this sector. It switches to listen mode to wait for an alignment frame. Once an alignment frame is received, it immediately returns one, completing the alignment between the ordinary node and the cluster head node. The specific method is as follows: the ordinary node in the sector... Switch to listen mode and wait for an alignment frame. Once an alignment frame is received from the cluster head node, immediately return an alignment frame. Before returning an alignment frame, a backoff operation can be performed based on the node number to avoid collisions. Sector The sector marked as the cluster head node.

[0118] Figure 4 This is a schematic diagram of a star network with each cluster head as the central node according to an embodiment of the present invention, such as... Figure 4 As shown, after the above process, the ordinary nodes in the cluster will be precisely aligned with the cluster head node, thus forming a star network.

[0119] Optionally, step 103, in response to the cluster head node being unable to continue serving as the cluster head, involves reselecting a cluster head node and reconstructing the network, including:

[0120] The ordinary nodes and their corresponding cluster head nodes are periodically maintained.

[0121] If the periodic maintenance of ordinary nodes and cluster head nodes fails and cannot be recovered by conventional means, then the cluster head node is determined to be damaged or interfered with.

[0122] The ordinary nodes are controlled to reassign nodes to each cluster and select the cluster head node of each cluster. Through a fast networking mechanism combining wide and narrow beams, a star network with each cluster head as the central node is constructed.

[0123] Optionally, in step 103, in response to the cluster head node being unable to continue serving as the cluster head, a new cluster head node is selected and the network is reconstructed.

[0124] In this embodiment, after the ordinary nodes and the cluster head node form a star network, they maintain periodic maintenance with the cluster head node. If the periodic maintenance of the ordinary nodes and the cluster head node fails and cannot be recovered by conventional means, the cluster head node is considered to be damaged or disturbed.

[0125] Preferably, the ordinary nodes will re-execute the "clustering and cluster head consensus mechanism to assign nodes to each cluster and select the cluster head node of each cluster" and the "after each cluster selects the cluster head node, a star network with each cluster head as the central node is constructed through a fast networking mechanism combining wide / narrow beams".

[0126] To implement the above embodiments, this application also proposes a clustering networking device for purely directional self-organizing networks. Figure 5 This is a schematic diagram of a clustering networking device for purely directional self-organizing networks, provided as an embodiment of this application. Figure 5 As shown, the device includes:

[0127] The cluster head selection module 510 is used to initialize nodes, assign nodes to various clusters and select the cluster head node of each cluster through the clustering and cluster head consensus mechanism.

[0128] The networking module 520 is used to construct a star network with each cluster head node as the central node through a fast networking mechanism that combines wide and narrow beams.

[0129] The correction module 530 is used to reselect a cluster head node and reconstruct the network in response to the cluster head node being unable to continue serving as the cluster head.

[0130] To implement the above embodiments, this application also proposes an electronic device, including: a processor and a memory communicatively connected to the processor; the memory stores computer execution instructions; the processor executes the computer execution instructions stored in the memory to implement the method provided in the foregoing embodiments.

[0131] To implement the above embodiments, this application also proposes a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, are used to implement the methods provided in the foregoing embodiments.

[0132] To implement the above embodiments, this application also proposes a computer program product, including a computer program that, when executed by a processor, implements the methods provided in the foregoing embodiments.

[0133] The collection, storage, use, processing, transmission, provision, and disclosure of user personal information involved in this application all comply with the provisions of relevant laws and regulations and do not violate public order and good morals.

[0134] It should be noted that personal information collected from users should be used for legitimate and reasonable purposes and should not be shared or sold outside of these legitimate uses. Furthermore, such collection / sharing should only be conducted after receiving the user's informed consent, including but not limited to notifying the user to read the user agreement / user notice and sign an agreement / authorization that includes authorization of relevant user information before the user uses the function. In addition, any necessary steps must be taken to protect and safeguard access to such personal information data and ensure that others with access to personal information data comply with their privacy policies and procedures.

[0135] This application is intended to provide an implementation scheme for users to selectively prevent the use or access to their personal information data. Specifically, this disclosure is intended to provide hardware and / or software to prevent or block access to such personal information data. Once personal information data is no longer needed, risks can be minimized by restricting data collection and deleting data. Furthermore, where applicable, such personal information is de-identified to protect user privacy.

[0136] In the foregoing descriptions of the embodiments, the terms "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., refer to specific features, structures, materials, or characteristics described in connection with that embodiment or example, which are included in at least one embodiment or example of this application. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of different embodiments or examples.

[0137] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this application, "multiple" means at least two, such as two, three, etc., unless otherwise explicitly specified.

[0138] Any process or method description in the flowchart or otherwise herein can be understood as representing a module, segment, or portion of code comprising one or more executable instructions for implementing custom logic functions or processes, and the scope of the preferred embodiments of this application includes additional implementations in which functions may be performed not in the order shown or discussed, including substantially simultaneously or in reverse order depending on the functions involved, as should be understood by those skilled in the art to which embodiments of this application pertain.

[0139] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as a sequenced list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by, or in conjunction with, an instruction execution system, apparatus, or device (such as a computer-based system, a processor-included system, or other system that can fetch and execute instructions from, an instruction execution system, apparatus, or device). For the purposes of this specification, "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transmit programs for use by, or in conjunction with, an instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of computer-readable media include: an electrical connection having one or more wires (electronic device), a portable computer disk drive (magnetic device), random access memory (RAM), read-only memory (ROM), erasable and editable read-only memory (EPROM or flash memory), fiber optic devices, and portable optical disc read-only memory (CDROM). Alternatively, the computer-readable medium may be paper or other suitable media on which the program can be printed, since the program can be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, interpreting, or otherwise processing as necessary, and then stored in a computer memory.

[0140] It should be understood that various parts of this application can be implemented using hardware, software, firmware, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented using software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware as in another embodiment, it can be implemented using any one or a combination of the following techniques known in the art: discrete logic circuits having logic gates for implementing logical functions on data signals, application-specific integrated circuits (ASICs) having suitable combinational logic gates, programmable gate arrays (PGAs), field-programmable gate arrays (FPGAs), etc.

[0141] Those skilled in the art will understand that all or part of the steps of the methods in the above embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, the program includes one or a combination of the steps of the method embodiments.

[0142] Furthermore, the functional units in the various embodiments of this application can be integrated into a processing module, or each unit can exist physically separately, or two or more units can be integrated into a module. The integrated module can be implemented in hardware or as a software functional module. If the integrated module is implemented as a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium.

[0143] The storage medium mentioned above can be a read-only memory, a disk, or an optical disk, etc. Although embodiments of this application have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting this application. Those skilled in the art can make changes, modifications, substitutions, and variations to the above embodiments within the scope of this application.

Claims

1. A clustering and networking method for purely directional self-organizing networks, characterized in that, Includes the following steps: The node is initialized, and the topology and voting information of all nodes in the network are obtained through the distributed topology consensus mechanism and the voting consensus mechanism; the preferred cluster head node is selected by the node through the cluster head selection mechanism; and the cluster head node is jointly selected by the voting consensus mechanism of all nodes. A star network is constructed with each cluster head node as the central node through a fast networking mechanism that combines wide and narrow beams. In response to the cluster head node being unable to continue serving as the cluster head, a new cluster head node is selected and the network is reconstructed; The distributed topology consensus mechanism and voting consensus mechanism include: All nodes are in directional antenna wide-beam scanning and listening mode by default. The number of directional antenna wide-beam sectors is set to [value missing]. The transmission time for each frame is ; Set the antenna of the node in the listening state to receive state, every [time period]. Time switches to the next sector, passing through Time can traverse all sectors; Control all the nodes with probability The system transitions from a listening state to a directional antenna wide-beam broadcast state, in which... This represents the total number of nodes in the entire network. Set the antenna of the node in broadcast state to transmit state every [time period]. Time switches to the next sector, passing through Time can send broadcast frames to all listening nodes within the airspace at the furthest transmission distance; each Time is called a listening round or a broadcast round, and each node continuously cycles through listening rounds and broadcast rounds; The process of obtaining network-wide node topology information and voting information through a distributed topology consensus mechanism and a voting consensus mechanism includes: Controls nodes in broadcast mode to continuously broadcast popular frames. The popular frames of a broadcast contain consensus information. ; ,in, For identification information, It is a node Corresponding topology information; Let the ticket box vector be... Let be the vote vector. It is a scalar, used as a label to avoid Received repeatedly, incrementing by 1 at the start of each broadcast round; among them, nodes in the listening state... Continuously listen for Gossip frames, through Filter out duplicate consensus information, if Then discard Otherwise, it will be retained as valid. The distributed topology consensus mechanism includes: During the listening rounds, control nodes discover new topology information, update their local topology information using this new information, and share this local topology information during the broadcast rounds, ultimately achieving topology consensus among all nodes in the network. Among these, nodes in the listening state... Get an effective Then, using renew The update method is as follows: ,in, and It is a node and nodes A known adjacency matrix represents the known topological information of the nodes; operators This indicates a fusion operation; the option selected here is... The function represents retrieving the larger value of a matrix element; It is and Isomorphic matrices, representing nodes The increment generated; if the node With nodes There has been no prior communication, meaning there are no edges in the topological undirected graph. , that is Then the node First time with After communication, a new edge will be added. , that is to say For edge weights, the signal-to-noise ratio (SNR) received this time can be used as the edge weight; the "node in listening state" Get an effective Then, using renew "It will eventually converge and reach a consensus with each round of listening." convergence value This is equal to the adjacency matrix of all nodes in the network. The process of cyclical convergence and consensus reached during successive rounds of listening is described. The convergence criterion is: if Then it is believed exist Convergence, that is, if in Within a time period, If no new edges are added, then it is considered... Convergence, the Indicates the maximum convergence time. ,in This indicates the time difference between the earliest and latest participants entering the consensus mechanism; Indicates the network radius; The significance level is indicated by a value of 0.1 or 0.05; all nodes are listed in the [reference needed]. convergence value This equals the adjacency matrix of all nodes in the network. After the distributed topology consensus is reached, the distributed voting consensus mechanism begins, with each node initially holding a certain number of votes. In each broadcast round, a node selects a preferred cluster head node from its neighbors and casts its vote. A node stops voting once it has zero votes. The cluster will eventually converge and reach a consensus, and the preferred cluster head node will become the cluster head node. The process of electing the final cluster head node through a consensus voting mechanism among the nodes includes: The control node receives the latest ballot vector during the listening round and updates its local ballot vector using the latest ballot vector and new votes. Control nodes share their local ballot vectors during broadcast rounds, ultimately achieving voting consensus among all nodes in the network; According to the consensus information The ticket box vector Count the number of votes for each node and sort the nodes in descending order of the number of votes; Before One node is selected as the preferred cluster head node and becomes the final cluster head node.

2. The method according to claim 1, characterized in that, The process of selecting a preferred cluster head node that the current node deems suitable through a cluster head selection mechanism includes: For nodes Each neighbor node ,calculate ,in and Represents a node and nodes The set of neighboring nodes, Represents a node To node The weights; Will Sort in descending order and take the first few. Value As the preferred cluster head node ;in, The number of clusters can be expressed by the formula Calculated; ; Indicates the total number of nodes in the network; Indicates the maximum capacity of each cluster; This represents the preferred cluster head set.

3. The method according to claim 1, characterized in that, The construction of a star network with each of the cluster head nodes as the central node includes: The cluster head node is controlled to perform wide-beam calling and traverse to select sectors. And send a summon frame in this sector. For all wide-beam sectors; Control ordinary nodes to perform wide-beam fast scanning, scan and select cluster head nodes that are being summoned in the surrounding airspace, and traverse the selected sectors. And listen in this sector, the ordinary node being any node other than the cluster head node; After the cluster head node completes wide-beam calling, it performs wide-beam alignment and traverses the selected sectors. In this sector, an alignment frame is sent and a reply is awaited. Once a reply alignment frame is received, the wide beam alignment is considered successful, and the wide beam is added to the set. ; Control the ordinary node in the sector Upon receiving a call frame, immediately stop traversing and perform wide beam alignment in this sector, switch to listening mode to wait for an alignment frame, and immediately return an alignment frame once an alignment frame is received; After the cluster head node completes wide-beam alignment, it performs narrow-beam summoning and traverses the set. Each wide beam in the spectrum, and the set of all narrow beams within the coverage area of ​​the wide beam are: Traverse and select sectors And send a summon frame in this sector; After the ordinary node completes the wide beam alignment, in the wide beam... Narrow beam fast scanning within the range, wide beam The set of all narrow beams within the coverage area is Traverse and select sectors And listen in this sector; After the cluster head node completes narrow beam calling, it performs narrow beam alignment and traverses the selected sectors. In this sector, an alignment frame is sent and a reply is awaited. Once a reply alignment frame is received, the narrow beam alignment is considered successful. Control the ordinary node in the sector Upon receiving a call frame, the traversal immediately stops and narrow beam alignment is performed in this sector. The system switches to listening mode to wait for an alignment frame. Once an alignment frame is received, an alignment frame is returned immediately, and the ordinary node and the cluster head node are aligned.

4. The method according to claim 3, characterized in that, The response to the cluster head node being unable to continue serving as the cluster head, reselecting a cluster head node and reconstructing the network, includes: The ordinary nodes and their corresponding cluster head nodes are periodically maintained. If the periodic maintenance of ordinary nodes and cluster head nodes fails and cannot be recovered by conventional means, then the cluster head node is determined to be damaged or interfered with. The ordinary nodes are controlled to reassign nodes to each cluster and select the cluster head node of each cluster. Through a fast networking mechanism combining wide and narrow beams, a star network with each cluster head as the central node is constructed.

5. A clustering networking device for purely directional self-organizing networks, characterized in that, include: The cluster head selection module is used to initialize nodes, obtain the topology and voting information of all nodes in the network through the distributed topology consensus mechanism and the voting consensus mechanism, select the preferred cluster head node that the current node deems capable through the cluster head selection mechanism, and jointly select the cluster head node through the voting consensus mechanism of each node. The networking module is used to construct a star network with each cluster head node as the central node through a fast networking mechanism that combines wide and narrow beams; The correction module is used to reselect a cluster head node and reconstruct the network in response to the cluster head node being unable to continue serving as the cluster head; The distributed topology consensus mechanism and voting consensus mechanism include: All nodes are in directional antenna wide-beam scanning and listening mode by default. The number of directional antenna wide-beam sectors is set to [value missing]. The transmission time for each frame is ; Set the antenna of the node in the listening state to receive state, every [time period]. Time switches to the next sector, passing through Time can be used to traverse all sectors; Control all the nodes with probability The system transitions from a listening state to a directional antenna wide-beam broadcast state, in which... This represents the total number of nodes in the entire network. Set the antenna of the node in broadcast state to transmit state every [time period]. Time switches to the next sector, passing through Time can send broadcast frames to all listening nodes within the airspace at the furthest transmission distance; each Time is called a listening round or a broadcast round, and each of the nodes continuously cycles through listening rounds and broadcast rounds; The process of obtaining network-wide node topology information and voting information through a distributed topology consensus mechanism and a voting consensus mechanism includes: Controls nodes in broadcast mode to continuously broadcast popular frames. The popular frames of a broadcast contain consensus information. ; ,in, For identification information, It is a node Corresponding topology information; Let the ticket box vector be... Let be the vote vector. It is a scalar, used as a label to avoid Received repeatedly, incrementing by 1 at the start of each broadcast round; among them, nodes in the listening state... Continuously listen for Gossip frames, through Filter out duplicate consensus information, if Then discard Otherwise, it will be retained as valid. The distributed topology consensus mechanism includes: During the listening rounds, control nodes discover new topology information, update their local topology information using this new information, and share this local topology information during the broadcast rounds, ultimately achieving topology consensus among all nodes in the network. Among these, nodes in the listening state... Get an effective Then, using renew The update method is as follows: ,in, and It is a node and nodes A known adjacency matrix represents the known topological information of the nodes; operators This indicates a fusion operation; the option selected here is... The function represents retrieving the larger value of a matrix element; It is and Isomorphic matrices, representing nodes The resulting increment, if the node With nodes There has been no prior communication, meaning there are no edges in the topological undirected graph. , that is Then the node First time with After communication, a new edge will be added. , that is to say , For edge weights, the signal-to-noise ratio (SNR) received this time can be used as the edge weight; the "node in listening state" Get an effective Then, using renew "It will eventually converge and reach a consensus with each round of listening." convergence value This is equal to the adjacency matrix of all nodes in the network. The process of cyclical convergence and consensus reached during successive rounds of listening is described. The convergence criterion is: if Then it is believed exist Convergence, that is, if in Within a time period, If no new edges are added, then it is considered... Convergence, the Indicates the maximum convergence time. ,in This indicates the time difference between the earliest and latest participants entering the consensus mechanism; Indicates the network radius; The significance level is indicated by a value of 0.1 or 0.05; all nodes are listed in the [reference needed]. convergence value This equals the adjacency matrix of all nodes in the network. After the distributed topology consensus is reached, the distributed voting consensus mechanism begins, with each node initially holding a certain number of votes. In each broadcast round, a node selects a preferred cluster head node from its neighbors and casts its vote. A node stops voting once it has zero votes. The nodes will eventually converge and reach a consensus, and the preferred cluster head node will become the cluster head node. The process of electing the final cluster head node through a consensus voting mechanism among the nodes includes: The control node receives the latest ballot vector during the listening round and updates its local ballot vector using the latest ballot vector and new votes. Control nodes share their local ballot vectors during broadcast rounds, ultimately achieving voting consensus among all nodes in the network; According to the consensus information The ticket box vector Count the number of votes for each node and sort the nodes in descending order of the number of votes; Before One node is selected as the preferred cluster head node and becomes the final cluster head node.

6. An electronic device, characterized in that, include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory to implement the method as described in any one of claims 1-4.

7. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the method as described in any one of claims 1-4.

8. A computer program product, characterized in that, Includes a computer program that, when executed by a processor, implements the method of any one of claims 1-4.

Images