A broadcast routing method and apparatus for an ad hoc network

Abstract

The application discloses a broadcast routing method of a self-organizing network. The method first selects a network node set in which two neighbor nodes are not one-hop neighbors as a network relay node candidate set, secondly selects a network node set satisfying a minimum value of relay node numbers and ensuring full connectivity of the network from the network relay node candidate set as a network relay node total set, and finally selects a network node set with a maximum value of height position information from the network relay node total set as a network relay node set. The network relay node set is calculated from the entire network node set, is the most widely covered and has the least number of network relay nodes, can maximally reduce bandwidth required by full network broadcast, and improves network communication efficiency.

Description

Technical Field

[0001] This application relates to the field of distributed broadcast routing technology, and more specifically, to a broadcast routing method and apparatus for self-organizing networks. Background Technology

[0002] Ad hoc networks (AHs) are networks formed by a group of wireless nodes according to certain rules. Nodes in the network send and receive data on channels according to prescribed access methods and perform distributed network management. Routing is one of the key technologies in AH research; the quality of the routing protocol design directly affects the performance of the entire network. Routing protocols in AHs include unicast routing protocols, multicast routing protocols, and broadcast routing protocols.

[0003] Routing is a key technology in ad hoc network research, encompassing unicast routing, multicast routing, and broadcast routing. Unicast routing protocols are used by source nodes to send data to a specific destination node in the network; multicast routing protocols are used by source nodes to send data to a subset of nodes in the network; and broadcast routing protocols are used by source nodes to send data to all other nodes in the network. Broadcast routing protocols are not only used for network-wide service broadcasting but are also an important means of implementing the route discovery process in unicast routing protocols and the group membership maintenance process in multicast routing protocols. For example, OLSR is a unicast routing protocol suitable for ad hoc networks and is a typical link-state routing protocol, where the link information of each node in the network needs to be broadcast throughout the network.

[0004] To reduce the bandwidth required for network-wide broadcasting, many broadcast routing algorithms have been proposed in the existing technology. However, most of them rely on neighbor-aware information, such as one-hop neighbor information based on perception, two-hop neighbor information based on perception, and network-wide topology information based on perception. By selecting some nodes in the network as relay nodes to forward the received network-wide broadcast messages, the network-wide broadcast messages sent by any node in the network can be spread to all other nodes in the network. However, how to select the fewest relay nodes to make the network fully connected is one of the problems that those skilled in the art need to consider. Summary of the Invention

[0005] The purpose of this application is to overcome the shortcomings of existing technologies and provide a broadcast routing method and apparatus for self-organizing networks. By calculating the network relay node set with the widest coverage and the fewest number of network relay nodes from the entire network node set, the bandwidth required for network-wide broadcasting can be reduced to the minimum, thereby improving network communication efficiency.

[0006] The objective of this application is achieved through the following technical solution:

[0007] In a first aspect, this application proposes a broadcast routing method for ad hoc networks, the method comprising:

[0008] Select a set of network nodes whose two neighboring nodes are not one-hop neighbors as the candidate set of network relay nodes;

[0009] From the candidate set of network relay nodes, select the set of network nodes that satisfies the minimum number of relay nodes and guarantees full network connectivity as the total set of network relay nodes;

[0010] The set of network nodes with the maximum height location information is selected from the total set of network relay nodes as the network relay node set.

[0011] In one possible implementation, the method further includes:

[0012] The network relay nodes in the network relay node set will relay and forward the received network-wide broadcast messages.

[0013] In one possible implementation, the step of selecting a set of network nodes whose two neighboring nodes are not one-hop neighbors as the candidate set of network relay nodes includes:

[0014] Select a network node and determine whether the two neighboring nodes of the network node are one-hop neighbors;

[0015] If a network node has two neighboring nodes that are not one-hop neighbors, then the network node is added to the network candidate set.

[0016] Iterate through all network nodes and add network nodes whose two neighboring nodes are not one-hop neighbors to the network relay node candidate set.

[0017] In one possible implementation, the step of selecting a set of network nodes from the candidate set of network relay nodes that satisfies the minimum number of nodes and guarantees full network connectivity as the total set of network relay nodes includes:

[0018] S1. If the candidate set of relay nodes in the network is not empty, initialize the number of calculations c = 0 and set the number of nodes m = 1.

[0019] S2. Select m network relay nodes from the candidate set of network relay nodes, and accumulate the calculation count c, with the accumulation count being 1.

[0020] S3. Determine whether the value of the number of nodes m is equal to 1 or greater than 1. If it is equal to 1, execute S4; if it is greater than 1, execute S5.

[0021] S4. Determine whether the union of the neighbor set of the selected network relay node and the network relay node itself is equal to the total set of network nodes. If it is equal, proceed to S6; otherwise, proceed to S7.

[0022] S5. Determine whether the union of the neighbor nodes of the selected network relay node satisfies the condition. NA is the total set of network nodes, and Nb(i) is the set of neighbor nodes of the selected network relay node. If the conditions are met, execute S6; otherwise, execute S7.

[0023] S6. Place the selected set that guarantees full network connectivity into the total set of network relay nodes;

[0024] S7. Determine the number of calculations. Whether it is true or false, n is the number of nodes in the candidate set of network relay nodes. If it is true, execute S8; if it is false, execute S9.

[0025] S8. Determine if the total set of network relay nodes is empty. If it is, execute S9; otherwise, execute S11.

[0026] S9. Update the calculation count c = 0, and accumulate the number of nodes m, with an accumulation count of 1;

[0027] S10. Determine if m>n is true. If true, execute S11; otherwise, execute S2.

[0028] S11. The calculation ends, and the total set of network relay nodes is obtained.

[0029] Secondly, this application also proposes a broadcast routing device for ad hoc networks, the device comprising:

[0030] Network relay node candidate set module: Selects a set of network nodes whose two neighbor nodes are not one-hop neighbors as the network relay node candidate set;

[0031] Network relay node set module: Selects a set of network nodes from the candidate set of network relay nodes that satisfies the minimum number of relay nodes and ensures full network connectivity as the network relay node set;

[0032] The network relay node set module selects the set of network nodes with the maximum height location information from the total set of network relay nodes as the network relay node set.

[0033] In one possible implementation, the device further includes:

[0034] The forwarding module is used to relay and forward received network-wide broadcast messages through network relay nodes in the network relay node set.

[0035] In one possible implementation, the network relay node candidate set module is further configured to:

[0036] Select a network node and determine whether the two neighboring nodes of the network node are one-hop neighbors;

[0037] If a network node has two neighboring nodes that are not one-hop neighbors, then the network node is added to the network candidate set.

[0038] Iterate through all network nodes and add network nodes whose two neighboring nodes are not one-hop neighbors to the network relay node candidate set.

[0039] Thirdly, this application also proposes a computer device comprising a processor and a memory, wherein the memory stores a computer program that is loaded and executed by the processor to implement a broadcast routing method for self-organizing networks as described in any of the first aspects.

[0040] Fourthly, this application also proposes a computer-readable storage medium storing a computer program that is loaded and executed by a processor to implement a broadcast routing method for ad hoc networks as described in any of the first aspects.

[0041] The main solution and its various further alternatives described above can be freely combined to form multiple solutions, all of which are solutions that can be adopted and are claimed in this application; furthermore, the (non-conflicting alternatives) can also be freely combined with each other and with other alternatives. Those skilled in the art, after understanding the solution of this application, will realize from the prior art and common general knowledge that there are many combinations, all of which are technical solutions to be protected by this application, and will not be exhaustively listed here.

[0042] This application discloses a broadcast routing method for ad hoc networks. The method first selects a set of network nodes whose two neighboring nodes are not one-hop neighbors as a candidate set of network relay nodes. Then, it selects a set of network nodes from the candidate set that satisfies the minimum number of relay nodes and guarantees full network connectivity as the total set of network relay nodes. Finally, it selects a set of network nodes from the total set of network relay nodes that has the maximum value of height location information as the network relay node set. By calculating the network relay node set with the widest coverage and the fewest number of network relay nodes from the entire set of network nodes, the bandwidth required for broadcasting across the entire network can be reduced to the minimum, thereby improving network communication efficiency. Attached Figure Description

[0043] Figure 1 A flowchart illustrating the broadcast routing method for self-organizing networks provided in an embodiment of this application is shown.

[0044] Figure 2 A schematic diagram of a sub-process of step S200 provided in an embodiment of this application is shown.

[0045] Figure 3 A schematic diagram of the network topology before broadcast route calculation is shown.

[0046] Figure 4A schematic diagram of the network topology generated from the candidate set of network relay nodes is shown.

[0047] Figure 5 A schematic diagram of the network relay node set proposed in the embodiments of this application is shown. Detailed Implementation

[0048] The following specific examples illustrate the implementation of this application. Those skilled in the art can easily understand other advantages and effects of this application from the content disclosed in this specification. This application can also be implemented or applied through other different specific embodiments, and various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of this application. It should be noted that, unless otherwise specified, the following embodiments and features in the embodiments can be combined with each other.

[0049] Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0050] In existing technologies, most broadcast routing algorithms rely on neighbor-aware information, such as one-hop neighbor information, two-hop neighbor information, and network topology information, to perform broadcast route calculations. By selecting a subset of nodes in the network as relay nodes to forward received network-wide broadcast messages, broadcast messages sent by any node in the network can be disseminated to all other nodes in the network. However, how to select the fewest relay nodes to ensure full network connectivity remains a problem that those skilled in the art need to consider.

[0051] Therefore, in order to solve the above problems, this application proposes a broadcast routing method for self-organizing networks. Compared with traditional broadcast routing methods, it can calculate the network relay node set with the widest coverage and the fewest number of nodes, and can minimize the bandwidth required for network-wide broadcasting and improve network communication efficiency. The following is a detailed description of the method.

[0052] Please refer to Figure 1 , Figure 1 The diagram illustrates a flowchart of a broadcast routing method for ad hoc networks provided in an embodiment of this application. This method, applied to ad hoc networks, includes the following steps:

[0053] S100. Select a set of network nodes whose two neighboring nodes are not one-hop neighbors as the candidate set of network relay nodes.

[0054] First, all nodes in the network periodically acquire the network topology and network topology information, and use the distributed calculation of their own network relay node identity. The network topology information includes the total set of network nodes, the neighbor information Nb(i) of the neighbor nodes of the selected network relay node, the union Nb[i] of each network relay node itself and its neighbors, and height location information, etc.

[0055] The specific process of step S100 includes:

[0056] Select a network node and determine whether its two neighboring nodes are one-hop neighbors.

[0057] If a network node has two neighboring nodes that are not one-hop neighbors, then the network node is added to the network candidate set.

[0058] Iterate through all network nodes and add network nodes whose two neighboring nodes are not one-hop neighbors to the network relay node candidate set.

[0059] Before the calculation begins, any network node can be selected for initialization, initially as a non-network relay node. When the two neighboring nodes of this non-network relay node are not one-hop neighbors, it is considered a network relay node, and then the network relay node is added to the network relay node candidate set.

[0060] S200. Select the set of network nodes that satisfy the minimum number of relay nodes and guarantee full network connectivity from the candidate set of network relay nodes as the total set of network relay nodes.

[0061] From the candidate set of network relay nodes, select the set of nodes that guarantees full network connectivity and has the fewest number of nodes. This set of nodes constitutes the total set of network relay nodes. Figure 1 Please refer to Figure 2 , Figure 2 The diagram illustrates a sub-process of step S200 provided in an embodiment of this application. The specific steps for obtaining the total set of network relay nodes are as follows:

[0062] S1. If the candidate set of relay nodes in the network is not empty, initialize the number of calculations c = 0 and set the number of nodes m = 1.

[0063] S2. Select m network relay nodes from the candidate set of network relay nodes, and accumulate the number of calculations c, with the accumulation count being 1.

[0064] S3. Determine whether the value of the number of nodes m is equal to 1 or greater than 1. If it is equal to 1, execute S4; if it is greater than 1, execute S5.

[0065] S4. Determine whether the union of the neighbor set of the selected network relay node and the network relay node itself is equal to the total set of network nodes. If it is equal, proceed to S6; otherwise, proceed to S7.

[0066] S5. Determine whether the union of the neighbor nodes of the selected network relay node satisfies the condition. NA is the total set of network nodes, and Nb(i) is the set of neighbor nodes of the selected network relay node. If the conditions are met, execute S6; otherwise, execute S7.

[0067] S6. Place the selected set that guarantees full network connectivity into the total set of network relay nodes;

[0068] S7. Determine the number of calculations. Whether it is true or false, n is the number of nodes in the candidate set of network relay nodes. If it is true, execute S8; if it is false, execute S9.

[0069] S8. Determine if the total set of network relay nodes is empty. If it is, execute S9; otherwise, execute S11.

[0070] S9. Update the calculation count c = 0, and accumulate the number of nodes m, with an accumulation count of 1;

[0071] S10. Determine if m>n is true. If true, execute S11; otherwise, execute S2.

[0072] S11. The calculation ends, and the total set of network relay nodes is obtained.

[0073] The first input for the calculation is the network relay node candidate set. Then, it is determined whether the network relay node candidate set RB is empty. If it is empty, the selection ends and an empty network relay node candidate set is returned. If it is not empty, the number of calculations c is initialized to 0 and the number of nodes selected m is set to 1. Next, the number of calculations c is updated to c + 1, m nodes are selected from the network relay node candidate set, and the set of m nodes is taken as the output.

[0074] Determine whether m is equal to 1 or greater than 1. If it is greater than 1, determine if the union of the neighbors of the selected node satisfies the formula. If the condition is met, the selected set that guarantees full network connectivity is added to the total set of network relay nodes; otherwise, the number of calculations is checked again. If true, check if the total set of network relay nodes (NF) is empty. If empty, update the calculation count c = 0 and update the selected node count m to m + 1. If not empty, end the calculation and return the total set of network relay nodes. (The question then asks for the calculation count...) If the condition is not met, the number of calculations c is updated to c plus 1, and the above judgment is performed again on m nodes in the network relay candidate set.

[0075] If m is 1, then check if the union of the selected node's neighbor set and the selected node's set equals the total set of network nodes. If it does, add the selected set that guarantees full network connectivity to the total set of network relay nodes. If it does not, continue to check the number of calculations. If true, check if the total number of network relay nodes NF is empty. If it is empty, update the number of calculations c = 0 and update the number of selected nodes m equal to m + 1. If false, end the calculation and return the total number of network relay nodes.

[0076] The purpose of the above steps is to select the set of nodes from the candidate set of network relay nodes that can guarantee full network connectivity and has the fewest number of nodes.

[0077] S300. Select the set of network nodes with the maximum height location information from the total set of network relay nodes as the network relay node set.

[0078] A unique set of network relay nodes is selected from the total set of network relay nodes. Using altitude location information, the set with the largest sum of altitudes in the total set of network relay nodes is chosen as the final set of network relay nodes. If a node is in the selected set, it is considered a network relay node, and the network relay nodes in this set will relay any received network-wide broadcast messages. Otherwise, it is not a network relay node and will not forward network-wide broadcast messages.

[0079] Each node in the network periodically calculates its own network relay node identity based on the obtained network topology. First, it calculates a candidate set of network relay nodes. Then, it selects the total set of network relay nodes that can guarantee full network connectivity and has the fewest number of nodes from the candidate set. Finally, it selects a unique set of network relay nodes from the total set of network relay nodes according to the principle of height and maximum, so as to ensure that the network relay node sets calculated by each node in the network are the same.

[0080] It is worth noting that the network relay node selection algorithm is a distributed selection algorithm, which makes the network topology adaptable and flexible, and can also minimize the bandwidth of the whole network broadcast, thereby improving network communication efficiency.

[0081] In one possible embodiment, for better explanation of the above method, please refer to [reference needed]. Figure 3 , Figure 3 The diagram shows a network topology before broadcast route calculation. In one scenario, eight network nodes are non-network candidate relay nodes. The set is represented as {A, B, C, D, E, F, G, H}. Nodes that are neighbors are connected, and the neighbor relationships are shown in Table 1.

[0082] Table 1

[0083] Network Nodes Neighbor nodes A B, C, D, F, G B A, D, F, F, H C A, D D C, A, B, E E B, D F A, G G F, A, B, H H G, B

[0084] Each node in the network periodically broadcasts its one-hop neighbors to the entire network, enabling nodes to obtain the network topology. Each node also distributes its network relay node identity calculation. Nodes with two non-one-hop neighbors are added to the network relay node candidate set. Four network relay node candidate nodes A, B, D, and G are calculated, forming the network relay node candidate set {A, B, D, G}. Figure 3 Please refer to Figure 4 , Figure 4 A schematic diagram of the network topology generated from the candidate set of network relay nodes is shown.

[0085] To achieve full network connectivity with the fewest possible network relay nodes, first select any one node from the candidate set {A, B, D, G} and check if the union of its neighbors and itself equals the total set of network nodes. If not, continue selecting any two nodes A and B from the candidate set {A, B, D, G} and check if the union of their neighbors equals the total set of network nodes. If nodes A and B satisfy the condition... When the set {A, B} is added to the total set of network relay nodes, the process continues in this manner. If the total set of network relay nodes contains only one set {A, B}, then that set is selected as the final set of network relay nodes {A, B}. Figure 5 As shown, Figure 5 A schematic diagram of the network relay node set proposed in an embodiment of this application is shown. If there are multiple sets in the total set of network relay nodes, the set of network nodes with the maximum height location information will be selected as the network relay node set from among the multiple sets.

[0086] Compared with the prior art, the embodiments of this application have the following beneficial effects:

[0087] First, each node in the network calculates its own network relay node identity in a distributed manner, and the calculation result is unique. The network central node does not need to calculate and distribute the calculation result, resulting in a fast convergence rate, which is more suitable for distributed self-organizing networks.

[0088] Secondly, by selecting the fewest network relay nodes that can connect to the network, the network bandwidth required for a single network-wide broadcast can be reduced, improving network communication efficiency. This also minimizes the number of nodes in the periodically selected network relay node set. When any node in the network sends a network-wide broadcast message, only nodes in the network relay node set need to forward it; the fewer nodes in the network relay node set, the less bandwidth is required to forward the network-wide broadcast message.

[0089] Third, by selecting the network relay node set with the highest average height, better network coverage is achieved for dynamic network topologies.

[0090] Fourth, when there are multiple sets of network relay nodes that can guarantee full network connectivity, choosing the set with the largest height can achieve better network coverage. For dynamic self-organizing networks, good coverage can ensure that edge nodes will not become uncovered by network relay nodes due to short-term movement.

[0091] Secondly, this application also proposes a broadcast routing device for ad hoc networks, comprising:

[0092] Network relay node candidate set module: Selects a set of network nodes whose two neighbor nodes are not one-hop neighbors as the network relay node candidate set;

[0093] Network relay node set module: Selects the set of network nodes that meet the minimum number of relay nodes and guarantee full network connectivity from the candidate set of network relay nodes as the network relay node set;

[0094] The network relay node set module selects the set of network nodes with the maximum height location information from the total set of network relay nodes as the network relay node set.

[0095] In one possible implementation, the broadcast routing device for the ad hoc network further includes:

[0096] The forwarding module is used to relay and forward received network-wide broadcast messages through network relay nodes in the network relay node set.

[0097] In one possible implementation, the network relay node candidate set module is further configured to:

[0098] Select a network node and determine whether its two neighboring nodes are one-hop neighbors.

[0099] If a network node has two neighboring nodes that are not one-hop neighbors, then the network node is added to the network candidate set.

[0100] Iterate through all network nodes and add network nodes whose two neighboring nodes are not one-hop neighbors to the network relay node candidate set.

[0101] This preferred embodiment provides a computer device that can implement the steps in any embodiment of the broadcast routing method for ad hoc networks provided in this application. Therefore, it can achieve the beneficial effects of the broadcast routing method for ad hoc networks provided in this application, as detailed in the preceding embodiments, which will not be repeated here.

[0102] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be implemented by instructions, or by instructions controlling related hardware. These instructions can be stored in a computer-readable storage medium and loaded and executed by a processor. Therefore, embodiments of this application provide a storage medium storing multiple instructions that can be loaded by a processor to execute the steps of any embodiment of the broadcast routing method for ad hoc networks provided in this application.

[0103] The storage medium may include: read-only memory (ROM), random access memory (RAM), disk or optical disk, etc.

[0104] Since the instructions stored in the storage medium can execute the steps in any of the broadcast routing method embodiments of the ad hoc network provided in this application, the beneficial effects that the broadcast routing method of any ad hoc network provided in this application can achieve can be realized. For details, please refer to the previous embodiments, which will not be repeated here.

[0105] This application discloses a broadcast routing method for ad hoc networks. The method first selects a set of network nodes whose two neighboring nodes are not one-hop neighbors as a candidate set of network relay nodes. Then, it selects a set of network nodes from the candidate set that satisfies the minimum number of relay nodes and guarantees full network connectivity as the total set of network relay nodes. Finally, it selects a set of network nodes from the total set of network relay nodes that has the maximum value of height location information as the network relay node set. By calculating the network relay node set with the widest coverage and the fewest number of network relay nodes from the entire set of network nodes, the bandwidth required for broadcasting across the entire network can be reduced to the minimum, thereby improving network communication efficiency.

[0106] The above description is merely a preferred embodiment of this application and is not intended to limit this application. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this application should be included within the protection scope of this application.

Claims

1. A broadcast routing method for self-organizing networks, characterized in that, The method includes: Select a set of network nodes whose two neighboring nodes are not one-hop neighbors as the candidate set of network relay nodes; From the candidate set of network relay nodes, select the set of network nodes that satisfies the minimum number of relay nodes and guarantees full network connectivity as the total set of network relay nodes, including: S1. If the candidate set of relay nodes in the network is not empty, initialize the number of calculations c=0 and set the number of nodes m=1. S2. Select m network relay nodes from the candidate set of network relay nodes, and accumulate the calculation count c, with the accumulation count being 1. S3. Determine whether the value of the number of nodes m is equal to 1 or greater than 1. If it is equal to 1, execute S4; if it is greater than 1, execute S5. S4. Determine whether the union of the neighbor set of the selected network relay node and the network relay node itself is equal to the total set of network nodes. If it is equal, proceed to S6; otherwise, proceed to S7. S5. Determine whether the union of the neighbor nodes of the selected network relay node satisfies the condition. , For the total set of network nodes, Given the set of neighboring nodes of the selected network relay node, execute S6 if the condition is met, otherwise execute S7. S6. Place the selected set that guarantees full network connectivity into the total set of network relay nodes; S7. Determine the number of calculations. Whether it is true or false, n is the number of nodes in the candidate set of network relay nodes. If it is true, execute S8; if it is false, execute S9. S8. Determine if the total set of network relay nodes is empty. If it is, execute S9; otherwise, execute S11. S9. Update the calculation count c=0, and accumulate the number of nodes m, with the accumulation count being 1; S10. Determine if m>n is true. If true, execute S11; otherwise, execute S2. S11. Calculation complete, obtaining the total set of network relay nodes; The set of network nodes with the maximum height location information is selected from the total set of network relay nodes as the network relay node set.

2. The broadcast routing method for ad hoc networks as described in claim 1, characterized in that, The method further includes: The network relay nodes in the network relay node set will relay and forward the received network-wide broadcast messages.

3. The broadcast routing method for ad hoc networks as described in claim 1, characterized in that, The steps for selecting a set of network nodes whose two neighboring nodes are not one-hop neighbors as a candidate set of network relay nodes include: Select a network node and determine whether the two neighboring nodes of the network node are one-hop neighbors; If a network node has two neighboring nodes that are not one-hop neighbors, then the network node is added to the network candidate set. Iterate through all network nodes and add network nodes whose two neighboring nodes are not one-hop neighbors to the network relay node candidate set.

4. A broadcast routing device for self-organizing networks, characterized in that, The device includes: Network relay node candidate set module: Selects a set of network nodes whose two neighbor nodes are not one-hop neighbors as the network relay node candidate set; Network relay node set module; used to execute: S1, if the network relay node candidate set is not empty, initialize the number of calculations c=0 and set the number of nodes m=1; S2. Select m network relay nodes from the candidate set of network relay nodes, and accumulate the calculation count c, with the accumulation count being 1. S3. Determine whether the value of the number of nodes m is equal to 1 or greater than 1. If it is equal to 1, execute S4; if it is greater than 1, execute S5. S4. Determine whether the union of the neighbor set of the selected network relay node and the network relay node itself is equal to the total set of network nodes. If it is equal, proceed to S6; otherwise, proceed to S7. S5. Determine whether the union of the neighbor nodes of the selected network relay node satisfies the condition. , For the total set of network nodes, Given the set of neighboring nodes of the selected network relay node, execute S6 if the condition is met, otherwise execute S7. S6. Place the selected set that guarantees full network connectivity into the total set of network relay nodes; S7. Determine the number of calculations. Whether it is true or false, n is the number of nodes in the candidate set of network relay nodes. If it is true, execute S8; if it is false, execute S9. S8. Determine if the total set of network relay nodes is empty. If it is, execute S9; otherwise, execute S11. S9. Update the calculation count c=0, and accumulate the number of nodes m, with the accumulation count being 1; S10. Determine if m>n is true. If true, execute S11; otherwise, execute S2. S11. Calculation complete, obtaining the total set of network relay nodes; The network relay node set module selects the set of network nodes with the maximum height location information from the total set of network relay nodes as the network relay node set.

5. The broadcast routing device for self-organizing networks as described in claim 4, characterized in that, The device further includes: The forwarding module is used to relay and forward received network-wide broadcast messages through network relay nodes in the network relay node set.

6. The broadcast routing device for ad hoc networks as described in claim 4, characterized in that, The network relay node candidate set module is also used for: Select a network node and determine whether the two neighboring nodes of the network node are one-hop neighbors; If a network node has two neighboring nodes that are not one-hop neighbors, then the network node is added to the network candidate set. Iterate through all network nodes and add network nodes whose two neighboring nodes are not one-hop neighbors to the network relay node candidate set.

7. A computer device, characterized in that, The computer device includes a processor and a memory, the memory storing a computer program that is loaded and executed by the processor to implement the broadcast routing method for self-organizing networks as described in any one of claims 1-3.

8. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, which is loaded and executed by a processor to implement the broadcast routing method for self-organizing networks as described in any one of claims 1-3.

Images