Efficient sector switching sequence generation method for directional antenna neighbor discovery and neighbor discovery method

Abstract

The invention discloses an efficient sector switching sequence generation method for directional antenna neighbor discovery and a neighbor discovery method. The sequence generation method comprises the following steps: generating a unique ID for a target network node, and converting the unique ID into a binary sequence; constructing an extended ID sequence by using the binary sequence; generating a sector switching subsequence by using the extended ID sequence and combining the available sector information, and constructing a sector switching matrix by using the sector switching subsequence; expanding the sector switching matrix according to rows to obtain a sector switching sequence of the network nodes; calculating whether node beams for sector switching by using the sector switching sequence are aligned within a preset threshold value, and if the beams are aligned within the preset threshold value, outputting the current sector switching sequence; and if the alignment of the beams is not completed, regenerating a new sector switching sequence until the alignment of the beams can be completed within a preset threshold. The efficiency of the networking method can be effectively improved, and node communication requirements in various network scenes can be met.

Description

Technical Field

[0001] The present invention belongs to the technical field of wireless ad - hoc network communication. More specifically, it relates to an efficient sector - switching sequence generation method and a neighbor discovery method for directional antenna neighbor discovery. Background Art

[0002] Wireless ad - hoc networks play a core role in scenarios without fixed infrastructure such as disaster response, field survey, smart home, and drone formation. In these applications, nodes are directly interconnected to form communication links, and neighbor discovery technology is the cornerstone for establishing effective communication links. The strategy of using omnidirectional antennas for neighbor discovery is simple, but it is limited by the signal coverage range and vulnerability to attacks. In contrast, the directional antenna neighbor discovery technology becomes an ideal choice due to its enhanced communication privacy and anti - interference ability. However, without precise node location information and time synchronization, achieving precise alignment of directional antennas becomes a technical challenge.

[0003] In existing wireless ad - hoc networks based on directional antennas, the neighbor discovery mechanism faces the challenge of low - efficiency sector - switching sequence design. Specifically, this design flaw directly leads to a significant increase in the maximum time to detect neighbors (MTTD) and the average time to detect neighbors (ETTD), thereby reflecting the low overall efficiency of sector - switching. This inefficiency not only increases the time - consuming process of directional antenna alignment between network nodes but also profoundly affects the network connection speed and stability, bringing non - negligible negative impacts to the performance and reliability of the entire network. Therefore, optimizing the sector - switching sequence design to improve the efficiency of the neighbor discovery mechanism has become a key problem to be solved urgently.

[0004] The prior art patent with the publication number CN117560684A proposes a directional narrow - and - wide beam networking optimization method and device, which synchronizes nodes within the self - organizing network through SAND, uses wide beams for coarse alignment, and then uses narrow beams for fine alignment to complete the entire networking process. Although this method improves the networking efficiency and flexibility to a certain extent, it is still restricted by certain node distributions and network environments. Summary of the Invention

[0005] The present invention provides an efficient sector - switching sequence generation method and a neighbor discovery method for directional antenna neighbor discovery to improve the efficiency of the networking method and meet the node communication requirements in various network scenarios.

[0006] The primary object of the present invention is to solve the above - mentioned technical problems, and the technical solution of the present invention is as follows:

[0007] The first aspect of the present invention provides an efficient sector - switching sequence generation method for directional antenna neighbor discovery, including the following steps:

[0008] Generate a unique ID for the target network node and convert the unique ID into a binary sequence;

[0009] Construct an extended ID sequence using the binary sequence;

[0010] Generate a sector switching subsequence using the extended ID sequence in combination with available sector information, and construct a sector switching matrix using the sector switching subsequence;

[0011] Unfold the sector switching matrix row by row to obtain the sector switching sequence of the network node;

[0012] Calculate whether the node beam for sector switching using the sector switching sequence is aligned within a preset threshold. If the beam is aligned within the preset threshold, output the current sector switching sequence; if the beam is not aligned, regenerate a new sector switching sequence until the beam can be aligned within the preset threshold.

[0013] Further, the unique ID is determined by the physical location of the node itself.

[0014] Further, the extended ID sequence is constructed as follows:

[0015]

[0016] where α i represents the binary sequence of the unique ID of node i, with a length of n bits, n≥2, α i (k) represents the k-th bit of the unique ID of node i, α i (1,k m ) and α i (k m +1,n) represent subsequences from α i (1) to α i (k m ) and from α i (k m +1) to α i (n); 1(l 2 ) represents a binary sequence of all 1s with length l 2 , 0(l 1 ) represents a binary sequence of all 0s with length l 1 , l 2 <l 1 <k m , l 1 +l 2 >k m ,

[0017] Furthermore, the length of the sector switching matrix is the length of the extended ID sequence, and its construction method includes the following steps:

[0018] For each binary digit of the extended ID sequence, combined with the available sector information, generate the corresponding sector switching subsequence using a preset method and record it;

[0019] Fill the generated sector switching subsequences into the corresponding columns of the matrix repeatedly in the order of the binary digits in the extended ID sequence until the number of rows in all columns of the matrix is the same;

[0020] Output the constructed sector switching matrix.

[0021] Furthermore, the preset method for generating the corresponding sector switching subsequence is:

[0022] For the k-th binary digit in the extended ID sequence, the sector switching subsequence μ ρ has the following expression:

[0023]

[0024] where N is the number of sectors in the available sector set B = {0, 1, …, N - 1}; ρ is the case number, ρ = 0 represents the case where N is even and the k-th binary digit is 0; ρ = 1 represents the case where N is even and the k-th binary digit is 1; ρ = 2 represents the case where N is odd and the k-th binary digit is 0; ρ = 3 represents the case where N is odd and the k-th binary digit is 1; σ(j) is a value-taking function used to extract a sector number from the available sector set B and place it in the j-th position of the subsequence, and ensure that each available sector is extracted only once, j max = N; b rand1 , b rand2 , b rand3 are three sector numbers randomly selected from the available sector set B.

[0025] Furthermore, the expression of the sector switching sequence τ i is:

[0026]

[0027] where i is the node number, L is the length of the extended ID sequence , μ ρ is the sector switching subsequence, is the sector switching matrix generated using the sector switching subsequence, is the element in the x-th row and y-th column of the sector switching matrix , and P is the total number of rows of the matrix.

[0028] Further, when the number of sectors is odd, the preset threshold is L * N * (N + 2); when the number of sectors is even, the preset threshold is L * (N + 1) * (N + 3), where N is the number of available sectors and L is the length of the extended ID sequence.

[0029] The second aspect of the present invention provides a method for discovering neighbors of a directional antenna. A sector switching sequence is generated by using an efficient sector switching sequence generation method for discovering neighbors of a directional antenna, and the sector switching sequence is used for discovering neighbors of the directional antenna.

[0030] The third aspect of the present invention provides an efficient sector switching sequence generation system for discovering neighbors of a directional antenna. The system includes: a memory and a processor. The memory includes a program for an efficient sector switching sequence generation method for discovering neighbors of a directional antenna. When the program for the efficient sector switching sequence generation method for discovering neighbors of a directional antenna is executed by the processor, the steps of an efficient sector switching sequence generation method for discovering neighbors of a directional antenna are implemented.

[0031] The fourth aspect of the present invention provides a computer-readable storage medium. The computer-readable storage medium includes a program for an efficient sector switching sequence generation method for discovering neighbors of a directional antenna. When the program for the efficient sector switching sequence generation method for discovering neighbors of a directional antenna is executed by a processor, the steps of the efficient sector switching sequence generation method for discovering neighbors of a directional antenna are implemented.

[0032] Compared with the prior art, the beneficial effects of the technical solution of the present invention are as follows:

[0033] The high-efficiency sector switching sequence generation method for discovering neighbors of a directional antenna designed by the present invention, relying on the innovative principle of generating a sector switching sequence based on the binary type of the ID sequence, not only provides an efficient solution for discovering neighbors of a directional antenna, but also, due to the universality of the principle, enables the method to be easily applicable to various network environments and communication requirements. At the same time, when using the method of the present invention, when a network node discovers neighbors using a directional antenna, the time for discovering neighbors can be significantly reduced. For the main performance indicators MTTD and ETTD of the algorithm, the method of the present invention is superior to the current mainstream algorithms, achieving a significant performance improvement and showing high efficiency and stable performance advantages. Description of the Drawings

[0034] To make the objectives and technical solutions of the present invention clearer, the present invention provides the following drawings and descriptions:

[0035] Figure 1 It is a flowchart of the method provided by an embodiment of the present invention;

[0036] Figure 2 Schematic diagram of the sector switching subsequence provided by the embodiment of the present invention for Node A;

[0037] Figure 3 Schematic diagram of the sector switching matrix provided by the embodiment of the present invention for Node A;

[0038] Figure 4 Schematic diagram of the sector switching subsequence provided by the embodiment of the present invention for Node B;

[0039] Figure 5 Schematic diagram of the sector switching matrix provided by the embodiment of the present invention for Node B;

[0040] Figure 6 Comparison diagram of experimental results under the condition of different numbers of sectors and time synchronization provided by the embodiment of the present invention;

[0041] Figure 7 Comparison diagram of experimental results under the condition of different numbers of sectors and time asynchrony provided by the embodiment of the present invention;

[0042] Figure 8 Comparison diagram of experimental results under the condition of different binary sequence lengths and time synchronization provided by the embodiment of the present invention;

[0043] Figure 9 Comparison diagram of experimental results under the condition of different binary sequence lengths and time asynchrony provided by the embodiment of the present invention. Detailed implementation manners

[0044] In order to more clearly understand the above objects, features and advantages of the present invention, the present invention will be further described in detail below with reference to the accompanying drawings and specific implementation manners. It should be noted that, without conflict, the embodiments of the present application and the features in the embodiments may be combined with each other.

[0045] Many specific details are set forth in the following description in order to fully understand the present invention. However, the present invention may be implemented in other ways different from those described herein. Therefore, the protection scope of the present invention is not limited by the specific embodiments disclosed below.

[0046] Embodiment 1:

[0047] The present invention provides an efficient sector switching sequence generation method for directional antenna neighbor discovery. Neighbor discovery between nodes refers to the process by which nodes in a network identify and determine the existence of their neighboring nodes through specific protocols and mechanisms. In the present invention, neighbor discovery between nodes is achieved by sector alignment (i.e., the directional antennas between nodes are in sectors and aligned pairwise) and sending interaction information. Specifically, assume there are a pair of nodes A and B (with the same number of sectors), and they are both executing a switching sequence. The switching sequences of nodes A and B generated by the present invention can ensure the sector alignment between node A and node B, thereby achieving efficient neighbor discovery. As Figure 1 shown is a flowchart of an efficient sector switching sequence generation method for directional antenna neighbor discovery, and the specific steps are as follows:

[0048] S1: Generate a unique ID for the target network node and convert the unique ID into a binary sequence.

[0049] More specifically, the unique ID is determined by the physical location of the node itself.

[0050] S2: Use the binary sequence to construct an extended ID sequence.

[0051] More specifically, the extended ID sequence is constructed according to the following expression:

[0052]

[0053] where, α i represents the binary sequence of the unique ID of node i, with a length of n bits, n≥2, α i (k) represents the k-th bit of the unique ID of node i, α i (1,k m ) and α i (k m +1,n) represent subsequences from α i (1) to α i (k m ) and from α i (k m +1) to α i (n); 1(l 2 ) represents a binary sequence of all 1s with a length of l 2 , 0(l 1 ) represents a binary sequence of all 0s with a length of l 1 , l 2 <l 1 <k m , l 1 +l 2 >k m ,

[0054] S3: Generate a sector switching subsequence by using the extended ID sequence in combination with the available sector information, and construct a sector switching matrix by using the sector switching subsequence.

[0055] More specifically, the length of the sector switching matrix is the length of the extended ID sequence, and its construction method includes the following steps:

[0056] For each binary number in the extended ID sequence, in combination with the available sector information, generate the corresponding sector switching subsequence by using a preset method and record it. The preset method for generating the corresponding sector switching subsequence is:

[0057] For the k-th binary number in the extended ID sequence, the sector switching subsequence μ ρ is expressed as:

[0058]

[0059] where N is the number of sectors in the available sector set B = {0, 1, …, N - 1}; ρ is the case number, ρ = 0 represents the case where N is even and the k-th binary number is 0; ρ = 1 represents the case where N is even and the k-th binary number is 1; ρ = 2 represents the case where N is odd and the k-th binary number is 0; ρ = 3 represents the case where N is odd and the k-th binary number is 1; σ(j) is a value-taking function for extracting a sector number from the available sector set B and placing it in the j-th position of the subsequence, and ensuring that each available sector is extracted only once, j max = N; b rand1 , b rand2 , b rand3 are three sector numbers randomly extracted from the available sector set B.

[0060] According to the order of the binary numbers in the extended ID sequence, repeatedly fill the generated sector switching subsequences into the corresponding columns of the matrix until the number of rows in all columns of the matrix is the same;

[0061] Output the constructed sector switching matrix.

[0062] S4: Expand the sector switching matrix row by row to obtain the sector switching sequence of the network node.

[0063] More specifically, the sector switching sequence τ i of node i is expressed as:

[0064]

[0065] where i is the node number, L is the length of the extended ID sequence , μ ρis the sector switching subsequence, is the sector switching matrix generated by using the sector switching subsequence, is the sector switching matrix is the element in the x-th row and y-th column, and P is the total number of rows of the matrix.

[0066] When the number of available sectors is even, in a specific embodiment, the object is the directional antenna network node A with a binary sequence number 00000001 and the number of available sectors N = 4 in a wireless ad hoc network. A sector switching sequence is generated for it through the following steps:

[0067] Step 1: Mark the N = 4 switchable sectors of the network node A as 0, 1, 2, and 3 respectively.

[0068] Step 2: Generate the corresponding extended sequence from the 8-bit binary sequence number 00000001 of the network node A.

[0069] The corresponding extended sequence of the node A can be obtained from formula (1), where α A (1,k m ) = α A (1,4) = 0000, α A (k m +1,n) = 0001. According to l 2 <l 1 <k m = 4, l 1 +l 2 >k m = 4, take l 1 = 3, l 2 = 2, then 0(l 1 ) = 000, 1(l 2 ) = 11, thus generating a 15-bit binary sequence. The specific extended sequence construction of the node A is as follows.

[0070]

[0071] Step 3: Generate the sector switching subsequence μ ρ of the node A from the 15-bit binary extended sequence in Step 2. Traverse the sequence given by the extended sequence of the node A in Step 2 . Since the number of available sectors N = 4, when the binary number in the binary extended sequence is 0, ρ = 0, then the subsequence μ 0 = (σ(1), σ(2), σ(3), σ(4), b rand1 ), where μ 0The first four digits are a random non-repeating permutation of the four elements {0, 1, 2, 3}, and the fifth digit is randomly selected from {0, 1, 2, 3}. That is, an example of a feasible binary number 0 for the sector switching subsequence of the directional antenna is {1, 0, 2, 3, 2}; when the binary number in the binary expansion sequence is 1, that is, ρ = 1, the subsequence μ 1 =(σ(1), σ(2), σ(3), σ(4), b rand1 , b rand2 , b rand3 ), where μ 1 The first four digits are a random non-repeating permutation of the four elements {0, 1, 2, 3}, and the fifth to seventh digits are each randomly selected from {0, 1, 2, 3}. That is, an example of a feasible binary number 1 for the sector switching subsequence of the directional antenna is {3, 2, 1, 0, 1, 2, 0}, as follows Figure 2 shown

[0072] Step 4: According to the sector switching subsequences of different bit types generated in Step 3, repeat and place the corresponding subsequences in each column to construct the sector switching matrix of node A with an even number of sectors For example, from the binary expansion sequence 000000010000111 of node A given in Step 2 and the examples given in Step 3, an example of the sector switching matrix is given here. As follows Figure 3 shown

[0073] Step 5: According to the sector switching matrix generated in Step 4, the nodes are accessed row by row to generate the sector switching sequence of node A as μ A_Even ={1, 1, 2, 2, 0, 0, 3, 3, 2, 1, 3, 3, 1, 2, 2, 0, 2, …}

[0074] When the number of available sectors is odd, in a specific embodiment, the object is a directional antenna network node B with a binary sequence number 00000010 in a wireless ad hoc network and the number of available sectors N = 5. A sector switching sequence is generated for it through the following steps

[0075] Step 1: Label the N = 5 switchable sectors of the network node B as 0, 1, 2, 3, 4 respectively

[0076] Step 2: Generate the corresponding expansion sequence from the n = 8-bit binary sequence number 00000010 of the network node B

[0077] The corresponding expansion sequence of node B can be obtained from formula (1), where α B (1, k m ) = αB (1,4) = 0000, α B (k m +1,n) = 0010. According to l 2 <l 1 <k m = 4, l 1 +l 2 >k m = 4, take l 1 = 3, l 2 = 2, then 0(l 1 ) = 000, 1(l 2 ) = 11, thus generating a 15-bit binary sequence L, specifically the binary expansion sequence of node B is constructed as follows.

[0078]

[0079] Step 3: Generate the sector switching subsequence μ of node B from the 15-bit binary expansion sequence in Step 2 ρ . Traverse the sequence given by the expansion sequence of node B in Step 2 . Since the number of available sectors N = 5, when the binary number in this binary expansion sequence is 0, ρ = 2, then the subsequence μ 2 = (σ(1), σ(2), σ(3), σ(4), σ(5)), where the five-bit sequence in μ 2 is a random non-repeating permutation of the five elements {0, 1, 2, 3, 4}, that is, here a feasible example of the sector switching subsequence of the directional antenna when the binary number is 0 is {1, 0, 2, 3, 4}; when the binary number in this binary expansion sequence is 1, that is, ρ = 3, the subsequence μ 3 = (σ(1), σ(2), σ(3), σ(4), σ(5), b rand2 , b rand3 ), where the first five bits of μ 3 are a random non-repeating permutation of the five elements {0, 1, 2, 3, 4}, and the sixth to seventh bits are randomly selected from {0, 1, 2, 3, 4} respectively, that is, here a feasible example of the sector switching subsequence of the directional antenna when the binary number is 1 is {3, 2, 1, 0, 4, 2, 0}, as follows Figure 4 shown.

[0080] Step 4: According to the sector switching subsequences of different bit types generated in Step 3, repeat and place the corresponding subsequences in each column to construct the sector switching matrix of node A with an odd number of sectors For example, based on the binary expansion sequence 000000010001011 of node B given in step 2 and the example given in step 3, an instance of the sector switching matrix is given here as follows Figure 5 as shown.

[0081] Step 5: According to the sector switching matrix generated in step 4, the nodes are accessed row by row to generate the directional antenna sector switching sequence of node B as μ B_Odd ={1, 1, 4, 2, 0, 4, 3, 3, 2, 1, 3, 4, 1, 2, 2, 0, 2, …}

[0082] S5: Calculate whether the node beam for sector switching using the sector switching sequence is aligned within a preset threshold. If the beam is aligned within the preset threshold, output the current sector switching sequence; if the beam is not aligned, regenerate a new sector switching sequence until the beam can be aligned within the preset threshold.

[0083] The preset threshold is L*N*(N + 2) when the number of sectors is odd; when the number of sectors is even, the preset threshold is L*(N + 1)*(N + 3), where N is the number of available sectors and L is the length of the extended ID sequence. The theoretical basis and design method of this preset threshold refer to the following research results: the systematic research on the theoretical basis and algorithm design for directional antenna neighbor discovery in distributed wireless networks proposed by Chen et al. (On Oblivious Neighbor Discovery in Distributed Wireless Networks With Directional Antennas, IEEE / ACM Transactions on Networking, 25, 2017: 1982-1993) and the robust deterministic neighbor discovery method proposed by Xu et al. (Robust Deterministic Neighbor Discovery in Ad Hoc Networks with Directional Antennas, 2023 IEEE MTT-S International Wireless Symposium (IWS), 2023, 1-4). The high-efficiency sector switching sequence generation method for directional antenna neighbor discovery designed in the present invention, by virtue of its innovative principle of generating sector switching sequences in the binary type of ID sequences, not only provides an efficient solution for directional antenna neighbor discovery, but also, due to the universality of its principle, enables this method to be easily applicable to various network environments and communication requirements. Using the present invention for simulation experiments, the simulation software MATLAB was selected to verify the effectiveness and feasibility of the proposed method. The performance of the algorithm of the present invention between a pair of nodes A and node B was studied. During the experiment, it was run 20000 times independently in each case and the average value was taken.The present invention conducts a comparative analysis with three representative directional antenna neighbor discovery methods in the prior art, specifically including: the directional antenna neighbor discovery method based on a robust deterministic mechanism (Robust Deterministic Neighbor Discovery in Ad Hoc Networks with Directional Antennas, RSBA) proposed by Xu et al., the directional antenna neighbor discovery method based on a distributed network oblivious mechanism (Oblivious Neighbor Discovery in Distributed Wireless Networks, ODND) proposed by Chen et al., and the directional antenna neighbor discovery method based on a millimeter-wave network hunting mechanism (Hunting-based Directional Neighbor Discovery, HDND) proposed by Wang et al.

[0084] In this experiment, the length of the number sequence of each node in the wireless ad hoc network is 8. As Figure 6 shown is the comparison of the maximum neighbor discovery time (MTTD) and the average neighbor discovery time (ETTD) of the present invention with the existing methods RSBA, ODND, and HDND under the conditions of different numbers of sectors and time synchronization. It can be seen from the figure that the MTTD required by the method adopted by the present invention is reduced by 43%, 34%, and 21% on average compared with RSBA, ODND, and HDND, respectively; the ETTD required is reduced by 49%, 35%, and 23% on average compared with RSBA, ODND, and HDND, respectively. As Figure 7 shown is the comparison of the maximum neighbor discovery time (MTTD) and the average neighbor discovery time (ETTD) of the present invention with the existing methods RSBA, ODND, and HDND under the conditions of different numbers of sectors and time asynchronization. It can be seen from the figure that the MTTD required by the method adopted by the present invention is reduced by 46%, 34%, and 17% on average compared with RSBA, ODND, and HDND, respectively; the ETTD required is reduced by 52%, 40%, and 26% on average compared with RSBA, ODND, and HDND, respectively. As Figure 8 shown is the comparison of the maximum neighbor discovery time (MTTD) and the average neighbor discovery time (ETTD) of the present invention with the existing methods RSBA, ODND, and HDND under the conditions of different binary sequence lengths and time synchronization. It can be seen from the figure that the MTTD required by the method adopted by the present invention is reduced by 56%, 47%, and 30% on average compared with RSBA, ODND, and HDND, respectively; the ETTD required is reduced by 58%, 49%, and 31% on average compared with RSBA, ODND, and HDND, respectively. AsFigure 9 Shown is the comparison of the maximum neighbor discovery time (MTTD) and the average neighbor discovery time (ETTD) of the present invention with the existing methods RSBA, ODND, and HDND under the conditions of different binary sequence lengths and time asynchrony. It can be seen from the figure that the MTTD required by the method adopted by the present invention is reduced by 53%, 45%, and 28% on average compared with RSBA, ODND, and HDND respectively; the ETTD required is reduced by 56%, 48%, and 30% on average compared with RSBA, ODND, and HDND respectively.

[0085] Example 2:

[0086] This example provides a method for neighbor discovery of a directional antenna. A sector switching sequence is generated by using the efficient sector switching sequence generation method for neighbor discovery of a directional antenna described in Example 1, and the sector switching sequence is used for neighbor discovery of the directional antenna.

[0087] Example 3:

[0088] This example provides an efficient sector switching sequence generation system for neighbor discovery of a directional antenna, including a memory and a processor. The memory includes a program for the efficient sector switching sequence generation method for neighbor discovery of a directional antenna. When the program for the efficient sector switching sequence generation method for neighbor discovery of a directional antenna is executed by the processor, the steps of an efficient sector switching sequence generation method for neighbor discovery of a directional antenna as described in Example 1 are implemented.

[0089] Example 4:

[0090] This example provides a computer-readable storage medium. The computer-readable storage medium includes a program for the efficient sector switching sequence generation method for neighbor discovery of a directional antenna. When the program based on the efficient sector switching sequence generation method for neighbor discovery of a directional antenna is executed by a processor, the steps of an efficient sector switching sequence generation method for neighbor discovery of a directional antenna as described in Example 1 are implemented.

[0091] Obviously, the above embodiments of the present invention are merely examples for clearly explaining the present invention, rather than limitations on the implementation manners of the present invention. For those of ordinary skill in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to enumerate all the implementation manners here. Any modifications, equivalent replacements, and improvements made within the spirit and principle of the present invention shall be included within the protection scope of the claims of the present invention.

Claims

1. An efficient sector switching sequence generation method for directional antenna neighbor discovery, characterized in that: The steps include: Generate a unique ID for the target network node, and convert the unique ID into a binary sequence; constructing an extended ID sequence using the binary sequence; generating a sector switching subsequence by using the extended ID sequence in combination with available sector information, and constructing a sector switching matrix by using the sector switching subsequence; Expanding the sector switching matrix row by row to obtain a sector switching sequence of a network node; Calculate whether the node beam that uses the sector switching sequence to perform sector switching is aligned within a preset threshold. If the beam is aligned within the preset threshold, output the current sector switching sequence; if the beam is not aligned, regenerate a new sector switching sequence until the beam can be aligned within the preset threshold.

2. The method for generating an efficient sector switching sequence for directional antenna neighbor discovery according to claim 1, characterized in that: The unique ID is determined by the physical location of the node itself.

3. The method for generating an efficient sector switching sequence for directional antenna neighbor discovery according to claim 1, characterized in that: The extended ID sequence The construction expression is: Among them, α i A binary sequence representing the unique ID of node i, with a length of n bits, n ≥ 2, α i (k) represents the kth bit of the unique ID of node i, α i (1,k m ) and α i (k m +1,n) represents the i (1) to α i (k m ) and from α i (k m +1) to α i (n); 1(l2) represents a binary sequence of all 1s with a length of l2, 0(l1) represents a binary sequence of all 0s with a length of l1, and l2 <l1<k m , l1+l2> k m, 4. The method for generating an efficient sector switching sequence for directional antenna neighbor discovery according to claim 1, characterized in that: The length of the sector switching matrix is ​​the length of the extended ID sequence, and its construction method includes the following steps: For each binary digit of the extended ID sequence, combined with the available sector information, a corresponding sector switching subsequence is generated and recorded using a preset method; Repeatedly fill the generated sector switching subsequences into the corresponding columns of the matrix according to the order of the binary numbers in the extended ID sequence until the number of rows of all columns in the matrix is ​​consistent; Output the constructed sector switching matrix.

5. The method for generating an efficient sector switching sequence for directional antenna neighbor discovery according to claim 4, characterized in that: The preset method for generating the corresponding sector switching subsequence is: For the kth binary number in the extended ID sequence, the sector switching subsequence μ ρ The expression is: Wherein, N is the number of sectors in the available sector set B = {0, 1, ..., N-1}; ρ is the case number, ρ = 0 represents the case where N is an even number and the k-th binary number is 0; ρ = 1 represents the case where N is an even number and the k-th binary number is 1; ρ = 2 represents the case where N is an odd number and the k-th binary number is 0; ρ = 3 represents the case where N is an odd number and the k-th binary number is 1; σ(j) is a value function, which is used to extract a sector number from the available sector set B and put it in the j-th position of the subsequence, and ensure that each available sector is extracted only once, j max =N; b rand1 ,b rand2 ,b rand3 are three sector numbers randomly selected from the available sector set B.

6. The method for generating an efficient sector switching sequence for directional antenna neighbor discovery according to claim 1, characterized in that: The sector switching sequence τ i The expression is: Among them, i is the node number, L is the extended ID sequence The length, μ ρ is the sector switching subsequence, is the sector switching matrix generated using the sector switching subsequence, Switching matrix for sectors The element in row x and column y, P is The total number of rows in the matrix.

7. The method for generating an efficient sector switching sequence for directional antenna neighbor discovery according to claim 1, characterized in that: The preset threshold is L*N*(N+2) when the number of sectors is an odd number; when the number of sectors is an even number, the preset threshold is L*(N+1)*(N+3), where N is the number of available sectors and L is the length of the extended ID sequence.

8. A directional antenna neighbor discovery method, characterized in that: The method adopts the efficient sector switching sequence generation method for directional antenna neighbor discovery described in any one of claims 1 to 7 to generate a sector switching sequence, and uses the sector switching sequence to perform directional antenna neighbor discovery.

9. An efficient sector switching sequence generation system for directional antenna neighbor discovery, characterized in that: The system includes: a memory and a processor, wherein the memory includes a program of an efficient sector switching sequence generation method for directional antenna neighbor discovery, and when the program of the efficient sector switching sequence generation method for directional antenna neighbor discovery is executed by the processor, the steps of an efficient sector switching sequence generation method for directional antenna neighbor discovery as described in any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a program for an efficient sector switching sequence generation method for directional antenna neighbor discovery. When the program for an efficient sector switching sequence generation method for directional antenna neighbor discovery is executed by a processor, the steps of an efficient sector switching sequence generation method for directional antenna neighbor discovery as described in any one of claims 1 to 7 are implemented.

Images