A dynamic communication networking method based on starburst near field communication

Abstract

The application relates to the technical field of communication networking, and particularly discloses a dynamic communication networking method based on star-flash near field communication, which comprises the following steps: during normal communication between a primary central node and a terminal node, based on a preconfigured candidate central node and node state information reported by the candidate central node; through an evaluation algorithm, nodes meeting access capacity constraints are screened to generate a backup node list and are delivered to the terminal node; during a normal communication period, parameter negotiation between the terminal node and part of the nodes in the backup node list is completed in advance through link layer signaling, and the negotiation result is stored in both parties; when the terminal node detects that a communication link with the primary central node is interrupted, a target node is determined from the backup node list according to a preset node selection strategy, a connection establishment request is initiated by directly using the stored negotiation result, and service data transmission is quickly recovered.

Description

Technical Field

[0001] This invention relates to the field of communication networking technology, and specifically to a dynamic communication networking method based on star flash near-field communication. Background Technology

[0002] Near-field communication (NFC) technology is widely used in short-range wireless communication, especially in open frequency bands. Existing technologies typically employ a static pre-configured networking approach to construct a star network topology, supporting a converged communication mode from the terminal (T node) to the primary central node (G node). In this mode, when the primary central node is functioning normally and the network environment is relatively stable, the system can provide reliable communication services.

[0003] However, existing technologies have significant limitations. First, the networking process relies on fixed configurations and lacks dynamic adaptability, making it difficult to cope with high-speed mobile scenarios. Second, in the network topology, if the primary central node experiences communication interruption due to attacks, damage, or environmental factors, the system needs to reselect a backup G node through a serial mechanism and execute a complete parameter negotiation and access process. This process includes multiple steps such as node selection, parameter negotiation, and secure access, resulting in long link reconstruction delays, typically reaching the second level, which seriously affects the real-time performance and reliability of communication.

[0004] In applications such as transportation, defense, and maritime rescue, where mobility and robustness are critical, existing fixed ground-based G nodes are costly to build, and frequent switching can lead to communication interruptions, failing to meet the need for rapid self-healing. Furthermore, in high-probability-of-damage environments, pre-configured backup nodes may have already failed, further exacerbating the difficulty of network reconstruction. Summary of the Invention

[0005] The purpose of this invention is to provide a dynamic communication networking method based on star flash near-field communication, and to solve the following technical problems.

[0006] The objective of this invention can be achieved through the following technical solutions: A dynamic communication networking method based on star-flash near-field communication includes the following steps: Step S1: Obtain the normal communication time period of the primary central node and the terminal node, and pre-configure several candidate central nodes. During the normal communication time period, the primary central node receives the node status information reported by each candidate central node. Step S2: The primary central node selects candidate central nodes that meet the acceptance capacity constraints based on the node status information and the evaluation calculation, generates a backup node list, and transmits the backup node list to the terminal node. Step S3: When the primary central node is in normal communication time, select several candidate central nodes from the backup node list and record them as backup nodes; perform negotiation processing between the terminal node and the backup node through link layer signaling to obtain the negotiation result, and store the negotiation result in the terminal node and the backup node; Step S4: When the terminal node detects that the communication link of the primary central node is interrupted, the terminal node determines the target backup node in the backup node list based on the preset node selection strategy. The terminal node directly initiates a connection establishment request to the target backup node according to the negotiation result and resumes the transmission of service data.

[0007] As a further aspect of the present invention: the normal communication time period is the time period during which the primary central node and the terminal node maintain normal communication.

[0008] As a further aspect of the present invention, the node status information includes remaining connection capacity, available bandwidth, and signal strength.

[0009] As a further aspect of the present invention: the evaluation algorithm includes several evaluation indicators, including the remaining connection capacity of the candidate central node being greater than a preset threshold, the available bandwidth of the candidate central node meeting the service requirements of the terminal node, and the signal strength between the candidate central node and the terminal node being greater than or equal to a preset strength threshold.

[0010] As a further aspect of the present invention, the process of selecting candidate center nodes that meet the acceptance capability constraints based on the evaluation calculation includes: if there is a candidate center node that meets all evaluation indicators, then the candidate center node is recorded as meeting the acceptance capability constraints.

[0011] As a further aspect of the present invention: the negotiation process includes: The negotiation process is a negotiation of physical layer access parameters, which include channel parameters, time slot allocation, and key information. The terminal node initiates a negotiation request for access parameters, which is forwarded to the backup node via the primary central node. The backup node generates a response message containing channel parameters, time slot parameters, and key information based on the current resource status, and returns it to the terminal node via the primary central node. The terminal node and the backup node save the response message.

[0012] As a further aspect of the present invention: the node selection strategy is based on a selection mechanism, which includes prioritizing the selection of backup nodes with the same equipment manufacturer as the terminal node, prioritizing the selection of backup nodes with the highest historical connection success rate, and prioritizing the selection of backup nodes with the strongest signal strength.

[0013] As a further aspect of the present invention: when the negotiation result initiates a connection establishment request to the target backup node, the negotiation of access parameters is skipped, and the transmission of service data is resumed after the physical layer connection and security authentication are completed.

[0014] The beneficial effects of this invention are: This invention fundamentally solves the problem of excessively long network reconstruction delays caused by the failure of central nodes or link interruptions in mobile networking scenarios using existing near-field communication technologies. By redesigning the process, which originally involved sequential access point selection and parameter negotiation after a link failure, it moves this process forward to the normal operation phase of the primary central node, allowing terminal nodes to immediately initiate a reconnection process based on a pre-generated dynamic backup node list and pre-negotiated physical layer access parameters upon detecting a disconnection. This skips the time-consuming real-time negotiation phase, significantly reducing the topology reconstruction time from seconds in traditional methods to just the time required to complete physical layer access and security authentication. This achieves millisecond-level rapid network self-healing, greatly improving service continuity and reliability in harsh scenarios such as high-speed mobility and high probability of network failure. Furthermore… This invention does not rely on static pre-configuration, but rather uses a dynamic bootstrapping mechanism to enable the primary central node to dynamically select the optimal backup node and generate a list based on multi-dimensional status information such as remaining connection capacity, available bandwidth, signal strength, and battery power reported in real time by candidate nodes. This process ensures the real-time and accurate selection of backup nodes and effectively avoids handover failures caused by the failure of pre-configured nodes. The overall architecture of this invention also brings improvements in network robustness and scalability. Its mechanism naturally supports network splitting and merging scenarios, and can quickly reconstruct subnets or achieve load balancing when the topology changes dynamically. This ensures the integrity and consistency of large-scale, highly mobile near-field communication networks, providing strong technical support for key areas such as transportation, national defense, and emergency rescue. Attached Figure Description

[0015] The invention will now be further described with reference to the accompanying drawings.

[0016] Figure 1 This is a schematic diagram illustrating the steps of a dynamic communication networking method based on star flash near-field communication according to the present invention; Figure 2 This is a schematic diagram of the access link reconstruction process in the prior art described in the present invention, which is a dynamic communication networking method based on star flash near-field communication. Figure 3 This is a schematic diagram of the access link reconstruction process in a dynamic communication networking method based on star flash near-field communication according to the present invention; Figure 4 This is a schematic diagram of the bootstrapping process in a dynamic communication networking method based on star flash near-field communication according to the present invention; Figure 5This is a schematic diagram of the authorization sub-process in a dynamic communication networking method based on star flash near-field communication of the present invention; Figure 6 This is a schematic diagram of the local strategy sub-process in a dynamic communication networking method based on star flash near-field communication according to the present invention; Figure 7 This is a schematic diagram of the overall process and embodiments of a dynamic communication networking method based on star flash near-field communication according to the present invention. Detailed Implementation

[0017] 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 scope of protection of the present invention.

[0018] Currently, open frequency band near-field communication can only complete static pre-configured networking, providing star networking capabilities and supporting converged communication mode from terminal node T to primary central node G; adopting the mode of trying the second central node access after the primary central node confirms the disconnection, this can achieve good usage results in low-speed networks or when the primary central node cannot be damaged.

[0019] In transportation, defense, and maritime rescue scenarios, there is a need to build a mobile local network. The current ground station primary central node mode is not well adapted to high-speed mobile scenarios. The construction of fixed ground primary central node stations is difficult, costly, and requires too frequent switching. On the other hand, if the primary central node, as the center, is likely to be damaged, the original communication system and topology are difficult to rebuild quickly.

[0020] This invention pre-constructs cross-link layer interaction technology to quickly complete the negotiation of access parameters before the primary central node fails. This ensures that when switching to a new central node, the negotiation process can be skipped and the access process can be directly reached, thereby shortening the link reconstruction latency and achieving the effect of rapid link reconstruction.

[0021] like Figure 2 As shown, the typical access link reconstruction process involves completely re-establishing a new air interface physical layer connection to the new second backup central node after the primary central node confirms the link failure. This process can lead to a long link failure time in high-speed mobile scenarios, resulting in the failure of the local area network between N nodes. This failure time may reach the second level and, in severe cases, render the network unusable. In existing technologies, the link layer of the T1 access node first determines that the G1 node is disconnected or damaged by failing to correctly receive data packets from the peer within a certain period of time, or by failing to receive a correct response packet after multiple retransmissions. Then, based on the priority of its static configuration list or by re-receiving broadcast information from other G nodes within the domain, it initiates the access point selection and parameter negotiation process for the backup G2 node. Figure 2 Steps 2 and 3 shown in the diagram complete the process of establishing a secure access link to the G2 backup node. The time required at this point is usually in the order of seconds. The time for the topology link reconstruction process is t1 + t2.

[0022] Please see Figure 1 As shown, this invention is a dynamic communication networking method based on star flash near-field communication, comprising the following steps: Step S1: Obtain the normal communication time period of the primary central node and the terminal node, and pre-configure several candidate central nodes. During the normal communication time period, the primary central node receives the node status information reported by each candidate central node. In a preferred embodiment of the present invention, the normal communication time period is the time period during which the primary central node and the terminal node maintain normal communication. In a preferred embodiment of the present invention, the node status information includes remaining connection capacity, available bandwidth, and signal strength; Step S2: The primary central node selects candidate central nodes that meet the acceptance capacity constraints based on the node status information and the evaluation calculation, generates a backup node list, and transmits the backup node list to the terminal node. In a preferred embodiment of the present invention, the evaluation algorithm includes several evaluation indicators, including the remaining connection capacity of the candidate central node being greater than a preset threshold, the available bandwidth of the candidate central node meeting the service requirements of the terminal node, and the signal strength between the candidate central node and the terminal node being greater than or equal to a preset strength threshold. In a preferred embodiment of the present invention, the process of selecting candidate center nodes that meet the acceptance capability constraints based on the evaluation calculation includes: if there is a candidate center node that meets all evaluation indicators, then the candidate center node is recorded as meeting the acceptance capability constraints. In a preferred embodiment of the present invention, the backup node list consists of all candidate center nodes that meet the acceptance capacity constraints; Step S3: When the primary central node is in normal communication time, select several candidate central nodes from the backup node list and record them as backup nodes; perform negotiation processing between the terminal node and the backup node through link layer signaling to obtain the negotiation result, and store the negotiation result in the terminal node and the backup node; In a preferred embodiment of the present invention, the negotiation process includes: The negotiation process is a negotiation of physical layer access parameters, which include channel parameters, time slot allocation, and key information. The terminal node initiates a negotiation request for access parameters, which is forwarded to the backup node via the primary central node. The backup node generates a response message containing channel parameters, time slot parameters, and key information based on the current resource status, and returns it to the terminal node via the primary central node. The terminal node and the backup node save the response message. Step S4: When the terminal node detects that the communication link of the primary central node is interrupted, the terminal node determines the target backup node in the backup node list based on the preset node selection strategy. The terminal node directly initiates a connection establishment request to the target backup node according to the negotiation result and resumes the transmission of service data. In a preferred embodiment of the present invention, the node selection strategy is based on a selection mechanism, which includes prioritizing the selection of backup nodes with the same equipment manufacturer as the terminal node, prioritizing the selection of backup nodes with the highest historical connection success rate, and prioritizing the selection of backup nodes with the strongest signal strength. In a preferred embodiment of the present invention, when the negotiation result sends a connection establishment request to the target backup node, the negotiation of access parameters is skipped, and the transmission of service data is resumed after the physical layer connection and security authentication are completed. Specifically, this invention divides the access process into two sub-processes: a first-step parameter negotiation process and a second-step secure access process. The first-step negotiation process is completed in advance, so that only the second process needs to be completed when rebuilding the new network topology, thereby achieving a rapid self-healing reconstruction effect of the network. like Figure 3 As shown, the present invention adopts a forward parameter negotiation process, that is, while G1 is still in normal working condition, the first process is completed first, thereby saving the time t1 spent in process one. When the primary G1 node is interrupted due to damage, the second backup node only needs to complete process two to quickly complete the new link layer reconnection, thereby quickly self-healing. Under the mechanism of this invention, since the time t1 spent in the parameter negotiation process is connected to the time t0, the topology reconstruction process only needs to spend time t2, which can save up to 50% of the latency. The technical solution of this invention includes: 1. The bootstrapping mechanism of candidate center nodes; 2. The primary G1 node's authorization mechanism can authorize a list of multiple nodes that have requested to act as candidate central nodes, including priority and authorization success mechanisms under specified conditions. 3. The mechanism by which node T1 selects candidate center nodes according to its local strategy after receiving the List; 4. Establish a parameter negotiation mechanism in advance with one or more candidate nodes in the List; Specifically, the bootstrapping mechanism includes: 1. G1 has a pre-configured static whitelist G2, G3, ..., Gk, where k is the total number of nodes, and G2 and G3 have the first priority, and [G4, Gk] have the second priority. 2. In the network configuration, all G2, G3, ..., Gk act as T for G1; 3. All G2, G3, ..., Gk report their available idle capacity to G1; 5. G1 selects G2 as the preferred backup node in the first priority set through comparison or multi-factor algorithm; if there is no selectable node in the first priority node set, the same algorithm is used to select the result in the second priority set. 6. At this point, the bootstrapping process is complete, and G2 is promoted to the role of a backup node that can take over G1; The authorization mechanism includes completing a list of candidate G nodes that can be taken over, specifically including: 1. G1 issues authorization to the selected G2 node, granting G2 permission to take over the list of all T nodes under G1's management at any time; 2. If there are m T nodes in the G1 management domain, and this value is greater than the idle capacity n of G2 that can be accessed, then G1 needs to select a new backup G3 node to take over (mn) T nodes. 3. If G3 has insufficient idle capacity, continue the process to select enough List members to serve as backup nodes; 4. When G1 authorizes G2 or G3, it sends all Ts under G1's management as a whitelist of available access points; The local strategy includes the selection of a strategy from T to G, specifically including: 1. In the above authorization mechanism steps, G1 sends a dynamic whitelist List={G2} to T1; or G1 sends a dynamic whitelist List={G2, G3}, or List={G2, G3, Gk} to T1; 2. T1 can select one of the devices in the list locally based on its own strategy. The selection strategy includes the principle of closeness, that is, devices from the same manufacturer or those that have been successfully connected before, in order to ensure the success rate. 3. If close relatives are not applicable, choose the first item in the list, as the first item has the highest priority; The method of the bootstrap subprocess embodiment of the present invention is as follows: 1. G1 has a pre-configured list of G nodes that can be backed up and starts the boot process; 2. Other G2, G3, ..., Gk nodes determine their ability to act as alternative central nodes through a bootstrapping algorithm. This bootstrapping process is completely independent. Generally, they determine that they have enough idle capacity to be connected, such as 50% idle capacity. They then send a request to G1 node to act as a backup node and negotiate that they are the T role. 3. The G1 primary central node distinguishes and identifies multiple bootstrap requests and requires each node to report its idle capacity; 4. The primary central node of G1 determines an available backup list through a comparison algorithm, which is usually 1 to 4; 5. At this point, the bootstrapping process for character selection is complete; The method of the authorized sub-process embodiment of the present invention is as follows: 1. Based on the algorithm results, node G1 authorizes G2 to act as a backup node and sends a whitelist of all T nodes managed within its own domain. 2. If G2's idle capacity is insufficient, G1 will continue to select G3 and send G3 an authorization containing a whitelist of all Ts that can be taken over; 3. Continue in this manner until G1 completes all authorizations; The method of the local policy sub-process embodiment of the present invention is as follows: 1. G1 distributes a list of G nodes that can be backed up to all T nodes. 2. Based on the local configuration strategy, such as the principle of closeness, T selects one from the list, such as equipment from the same manufacturer or peer entities that have been successfully connected before; 3. Alternatively, the default priority can be used, and the first node in the List can be directly selected as the backup G node; The process of this invention is a dynamic real-time process. The bootstrap algorithm can achieve millisecond-level selection of alternative center nodes and parameter negotiation. The overall process and its implementation are as follows: 1.1 T1 and G1 complete the normal data link establishment process; 1.2, G2, and other optional backup nodes complete the role bootstrapping process; 1.3. G1 completes the backup node authorization sub-process; 1.4. The T1 access node completes the backup G node selection sub-process; 2. T1, G1, and G2 jointly update the access parameters and save the results; 2.1, T1 initiates an access parameter update; 2.2. G1 forwards the request to G2, and G2 participates in the access parameter update process and determines the result; 3.1 G2 returns the updated results of the negotiated access parameters; 3.2 G1 returns the negotiation update result to T1; 4. After the link between T1 and G1 is broken, T1 directly completes the pairing process with G2; 5. After T1 and G2 complete the subsequent authentication and security process, they start sending the payload. At this point, after T1 and G1 lose their connection, they can reconnect to G2 in just t2 hours. The topology link is successfully rebuilt, and the network achieves self-healing.

[0023] This invention also includes a bootstrapping algorithm for optional backup central nodes, including local multi-factor algorithms such as remaining power, access capacity, available access bandwidth, and maximum available rate. These algorithms depend on different strategies and algorithms and fall within the scope of different embodiments of this invention. This invention also includes authorization strategies and mechanisms at the G1 primary central node. Different authorization strategies and differentiated authorization methods depend on different implementation processes, such as priorities and conditions, and fall within the scope of different embodiments of this invention. This invention also includes the T1 node, after receiving the authorized List, using different negotiation parameters for different nodes in the List, including selection conditions such as location, distance, and access capacity, which fall within the scope of different embodiments of this invention; This invention can also be used in other scenarios, including but not limited to splitting into multiple subnets, i.e., the dynamic process of splitting a star network into multiple star subnets, which falls within the scope of extended applications of this invention; similarly, multiple subnets can also converge in reverse to form a whole converged network, which also falls within the scope of extended applications of this invention. This invention can also be used in other scenarios, including but not limited to load balancing of multiple subnets. That is, when multiple nodes cannot share bandwidth and speed, a subnet will be independently constructed based on the node requests of high bandwidth, high speed or low latency.

[0024] The foregoing has provided a detailed description of one embodiment of the present invention, but this description is merely a preferred embodiment and should not be construed as limiting the scope of the invention. All equivalent variations and modifications made within the scope of the present invention should still fall within the scope of the present invention.

Claims

1. A dynamic communication networking method based on star-flash near-field communication, characterized in that, Includes the following steps: Step S1: Obtain the normal communication time period of the primary central node and the terminal node, and pre-configure several candidate central nodes. During the normal communication time period, the primary central node receives the node status information reported by each candidate central node. Step S2: The primary central node selects candidate central nodes that meet the acceptance capacity constraints based on the node status information and the evaluation calculation, generates a backup node list, and transmits the backup node list to the terminal node. Step S3: When the primary central node is in normal communication time, select several candidate central nodes from the backup node list and record them as backup nodes; The terminal node and the backup node are negotiated through link layer signaling to obtain a negotiation result, and the negotiation result is stored in the terminal node and the backup node. Step S4: When the terminal node detects that the communication link of the primary central node is interrupted, the terminal node determines the target backup node in the backup node list based on the preset node selection strategy. The terminal node directly initiates a connection establishment request to the target backup node according to the negotiation result and resumes the transmission of service data. In step S3, the negotiation process includes: The negotiation process is a negotiation of physical layer access parameters, which include channel parameters, time slot allocation, and key information. The terminal node initiates a negotiation request for access parameters, which is forwarded to the backup node via the primary central node. The backup node generates a response message containing channel parameters, time slot parameters, and key information based on the current resource status, and returns it to the terminal node via the primary central node. The terminal node and the backup node save the response message.

2. The dynamic communication networking method based on star flash near-field communication according to claim 1, characterized in that, In step S1, the normal communication time period is the time period during which the primary central node and the terminal node maintain normal communication.

3. The dynamic communication networking method based on star flash near-field communication according to claim 1, characterized in that, In step S1, the node status information includes remaining connection capacity, available bandwidth, and signal strength.

4. The dynamic communication networking method based on star flash near-field communication according to claim 3, characterized in that, In step S2, the evaluation algorithm includes several evaluation indicators, including the remaining connection capacity of the candidate central node being greater than a preset threshold, the available bandwidth of the candidate central node meeting the service requirements of the terminal node, and the signal strength between the candidate central node and the terminal node being greater than or equal to a preset strength threshold.

5. The dynamic communication networking method based on star flash near-field communication according to claim 1, characterized in that, In step S2, the process of selecting candidate center nodes that meet the acceptance capability constraints based on the evaluation calculation includes: if there is a candidate center node that meets all evaluation indicators, then the candidate center node is recorded as meeting the acceptance capability constraints.

6. The dynamic communication networking method based on star flash near-field communication according to claim 1, characterized in that, In step S4, the node selection strategy is based on a selection mechanism, which includes prioritizing backup nodes with the same equipment manufacturer as the terminal node, prioritizing backup nodes with the highest historical connection success rate, and prioritizing backup nodes with the strongest signal strength.

7. The dynamic communication networking method based on star flash near-field communication according to claim 1, characterized in that, In step S4, when the negotiation result sends a connection establishment request to the target backup node, it skips the negotiation of access parameters and resumes the transmission of service data after completing the physical layer connection and security authentication.

Images