High-dynamic omnidirectional mode centerless ad hoc network base station election method
By periodically broadcasting CSCF messages by nodes in a decentralized self-organizing network and judging based on connection quality weighting values, dynamic election and change of base stations are realized, solving the problem of unstable communication quality in high-speed mobile environments, resulting in a more stable topology and lower control overhead.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-11-28
- Publication Date
- 2026-04-07
AI Technical Summary
Existing base station election strategies cannot effectively perform dynamic evaluation and election in high-speed mobile omnidirectional communication systems, resulting in unstable communication quality.
In the high dynamic omnidirectional mode, each node periodically broadcasts CSCF messages and determines the base station selection based on the number of connections and the connection quality weighting value. The node declares itself as a base station and broadcasts cluster head messages. Other nodes change base stations in the second scheduling cycle. If the connection quality deteriorates, a new round of election is triggered.
By combining network connectivity and quality as judgment thresholds, the topology is more stable, control overhead is lower, base station election is more flexible, and it is adaptable to high-speed mobile environments.
Smart Images
Figure CN121814529A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of decentralized ad hoc network communication technology, and specifically to a highly dynamic omnidirectional mode decentralized ad hoc network base station election method. Background Technology
[0002] Current base station election strategies include trust-energy dual-factor election, speed and energy dual-threshold election, maximum number of serving neighbors, and zero-center reinforcement learning election. Among them, trust-energy dual-factor election is suitable for fixed or low-speed mobile, speed and energy dual-threshold strategy is suitable for medium-speed mobile, maximum number of serving neighbors is suitable for node-dense SOS networks, and zero-center reinforcement learning is suitable for high-dynamic + directional antenna applications. Therefore, for high-speed mobile environments in commonly used omnidirectional communication systems, a base station election and change strategy is urgently needed. Summary of the Invention
[0003] This invention provides a high-dynamic omnidirectional mode base station election method for decentralized self-organizing networks to solve the problem in the prior art that base stations cannot be dynamically evaluated, elected and changed based on the overall network communication quality in a high-dynamic environment.
[0004] In a first aspect of the present invention, a method for electing a decentralized self-organizing network base station in a highly dynamic omnidirectional mode is provided, comprising:
[0005] In the high dynamic omnidirectional mode, each node periodically broadcasts CSCF messages;
[0006] Each node calculates its connection relationship with other nodes based on its local neighbor topology table within the specified scheduling period, and uses the weighted value of the number of connections and connection quality as the basis for determining the selection of base stations.
[0007] If the weighted value of node i is the largest in the entire tree, then it declares itself as a base station node and broadcasts the base station cluster head message;
[0008] After receiving the cluster head message, the remaining nodes will begin changing the base station in the second scheduling cycle;
[0009] A new round of elections is triggered when the cluster head's connectivity and connectivity quality are lower than those of other nodes.
[0010] In some optional embodiments of the present invention, the CSCF message includes:
[0011] Node ID, node connection topology, and node link information.
[0012] In some optional embodiments of the present invention, each node calculates its connection relationships with other nodes based on its local neighbor topology table within a specified scheduling period, and uses a weighted value of connection quantity and connection quality as the basis for determining base station selection, including:
[0013] At the second composite data frame, topology traversal is initiated to determine the interconnection relationships between nodes.
[0014] The backup base station election operation begins based on the topological connectivity, and a depth-first search algorithm is used to construct the connectivity matrix, taking into account the connectivity quality between nodes.
[0015] Starting from the topological vertex, proceed to the first adjacent node in one hop, and then proceed from the first adjacent node in one hop to the first adjacent node in two hops, and perform traversal search calculations in sequence.
[0016] If all adjacent nodes in the topology have been traversed, then check if there are any unvisited nodes. If so, continue the search and traversal; otherwise, exit the search algorithm.
[0017] After the topology traversal is completed, a base station candidate group is formed.
[0018] In some optional embodiments of the present invention, when the cluster head's connectivity and connectivity quality are lower than those of other nodes, a new round of election is triggered, including:
[0019] Enable base station disconnection detection during the response time slots of each node;
[0020] When the cluster head's connectivity and connectivity quality are lower than those of other nodes, the base station is already out of contact.
[0021] A breadth-first search algorithm is used to determine backup seed base stations.
[0022] In some optional embodiments of the present invention, when the cluster head's connectivity and connectivity quality are lower than those of other nodes, triggering a new round of election further includes:
[0023] In the base station candidate group, starting from the original base station, evaluate the connection quality and number of connections of each node of the one-hop neighbor. Then, evaluate the connection quality and number of connections of the two-hop neighbor nodes with each node of the one-hop neighbor as the root node, until all nodes have been traversed.
[0024] The node with the best connection quality and the most connections is selected as the quasi-base station node.
[0025] In a second aspect of the present invention, a highly dynamic omnidirectional mode decentralized self-organizing network base station election device is provided, comprising:
[0026] The node module is used to periodically broadcast CSCF messages in highly dynamic omnidirectional mode;
[0027] The weighted value calculation module is used to calculate the connection relationship with other nodes based on the local neighbor topology table within a specified scheduling period, and uses the weighted value of connection quantity and connection quality as the basis for judging the selection of base stations;
[0028] The declaration broadcast module is used to declare node i as a base station node and broadcast the base station cluster head message when the weighted value of node i is the largest in the entire tree;
[0029] The election change module is used to change base stations at the beginning of the second scheduling cycle;
[0030] The election change module is also used to trigger a new round of elections when the cluster head's connectivity and connectivity quality are lower than those of other nodes.
[0031] In a third aspect of the present invention, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program to implement the steps of the high dynamic omnidirectional mode decentralized self-organizing network base station election method as described in any one of the embodiments of the first aspect.
[0032] In a fourth aspect of the present invention, a computer-readable storage medium is provided having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the high-dynamic omnidirectional mode decentralized self-organizing network base station election method described in any one of the embodiments of the first aspect.
[0033] The beneficial effects provided by this invention are:
[0034] The method of this invention combines the network connection relationship and connection quality of each node as the judgment threshold, resulting in a more stable topology; each node broadcasts only one base station cluster head message packet per scheduling cycle, resulting in low control overhead.
[0035] Advantages of additional aspects of the invention 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 the invention. Attached Figure Description
[0036] Figure 1 This is a schematic diagram illustrating the detection of the operating status of a multi-node network provided in an embodiment of the present invention;
[0037] Figure 2 This is a schematic diagram illustrating the determination of the interconnection relationship between nodes through topological traversal in an embodiment of the present invention.
[0038] Figure 3 A flowchart of a high-dynamic omnidirectional mode base station election method for a decentralized self-organizing network provided in an embodiment of the present invention. Detailed Implementation
[0039] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the protection scope of the present invention.
[0040] In an embodiment of the present invention, a method for electing a decentralized self-organizing network base station in a highly dynamic omnidirectional mode is provided, comprising:
[0041] a) In the high dynamic omnidirectional mode, each node periodically broadcasts CSCF messages, which carry at least the node ID, node connection topology, and node link information.
[0042] b) Each node calculates its connection relationship with other nodes based on its local neighbor topology table within the specified scheduling period, and uses the weighted value of the number of connections and connection quality as the basis for determining the selection of base stations;
[0043] c) If the weighted value of node i is the largest in the entire tree, then it declares itself as a base station node and broadcasts the base station cluster head message;
[0044] d) After receiving the cluster head message, the remaining nodes begin to change the base station in the second scheduling cycle;
[0045] e) When the cluster head's connectivity and connectivity quality are lower than those of other nodes, a new round of election is automatically triggered.
[0046] like Figure 1 As shown, in one specific embodiment, base station selection in high dynamic omnidirectional mode may include:
[0047] a) Continuously monitor the operational status of multi-node networks throughout the entire lifecycle, such as Figure 2 As shown;
[0048] b) At the second composite data frame time, initiate topology traversal to determine the interconnection relationships between nodes, such as... Figure 3 As shown;
[0049] c) Initiate the backup base station election operation based on the topology connection relationship;
[0050] d) Combining the connection quality between nodes, a depth-first search (DFS) algorithm is used to construct the connection matrix. Starting from a vertex in the topology, the algorithm iterates to the first adjacent node in the first hop, then sequentially from the first adjacent node in the first hop to the first adjacent node in the second hop, performing the traversal search. If all adjacent nodes in the topology have been traversed, it checks for unvisited nodes; if so, the search continues; otherwise, the algorithm exits. The node connection quality (uQuality) is stored in an array as one of the parameters for valid connections.
[0051]
[0052] e) After the topology traversal is completed, a base station candidate group GroupBs[uBSnode] is formed.
[0053] Base station handover in high dynamic omnidirectional mode may include:
[0054] a) Continuously monitor the base station's operational status throughout the entire lifecycle;
[0055] b) Enable base station disconnection detection during the response time slots of each node;
[0056] c) If the base station is already out of contact, use the breadth-and-search algorithm to determine the backup seed base station; in the base station candidate group GroupBs[uBsnode], start from the original base station and evaluate the connection quality and number of connections of each one-hop neighbor node, and then evaluate the connection quality and number of connections of each two-hop neighbor node with each one-hop neighbor node as the root node, until all nodes have been traversed, and select the node with the best connection quality and the most connections as the prospective base station node.
[0057]
[0058] e) Information on the selection results of flood broadcast base stations across the entire network.
[0059] It should be understood that in the description of this specification, references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples" refer to specific features, structures, materials, or characteristics described in connection with that embodiment or example, which are included in at least one embodiment or example of the present invention. In this description, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Moreover, without contradiction, those skilled in the art can combine and integrate different embodiments or examples described in this specification, as well as some features of different embodiments or examples.
[0060] Of course, those skilled in the art can make various corresponding changes and modifications based on the present invention without departing from its spirit and essence, but such changes and modifications should all fall within the protection scope of the claims of the present invention.
Claims
1. A method for electing base stations in a decentralized self-organizing network in a highly dynamic omnidirectional mode, characterized in that, include: In the high dynamic omnidirectional mode, each node periodically broadcasts CSCF messages; Each node calculates its connection relationship with other nodes based on its local neighbor topology table within the specified scheduling period, and uses the weighted value of the number of connections and connection quality as the basis for determining the selection of base stations. If the weighted value of node i is the largest in the entire tree, then it declares itself as a base station node and broadcasts the base station cluster head message; After receiving the cluster head message, the remaining nodes will begin changing the base station in the second scheduling cycle; A new round of elections is triggered when the cluster head's connectivity and connectivity quality are lower than those of other nodes.
2. The method for electing a decentralized self-organizing network base station in a highly dynamic omnidirectional mode according to claim 1, characterized in that, The CSCF message includes: Node ID, node connection topology, and node link information.
3. The method for electing a decentralized self-organizing network base station in a highly dynamic omnidirectional mode according to claim 1, characterized in that, Each node calculates its connection relationships with other nodes based on its local neighbor topology table within a specified scheduling period. The selection of a base station is based on a weighted average of the number and quality of connections, including: At the second composite data frame, topology traversal is initiated to determine the interconnection relationships between nodes. The backup base station election operation begins based on the topological connectivity, and a depth-first search algorithm is used to construct the connectivity matrix, taking into account the connectivity quality between nodes. Starting from the topological vertex, proceed to the first adjacent node in one hop, and then proceed from the first adjacent node in one hop to the first adjacent node in two hops, and perform traversal search calculations in sequence. If all adjacent nodes in the topology have been traversed, then check if there are any unvisited nodes. If so, continue the search and traversal; otherwise, exit the search algorithm. After the topology traversal is completed, a base station candidate group is formed.
4. The method for electing a decentralized self-organizing network base station in a highly dynamic omnidirectional mode according to claim 3, characterized in that, When the cluster head's connectivity and connectivity quality are lower than other nodes, a new round of elections is triggered, including: Enable base station disconnection detection during the response time slots of each node; When the cluster head's connectivity and connectivity quality are lower than those of other nodes, the base station is already out of contact. A breadth-first search algorithm is used to determine backup seed base stations.
5. The method for electing a decentralized self-organizing network base station in a highly dynamic omnidirectional mode according to claim 4, characterized in that, When the cluster head's connectivity and connectivity quality are lower than other nodes, a new round of election is triggered, which also includes: In the base station candidate group, starting from the original base station, evaluate the connection quality and number of connections of each node of the one-hop neighbor. Then, evaluate the connection quality and number of connections of the two-hop neighbor nodes with each node of the one-hop neighbor as the root node, until all nodes have been traversed. The node with the best connection quality and the most connections is selected as the quasi-base station node.
6. A highly dynamic omnidirectional mode decentralized self-organizing network base station election device, characterized in that, include: The node module is used to periodically broadcast CSCF messages in highly dynamic omnidirectional mode; The weighted value calculation module is used to calculate the connection relationship with other nodes based on the local neighbor topology table within a specified scheduling period, and uses the weighted value of connection quantity and connection quality as the basis for judging the selection of base stations; The declaration broadcast module is used to declare node i as a base station node and broadcast the base station cluster head message when the weighted value of node i is the largest in the entire tree; The election change module is used to change base stations at the beginning of the second scheduling cycle; The election change module is also used to trigger a new round of elections when the cluster head's connectivity and connectivity quality are lower than those of other nodes.
7. An electronic device comprising a memory, a processor, and a computer program stored in the memory, characterized in that, The processor executes the computer program to implement the steps of the high dynamic omnidirectional mode decentralized self-organizing network base station election method according to any one of claims 1-5.
8. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the steps of the high dynamic omnidirectional mode decentralized self-organizing network base station election method according to any one of claims 1-5.