Subnet fusion method of self-organizing network based on multi-beam directional antenna

Abstract

The invention discloses a sub-network convergence method of a self-organizing network based on a multi-beam directional antenna, which comprises the following steps of: 1, setting different silence time for each sub-network, so that the communication states of nodes in different sub-networks in a neighbor discovery period are not completely the same; 2, defining a specific neighbor discovery time period communication state change period of the subnet, and increasing the effective interaction time among the nodes in the neighbor discovery time period by reversing the communication states of all the nodes in the subnet in the neighbor discovery time period; according to the invention, the problem that neighbor discovery cannot be carried out due to consistent communication states of the nodes or handshake cannot be carried out after beam alignment between the nodes due to insufficient communication duration is solved, so that more stable and efficient data transmission can be realized, and the self-adaptive capability and expansibility of the network are enhanced; and various application scenes in a large-scale and dynamic environment can be effectively supported.

Description

Technical Field

[0001] The invention belongs to the technical field of communications, and in particular relates to a subnet fusion method of a self-organizing network based on multi-beam directional antennas. Background Art

[0002] A directional ad hoc network is a self-organizing network that uses multi-beam directional antennas. Each node in the network has an equal status and has the ability to send, receive and forward data. Compared with traditional mobile ad hoc networks, nodes in a directional ad hoc network move at high speeds and are located at high altitudes, and communication can only be achieved when the directional antennas are aligned with each other. Since this network does not rely on traditional network equipment such as base stations and routers, each mobile node can serve as both a source node and a destination node, as well as a relay node, thus showing great flexibility in an environment without infrastructure. This makes directional ad hoc networks play a huge role in scenarios where traditional networks cannot cover or cannot work properly.

[0003] In any wireless network, network convergence is a critical issue. Due to the high-speed movement of nodes, frequent changes in network topology, and the constraints between multi-beam directional antennas, multiple subnets will gradually form in a directional ad hoc network, and as the subnets move and approach, subnet convergence occurs. When designing a subnet convergence solution, the following issues need to be considered:

[0004] (1) Avoiding time slot conflicts: When edge nodes in different subnets perform neighbor discovery, the sending and receiving time slots should be staggered as much as possible to avoid sending and receiving conflicts at the same time, so as to ensure that information exchange between subnets can proceed smoothly.

[0005] (2) Optimization of available time slot length: When the available interaction time slot length of two nodes is insufficient for information exchange, a new mechanism is needed to optimize the time slot staggering to increase the success rate of neighbor discovery and ensure the stability of the communication link.

[0006] (3) Time synchronization problem: Since the beam states of multi-beam directional antennas are the same at the same time, the time synchronization of the two subnets is particularly important during the subnet fusion process. A reasonable time synchronization mechanism can ensure the efficient implementation of the fusion process.

[0007] However, the existing subnet fusion technology still has some shortcomings:

[0008] Existing subnet fusion technologies usually operate only after one subnet receives information from another subnet, without considering the situation where nodes cannot receive information from another subnet due to misalignment of transmit and receive time slots or too short available communication time. In the event of subnet fusion failure, existing technologies lack a fast and effective recovery mechanism, which may cause the network to be unstable for a long time, affecting communication quality and business continuity. In addition, existing technologies are usually based on omnidirectional antennas and cannot be directly applied to self-organizing networks equipped with multi-beam directional antennas. Summary of the invention

[0009] The present invention aims to solve the deficiencies of the above-mentioned prior art and proposes a subnet fusion method for a self-organizing network based on a multi-beam directional antenna, in order to ensure that two subnets with communication needs can be merged into one network, thereby improving the overall resource utilization of the network, reducing communication delays and network congestion, thereby achieving more stable and efficient data transmission, enhancing the network's adaptability and scalability, and effectively supporting a variety of application scenarios in large-scale and dynamic environments.

[0010] In order to achieve the above object, the technical solution adopted by the present invention is:

[0011] The present invention discloses a subnet fusion method for a self-organizing network based on a multi-beam directional antenna, which is applied to n subnets equipped with multi-beam directional antennas. In the self-organizing network U, represents the ith subnet equipped with multi-beam directional antennas, and , express The jth node in For subnet The number of nodes in The priority is ;make The number is , and the number is unique;

[0012] Define the first K time slots of the communication cycle T as the neighbor discovery period;

[0013] Define the i-th subnet The jth node in In the kth time slot The communication status is ,when express In the kth time slot The communication status is sending information. express In the kth time slot The communication status is receiving information; ∈T; 0 < k < K; K represents the total number of time slots in the neighbor discovery period;

[0014] Assume the i-th subnet The p-th node in Has established a link with the j-th node ;

[0015] When The communication status of And The communication status of At this time, it means that in the k-th time slot From To Send information;

[0016] When The communication status of And The communication status of At this time, it means that in the k-th time slot From To Send information; The feature is that the subnet fusion method includes the following steps:

[0017] Step 1, calculate The silent time of , where Is the node number with the highest priority in the i-th subnet Before the moment of In the communication cycle T, Is in a silent state, after the moment of In the communication cycle T, Enters the neighbor discovery period; and in the neighbor discovery period, The node corresponding to The communication status is that sending information and receiving information alternate continuously, and the node All beams are in the same communication state at the same moment;

[0018] Step 2, calculate The silent time of , where Is the node number with the highest priority in the h-th subnet Before the moment of In the communication cycle T, the subnet Is in a silent state, after the moment of In the communication cycle T, it enters the neighbor discovery period; and in the neighbor discovery period, The node corresponding to The communication status is that sending information and receiving information alternate continuously, and All beams of are in the same communication state at the same time;

[0019] Step 3: During the neighbor discovery period, when the i-th subnet The jth node in The beam detects the Subnet The bth node in When the subnet The jth node in Communication status in the first time slot and Subnet Middle Nodes Communication status in the first time slot Are they the same? If they are the same, go to step 4; otherwise, go to step 5.

[0020] Step 4: Calculation and In the kth time slot Interaction time , and judge Is it true? If true, it means that the i-th subnet The jth node in and the hth subnet The bth node in If there is enough time to exchange information, execute step 7, otherwise, execute step 6; wherein, Indicates the minimum time required for nodes to exchange information during the neighbor discovery period;

[0021] Step 5: Calculation , and judge Is it true? If true, it means that the i-th subnet The jth node in and the hth subnet The bth node in If there is enough time to exchange information, go to step 7; otherwise, go to step 6;

[0022] Step 6: Define the i-th subnet The number of communication status change cycles during the neighbor discovery period is , and initialize , and define the i-th subnet The initial moment of communication state change is ;

[0023] Definition Subnet The number of communication status change cycles during the neighbor discovery period is , and initialize , and define the Subnet The initial moment of communication state change is ;

[0024] like , then for Subnet The communication state of all nodes in the neighbor discovery period is reversed, otherwise, the i-th subnet The communication state of all nodes in the neighbor discovery period is reversed; after the reversal, let ;

[0025] Step 7: The i-th subnet The jth node in and Subnet The bth node in In the neighbor discovery period, the silent time and the number of communication status change cycles of the subnet to which the network belongs are exchanged, and the number of communication status change cycles of the network to which the network belongs is obtained from the i-th subnet. and Subnet The smaller number of silent time and communication status change cycles is selected as the silent time and communication status change cycle of the new subnet after fusion under the new communication cycle, and it is notified to the i-th subnet to which it belongs respectively. and the Subnet Other nodes in the network, thus realizing the i-th subnet and Subnet Synchronize in the new communication cycle and complete the i-th subnet and Subnet fusion of.

[0026] An electronic device of the present invention includes a memory and a processor, wherein the memory is used to store a program that supports the processor to execute the method, and the processor is configured to execute the program stored in the memory.

[0027] The present invention provides a computer-readable storage medium, wherein a computer program is stored on the computer-readable storage medium, and the computer program executes the steps of the method when executed by a processor.

[0028] Compared with the prior art, the present invention has the following effects:

[0029] 1. The present invention effectively reduces the probability that adjacent subnets cannot discover each other during the neighbor discovery period due to the same beam state by setting different silent times for each subnet. Compared with the prior art solutions, through the silent time allocation mechanism of the present invention, different subnets enter the neighbor discovery period after being silent for different times, avoiding the situation where the node communication states of different subnets during the neighbor discovery period are exactly the same, thereby significantly improving the success rate of neighbor discovery.

[0030] 2. The present invention designs a subnet-specific neighbor discovery period communication status change cycle, which solves the problem that different subnets may not be able to shake hands and establish links due to too short communication time; compared with the existing technical solutions, by setting flexible neighbor discovery period communication status change cycles for different subnets, the communication status of all nodes in the subnet during the neighbor discovery period is reversed after a period of time, which increases the available time slot in the neighbor discovery period, and overcomes the problem of nodes being unable to discover neighbors due to the existing communication time being insufficient for handshakes. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Figure 1 It is a structural diagram of the subnet fusion method provided by the present invention;

[0032] Figure 2 is a network structure diagram of an embodiment of the present invention;

[0033] Figure 3 It is a communication state structure diagram of the neighbor discovery period according to an embodiment of the present invention. DETAILED DESCRIPTION

[0034] In this embodiment, a subnet fusion method of a self-organizing network based on a multi-beam directional antenna is designed for a scenario where subnets are continuously generated and merged in a self-organizing network equipped with a multi-beam directional antenna, so that the sending and receiving time slots of the subnets are staggered during the neighbor discovery period to perform subnet fusion, and a solution is provided for the situation where the effective interaction time of different subnets during the neighbor discovery period is insufficient for handshake. Specifically, if Figure 2 As shown, there are n subnets Constitute a self-organizing network U, where represents the ith subnet equipped with multi-beam directional antennas, and , express The jth node in For subnet The number of nodes in The priority is ;make The number is , and the number is unique;

[0035] Define the first K time slots of the communication period T as the neighbor discovery period; the neighbor discovery period is used for the detection alignment and handshake of beams between nodes.

[0036] Define the j-th node in the i-th subnet at the k-th time slot has a communication state of when indicates that at the k-th time slot the communication state is to send information, when indicates that at the k-th time slot the communication state is to receive information; ∈T; 0 < k < K; K represents the total number of time slots in the neighbor discovery period;

[0037] Assume that the p-th node in the i-th subnet has established a link with the j-th node ;

[0038] When the communication state of and the communication state of at the k-th time slot from to send information;

[0039] When the communication state of and the communication state of at the k-th time slot from to send information;

[0040] In a specific embodiment, as Figure 2 shown, there are subnets and subnet in the ad-hoc network U, where the solid line indicates that a two-way link has been established between two nodes; the dashed line indicates that the beams between two nodes have been aligned and the neighbor discovery operation is in progress. As Figure 1 shown, the subnet fusion method includes the following steps:

[0041] Step 1, calculate the silent time of , where is the node number with the highest priority in the i-th subnet ; before the moment of the communication period T, In silent state, during the communication cycle T After the moment, Enter the neighbor discovery period; Setting the silent time can stagger the time slots of the neighbor discovery period between different subnets to avoid the nodes in the two subnets entering the communication range of each other being unable to discover neighbors because the communication status of the beams is exactly the same; and in the neighbor discovery period, The corresponding node The communication state is that sending and receiving information are constantly alternating, and the node All beams are in the same communication state at the same time.

[0042] Step 2: Calculation Quiet time ,in, It is the hth subnet The node number with the highest priority in the communication cycle T Previous time subnet In silent state, during the communication cycle T After the time, the neighbor discovery period begins; and during the neighbor discovery period, The corresponding node The communication state is that sending information and receiving information are constantly alternating, and All beams of are in the same communication state at the same time;

[0043] In a specific embodiment, the subnet Midpoint is the node with the highest priority, and its number is , then the subnet The silent time is ; Subnet Midpoint is the node with the highest priority, and its number is , then the subnet The silent time is .like Figure 3 As shown, .

[0044] Step 3: During the neighbor discovery period, when the i-th subnet The jth node in The beam detects the Subnet The bth node in When Figure 3 As shown, determine the subnet The jth node in Communication status in the first time slot and Subnet Middle Nodes Communication status in the first time slot Are they the same? If they are the same, go to step 4; otherwise, go to step 5.

[0045] Step 4: Calculation and In the kth time slot Interaction time , and judge Is it true? If true, it means the i-th subnet The jth node in and the hth subnet The bth node in If there is enough time to exchange information, execute step 7; otherwise, execute step 6; wherein, Indicates the minimum time required for nodes to exchange information during the neighbor discovery period.

[0046] Step 5: Calculation , and judge Is it true? If true, it means the i-th subnet The jth node in and the hth subnet The bth node in If there is enough time to exchange information, go to step 7; otherwise, go to step 6;

[0047] In a specific embodiment, the i-th subnet The jth node in Communication status in the first time slot , the hth subnet The bth node in Communication status in the first time slot , the communication state is the same in the k=1 time slot, and the calculation is ,and , subnet Midpoint and subnet Midpoint Unable to shake hands.

[0048] Step 6: Define the i-th subnet The number of communication status change cycles during the neighbor discovery period is , and initialize , and define the i-th subnet The initial moment of communication state change is The purpose of setting the communication state change cycle during the neighbor discovery period is to reverse the communication state of all nodes in the subnet during the neighbor discovery period after a specified time. For the situation where nodes in other subnets have been detected but the communication time is too short to handshake, this measure can increase the available time of nodes in the current subnet and nodes in other subnets in the neighbor discovery period, thereby increasing the probability of successful neighbor discovery.

[0049] Definition Subnet The number of communication status change cycles during the neighbor discovery period is , and initialize , and define the Subnet The initial moment of communication state change is ;

[0050] like , then for Subnet The communication state of all nodes in the neighbor discovery period is reversed, otherwise, the i-th subnet The communication state of all nodes in the neighbor discovery period is reversed; after the reversal, let ;

[0051] In a specific embodiment, the subnet At the moment of initial communication state change Enter the neighbor discovery period communication state change cycle, and the number is , and initialize ; Subnet At the moment of initial communication state change Enter the neighbor discovery period communication state change cycle, and the number is , and initialize ;because , subnet The communication state of all nodes in the neighbor discovery period is reversed; after the reversal, the subnet Midpoint of , subnet Midpoint of , the communication state is different in the k=1 time slot, and the calculation is .

[0052] Step 7: The i-th subnet The jth node in and Subnet The bth node in During the neighbor discovery period, the silent time and the number of communication status change cycles of the subnet to which it belongs are exchanged, starting from the i-th subnet and Subnet The smaller number of silent time and communication status change cycles is selected as the silent time and communication status change cycle of the new subnet after fusion under the new communication cycle, and it is notified to the i-th subnet to which it belongs respectively. and the Subnet Other nodes in the network, thus realizing the i-th subnet and Subnet Synchronize in the new communication cycle and complete the i-th subnet and Subnet fusion of.

[0053] In a specific embodiment, through the subnet After all nodes in the network reverse the communication state of the neighbor discovery period, Midpoint and subnet Midpoint There is enough handshake time to exchange information about the quiet time of the subnet to which it belongs and the number of communication status change cycles. , the i-th subnet and Subnet choose is the quiet time of the new subnet after fusion, that is, Keep it as is, subnet Change the quiet time to , change the number of communication status change cycles during the neighbor discovery period to .node and nodes Notify each subnet to which it belongs and the subnet to which it belongs Other nodes in the network implement the i-th subnet and Subnet Synchronization under the new communication cycle, such as Figure 3 As shown, so far, and Successful integration.

[0054] In this embodiment, an electronic device includes a memory and a processor, wherein the memory is used to store a program that supports the processor to execute the above method, and the processor is configured to execute the program stored in the memory.

[0055] In this embodiment, a computer-readable storage medium stores a computer program on the computer-readable storage medium, and the computer program executes the steps of the above method when executed by a processor.

Claims

1. A subnet fusion method for a self-organizing network based on multi-beam directional antennas is applied to n subnets equipped with multi-beam directional antennas. In the self-organizing network U, represents the ith subnet equipped with multi-beam directional antennas, and , express The jth node in For subnet The number of nodes in The priority is ;make The number is , and the number is unique; Define the first K time slots of the communication cycle T as the neighbor discovery period; Define the i-th subnet the j-th node in at the k-th time slot the communication state is , when denotes at the k-th time slot the communication state is to send information, when denotes at the k-th time slot the communication state is to receive information; ∈T; 0 < k < K; K represents the total number of time slots in the neighbor discovery period; Assume that the i-th subnet The pth node in With the jth node Links have been established; when Communication status and Communication status , indicating that in the kth time slot Depend on Towards Send a message; when Communication status and Communication status , indicating that in the kth time slot Depend on Towards Sending information; characterized in that the subnet fusion method comprises the following steps: Step 1. Calculation Quiet time ,in, is the i-th subnet The node number with the highest priority in the communication cycle T Before the moment, In silent state, during the communication cycle T After the moment, Entering a neighbor discovery period; and in the neighbor discovery period, The corresponding node The communication state is that sending and receiving information are constantly alternating, and the node All beams of are in the same communication state at the same time; Step 2: Calculation Quiet time ,in, It is the hth subnet The node number with the highest priority in the communication cycle T Previous time subnet In silent state, during the communication cycle T After the time, the neighbor discovery period begins; and during the neighbor discovery period, The corresponding node The communication state is that sending information and receiving information are constantly alternating, and All beams of are in the same communication state at the same time; Step 3: During the neighbor discovery period, when the i-th subnet The jth node in The beam detects the Subnet The bth node in When the subnet The jth node in Communication status in the first time slot and Subnet Middle Nodes Communication status in the first time slot Are they the same? If they are the same, go to step 4; otherwise, go to step 5. Step 4: Calculation and In the kth time slot Interaction time , and judge Is it true? If true, it means that the i-th subnet The jth node in and the hth subnet The bth node in If there is enough time to exchange information, execute step 7, otherwise, execute step 6; wherein, Indicates the minimum time required for nodes to exchange information during the neighbor discovery period; Step 5: Calculation , and judge Is it true? If true, it means that the i-th subnet The jth node in and the hth subnet The bth node in If there is enough time to exchange information, go to step 7; otherwise, go to step 6; Step 6: Define the i-th subnet The number of communication status change cycles during the neighbor discovery period is , and initialize , and define the i-th subnet The initial moment of communication state change is ; Definition Subnet The number of communication status change cycles during the neighbor discovery period is , and initialize , and define the Subnet The initial moment of communication state change is ; like , then for Subnet The communication state of all nodes in the neighbor discovery period is reversed, otherwise, the i-th subnet The communication state of all nodes in the neighbor discovery period is reversed; after the reversal, let ; Step 7: The i-th subnet The jth node in and Subnet The bth node in In the neighbor discovery period, the silent time and the number of communication status change cycles of the subnet to which the network belongs are exchanged, and the number of communication status change cycles of the network to which the network belongs is obtained from the i-th subnet. and Subnet The smaller number of silent time and communication status change cycles is selected as the silent time and communication status change cycle of the new subnet after fusion under the new communication cycle, and it is notified to the i-th subnet to which it belongs respectively. and the Subnet Other nodes in the network, thus realizing the i-th subnet and Subnet Synchronize in the new communication cycle and complete the i-th subnet and Subnet fusion of.

2. An electronic device, comprising a memory and a processor, characterized in that: The memory is used to store a program that supports a processor to execute the method according to claim 1, and the processor is configured to execute the program stored in the memory.

3. A computer-readable storage medium having a computer program stored thereon, characterized in that: The computer program executes the steps of the method according to claim 1 when executed by a processor.

Images