Clustering networking method and device for pure directional self-organizing network

Abstract

The invention provides a clustering networking method and device for a pure directional self-organizing network, and relates to the technical field of networks, and the method comprises the steps: initializing nodes, classifying the nodes into each cluster through a clustering and cluster head consensus mechanism, and selecting a cluster head node of each cluster; constructing a star network by taking each cluster head node as a central node through a rapid networking mechanism combining wide and narrow beams; and in response to the situation that the cluster head node cannot continuously serve as the cluster head, reselecting the cluster head node and reconstructing the network. By determining the cluster head node and constructing the star network, the robustness, survivability and communication efficiency of the network are improved. By adopting the directional antenna, the network capacity and the communication distance are improved, and certain robustness and survivability are ensured while the concealment, the safety and the anti-interference capability are enhanced.

Description

Technical Field

[0001] The present application relates to the field of network technology, and in particular to a clustering networking method and device for a purely directional self-organizing network. Background Art

[0002] Wireless self-organizing networks can be divided into two categories: centralized and decentralized. Centralized wireless self-organizing networks are easy to implement, but the network is too dependent on central nodes, making the network robust and invulnerable. Although fully decentralized networks have higher robustness, they require additional consensus mechanisms and convergence time to achieve consistency among network nodes, making it difficult to meet scenarios with high dynamics and low latency requirements. Summary of the invention

[0003] The present application aims to solve one of the technical problems in the related art at least to some extent.

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

[0005] The second object of the present application is to provide a device.

[0006] The third objective of the present application is to provide an electronic device.

[0007] A fourth objective of the present application is to provide a computer-readable storage medium.

[0008] A fifth object of the present application is to provide a computer program product.

[0009] To achieve the above-mentioned purpose, the first embodiment of the present application proposes a clustering networking method for a purely directional self-organizing network, including:

[0010] Obtain the node topology information and voting information of the entire network through the distributed topology consensus mechanism and voting consensus mechanism;

[0011] Through the cluster head selection mechanism, the preferred cluster head node that this node considers competent is selected;

[0012] The cluster head node is jointly selected through the voting consensus mechanism of each node.

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

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

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

[0016] Control all the nodes with probability Transfer from the listening state to the 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 the broadcast state to the sending state, and switch to the next sector every τ time. The broadcast frame can be sent to all nodes in the listening state within the farthest transmission distance in the airspace at a time; The time is called a listening round or a broadcasting round, and each node continuously cycles the listening round and the broadcasting round.

[0018] Optionally, the obtaining of the node topology information and voting information of the entire network through the distributed topology consensus mechanism and the voting consensus mechanism includes:

[0019] Control the nodes in the broadcast state to continuously broadcast popular frames, node N i The broadcast popular frame contains the consensus information G i ;

[0020] G i = {g i , A i , B i , b i}, where g i A is the identification information. i is node N i Corresponding topological information; B i is the ballot box vector, b i is the ballot vector.

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

[0022] The control node discovers new topology information in the listening round and uses the newly discovered topology information to update the local topology information. The control node shares the local topology information in the broadcast round, and finally achieves topology consensus among all nodes in the network.

[0023] Optionally, the step of selecting a preferred cluster head node that the node considers competent 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 neighbor nodes, w k Represents node N j To Node N k The weight of

[0025] W j Sort in descending order, take the first S values ​​W j1 , W j2 , ..., W jS , as the preferred cluster head node Among them, S represents the number of clusters, which can be expressed by Calculate; ||A||1 indicates the number of nodes in the entire network; C max Indicates the maximum capacity of each cluster; Indicates the preferred cluster head set.

[0026] Optionally, the voting consensus mechanism of each node is used to jointly select the final cluster head node, including:

[0027] The control node receives the latest ballot box vector in the listening round and updates the local ballot box vector using the latest ballot box vector and the new vote;

[0028] The control nodes share the local ballot box vector in the broadcast round, and finally achieve the voting consensus of all nodes in the network;

[0029] According to the consensus information G i The ballot box vector B i , count the votes of each node and sort the nodes in descending order by the number of votes;

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

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

[0032] Control the cluster head node to perform wide beam calling and traverse the selected sectors And send a summon frame in this sector, is the set of all wide beam sectors;

[0033] Control the common nodes to perform wide beam fast scanning, scan and select the cluster head nodes being called in the surrounding airspace, and traverse the selected sectors And listen in this sector, the common node is a node other than the cluster head node;

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

[0035] Control the common nodes in the sector After receiving the summon frame, it immediately stops traversal and performs wide beam alignment in this sector, switches to listening mode to wait for the alignment frame, and returns an alignment frame immediately once the alignment frame is received;

[0036] After the wide beam alignment is completed, the cluster head node is controlled to perform narrow beam calling and traverse the set For each wide beam in, the set of all narrow beams within the coverage of the wide beam is Traverse the selected sectors And send a summon frame in this sector;

[0037] After controlling the common node to complete the wide beam alignment, Narrow beam fast scanning within the range, wide beam The set of all narrow beams within the coverage area is Traverse the selected sectors And listen in this sector;

[0038] After the narrow beam calling is completed, the cluster head node is controlled to perform narrow beam alignment and traverse the selected sectors. Send an alignment frame in this sector and wait for a reply. Once the reply alignment frame is received, it is considered that the narrow beam alignment is successful.

[0039] Control the common nodes in the sector After receiving the summon frame, it immediately stops traversal and performs narrow beam alignment in this sector, switches to the listening mode to wait for the alignment frame, and immediately returns an alignment frame once the alignment frame is received. The ordinary node completes the alignment with the cluster head node.

[0040] Optionally, in response to the cluster head node being unable to continue to serve as the cluster head, reselecting a cluster head node and reconstructing the network includes:

[0041] Controlling the common nodes and the corresponding cluster head nodes to maintain periodic maintenance;

[0042] If the periodic maintenance of the common nodes and the cluster head node fails and cannot be restored by conventional means, it is determined that the cluster head node is damaged or disturbed;

[0043] The common nodes are controlled to reclassify the nodes into clusters and select the cluster head node of each cluster, and a star network with the cluster head of each cluster as the central node is constructed through a fast networking mechanism combining wide / narrow beams.

[0044] To achieve the above-mentioned purpose, the second embodiment of the present application proposes a clustering networking device for a purely directional self-organizing network, including:

[0045] The cluster head selection module is used to initialize nodes, classify nodes into clusters and select the cluster head node of each cluster through clustering and cluster head consensus mechanism;

[0046] A networking module, used to build a star network with each of the cluster head nodes as a central node through a fast networking mechanism combining wide and narrow beams;

[0047] The correction module is used for reselecting a cluster head node and reconstructing the network in response to the cluster head node being unable to continue to serve as the cluster head.

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

[0049] The memory stores computer-executable instructions;

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

[0051] To achieve the above-mentioned purpose, the fourth aspect embodiment of the present application proposes a computer-readable storage medium, in which computer-readable storage medium is stored computer execution instructions, and when the computer execution instructions are executed by a processor, they are used to implement the method as described in any one of the first aspects.

[0052] To achieve the above-mentioned purpose, the fifth aspect of the present application proposes a computer program product, which implements any method in the first aspect when executed by a processor.

[0053] The clustering networking method, device, electronic device and storage medium for pure directional self-organizing network provided by the present application improve the robustness, anti-destruction and communication efficiency of the network by determining the cluster head node and building a star network. The use of directional antennas increases the network capacity and communication distance, enhances the concealment, security and anti-interference ability, and also ensures a certain robustness and anti-destruction.

[0054] Additional aspects and advantages of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through the practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0056] Figure 1 A schematic diagram of a flow chart of a clustering networking method for a purely directional self-organizing network provided in an embodiment of the present application;

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

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

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

[0060] Figure 5 A schematic diagram of the structure of a cluster networking device for a purely directional self-organizing network provided in an embodiment of the present application. DETAILED DESCRIPTION

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

[0062] Distributed cluster collaboration is a typical working mode of unmanned aerial vehicles / unmanned vehicles / and other unmanned vehicles. Wireless self-organizing networks provide distributed clusters with communication capabilities between distributed nodes.

[0063] Traditional wireless self-organizing networks use omnidirectional antennas, which have a wide coverage range, low equipment cost, and mature existing network protocols and are easy to implement. However, omnidirectional antennas have defects in communication distance, energy efficiency, electromagnetic concealment, anti-interference capability, and anti-interception capability.

[0064] Thanks to the development of antenna technology, the use of directional antennas in wireless self-organizing networks can greatly improve network capacity, increase communication distance, and improve concealment, security, and anti-interference capabilities.

[0065] The current directional antenna self-organizing network mostly uses a combination of directional antennas and omnidirectional antennas. The omnidirectional channel provides necessary auxiliary information for the directional channel, which will bring additional costs and cannot completely eliminate the disadvantages of omnidirectional antennas. Purely directional self-organizing networks completely abandon the reliance on omnidirectional channels, maximize the advantages of directional antennas, but also pose greater challenges to network protocol design.

[0066] Wireless self-organizing networks can be divided into two categories: centralized and decentralized. Centralized wireless self-organizing networks are easy to implement, but the network is too dependent on central nodes, making the network less robust and invulnerable. Although fully decentralized networks are more robust, they require additional consensus mechanisms and convergence time to achieve consistency among network nodes. For scenarios with high dynamics and low latency requirements such as unmanned vehicles, these costs are difficult to tolerate; especially for networks using purely directional antennas, the "deafness problem" makes it very difficult to implement traditional consensus mechanisms.

[0067] To address this problem, the present application provides a clustering networking method for a purely directional self-organizing network. Figure 1 The present invention provides a flow chart of a clustering networking method for a purely directional self-organizing network. Figure 1 As shown, the method comprises the following steps:

[0068] Step 101, initialize the nodes, classify the nodes into clusters and select the cluster head node of each cluster through clustering and cluster head consensus mechanism;

[0069] Step 102, building a star network with each cluster head node as a central node through a fast networking mechanism combining wide and narrow beams;

[0070] Step 103: In response to the cluster head node being unable to continue to serve as the cluster head, reselect a cluster head node and reconstruct the network.

[0071] Optionally, the step 101 classifies the nodes into clusters and selects the cluster head node of each cluster through clustering and cluster head consensus mechanism, including:

[0072] Step 201, obtaining the node topology information and voting information of the entire network through the distributed topology consensus mechanism and the voting consensus mechanism;

[0073] Step 202, selecting a preferred cluster head node that the node considers competent through a cluster head selection mechanism;

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

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

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

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

[0078] Control all the nodes with probability Transfer from the listening state to the 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 the broadcast state to the sending state, and switch to the next sector every τ time. The broadcast frame can be sent to all nodes in the listening state within the farthest transmission distance within the airspace;

[0080] Every The time is called a listening round or a broadcasting round, and each node continuously cycles the listening round and the broadcasting round.

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

[0082] Control the nodes in the broadcast state to continuously broadcast popular frames (Gossip frames), node N i The broadcast popular frame contains the consensus information G i ;

[0083] G i = {g i , A i , B i , b i}, where g i A is the identification information. i is node N i Corresponding topological information; B i is the ballot box vector, b i is the ballot vector. g i is a scalar used as a label to avoid G i It is received repeatedly and incremented by 1 at the beginning of each broadcast round.

[0084] Preferably, the node N in the listening state r Continue to listen for Gossip frames through g i Filter duplicate consensus information. If g i (t) = g i (t-1), then discard G i , otherwise keep it as valid G i .

[0085] Optionally, the distributed topology consensus mechanism includes: the control node discovers new topology information in the listening round, uses the newly discovered topology information to update the local topology information, and the control node shares the local topology information in the broadcast round, and finally achieves the topology consensus of the nodes in the whole network.

[0086] Preferably, the node N in the listening state r Get a valid G i Afterwards, use A i Update A r , the update method is: Among them, A r and A i is node N r and node N i The known adjacency matrix represents the known topological information of the node; the operator Indicates the fusion operation. Here, the max() function is used to take the larger value of the matrix elements. a r is a and A r Homogeneous matrices, representing nodes N r Specifically, if node N r With node N i No communication has been carried out before, that is, there is no edge in the topological undirected graph (N 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 i , N j ), that is, let (a r ) r，i =(a r ) i，r =w. w is the edge weight, and the signal-to-noise ratio (SNR) received this time can be used as the edge weight.

[0087] Preferably, the "node N in the listening state" r Get a valid G i Afterwards, use A i Update A r " will eventually converge and reach consensus as the listening rounds cycle. r The convergence value A r =A consensus It is equal to the adjacency matrix of all network nodes.

[0088] In the above “the cycle of listening rounds eventually converges and reaches a consensus”, A r The convergence condition is: if ||A r (t)||1=||A r (t-1)||1, then we think A r In t con Converges when T max During the time, A r If there is no new edge, then A r Convergence. max represents the maximum convergence time, Where T delta Indicates the time difference between the earliest and latest time to enter the consensus mechanism; Δ G represents the network radius; α represents the significance level, which is usually 0.1 or 0.05.

[0089] Preferably, all nodes in the A r The convergence value A r =A consensus Equal to the adjacency matrix of all network nodes, that is, after the distributed topology consensus is reached, the distributed voting consensus mechanism begins. The number of votes each node initially holds is N B In each broadcast round, the node selects the preferred cluster head node from the neighboring nodes and casts the vote. The node will no longer vote after the number of votes it holds reaches 0. r It will eventually converge and reach a consensus, and the preferred cluster head node will become the cluster head node.

[0090] Optionally, the step 202 selects a preferred cluster head node that the node considers competent 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 neighbor nodes, w k Represents node N j To Node N k The weight of

[0092] W j Sort in descending order, take the first S values ​​W j1 , W j2 , ..., W jS , as the preferred cluster head node Among them, S represents the number of clusters, which can be expressed by Calculate; ||A||1 indicates the number of nodes in the entire network; C max Indicates the maximum capacity of each cluster; Indicates the preferred cluster head set.

[0093] Figure 2 Schematic diagram of clustering and cluster head consensus mechanism according to an embodiment of the present invention. Figure 2 As shown, the step 203 selects the final cluster head node through the voting consensus mechanism of each node, including:

[0094] The voting consensus mechanism of each node is used to jointly select the final cluster head node, including:

[0095] The control node receives the latest ballot box vector in the listening round and updates the local ballot box vector using the latest ballot box vector and the new vote;

[0096] The control nodes share the local ballot box vector in the broadcast round, and finally achieve the voting consensus of all nodes in the network;

[0097] According to the consensus information G i The ballot box vector B i , count the votes of each node and sort the nodes in descending order by the number of votes;

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

[0099] Preferably, after the node selects the preferred cluster head node from the neighboring nodes, it casts the vote. The specific method is as follows: i New ballot b i , if N j is the preferred cluster head node, then let (b i ) j is 1, that is:

[0100]

[0101] Preferably, the nodes in the broadcast state continuously broadcast the Gossip frame. i The broadcast Gossip frame contains the consensus information G i = {g i , A i , B i , b i}. Among them, g i is a scalar used as a label to avoid G i It is received repeatedly, and increases by 1 at the beginning of each broadcast round, and remains unchanged within the broadcast round; B i is the vote counting information expressed in vector form (called the ballot box vector), B i Elements (B i ) j Represents node N j The number of votes received; b iis the voting information expressed in vector form (called the ballot vector), b i The element (b i ) j Indicates that in this broadcast round, node N i Vote to node N j The number of votes.

[0102] Preferably, the node N in the listening state r Continue to listen for Gossip frames through g i Filter duplicate consensus information. If g i (t) = g i (t-1), then discard G i , otherwise keep it as valid G i .

[0103] Preferably, the node N in the listening state r Get a valid G i Then, use B i and b i Update B r , the update method is: Among them, B r and B i is node N r and node N i Known ticket box vector; operator Indicates the fusion operation. Here, the max() function is used to take the larger value of the vector elements; b i A and B i Homogeneous vectors, representing nodes N i The increment generated, specifically, b i The elements in (b i ) j Represents node N i New vote to node N j The number of votes.

[0104] Preferably, the "node N in the listening state" r Get a valid G i Then, use B i and b i Update B r " will eventually converge and reach consensus as the listening rounds cycle. r The convergence value B r =B consensus The voting result of the whole network is equal to the preferred cluster head node, and the specific method is as follows: Ballot box B i The S nodes with the highest votes can become cluster head nodes.

[0105] Figure 3FIG. 1 is a flow chart of a fast networking mechanism combining wide / narrow beams according to an embodiment of the present invention. Figure 3 The step 102 is shown as constructing a star network with each cluster head node as a central node, including:

[0106] Step 301: Control the cluster head node to perform wide beam calling and traverse the selected sectors. The cluster head node traverses each sector for a time interval of τ, and the total duration of the wide beam call is T. WH This behavior aims to attract the attention of other nodes in the cluster by sending a call frame to the entire airspace. is the set of all wide beam sectors;

[0107] Step 302: Control the common nodes to perform wide beam fast scanning, scan and select the cluster head nodes being called in the surrounding airspace, and traverse the selected sectors. And listen in this sector, the common node is a node other than the cluster head node;

[0108] In this embodiment, preferably, the common node performs wide beam fast scanning to scan the surrounding airspace to see if there is a cluster head node being called. The specific method is: the common node traverses the selected sector 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 sector Upon receiving the Summoning frame, the traversal is stopped immediately and wide beam alignment is performed in this sector. If the Summoning Node is not found, this process is repeated until the timeout.

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

[0110] Step 304: Control the common node in the sector After receiving the call frame, the cluster head node immediately stops traversing and performs wide beam alignment in this sector, and switches to the listening mode to wait for the alignment frame. The specific method is as follows: the cluster head node traverses the selected 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 sector After receiving the alignment frame replied by the ordinary node, it will immediately return an alignment frame and add this sector to the set The cluster head node traverses The total duration is

[0111] Preferably, once a normal node is in a sector Upon receiving the summon frame, the traversal is stopped immediately and wide beam alignment is performed in this sector. The specific method is as follows: Switch to listening mode and wait for the alignment frame. Once the alignment frame sent by the cluster head node is received, an alignment frame is immediately returned. Before returning the alignment frame, a backoff operation can be performed according to the node number to avoid collision.

[0112] Step 305: After the wide beam alignment is completed, the cluster head node is controlled to perform narrow beam calling and traverse the set For each wide beam in, the set of all narrow beams within the coverage of the wide beam is Traverse the selected sectors And send a summon frame in this sector;

[0113] Preferably, after the cluster head node completes the wide beam alignment, it traverses each successfully aligned wide beam and performs narrow beam calling within the wide beam range. The specific method is: the cluster head node traverses the set Select Sector Get Collection 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 the common node completes the wide beam alignment, Narrow beam fast scanning within the range, wide beam The set of all narrow beams within the coverage area is Traverse the selected sectors And listen in this sector;

[0115] Preferably, after the common node completes the wide beam alignment, it performs a narrow beam fast scan within the wide beam range. The specific method is as follows: the common node obtains the set Traverse the selected sectors and listen in this sector. Once in sector Upon receiving the Summon frame, the traversal is stopped immediately and narrow beam alignment is performed in this sector.

[0116] Step 307: Control the cluster head node to perform narrow beam alignment after the narrow beam calling is completed, and traverse the selected sectors. Send an alignment frame in this sector and wait for a reply. Once the reply alignment frame is received, it is considered that the narrow beam alignment is successful. The specific method is: the cluster head node traverses and selects the sector Send an alignment frame in this sector and wait for a reply. Once in sector Received normal node N i If the alignment frame is returned, the narrow beam alignment is successful. Marked as normal node N i The sector where the device is located.

[0117] Step 308: Control the common node in the sector After receiving the call frame, it immediately stops traversal and performs narrow beam alignment in this sector, switches to the listening mode to wait for the alignment frame, and immediately returns an alignment frame once the alignment frame is received. The ordinary node completes the alignment with the cluster head node. The specific method is: the ordinary node in the sector Switch to listening mode and wait for alignment frame. Once the alignment frame sent by the cluster head node is received, an alignment frame is immediately returned. Before returning the alignment frame, a backoff operation can be performed according to the node number to avoid collision. Sector The sector marked as the cluster head node is located.

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

[0119] Optionally, in response to the cluster head node being unable to continue to serve as the cluster head, step 103 reselects a cluster head node and reconstructs the network, including:

[0120] Controlling the common nodes and the corresponding cluster head nodes to maintain periodic maintenance;

[0121] If the periodic maintenance of the common nodes and the cluster head node fails and cannot be restored by conventional means, it is determined that the cluster head node is damaged or disturbed;

[0122] The common nodes are controlled to reclassify the nodes into clusters and select the cluster head node of each cluster, and a star network with the cluster head of each cluster as the central node is constructed through a fast networking mechanism combining wide / narrow beams.

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

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

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

[0126] In order to implement the above embodiments, the present application also proposes a clustering networking device for a purely directional self-organizing network. Figure 5 The present invention provides a schematic diagram of a cluster networking device for a purely directional self-organizing network. Figure 5 As shown, the device comprises:

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

[0128] A networking module 520, configured to construct a star network with each of the cluster head nodes as a central node through a fast networking mechanism combining 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 to serve as the cluster head.

[0130] In order to implement the above embodiments, the present application also proposes an electronic device, comprising: a processor, and a memory communicatively connected to the processor; the memory stores computer-executable instructions; the processor executes the computer-executable instructions stored in the memory to implement the method provided by the above embodiments.

[0131] In order to implement the above embodiments, the present application also proposes a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the methods provided by the above embodiments.

[0132] In order to implement the above embodiments, the present application also proposes a computer program product, including a computer program, which implements the methods provided by the above embodiments when executed by a processor.

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

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

[0135] The present application is expected to provide an implementation scheme for users to selectively block the use or access of personal information data. That is, the present disclosure is expected to provide hardware and / or software to prevent or block access to such personal information data. Once the personal information data is no longer needed, the risk can be minimized by limiting data collection and deleting the data. In addition, when applicable, such personal information is de-identified to protect the privacy of the user.

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

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

[0138] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, fragment or portion of code comprising one or more executable instructions for implementing the steps of a custom logical function or process, and the scope of the preferred embodiments of the present application includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in the reverse order depending on the functions involved, which should be understood by technicians in the technical field to which the embodiments of the present application belong.

[0139] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute the instructions), or in combination with these instruction execution systems, devices or apparatuses. For the purpose of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in combination with these instruction execution systems, devices or apparatuses. More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (electronic device), a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), a fiber optic device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium and then editing, interpreting or processing in other suitable ways if necessary, and then stored in a computer memory.

[0140] It should be understood that the various parts of the present application can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0141] A person skilled in the art may understand that all or part of the steps in the method for implementing the above-mentioned embodiment may be completed by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, which, when executed, includes one or a combination of the steps of the method embodiment.

[0142] In addition, each functional unit in each embodiment of the present application may be integrated into a processing module, or each unit may exist physically separately, or two or more units may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may also be stored in a computer-readable storage medium.

[0143] The storage medium mentioned above may be a read-only memory, a magnetic disk or an optical disk, etc. Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be understood as limiting the present application. A person of ordinary skill in the art may change, modify, replace and modify the above embodiments within the scope of the present application.

Claims

1. A clustering networking method for a purely directional self-organizing network, characterized in that: The following steps are involved: Initialize nodes, assign nodes to clusters and select cluster head nodes for each cluster through clustering and cluster head consensus mechanism; Through a fast networking mechanism combining wide and narrow beams, a star network is constructed with each of the cluster head nodes as a central node; In response to the cluster head node being unable to continue to serve as the cluster head, a cluster head node is reselected and the network is reconstructed.

2. The method according to claim 1, characterized in that The clustering and cluster head consensus mechanism is used to classify nodes into clusters and select the cluster head node of each cluster, including: Obtain the node topology information and voting information of the entire network through the distributed topology consensus mechanism and voting consensus mechanism; Through the cluster head selection mechanism, the preferred cluster head node that this node considers competent is selected; The cluster head node is jointly selected through the voting consensus mechanism of each node.

3. The method according to claim 2, characterized in that The distributed topology consensus mechanism and voting consensus mechanism include: All nodes are in the directional antenna wide beam scanning listening state by default, and the number of directional antenna wide beam sectors is set to k. c , the transmission time of each frame is τ; Set the antenna of the node in the listening state to the receiving state every k c τ time to switch to the next sector, after Time can traverse all sectors; Control all the nodes with probability Transfer from the listening state to the directional antenna wide beam broadcast state, where N is the number of nodes in the entire network; Set the antenna of the node in the broadcast state to the sending state, and switch to the next sector every τ time. The broadcast frame can be sent to all nodes in the listening state within the farthest transmission distance in the airspace at a time; The time is called a listening round or a broadcasting round, and each node continuously cycles the listening round and the broadcasting round.

4. The method according to claim 3, characterized in that The method of obtaining the node topology information and voting information of the entire network through the distributed topology consensus mechanism and the voting consensus mechanism includes: Control the nodes in the broadcast state to continuously broadcast popular frames, node N i The broadcast popular frame contains the consensus information G i ; G i = {g i ,A i ,B i ,b i }, where g i A is the identification information. i is node N i Corresponding topological information; B i is the ballot box vector, b i is the ballot vector.

5. The method according to claim 4, characterized in that The distributed topology consensus mechanism includes: The control node discovers new topology information in the listening round and uses the newly discovered topology information to update the local topology information. The control node shares the local topology information in the broadcast round, and finally achieves topology consensus among all nodes in the network.

6. The method according to claim 5, characterized in that The cluster head selection mechanism is used to select a preferred cluster head node that the node considers competent, including: 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 neighbor nodes, w k Represents node N j To Node N k The weight of W j Sort in descending order, take the first S values ​​W j1 ,W j2 ,...,W jS , as the preferred cluster head node Among them, S represents the number of clusters, which can be expressed by Calculate; ||A||1 indicates the number of nodes in the entire network; C max Indicates the maximum capacity of each cluster; Indicates the preferred cluster head set.

7. The method according to claim 6, characterized in that The voting consensus mechanism of each node is used to jointly select the final cluster head node, including: The control node receives the latest ballot box vector in the listening round and updates the local ballot box vector using the latest ballot box vector and the new vote; The control nodes share the local ballot box vector in the broadcast round, and finally achieve the voting consensus of all nodes in the network; According to the consensus information G i The ballot box vector B i , count the votes of each node and sort the nodes in descending order by the number of votes; The first S nodes are selected as the preferred cluster head nodes and become the final cluster head nodes.

8. The method according to claim 7, characterized in that The step of constructing a star network with each cluster head node as a central node includes: Control the cluster head node to perform wide beam calling and traverse the selected sectors And send a summon frame in this sector, is the set of all wide beam sectors; Control the common nodes to perform wide beam fast scanning, scan and select the cluster head nodes being called in the surrounding airspace, and traverse the selected sectors And listen in this sector, the common node is a node other than the cluster head node; After the wide beam calling is completed, the cluster head node is controlled to perform wide beam alignment and traverse the selected sectors. Send an alignment frame in this sector and wait for a reply. Once the reply alignment frame is received, it is considered that the wide beam alignment is successful and the wide beam is added to the set. Control the common nodes in the sector After receiving the summon frame, it immediately stops traversal and performs wide beam alignment in this sector, switches to listening mode to wait for the alignment frame, and returns an alignment frame immediately once the alignment frame is received; After the wide beam alignment is completed, the cluster head node is controlled to perform narrow beam calling and traverse the set For each wide beam in, the set of all narrow beams within the coverage of the wide beam is Traverse the selected sectors And send a summon frame in this sector; After controlling the common node to complete the wide beam alignment, Narrow beam fast scanning within the range, wide beam The set of all narrow beams within the coverage area is Traverse the selected sectors And listen in this sector; After the narrow beam calling is completed, the cluster head node is controlled to perform narrow beam alignment and traverse the selected sectors. Send an alignment frame in this sector and wait for a reply. Once the reply alignment frame is received, it is considered that the narrow beam alignment is successful. Control the common nodes in the sector After receiving the summon frame, it immediately stops traversal and performs narrow beam alignment in this sector, switches to the listening mode to wait for the alignment frame, and immediately returns an alignment frame once the alignment frame is received. The ordinary node completes the alignment with the cluster head node.

9. The method according to claim 8, characterized in that In response to the cluster head node being unable to continue to serve as the cluster head, reselecting a cluster head node and reconstructing the network includes: Controlling the common nodes and the corresponding cluster head nodes to maintain periodic maintenance; If the periodic maintenance of the common nodes and the cluster head node fails and cannot be restored by conventional means, it is determined that the cluster head node is damaged or disturbed; The common nodes are controlled to reclassify the nodes into clusters and select the cluster head node of each cluster, and a star network with the cluster head of each cluster as the central node is constructed through a fast networking mechanism combining wide / narrow beams.

10. A clustering networking device for a purely directional self-organizing network, characterized in that: include: The cluster head selection module is used to initialize nodes, classify nodes into clusters and select the cluster head node of each cluster through clustering and cluster head consensus mechanism; A networking module, used to build a star network with each of the cluster head nodes as a central node through a fast networking mechanism combining wide and narrow beams; The correction module is used for reselecting a cluster head node and reconstructing the network in response to the cluster head node being unable to continue to serve as the cluster head.

11. An electronic device, characterized in that: include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1 to 9.

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

13. A computer program product, characterized in that The invention comprises a computer program, which implements the method according to any one of claims 1 to 9 when being executed by a processor.

Images