A directional wide-narrow beam networking optimization method and device

Abstract

The application provides a directional wide-narrow beam networking optimization method and device. The method comprises the following steps: synchronizing nodes in a SAND (SBA-D) self-organizing network; setting a sector scanning sequence design and a transceiving sequence design based on the SBA-D, and performing coarse alignment on the nodes in the network by using a wide beam, wherein the sector scanning sequence design is used to ensure that the sector alignment of the nodes is realized within a certain time slot when any two nodes are in a node transceiving state match, and the transceiving sequence design is used to ensure that the transceiving state of the nodes in each time slot corresponds to the sector scanning sequence; converting the sequence of the nodes in the network into an ID in any radix, setting the round code of each node according to the converted ID, determining the number of alignment sequences in each round, performing fine alignment on the nodes in the network by using a narrow beam, and completing the whole networking process. While ensuring the network entry proportion of the group nodes, the application significantly reduces the networking and alignment time, and can well meet the networking demand in different node distribution scenarios.

Description

Technical Field

[0001] This application relates to the field of wireless communication technology, and in particular to a method and apparatus for optimizing directional wide and narrow beam networking. Background Technology

[0002] Millimeter-wave ad hoc networks are wireless networks utilizing the millimeter-wave frequency band. They possess abundant bandwidth resources and can support high-volume, high-throughput, and low-latency service transmission. However, millimeter-wave signals have poor propagation characteristics and are susceptible to obstacles and weather conditions. Furthermore, millimeter-wave networks typically use omnidirectional antennas for data transmission, resulting in weak anti-interference capabilities and poor security. Therefore, directional antenna arrays are needed to constrain power, ensure transmission range, and improve resistance to interference and eavesdropping. However, directional beamforming is time-consuming and has a low node integration rate. 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 directional wide and narrow beam networking optimization method, which optimizes the strategies for directional neighbor discovery and beam alignment by combining wide and narrow beams. While ensuring the network entry ratio of nodes, it reduces the time consumption of distributed node networking and beam alignment, and can adapt to different node distributions, providing a technical solution for rapid networking and beam alignment of 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 method for optimizing directional wide and narrow beam networking, comprising:

[0010] Nodes within a self-organizing network are synchronized using the SAND (Sector Antenna Neighbor Discovery) algorithm.

[0011] Based on the neighbor discovery planning algorithm SBA-D, the sector scan sequence design and transmit / receive sequence design are set, and a wide beam is used to coarsely align the nodes in the network. The sector scan sequence design is used to ensure that when any two nodes are in the node transmit / receive state matching, the sector alignment of the nodes is achieved within a preset time slot. The transmit / receive sequence design is used to ensure that the transmit / receive state of the nodes in each time slot corresponds to the sector scan sequence.

[0012] The sequence number of nodes in the network is converted into an ID in any base. The round code of each node is set according to the converted ID, and the number of alignment sequences in each round is determined. Narrow beams are used to perform fine alignment of the nodes in the network to complete the entire networking process.

[0013] Optionally, synchronizing nodes within the self-organizing network via SAND includes:

[0014] After all nodes are powered on, set one node as the token holder node and the rest as fast-spinning nodes;

[0015] The fast rotating node continuously switches sectors in fast scan mode and prepares to receive signals, and the token holding node sends signals to each sector.

[0016] When a fast-spinning node receives a signal, it disables the fast-scanning mode of that node and aligns its sector with the token-holding node.

[0017] Once all the fast-spinning nodes have received the signal, the token-holding node is controlled to stop sending signals, thus completing the synchronization of all nodes within the self-organizing network.

[0018] Optionally, when using wide beams to coarsely align nodes within the network, a time slot can be configured with only one node as a transmitting node and the rest as receiving nodes.

[0019] Optionally, the design of the sector scan sequence and the transmit / receive sequence based on SBA-D includes:

[0020] The nodes within the network are numbered, and the sector scan sequence of the nodes is set using a preset sector sequence formula, which is:

[0021]

[0022] In the formula, This represents the sector scan sequence in time slot k for node number i. This represents the transmit / receive status of node i in time slot k, where M is the total number of sectors. Specifically, when node i is in transmit mode in time slot k... Select 1 if the value is 1, otherwise select 0.

[0023] The transmit / receive sequence is set according to the node numbers within the network and a preset transmit / receive sequence formula, wherein the length of the transmit / receive sequence is the same as the number of nodes, and the preset transmit / receive sequence formula is:

[0024]

[0025] Where i represents the node number.

[0026] Optionally, based on the converted ID, the round code of each node is set, and the alignment sequence number within each round is determined. A narrow beam is then used to perform fine alignment of the nodes within the network, completing the entire networking process, including:

[0027] Based on the converted ID, set the round code for each node to determine the transmit / receive status of each node within a round. Specifically, the round code corresponding to the BASE base ID is set to 1, and the rest are 0. The length of the round code is the sum of all values ​​of the BASE base ID of the largest node, as shown in the formula:

[0028]

[0029] in, This represents the ID whose decimal number is N-1 converted to BASE base.

[0030] Count the number of 0s and 1s in all IDs in each round, and take the maximum of the two as the number of alignment sequences in each round;

[0031] Based on the alignment sequence number, a narrow beam is used to precisely align the nodes within the network.

[0032] To achieve the above objectives, a second aspect of this application provides a directional wide and narrow beam networking optimization device, comprising:

[0033] The synchronization module is used to synchronize nodes within the self-organizing network using the SAND (Sector Antenna Neighbor Discovery) algorithm.

[0034] The coarse alignment module is used to set the sector scan sequence design and transmit / receive sequence design based on the neighbor discovery planning algorithm SBA-D. It uses a wide beam to coarsely align nodes in the network. The sector scan sequence design is used to ensure that when any two nodes are in the node transmit / receive state matching, the sector alignment of the nodes is achieved within a certain time slot. The transmit / receive sequence design is used to ensure that the transmit / receive state of the nodes corresponds to the sector scan sequence in each time slot.

[0035] The fine alignment module is used to convert the sequence number of nodes in the network into IDs in any number of bases, set the round code of each node according to the converted IDs, determine the number of alignment sequences in each round, and use a narrow beam to perform fine alignment of the nodes in the network to complete the entire networking process.

[0036] 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;

[0037] The memory stores computer-executed instructions;

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

[0039] 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 above.

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

[0041] The technical solutions provided by the embodiments of this application bring at least the following beneficial effects:

[0042] By combining wide and narrow beams, the strategies for directional neighbor discovery and beam alignment are optimized. While ensuring the network entry ratio of nodes, the time consumption of distributed node networking and beam alignment is reduced. It can also well meet the networking requirements of different node distribution scenarios, providing a technical solution for rapid networking and beam alignment of directional self-organizing networks.

[0043] 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

[0044] 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:

[0045] Figure 1 This is a flowchart illustrating a directional wide and narrow beam networking optimization method according to an embodiment of this application;

[0046] Figure 2 This is a schematic diagram of a directional networking network model according to an embodiment of this application;

[0047] Figure 3 This is an example diagram of a distributed node scenario shown according to an embodiment of this application;

[0048] Figure 4 This is an example diagram of node synchronization within a network according to an embodiment of this application;

[0049] Figure 5 This is a schematic diagram of a two-dimensional directional antenna model according to an embodiment of this application;

[0050] Figure 6This is an example diagram of beam alignment according to an embodiment of this application;

[0051] Figure 7 This is an example diagram of coarse alignment sector scanning according to an embodiment of this application;

[0052] Figure 8 This is an example diagram of beam alignment according to an embodiment of this application;

[0053] Figure 9 This is a block diagram illustrating a directional wide and narrow beam networking optimization device according to an embodiment of this application;

[0054] Figure 10 It is a block diagram of an electronic device. Detailed Implementation

[0055] The embodiments of this application are described in detail below. Examples of the 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.

[0056] The directional wide and narrow beam networking optimization method and apparatus of this application are described below with reference to the accompanying drawings.

[0057] like Figure 1 As shown, the method includes the following steps:

[0058] Step 101: Synchronize nodes within the self-organizing network using the SAND (Sector Antenna Neighbor Discovery) algorithm.

[0059] The network model for self-organizing network targeted networking mentioned in the embodiments of this application, such as... Figure 2 As shown, it has the following characteristics:

[0060] (1) Unique ID: Each node in the directed network has a unique ID number. Nodes are distinguished by their ID numbers. The maximum number of ID numbers is determined by the total number of nodes in the network.

[0061] (2) Sector: This application uses a beam-switching antenna under a smart antenna, and the sector of the node is determined by the direction of the main lobe of the beam divided by a fixed number.

[0062] (3) Working modes: There are three working modes for nodes in a self-organizing network: TRANSPORT mode, RECEIVE mode and Idle mode.

[0063] (4) Communication conditions: When a pair of nodes are connected in space within the sending sector and the receiving sector, they can communicate directly.

[0064] (5) Collision: When multiple nodes send sectors simultaneously point to a node's receive sector and transmit data, a collision occurs at the receiving node, meaning that only one neighbor can be found in a time slot.

[0065] (6) Handshake rules: Two-handshake strategy.

[0066] (7) Timing: Timing is performed according to time slots.

[0067] (8) Sector scan sequence: The sector scan sequence of a node is This represents the scan sector number of node i in time slot k.

[0068] (9) Transmit / Receive State Sequence: The transmit / receive state sequence of a node is as follows: This represents the transmit / receive status of node i in time slot k, where 0 represents the receive status and 1 represents the transmit status.

[0069] (10) Time Asynchronous: The nodes in the network are time asynchronous, and each node has a different power-on time.

[0070] (11) Node joining ratio: The node joining ratio is defined as the ratio of nodes that have successfully joined the network (completed precise alignment) to the total number of nodes, and is used to measure the networking effect.

[0071] In one possible implementation, such as Figure 3 As shown, the self-organizing network scenario includes 32 distributed nodes with node IDs ranging from 0 to 31. Each node is equipped with one wide-beam directional antenna and one narrow-beam directional antenna, both with a transmission distance of 10 kilometers. The directional antennas can scan horizontally, with beamwidths of 45° and 5° respectively. Furthermore, this example scenario is a single-hop, fully connected network. While the node distribution is generally balanced and random, some extreme distributions may still exist.

[0072] Understandably, the synchronization algorithm in this application adopts the attention-attracting mechanism of the SAND algorithm, and all nodes are not initially synchronized after they are powered on.

[0073] Synchronizing nodes within a self-organizing network in this embodiment specifically includes the following steps:

[0074] (1) First, set up a token holding node, and the rest of the nodes are fast rotating nodes in fast scanning mode.

[0075] In fast scan mode, nodes are scanned every time t. switch The token-holding node switches its sectors to search for channel activity. During this process, it sends M signals to each sector at time intervals of t. switch .

[0076] (2) The sector is constantly switched and ready to receive signals by the fast rotating node in fast scan mode, and the signal is sent to each sector by the token holding node.

[0077] Because other nodes are in a fast scan state, any node within any sector of the token-holding node is in M*t. switch A signal will definitely be received within a certain timeframe. For a more detailed explanation, refer to [reference needed]. Figure 4 As shown in this example, nodes A and B are located in the first sector of the token-holding node. At this time, the token-holding node transmits signals to this sector in M ​​consecutive time slots. Since nodes A and B have also traversed all sectors in these M time slots, nodes A and B will definitely be able to receive signals from the token-holding node in the M time slots.

[0078] Understandably, the signal contains a sequence number x, and according to calculations, synchronization requires M. 2 Each time slot, therefore, in M 2 After -x time slots, the node enters the next state. Upon receiving a signal, the fast-rotating node stops the fast-scanning state and aligns its sector with the token-holding node to ensure that it can always maintain communication with the token-holding node.

[0079] Furthermore, once all fast-spinning nodes have received the signal, the control token-holding node stops sending signals, completing the synchronization of all nodes within the self-organizing network.

[0080] Understandably, this synchronization strategy fully leverages the advantages of the SAND algorithm to achieve effective synchronization between nodes.

[0081] Step 102: Based on the neighbor discovery planning algorithm SBA-D, set up the sector scan sequence design and transmit / receive sequence design, and use a wide beam to perform coarse alignment of nodes in the network. The sector scan sequence design is used to ensure that when any two nodes are in the node transmit / receive state matching, the sector alignment of the nodes is achieved within the preset time slot. The transmit / receive sequence design is used to ensure that the transmit / receive state of the nodes in each time slot corresponds to the sector scan sequence.

[0082] In this embodiment of the application, a two-dimensional directional antenna model is first introduced, such as... Figure 5 As shown, the two-dimensional directional antenna uses an antenna with a sector width of α, therefore the number of sectors is... The numbering is S = {0, 1, 2, ..., M-2, M-1}.

[0083] Assuming the total number of antenna sectors M is even, there exists a mathematical relationship. In wireless communication, antenna orientation directly affects signal strength and quality, and is typically achieved by adjusting the antenna's direction. In specialized scenarios, the platform hosting a directional beamforming ad hoc network is often equipped with devices such as gyroscopes to acquire platform attitude data. As the platform moves or turns, antenna orientation information can be obtained in real time. At this point, all nodes in the network are calibrated to the same direction. Therefore, for any node in the network, when using the same directional antenna, their sector i-th sector all face the same direction.

[0084] Now we can apply the previous mathematical formula to the network. For any two nodes A and B in the network, assuming their beams are aligned, the positional difference between B and A is (Δx, Δy). Therefore, for A, the angle of B is... Here, the range of arctan is (0, 2π), and the value of arctan is related to the quadrants (1-4) corresponding to Δx and Δy. Conversely, the positional difference between A and B is (-Δx, -Δy), therefore, for B, the angle of A is... The phase difference between the two is 180°, therefore the relationship between the transmitting sector of node A and the receiving sector of node B at this time is:

[0085]

[0086] Since the gyroscopes and directional antennas of all nodes are identical, the sector distribution of the nodes in the network is known. If the total number of sectors M is even, then if two nodes A and B are neighbors, node A is located at node B's m-th sector. a A sector, specifically oriented as θ a Node B is located at node A's m-th node. b A sector, specifically oriented as θ b Then |θ| must exist. b -θ a =π|, that is When two nodes A and B are neighbors, their sectors must satisfy the above relationship when aligned. There are only M combinations of sectors that satisfy the alignment relationship. Therefore, only M scans are needed to scan all the combinations of sectors that satisfy the alignment relationship and find the corresponding sectors between the two nodes. Compared with blind scanning M*M, M scans save a lot of time.

[0087] like Figure 6 As shown, assuming M=4, the sector numbers of the nodes are S=0,1,2,3. There are only four possible sector alignment relationships between two neighboring nodes A and B: {0,2}, {1,3}, {2,0}, and {3,1}. Therefore, at most 4 scans are needed to complete the sector alignment of nodes A and B and find the corresponding sectors between nodes A and B.

[0088] Based on the above model, coarse-aligned sector scanning sequence design and transceiver sequence design can be performed.

[0089] (1) Sector scanning sequence design

[0090] For two adjacent nodes A and B, if node A is located in a certain sector m of node B, then node B must be located in the corresponding sector of node A Based on this corresponding sector characteristic, we can design the sector scanning sequence. The design goal of the sector scanning sequence is to ensure that for any two nodes A and B, when the transmitting and receiving states of the nodes match (one node is in the transmitting state and the other node is in the receiving state), there is always and 0≤k<M. Thus, node A and node B can achieve sector alignment at time k<M.

[0091]

[0092] When the time slot of node I is in the transmitting state, the sector sequence of the node is (0,1,2,...,M-1); when the node is in the receiving state, the sector sequence of the node is

[0093] In this case, the sectors of the node in the transmitting state and the sectors of the node in the receiving state are always mutually matching sectors. When one node scans to the corresponding matching sector, the other node must also scan to the corresponding matching sector, thereby realizing neighbor discovery. Between nodes with different transmitting and receiving states, neighbor discovery for two adjacent nodes at any relative position can be completed by performing at most M sector rotation scans.

[0094] An embodiment is given below to introduce the application of sector scanning sequence design.

[0095] As shown in Figure 7 , at this time, node A is a transmitting node, node B is a receiving node, node A is located in the 7th sector of node B, and node B is located in the 3rd sector of node A. According to Table 1, node A scans from sector 0 to sector 7, and node B scans from sector 4 to sector 3. It can be seen that when node A scans to sector 3 and node B scans to sector 7, the two nodes achieve sector alignment.

[0096] Node A (sends) 0 1 2 3 4 5 6 7 Node B (receiver) 4 5 6 7 0 1 2 3

[0097] Table 1

[0098] (2) Transceiver sequence design

[0099] The design of the send / receive sequence for the coarse alignment algorithm is as follows: First, the N nodes in the network are numbered {0, 1, 2, ..., N-1}. Then, the send / receive sequence is set according to the node numbers, with a sequence length of L = N. In the sequence of length L, only the element corresponding to the node ID is 1, and the rest are 0. 1 represents the sending node, and 0 represents the receiving node. The specific formula is expressed as follows:

[0100]

[0101] Here, the elements of sequence[i] are 1 and the length is L, while the elements of the other sequence sequences are all 0.

[0102] As an example, Table 2 shows the send and receive sequences at node number 3 with N=8 and M=8.

[0103] Send and receive sequence 0 0 0 0 0 0 0 0 Time slot <![CDATA[k8]]> <![CDATA[k9]]> <![CDATA[k 10 ]]> <![CDATA[k 11 ]]> <![CDATA[k 12 ]]> <![CDATA[k 13 ]]> <![CDATA[k 14 ]]> <![CDATA[k 15 ]]> Send and receive sequence 0 0 0 0 0 0 0 0 Time slot <![CDATA[k 16 ]]> <![CDATA[k 17 ]]> <![CDATA[k 18 ]]> <![CDATA[k 19 ]]> <![CDATA[k 20 ]]> <![CDATA[k 21 ]]> <![CDATA[k 22 ]]> <![CDATA[k 23 ]]> Send and receive sequence 0 0 0 0 0 0 0 0 Time slot <![CDATA[k 24 ]]> <![CDATA[k 25 ]]> <![CDATA[k 26 ]]> <![CDATA[k 27 ]]> <![CDATA[k 28 ]]> <![CDATA[k 29 ]]> <![CDATA[k 30 ]]> <![CDATA[k 31 ]]> Send and receive sequence 1 1 1 1 1 1 1 1 Time slot <![CDATA[k 32 ]]> <![CDATA[k 33 ]]> <![CDATA[k 34 ]]> <![CDATA[k 35 ]]> <![CDATA[k 36 ]]> <![CDATA[k 37 ]]> <![CDATA[k 38 ]]> <![CDATA[k 39 ]]> Send and receive sequence 0 0 0 0 0 0 0 0 Time slot <![CDATA[k 40 ]]> <![CDATA[k 41 ]]> <![CDATA[k 42 ]]> <![CDATA[k 43 ]]> <![CDATA[k 44 ]]> <![CDATA[k 45 ]]> <![CDATA[k 46 ]]> <![CDATA[k 47 ]]> Send and receive sequence 0 0 0 0 0 0 0 0 Time slot <![CDATA[k 48 ]]> <![CDATA[k 49 ]]> <![CDATA[k 50 ]]> <![CDATA[k 51 ]]> <![CDATA[k 52 ]]> <![CDATA[k 53 ]]> <![CDATA[k 54 ]]> <![CDATA[k 55 ]]> Send and receive sequence 0 0 0 0 0 0 0 0 Time slot <![CDATA[k 56 ]]> <![CDATA[k 57 ]]> <![CDATA[k 58 ]]> <![CDATA[k 59 ]]> <![CDATA[k 60 ]]> <![CDATA[k 61 ]]> <![CDATA[k 62 ]]> <![CDATA[k 63 ]]> Send and receive sequence 0 0 0 0 0 0 0 0

[0104] Table 2

[0105] Step 103: Convert the sequence number of nodes in the network into IDs in any base, set the round code of each node according to the converted IDs, determine the number of alignment sequences in each round, and use a narrow beam to perform fine alignment of the nodes in the network to complete the entire networking process.

[0106] Understandably, after coarse alignment is completed, each node has obtained neighbor information and corresponding sector relationships. Next, a narrow-beam antenna is used for fine beam alignment.

[0107] In this embodiment of the application, the decimal sequence ID of the node in the network is converted into an ID in any base. In this application, the base number is represented by the BASE value.

[0108] In one possible embodiment, the node numbered 2 has an ID of 02 in ternary.

[0109] Then, based on the converted ID, the round code of each node is set to determine the transmit and receive status of each node within a round. Specifically, the round code corresponding to the BASE base ID is set to 1, and the rest are 0. The length of the round code is the sum of all values ​​of the BASE base ID of the largest node, as shown in the formula:

[0110]

[0111] in, This represents the ID, which is a decimal number N-1 converted to base BASE. Therefore, id BASE Each bit corresponds to a BASE round, and the round corresponding to the highest bit is determined by the value of the highest bit.

[0112] In one possible embodiment, as shown in Table 3, nodes with BASE=3, N=9, and numbered {0,1,2,3,4,5,6,7,8} are used to describe the round codes of each node.

[0113] 0 00 100100 1 01 100010 2 02 100001 3 10 010100 4 11 010010 5 12 010001 6 20 001100 7 21 001010 8 22 001001

[0114] Table 3

[0115] It should be noted that here, 1 represents a transmitting node and 0 represents a receiving node. Since each node has a unique ID, the transmitting rounds of each node can cover the receiving rounds of all other nodes. However, because the model studied in this application considers signal collisions, the situation in Table 3 may result in signal collisions, making precise node alignment impossible. If it is necessary to ensure that there is only one transmitting node per time slot, then for a network with a maximum number of N nodes, a round code design with BASE = N must be adopted. However, this leads to an increase in the length of the round code sequence; in other words, to improve the success rate of network deployment, spatial reuse must be sacrificed.

[0116] It should be noted that collisions between signals are extreme cases; generally, it is believed that narrow beams will not collide.

[0117] In this embodiment, after designing the round code, the alignment sequence is designed. If the round code is 1, it is a sending sequence; if it is 0, it is a receiving sequence. First, the number of 0s and 1s in each round is counted, and the maximum value of the two is taken as the alignment sequence number for this round.

[0118] Generally, the number of sending nodes is less than the number of receiving nodes.

[0119] In one possible implementation, taking the transmitting node as an example, the node with the first round code of 1 in this round is selected, and the remaining nodes with the round code of 0 are sorted according to node order to form a transmitting sequence. For the node with the second round code of 1, the transmitting sequence of the node with the previous round code of 1 is shifted one position to the right, which ensures that there will be no conflict. This process continues until the transmitting sequence design for all transmitting nodes is completed. For the receiving node, the node with the first round code of 0 in this round is selected, and the remaining nodes with the round code of 1 are sorted according to node order to form a receiving sequence. At the same time, -1 is added to the end of the receiving sequence according to the alignment sequence number of this round, indicating that no antenna sector switching is required in this round. For the node with the second round code of 0, the receiving sequence of the node with the previous round code of 0 is shifted one position to the right, and this process continues until the receiving sequence design for all receiving nodes is completed.

[0120] In one possible embodiment, the sector scanning sequence design is shown in Table 4. Taking the nodes numbered 0 and 1 in Table 4 as examples, the round codes are 100100 and 010100, respectively.

[0121] 0 124578 036-1-1-1 1 147-1-1-1 023568 2 258-1-1-1 -1258-1-1 3 345678 834567 4 345-1-1-1 -1345-1-1 5 678-1-1-1 -1678-1-1

[0122] Table 4

[0123] Understandably, in a two-dimensional directional antenna model, sector alignment between two nodes can be completed in just M scans. However, in the system addressed in this application, both narrow-beam and wide-beam antennas are used. After initial coarse alignment is completed using the wide-beam antenna, further fine alignment is still required using the narrow-beam antenna. After initial alignment, this application obtains the initial sector relationship between the nodes, which allows for a reduction in the time required for narrow-beam alignment.

[0124] In this embodiment, the antenna angle of the wide-beam antenna is θ, and the antenna angle of the narrow-beam antenna is α. Therefore, the antenna sectors of the two are respectively... The sector ratio between the two is

[0125] Having completed the coarse alignment of the wide-beam antenna, this embodiment transforms the beam sector relationship of the wide-beam antenna into the beam sector relationship corresponding to the narrow-beam antenna. Since the narrow-beam antenna corresponds to only β pairs of sectors in the wide-beam antenna, it is assumed that the beam sector of the wide-beam antenna is m at this time. a ,m b Then, at this point, we can obtain the beam pair βm corresponding to the narrow beam antenna. a ,βm b ,βm a +1,βm b +1, βm a +2,βm b +2...βm a +β-1,βm b +β-1, after traversing β pairs, the precisely aligned sector between nodes A and B can be found.

[0126] In one possible implementation, such as Figure 8As shown, with a wide beam of 90° and a narrow beam of 30°, the sector correspondence of 0 and 2 in the 90° wide beam configuration is already known. Therefore, in the next step of fine alignment, with the narrow beam at 30°, there are 12 sector combinations. At this point, only sector rotation scanning of 0, 6, 1, 7, 2, and 8 is needed to complete the fine alignment of nodes A and B and discover the finely aligned sectors between nodes A and B. A total of 4 + 3 = 7 scans are used. If a 30° narrow beam were used for scanning and alignment from the beginning, 12 scans would be required. Therefore, this beam alignment model further reduces the number of beam alignments, even under the condition of already reducing the number of scans. Since this system only has two types of antennas, wide beam and narrow beam, further optimization is not possible. In extreme cases, a binary search can be used to minimize the number of scans.

[0127] This application's embodiments optimize the strategies for directional neighbor discovery and beam alignment by combining wide and narrow beams. While ensuring the network entry ratio of nodes, it reduces the time consumption of distributed node networking and beam alignment, and can well meet the networking requirements under different node distribution scenarios, providing a technical solution for rapid networking and beam alignment of directional self-organizing networks.

[0128] Figure 9 This is a block diagram of a directional wide and narrow beam networking optimization device 900 according to an embodiment of this application, comprising:

[0129] Synchronization module 910 is used to synchronize nodes within an ad hoc network using the SAND (Sector Antenna Neighbor Discovery) algorithm.

[0130] The coarse alignment module 920 is used to set the sector scan sequence design and transmit / receive sequence design based on the neighbor discovery planning algorithm SBA-D. It uses a wide beam to perform coarse alignment of nodes in the network. The sector scan sequence design is used to ensure that when any two nodes are in the node transmit / receive state matching, the sector alignment of the nodes is achieved within a certain time slot. The transmit / receive sequence design is used to ensure that the transmit / receive state of the nodes corresponds to the sector scan sequence in each time slot.

[0131] The fine alignment module 930 is used to convert the sequence number of nodes in the network into IDs in any number of bases, set the round code of each node according to the converted IDs, determine the number of alignment sequences in each round, and use a narrow beam to perform fine alignment of the nodes in the network to complete the entire networking process.

[0132] Regarding the apparatus in the above embodiments, the specific manner in which each module performs its operation has been described in detail in the embodiments related to the method, and will not be elaborated upon here.

[0133] Figure 10A schematic block diagram of an example electronic device 700 that can be used to implement embodiments of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device may also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0134] like Figure 10 As shown, device 700 includes a computing unit 701, which can perform various appropriate actions and processes based on a computer program stored in read-only memory (ROM) 702 or a computer program loaded from storage unit 708 into random access memory (RAM) 703. RAM 703 may also store various programs and data required for the operation of device 700. The computing unit 701, ROM 702, and RAM 703 are interconnected via bus 704. Input / output (I / O) interface 705 is also connected to bus 704.

[0135] Multiple components in device 700 are connected to I / O interface 705, including: input unit 706, such as keyboard, mouse, etc.; output unit 707, such as various types of monitors, speakers, etc.; storage unit 708, such as disk, optical disk, etc.; and communication unit 709, such as network card, modem, wireless transceiver, etc. Communication unit 709 allows device 700 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0136] The computing unit 701 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of the computing unit 701 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 701 performs the various methods and processes described above, such as the voice command response method. For example, in some embodiments, the voice command response method may be implemented as a computer software program tangibly contained in a machine-readable medium, such as storage unit 708. In some embodiments, part or all of the computer program may be loaded and / or installed on device 700 via ROM 702 and / or communication unit 709. When the computer program is loaded into RAM 703 and executed by the computing unit 701, one or more steps of the voice command response method described above may be performed. Alternatively, in other embodiments, the computing unit 701 may be configured to perform the voice command response method by any other suitable means (e.g., by means of firmware).

[0137] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0138] The program code used to implement the methods of this disclosure may be written in any combination of one or more programming languages. This program code may be provided to a processor or controller of a general-purpose computer, special-purpose computer, or other programmable data processing apparatus, such that when executed by the processor or controller, the program code causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The program code may be executed entirely on a machine, partially on a machine, as a standalone software package partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0139] In the context of this disclosure, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can be, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0140] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device for displaying information to the user (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor); and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the computer. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0141] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or middleware components (e.g., application servers), or frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), the Internet, and blockchain networks.

[0142] Computer systems can include clients and servers. Clients and servers are generally geographically separated and typically interact via communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. A server can be a cloud server, also known as a cloud computing server or cloud host, a hosting product within the cloud computing service ecosystem, addressing the shortcomings of traditional physical hosts and VPS (Virtual Private Server, or simply "VPS") services, such as high management difficulty and weak business scalability. Servers can also be servers for distributed systems or servers incorporating blockchain technology.

[0143] It should be understood that the various forms of processes shown above can be used to rearrange, add, or delete steps. For example, the steps described in this disclosure can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this disclosure can be achieved, and this is not limited herein.

[0144] The specific embodiments described above do not constitute a limitation on the scope of protection of this disclosure. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this disclosure should be included within the scope of protection of this disclosure.

Claims

1. A method for optimizing directional wide and narrow beam networking, characterized in that, include: Nodes within a self-organizing network are synchronized using the SAND (Sector Antenna Neighbor Discovery) algorithm. Based on the neighbor discovery planning algorithm SBA-D, the sector scan sequence design and transmit / receive sequence design are set, and a wide beam is used to coarsely align the nodes in the network. The sector scan sequence design is used to ensure that when any two nodes are in the node transmit / receive state matching, the sector alignment of the nodes is achieved within a preset time slot. The transmit / receive sequence design is used to ensure that the transmit / receive state of the nodes in each time slot corresponds to the sector scan sequence. When using a wide beam to coarsely align nodes within the network, a time slot is configured so that only one node is a transmitting node and the rest are receiving nodes. The design of the sector scan sequence and transmit / receive sequence based on SBA-D includes: The nodes within the network are numbered, and the sector scan sequence of the nodes is set using a preset sector sequence formula, which is: In the formula, This represents the sector scan sequence in time slot k for node number i. This represents the transmit / receive status of node i in time slot k, where M is the total number of sectors. This represents the node with node number i in the transmitting state when time slot k is in the transmitting state. Select 1 if the value is 1, otherwise select 0. The transmit / receive sequence is set according to the node numbers within the network and a preset transmit / receive sequence formula, wherein the length of the transmit / receive sequence is the same as the number of nodes, and the preset transmit / receive sequence formula is: Where i represents the node number; The process involves converting the sequence numbers of nodes within the network into IDs in any base, setting the round code for each node based on the converted IDs, determining the alignment sequence number within each round, and using a narrow beam to perform precise alignment of the nodes within the network. This completes the entire network setup process, which specifically includes: Based on the converted ID, set the round code for each node to determine the transmit / receive status of each node within a round. Specifically, the round code corresponding to the BASE base ID is set to 1, and the rest are 0. The length of the round code is the sum of the digits of the BASE base ID of the largest node, as shown in the formula: in, This represents the ID with decimal number N-1 converted to base BASE. The length of the node sequence; Count the number of 0s and 1s in all IDs in each round, and take the maximum of the two as the number of alignment sequences in each round; Based on the alignment sequence number, a narrow beam is used to precisely align the nodes within the network.

2. The method according to claim 1, characterized in that, The synchronization of nodes within the self-organizing network via SAND includes: After all nodes are powered on, set one node as the token holder node and the rest as fast-spinning nodes; The fast rotating node continuously switches sectors in fast scan mode and prepares to receive signals, and the token holding node sends signals to each sector. When a fast-spinning node receives a signal, it disables the fast-scanning mode of that node and aligns its sector with the token-holding node. Once all the fast-spinning nodes have received the signal, the token-holding node is controlled to stop sending signals, thus completing the synchronization of all nodes within the self-organizing network.

3. A directional wide and narrow beam networking optimization device, characterized in that, include: The synchronization module is used to synchronize nodes within the self-organizing network using the SAND (Sector Antenna Neighbor Discovery) algorithm. The coarse alignment module is used to set the sector scan sequence design and transmit / receive sequence design based on the neighbor discovery planning algorithm SBA-D. It uses a wide beam to coarsely align nodes in the network. The sector scan sequence design is used to ensure that when any two nodes are in the node transmit / receive state matching, the sector alignment of the nodes is achieved within a certain time slot. The transmit / receive sequence design is used to ensure that the transmit / receive state of the nodes corresponds to the sector scan sequence in each time slot. When using a wide beam to coarsely align nodes within the network, a time slot is configured so that only one node is a transmitting node and the rest are receiving nodes. The design of the sector scan sequence and transmit / receive sequence based on SBA-D includes: The nodes within the network are numbered, and the sector scan sequence of the nodes is set using a preset sector sequence formula, which is: In the formula, This represents the sector scan sequence in time slot k for node number i. This represents the transmit / receive status of node i in time slot k, where M is the total number of sectors. This represents the node with node number i in the transmitting state when time slot k is in the transmitting state. Select 1 if the value is 1, otherwise select 0. The transmit / receive sequence is set according to the node numbers within the network and a preset transmit / receive sequence formula, wherein the length of the transmit / receive sequence is the same as the number of nodes, and the preset transmit / receive sequence formula is: Where i represents the node number; The fine alignment module is used to convert the sequence number of nodes in the network into IDs in any base, set the round code of each node according to the converted IDs, determine the number of alignment sequences in each round, and use a narrow beam to perform fine alignment of the nodes in the network, completing the entire networking process. Specifically, it includes: Based on the converted ID, set the round code for each node to determine the transmit / receive status of each node within a round. Specifically, the round code corresponding to the BASE base ID is set to 1, and the rest are 0. The length of the round code is the sum of the digits of the BASE base ID of the largest node, as shown in the formula: in, This represents the ID with decimal number N-1 converted to base BASE. The length of the node sequence; Count the number of 0s and 1s in all IDs in each round, and take the maximum of the two as the number of alignment sequences in each round; Based on the alignment sequence number, a narrow beam is used to precisely align the nodes within the network.

4. 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-2.

5. 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-2.

6. 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-2.

Images