Distributed ad hoc network communication method and related apparatus

Abstract

The application discloses a kind of distributed ad hoc network communication method and related devices, it is related to wireless communication technical field, comprising: listening channel obtains the received signal strength of other node broadcast signal;Determine the target network identity of current node based on the comparison result of received signal strength and the first and second signal quality boundary of preset;In the superframe period, communication interaction is carried out in the corresponding functional time slot cluster based on target network identity;In the data interaction composite time slot cluster, channel competition is executed based on the physical layer frame structure containing unified preamble and distinguishing service priority frame start code, and service priority is obtained by hardware decoding frame start code and accordingly executed channel avoidance or preemption.The application realizes the distributed autonomous determination of network identity and the ordered scheduling of communication resource, improves topology robustness and core service real-time performance.

Description

Technical Field

[0001] This application relates to the field of wireless communication technology, and in particular to a distributed self-organizing network communication method and related apparatus. Background Technology

[0002] Currently, wireless mesh ad hoc networking technology is increasingly widely used in large-scale, highly dynamic, and highly interference-prone scenarios. Existing ad hoc networking solutions typically rely on centralized control nodes or pre-configured static topologies to maintain network operation, or are deeply bound and optimized with specific physical layer communication media (such as LoRa, WiFi, etc.). However, in complex environments with frequent node movement, severe obstruction, or multi-source interference, existing solutions lack a unified time-domain scheduling mechanism, leading to disordered transmission of broadcast, synchronization, and data services, and a high channel collision rate. Simultaneously, due to the strong coupling between networking rules and the physical layer, cross-frequency band and cross-media universal adaptation is difficult, failing to balance communication efficiency and reliability. Furthermore, existing network topology maintenance often relies on external platform commands; when the master node fails or mobile nodes frequently enter or leave the network, it can easily cause network-wide instability, lacking distributed autonomous evolution and self-healing capabilities, resulting in poor network stability. Summary of the Invention

[0003] In view of the problems of poor stability of ad hoc network topologies, high channel collision rates, and difficulty in cross-physical layer compatibility in existing technologies, this application provides a distributed ad hoc network communication method and related apparatus to achieve adaptive and stable evolution of decentralized topologies and efficient, low-collision scheduling of multiple services. The specific solution is as follows:

[0004] The first aspect of this application provides a distributed ad hoc network communication method, applied to communication nodes in a wireless ad hoc network, the method comprising:

[0005] Listen to the channel to obtain the received signal strength of broadcast signals sent by other nodes;

[0006] Based on the comparison results between the received signal strength and the preset first signal quality boundary and second signal quality boundary, the target network identity of the current node is determined; wherein, the first signal quality boundary is used to define the coverage area of ​​resolvable communication, the second signal quality boundary is used to define the scope of identity competition, and the signal strength threshold of the second signal quality boundary is higher than the signal strength threshold of the first signal quality boundary.

[0007] Within the superframe period, communication interaction is performed in the corresponding functional time slot cluster based on the target network identity; the superframe period includes a broadcast time slot cluster, a time synchronization time slot cluster, and a data interaction composite time slot cluster, and the data interaction composite time slot cluster includes at least one of a data transmission time slot cluster, a command transmission time slot cluster, and a reply confirmation time slot cluster.

[0008] Within the data interaction composite time slot cluster, channel contention is performed based on the physical layer frame structure. The physical layer frame structure includes a unified preamble and a frame start code used to distinguish service priorities. After detecting the unified preamble, the frame start code is decoded by hardware to obtain the service priority, and channel avoidance or preemption is performed based on the service priority.

[0009] In one possible implementation, determining the target network identity of the current node based on a comparison between the received signal strength and a preset first signal quality boundary and a second signal quality boundary includes:

[0010] If the received signal strength is less than or equal to the signal strength threshold corresponding to the first signal quality boundary, then it is determined that the other nodes are not within the coverage of the current node's resolvable communication, and the target network identity of the current node is determined to be the main gateway.

[0011] If the received signal strength is greater than the signal strength threshold corresponding to the first signal quality boundary and less than or equal to the signal strength threshold corresponding to the second signal quality boundary, then it is determined that the current node and the other nodes are in an independent network state, and the target network identity of the current node is determined to be the main gateway.

[0012] If the received signal strength is greater than the signal strength threshold corresponding to the second signal quality boundary, it is determined that the current node is in an identity competition state with the other nodes, and the target network identity of the current node is determined based on the unique node identifiers of the current node and the other nodes.

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

[0014] When the current node does not receive the broadcast signal from the higher-level main gateway, it searches for the broadcast signal of the higher-level main gateway level by level.

[0015] If the broadcast signal of the higher-level master gateway is found and a corresponding reply confirmation message is received, then based on the received signal strength and the signal quality boundary corresponding to the higher-level master gateway, the target network identity of the current node is determined to be the next-level master gateway or slave gateway at the level where the higher-level master gateway is located.

[0016] If the current node does not receive the broadcast signal or the reply confirmation message from any level of main gateway within the preset scanning period, the target network identity of the current node is determined to be a disconnected terminal.

[0017] In one possible implementation, if the target network identity of the current node is determined to be a disconnected terminal, the method further includes:

[0018] The off-chain terminal is controlled to broadcast service data within the data interaction composite time slot cluster;

[0019] If the disconnected terminal receives a reply confirmation message from any level of master gateway after sending the service data, it updates the target network identity of the current node to the corresponding level of slave gateway or master gateway based on the level of the reply confirmation message, so as to reconnect to the wireless ad hoc network.

[0020] In one possible implementation, the execution of channel avoidance or preemption based on the service priority includes:

[0021] When preparing to send a data frame within the data interaction composite time slot cluster, the physical layer signal of the current channel is monitored;

[0022] If the unified preamble sent by other nodes is detected, the start-of-frame code sent by the other nodes is decoded to obtain the service priority of the other nodes;

[0023] If the service priority of the other node is higher than the service priority of the data frame, then control the current node to stop sending and perform silent avoidance;

[0024] If the service priority of the other nodes is equal to the service priority of the data frame, then channel contention is performed based on the received signal strength of the current node and the other nodes;

[0025] If the service priority of the other nodes is lower than the service priority of the data frame, then the current node is controlled to continue sending the data frame to preempt the channel.

[0026] In one possible implementation, the method further includes a channel assessment and adaptive handover mechanism:

[0027] During the superframe period, the current working frequency band is silently monitored, and the channel busyness within the current working frequency band is statistically analyzed.

[0028] If the channel busyness exceeds a preset resource exhaustion threshold, or if the current level master gateway fails, a frequency hopping operation is triggered.

[0029] Based on a preset list of working frequency bands, the channel idle status and existing network load of each candidate frequency band are evaluated, the optimal candidate frequency band is selected as the new working frequency band, and the determination of the target network identity is re-executed on the new working frequency band.

[0030] In one possible implementation, the communication interaction within the corresponding functional time slot cluster based on the target network identity during the superframe period includes performing hierarchical time synchronization within the time synchronization time slot cluster:

[0031] Obtain the business type requirements of the current node;

[0032] If the required service type is high-precision positioning, then nanosecond or submicrosecond time synchronization is performed based on the hardware timestamp mechanism.

[0033] If the service type requirement is a highly dynamic networking or data interaction service, then microsecond-level or millisecond-level time synchronization is performed based on the local clock and broadcast time slot cluster alignment mechanism.

[0034] If the service type requirement is a low-power sensing service, then second-level or sub-second-level time synchronization is performed based on a software timing protocol.

[0035] A second aspect of this application provides a distributed ad hoc network communication device, applied to a communication node in a wireless ad hoc network, comprising:

[0036] The monitoring unit is used to monitor the channel to obtain the received signal strength of broadcast signals sent by other nodes;

[0037] An identity determination unit is used to determine the target network identity of the current node based on the comparison result between the received signal strength and a preset first signal quality boundary and a second signal quality boundary; wherein, the first signal quality boundary is used to define the coverage area of ​​resolvable communication, the second signal quality boundary is used to define the scope of identity competition, and the signal strength threshold of the second signal quality boundary is higher than the signal strength threshold of the first signal quality boundary.

[0038] The communication interaction unit is used to perform communication interaction within the corresponding functional time slot cluster based on the target network identity during the superframe period; the superframe period includes a broadcast time slot cluster, a time synchronization time slot cluster, and a data interaction composite time slot cluster, and the data interaction composite time slot cluster includes at least one of a data transmission time slot cluster, an instruction transmission time slot cluster, and a reply confirmation time slot cluster.

[0039] The channel contention unit is used to perform channel contention based on the physical layer frame structure within the data interaction composite time slot cluster; the physical layer frame structure includes a unified preamble and a frame start code for distinguishing service priorities; after detecting the unified preamble, the frame start code is decoded by hardware to obtain the service priority, and channel avoidance or preemption is performed based on the service priority.

[0040] A third aspect of this application provides a computer program product including computer-readable instructions that, when executed on an electronic device, cause the electronic device to implement the distributed self-organizing network communication method of the first aspect or any implementation thereof.

[0041] A fourth aspect of this application provides an electronic device, including at least one processor and a memory connected to the processor, wherein:

[0042] The memory is used to store computer programs;

[0043] The processor is used to execute the computer program so that the electronic device can implement the distributed self-organizing network communication method of the first aspect or any implementation thereof.

[0044] The fifth aspect of this application provides a computer-readable storage medium carrying one or more computer programs that, when executed by an electronic device, enable the electronic device to implement the distributed self-organizing network communication method described in the first aspect or any implementation thereof.

[0045] By employing the aforementioned technical solutions, the distributed self-organizing network communication method and related apparatus provided in this application, through setting a first signal quality boundary and a second signal quality boundary, maps the signal coverage of physical space into logical communication ranges and competition areas. This enables nodes to autonomously complete identity determination and topology construction based solely on locally perceived signal strength and node identifiers, without relying on the global scheduling of a central node. This avoids network oscillations caused by central node failure or link fluctuations in large-scale, highly dynamic scenarios, significantly improving the robustness and self-healing capability of the topology. Simultaneously, by dividing the superframe period into composite time slot clusters for broadcasting, synchronization, and data interaction, and combining this with a physical layer frame structure containing a unified preamble and a service priority frame start code, hardware-level real-time identification and zero-latency preemption of service priorities are achieved. This effectively solves the channel conflict problem in multi-node concurrent scenarios, ensuring the real-time performance of core services. Furthermore, the networking rules and time slot scheduling mechanism of this method are decoupled from the specific physical layer medium, allowing for flexible adaptation to different hardware capabilities and communication links. It also caters to the needs of multiple scenarios, including low-power IoT and high-precision collaborative detection, demonstrating broad versatility and scalability. Attached Figure Description

[0046] The above and other features, advantages, and aspects of the embodiments of this disclosure will become more apparent from the accompanying drawings and the following detailed description. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic, and the originals and elements are not necessarily drawn to scale.

[0047] Figure 1A flowchart illustrating a distributed ad hoc network communication method provided in an embodiment of this application;

[0048] Figure 2 A schematic diagram of a network element model provided in an embodiment of this application;

[0049] Figure 3 This is a schematic diagram of the superframe cycle structure provided in an embodiment of this application;

[0050] Figure 4 This is a schematic diagram of a node identity competition model provided in an embodiment of this application;

[0051] Figure 5 This application provides a schematic diagram of the evolution of an n-level chain gateway ad hoc network.

[0052] Figure 6 This is a schematic diagram of the structure of a distributed self-organizing network communication device provided in an embodiment of this application;

[0053] Figure 7 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation

[0054] The embodiments of this application are described below with reference to the accompanying drawings. The terminology used in the implementation section of this application is for explaining specific embodiments only and is not intended to limit the scope of this application.

[0055] The embodiments of this application will now be described with reference to the accompanying drawings. Those skilled in the art will recognize that, with technological advancements and the emergence of new scenarios, the technical solutions provided in the embodiments of this application are equally applicable to similar technical problems.

[0056] The terms "first," "second," etc., used in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such terms are interchangeable where appropriate; this is merely a way of distinguishing objects with the same attributes in the embodiments of this application. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion, so that a process, method, system, product, or apparatus that comprises a series of elements is not necessarily limited to those elements, but may include other elements not explicitly listed or inherent to those processes, methods, products, or apparatuses.

[0057] The distributed self-organizing network communication method of this application embodiment will be described in detail below with reference to the accompanying drawings.

[0058] Example 1

[0059] Reference Figure 1 , Figure 1 This is a flowchart illustrating a distributed ad hoc network communication method provided in an embodiment of this application. This method is applied to communication nodes in a wireless ad hoc network. Through the coordination of local awareness and physical layer frame structure, this method achieves adaptive construction of a decentralized topology and efficient scheduling of multiple services. Figure 1 As shown in the embodiments of this application, a distributed ad hoc network communication method may include the following steps, which are described in detail below.

[0060] Step S100: Listen to the channel to obtain the received signal strength of broadcast signals sent by other nodes.

[0061] Specifically, during power-on initialization or normal operation, the communication node periodically or within specific time slots listens to the current operating frequency band. The received signal strength (RSS) here is a generalized physical quantity used to characterize the signal quality of the wireless link. Its specific form can be Received Signal Strength Indication (RSSI), Signal-to-Noise Ratio (SNR), or other physical quantities that characterize the quality of the wireless link. It should be understood that although this embodiment uses RSSI as an example, in other embodiments, any parameter reflecting signal coverage and communication reliability can be used as a substitute, as long as it can support the subsequent identity determination logic. This application does not limit this.

[0062] By acquiring this parameter through monitoring, an objective physical layer basis is provided for subsequent identity determination. This allows the construction of the network topology to no longer rely on pre-configured static geographical information or instructions from the central node, but rather on real-time wireless environmental awareness. The execution of this step has a compact timing characteristic, typically entering the identity determination process immediately after completing a monitoring session, avoiding devices remaining in an idle state without response for extended periods.

[0063] Step S200: Based on the comparison results between the received signal strength and the preset first signal quality boundary and second signal quality boundary, determine the target network identity of the current node; wherein, the first signal quality boundary is used to define the coverage area of ​​resolvable communication, the second signal quality boundary is used to define the scope of identity competition, and the signal strength threshold of the second signal quality boundary is higher than the signal strength threshold of the first signal quality boundary.

[0064] Each wireless communication node operates within a preset frequency band, forming two levels of signal quality boundaries centered on the device: a first signal quality boundary and a second signal quality boundary. The first signal quality boundary represents the physical limit to which the wireless communication node can correctly demodulate and parse messages from the other party, i.e., the "visible range" of communication coverage. The second signal quality boundary is a further defined "stable interaction zone" within the visible range, used to trigger identity contention logic. Because the threshold of the second signal quality boundary is higher than that of the first signal quality boundary, this forms a ring-shaped buffer zone in space.

[0065] For ease of understanding, please refer to Figure 2 , Figure 2 This is a schematic diagram of a network element model provided in an embodiment of this application, showing the first signal quality boundary (corresponding to...). Figure 2 The weakest RSSI signal (represented by the outer dashed circle in the diagram) represents the spatial boundary corresponding to the minimum RSSI value that a wireless communication node device can parse and demodulate, i.e., the network element coverage boundary; devices within this boundary can normally receive, parse, and respond to communication messages from other nodes; the second signal quality boundary (corresponding to...) Figure 2 The RSSI threshold signal (represented by the inner dashed circle in the diagram) is a communication distance threshold set within the network element coverage boundary, corresponding to a specific RSSI strength. This threshold is used as a criterion for determining the identity contention between master and slave gateways. The boundary of the RSSI threshold signal can be customized. By customizing the RSSI threshold signal boundary, the coverage range of network nodes can be flexibly controlled. Node evolution in a distributed self-organizing network will only occur when other devices receive a signal strength from this device that is lower than the specified RSSI threshold signal boundary.

[0066] Specifically, when a neighboring node is outside the first signal quality boundary, it is considered invisible. When a neighboring node is between the first and second signal quality boundaries, although the physical link is connected, due to insufficient signal margin, it does not participate in intense identity competition and usually forms its own independent network or maintains a weak connection. Only when a neighboring node enters the second signal quality boundary is the link considered robust enough to safely perform master-slave identity competition or chain-like topology evolution. This design fundamentally avoids the problems of frequent node entry and exit from the network and topology oscillation caused by signal fluctuations near the critical value in traditional single-threshold schemes, ensuring the stability and robustness of the target network identity determination.

[0067] In this embodiment, the target network identity includes the following five categories.

[0068] The primary gateway identity, also known as the level 0 primary gateway, can directly connect to the platform, actively broadcast, and maintain the networking and message sending and receiving of nodes within the network element.

[0069] A secondary gateway, also known as a level 0 secondary gateway, can directly connect to the platform, but it has not become the primary gateway in the identity contention process and remains in a silent listening state, capable of forwarding messages. A secondary gateway can switch frequency bands through channel scanning to re-participate in the primary gateway contention.

[0070] A main chain gateway, or n-level main chain gateway, cannot directly connect to the platform but can receive broadcast or data information from the next higher-level gateway. After winning the competition to become a main chain gateway, it can broadcast and maintain its own subnet within the network element. Specifically, a terminal device that cannot directly connect to the platform system but can receive broadcast and reply messages from a level 0 main gateway device, or receive message replies from a gateway identity node device, is called a level 1 main chain gateway device. After winning the identity competition, it is called a level 1 main chain gateway. Similarly, an n-level main chain gateway is a terminal device that can only receive broadcast and reply messages from n-1 level main chain gateway devices. This device actively broadcasts and maintains the node networking and message forwarding within the network element.

[0071] A slave gateway, i.e., an n-level slave gateway, can receive signals from its parent gateway but does not compete to become the main gateway; it remains in a silent listening state and can forward messages. A slave gateway can switch to another operating frequency band via channel scanning and acquire the main gateway identity for that frequency band through identity contention.

[0072] For delinked terminal devices, those that have just been powered on or cannot receive any gateway broadcast or reply messages can only transmit data via broadcast. If a delinked terminal receives a reply message from another gateway device after broadcasting data, it rejoins the chain as a chain gateway at the corresponding level. Delinked terminals can also use the channel scanning function to search for n-1 level chain gateways on other operating frequency bands to join as an n-level main chain gateway.

[0073] Each main gateway and each level of main chain gateway maintains the network within its respective network element and forms the topology of the entire Mesh network. They are the main nodes supporting the entire Mesh network. Slave gateways and each level of slave chain gateway are distributed throughout the topology Mesh network, maintaining a silent listening state and providing auxiliary network services within their respective network elements.

[0074] It should be noted that, as a primary gateway or main chain gateway, it needs to maintain the networking, routing, and other business functions within its own network elements, which requires the hardware to have a certain level of computing power. For some lightweight hardware terminals, they can be configured not to participate in identity contention, that is, to always default to acting as a secondary gateway or secondary chain gateway.

[0075] In addition, for node devices in scenarios with dynamic network access requirements, such as low-power IoT node devices, low-altitude flight vehicles, and road vehicles as network access terminals, they can be connected to the network as n-level chain gateways or slave chain gateways. The level can be automatically adjusted according to the changes in time and space, without occupying the resources of the main gateway or main chain gateway, thus ensuring network stability.

[0076] In this application, the determination of the target network identity is based entirely on local comparison results, without the need for global information exchange, which reflects the technical advantages of distributed self-healing and adaptive evolution.

[0077] Step S300: During the superframe period, communication interaction is performed in the corresponding functional time slot cluster based on the target network identity.

[0078] Specifically, to overcome the conflict problem caused by the disordered transmission of services in existing ad hoc networks, this application constructs a standardized time-domain scheduling framework. This application divides the time axis into a periodic superframe structure. The system uses a superframe of fixed duration as the minimum cycle period. Each superframe cycle is divided into several equal-length minimum time slot units. The time slot length is pre-configured based on hardware clock accuracy, communication bandwidth, and synchronization requirements. All network elements strictly align with the superframe start boundary and time slot boundary under the constraints of the local clock and the network-wide time synchronization mechanism. This ensures that the behavior of different devices within the same time slot is controllable and conflict-free, guaranteeing orderly and conflict-free time-division transmission across the entire network, and cyclically executing the network interaction process.

[0079] Within each superframe cycle, one or more consecutive time slots are combined into a functional time slot cluster based on the different interactive functions. Each cluster carries a specific type of interactive behavior. Each device, according to its own role and communication needs, implements communication and interaction with the corresponding frame structure within the corresponding functional time slot cluster.

[0080] In one implementation, the superframe period includes a basic broadcast time slot cluster, a time synchronization time slot cluster, and a data interaction composite time slot cluster. The data interaction composite time slot cluster includes at least one of a data transmission time slot cluster, a command transmission time slot cluster, and a response acknowledgment time slot cluster. For ease of understanding, refer to... Figure 3 , Figure 3 This is a schematic diagram of the superframe periodic structure provided in an embodiment of this application.

[0081] Specifically, the broadcast time slot cluster is used by gateway devices to periodically broadcast identity and location information, providing surrounding nodes with network access criteria and location calculation information. The identity information includes gateway number, channel load assessment results, etc. Within each broadcast time slot cluster, depending on actual needs, such as in areas where multiple network elements overlap, multiple main gateway devices or multi-level main chain gateways can sequentially send broadcast messages through channel contention. The time synchronization time slot cluster is used to achieve hierarchical, step-by-step synchronization to meet the synchronization accuracy requirements of different service scenarios. Similarly, within this time slot cluster, for nodes requiring time synchronization, time synchronization interaction logic is sequentially performed through channel contention. The data interaction composite time slot cluster is a configurable composite structure that dynamically includes at least one of the following sub-time slot clusters according to scenario requirements: a data transmission time slot cluster, used by network element nodes to transmit sensing data and service data, scheduled for transmission according to priority to avoid co-frequency conflicts; a command transmission time slot cluster, used by the platform or upper-level gateway to issue control commands and configuration parameters, ensuring the determinism and reliability of command transmission; and a reply confirmation time slot cluster, used to receive confirmation replies from receiving devices for broadcasts, commands, or data, completing link maintenance and status updates. For example, in a sensing data acquisition scenario, the focus can be on configuring data transmission time slot clusters; while in a remote control scenario, the proportion of command transmission time slot clusters can be increased.

[0082] Within each of the aforementioned functional time slot clusters, each network element executes its corresponding communication interaction logic according to its role and function. The main gateway and main chain gateway actively send broadcast messages within the broadcast time slot cluster. Each device synchronizes its time with the next-level gateway device within the time synchronization time slot cluster as needed, ensuring time synchronization across the network. Slave gateways and slave chain gateways listen for broadcasts within the broadcast time slot cluster and forward or process data within the data transmission or command transmission time slot cluster. If a disconnected terminal does not receive a gateway message in the broadcast time slot cluster, it will broadcast data in the data transmission time slot cluster and rejoin the chain upon receiving a reply.

[0083] This time-slot cluster design, decoupled from the physical layer, allows the same set of networking rules to adapt to various heterogeneous service requirements, from low-power IoT to high-precision collaborative detection, avoiding the fragmentation drawbacks of designing separate protocols for each service. Standardized superframe structure and fixed time-slot clusters ensure network robustness, while configurable data interaction composite time-slot clusters adapt to multiple scenario requirements, significantly improving protocol versatility and hardware compatibility.

[0084] Step S400: Within the service interaction time slot cluster, channel contention is performed based on the physical layer frame structure; the physical layer frame structure includes a unified preamble and a frame start code used to distinguish service priorities; after detecting the unified preamble, the frame start code is decoded by hardware to obtain the service priority, and channel avoidance or preemption is performed based on the service priority.

[0085] This step is the core of achieving low-latency, deterministic transmission. Within the service interaction time slot cluster, when multiple nodes have simultaneous transmission needs, instead of using the traditional MAC layer software backoff algorithm, hardware-level contention is achieved using the physical layer frame structure. Specifically, the physical layer frame structure includes a unified preamble and a start frame delimiter (SFD) used to distinguish service priorities. The unified preamble triggers carrier sensing and channel assessment by all potential receiving nodes, ensuring that all network devices are aware of channel occupancy status; the start frame delimiter follows immediately after the preamble, and its encoded content directly maps to the service priority of the current frame (such as emergency alarms, synchronization signaling, and ordinary data).

[0086] The key is that this decoding process is directly completed by hardware logic such as RF chips or FPGAs, without waiting for MAC layer unpacking or CPU intervention. When a node detects a unified preamble, the hardware circuit parses the priority information carried in the frame start code within nanoseconds. If the other party has a higher priority, the sender immediately yields; if the priorities are the same or lower, the contention or preemption strategy continues. This hardware-level instant decision mechanism completely eliminates the uncertainty and delay caused by protocol stack processing, ensuring deterministic transmission of high-priority services such as core data from the sensing terminal and flight vehicle control commands in complex electromagnetic environments. This is the underlying foundation for the efficient, low-collision scheduling achieved in this application.

[0087] Through the coordinated execution of steps S100 to S400, this embodiment constructs a complete distributed self-organizing network communication method. This method utilizes dual signal quality boundaries to achieve autonomous and stable topology evolution, leverages superframe time slot clusters to achieve orderly service scheduling, and utilizes physical layer hardware-level priority contention to ensure the real-time performance of core data. These three elements support each other, jointly solving the technical challenges of poor stability, high conflict rates, and weak versatility faced by decentralized networks in large-scale, highly dynamic scenarios.

[0088] Example 2

[0089] As one implementation method, the target network identity of the current node is determined based on the comparison result between the received signal strength and the preset first signal quality boundary and second signal quality boundary. Specifically, the determination logic includes the following:

[0090] If the received signal strength is less than or equal to the signal strength threshold corresponding to the first signal quality boundary, it is determined that other nodes are not within the coverage of the current node's resolvable communication, and the target network identity of the current node is determined to be the main gateway.

[0091] If the received signal strength is greater than the signal strength threshold corresponding to the first signal quality boundary and less than or equal to the signal strength threshold corresponding to the second signal quality boundary, then it is determined that the current node is in an independent network state with other nodes, and the target network identity of the current node is determined to be the main gateway.

[0092] If the received signal strength is greater than the signal strength threshold of the second signal quality boundary, it is determined that the current node is in a state of identity competition with other nodes, and the target network identity is determined based on the unique node identifiers of the current node and other nodes.

[0093] The aforementioned three-stage comparison logic constitutes the core defense line of spatial dimension topology adaptation. Specifically, the first signal quality boundary defines the physical link connectivity baseline; that is, when the signal strength is below this value, nodes cannot correctly demodulate data and are considered "invisible" to each other. The second signal quality boundary defines the stable region of topology interaction, with a threshold higher than the first signal quality boundary, forming a ring-shaped "hysteresis buffer" between the two. When the signal of a neighboring node falls into this buffer (i.e., greater than the first boundary but less than or equal to the second boundary), although physical communication is possible, the signal margin is insufficient to support stable master-slave synchronization or high-frequency data forwarding. The system determines that the two are not suitable to establish a close hierarchical dependency relationship, and instead, they each operate as independent master gateways, maintaining their respective network elements.

[0094] This design effectively avoids the ping-pong effect caused by frequent node joining and leaving the network and repeated master-slave role switching due to slight signal fluctuations near the critical value in traditional single-threshold schemes, significantly improving the stability of the topology. The identity contention process is only triggered when the signal strength exceeds the second signal quality boundary and enters the strong signal area, ensuring that the final master-slave link has sufficient anti-interference capability and transmission reliability.

[0095] Furthermore, the process of determining the target network identity based on the unique identifiers of the current node and other nodes includes: if the unique identifier of the current node meets the preset competition winning conditions, then the target network identity of the current node is determined as the current level master gateway; if the unique identifier of the current node does not meet the competition winning conditions, then the target network identity of the current node is determined as the current level slave gateway.

[0096] In this embodiment, the unique identifier of a node can be a unique parameter such as a MAC address that is uniform across the entire network, a factory serial number, or a pre-assigned device ID.

[0097] In this embodiment, the winning condition for the competition is usually set as a numerical comparison rule, such as the one with the smaller MAC address value becoming the main gateway first.

[0098] When multiple nodes in the same area detect that each other's signal strength exceeds the second signal quality boundary, they spontaneously exchange broadcast messages containing their own unique node identifiers. Each node independently performs the comparison locally: if its identifier is superior to all known competitors, it declares itself the master gateway for the current level and continues to send broadcasts; if it finds a neighbor with a better identifier, it automatically degrades to a slave gateway, stops sending competitive broadcasts, and enters a listening state. This process is executed entirely in a distributed manner without the intervention of any central controller, enabling the network to quickly converge to a stable state even when nodes are randomly deployed or dynamically added.

[0099] For ease of understanding, please refer to Figure 4 , Figure 4 This is a schematic diagram of a node identity competition model provided in an embodiment of this application, such as... Figure 4 As shown, the two devices, main gateway 1 and main gateway 2, are far enough apart that their locations are not within the RSSI threshold signal boundary of each other's broadcast messages. They each evolve into main gateways, forming two independent network elements, and perform network maintenance and message sending and receiving within their respective network elements.

[0100] When the primary gateway 1 and the secondary gateway 1 are within each other's RSSI threshold signal range, the device that first sends the primary gateway broadcast message acquires the primary gateway identity, while the device that listens to the other's broadcast message acquires the secondary gateway identity. Each device has a standardized MAC address across the entire platform. When both gateway devices receive each other's primary gateway broadcast messages, the device with the smaller MAC address automatically acquires the primary gateway identity, and the device with the larger MAC address automatically acquires the secondary gateway identity.

[0101] For ease of understanding, this embodiment also provides the master-slave gateway identity evolution process, which is as follows: after the node is powered on and initialized, it first starts frequency scanning and selects the working frequency band to enter the network, and then listens for broadcast cluster information during the superframe period, which includes the following three cases.

[0102] In the first scenario, if no other gateway broadcasts are detected, the node directly acts as the primary gateway and continues to monitor the communication services of subsequent time slot clusters during the superframe period.

[0103] In the second scenario, if a node detects broadcasts from other gateways and is not the primary gateway, it determines its status based on the RSSI signal strength: if the RSSI signal is below a preset threshold, the node becomes the new primary gateway; if the RSSI signal is above the preset threshold, the node determines its status based on its current state: if it is currently scanning frequencies, it hops to the next channel; otherwise, it becomes a secondary gateway.

[0104] In the third scenario, if another gateway broadcast is detected and the gateway is already the primary gateway, the RSSI signal strength is used to determine its status: if the RSSI signal is higher than a preset threshold, its MAC address is compared with the broadcast gateway; the gateway with the smaller MAC address remains the primary gateway, while the gateway with the larger MAC address becomes a secondary gateway. If the RSSI signal is lower than the preset threshold, the gateway retains its primary gateway status. After a secondary gateway connects, it determines whether frequency hopping is necessary based on the superframe channel evaluation results. Simultaneously, it monitors the communication services of subsequent time slot clusters within the superframe period, achieving distributed, decentralized, adaptive identity evolution across the entire network.

[0105] Example 3

[0106] Based on the peer identity competition mechanism described in Example 2, this application further provides a vertical hierarchy construction method that supports multi-level chain topology expansion.

[0107] Specifically, when the current node does not receive a broadcast signal from a higher-level master gateway, it searches upwards for the broadcast signal of a higher-level master gateway. If a broadcast signal from a higher-level master gateway is found and a corresponding reply confirmation message is received, the target network identity of the current node is determined to be the next-level master gateway or slave gateway at the level where the higher-level master gateway is located, based on the received signal strength and the signal quality boundary corresponding to the higher-level master gateway. If the current node does not receive any broadcast signal or reply confirmation message from any level master gateway within the preset scanning period, the target network identity of the current node is determined to be a disconnected terminal.

[0108] Specifically, when a node powers on but does not detect a signal from the Level 0 main gateway (i.e., the root node directly connected to the platform), it does not immediately give up. Instead, it initiates a hierarchical upward search strategy, attempting to listen to broadcasts from Level 1, Level 2, and even (n-1) level main gateways. This chain-like search logic allows the network to extend outwards like a tree structure. For example, a node located in an edge region may not be able to directly connect to the Level 0 main gateway, but if it can clearly receive a signal from a Level 1 main gateway (i.e., the signal strength meets the second signal quality boundary requirements relative to that Level 1 main gateway) and completes the handshake by replying with an acknowledgment message, then the node will evolve into a Level 2 main gateway or a Level 2 slave gateway according to the aforementioned competition rules. Through this relay-style identity inheritance, the network can extend its coverage to areas far exceeding the radio frequency capabilities of a single node in a multi-hop manner. At the same time, the topology construction of each level follows the same dual-boundary competition rules, ensuring the consistency and scalability of the entire network architecture.

[0109] For ease of understanding, please refer to Figure 5 , Figure 5 This application provides a schematic diagram of the evolution of an n-level chain gateway ad hoc network, as shown in the embodiments of this application. Figure 5As shown, Level 1 main chain gateway terminal 1, Level 1 slave chain gateway terminal 1, and Level 1 slave chain gateway terminal 2 can all receive broadcast messages from the main gateway and are all acting as Level 1 chain gateway devices. However, the Level 1 main chain gateway first obtains the identity of the main chain gateway, or its MAC address number is smaller than the MAC address numbers of the other two. Therefore, it competes to obtain the identity of the Level 1 main chain gateway, while the other two obtain the identity of the Level 1 slave chain gateway.

[0110] Similarly, the identities of terminal devices in Level 2 and Level 3 main chain gateways are also obtained according to this competitive specification.

[0111] For ease of understanding, this embodiment also provides an n-level chain gateway identity evolution process, which is as follows: after the node is powered on and initialized, it starts frequency scanning and selects the working frequency band, aligns the time slots to enter the network, and then listens to the channel during the superframe period, specifically including the following three cases.

[0112] In the first scenario, when a level 0 gateway message exists, the node decides whether to act as an n-level main chain gateway or a slave chain gateway based on whether data interaction is needed, whether an ACK response is received from the gateway, and the RSSI signal strength.

[0113] In the second scenario, when there is no message from the level 0 gateway, the node searches upwards through the (n-1) level chain gateway broadcasts. Based on whether it receives an ACK response and the strength of the RSSI signal, it decides whether to act as the level n main chain gateway, the secondary chain gateway, or to enter a disconnected state.

[0114] In the third scenario, after the chain gateway connects, it determines whether frequency hopping is required based on the superframe channel evaluation results. If frequency hopping is required, it switches to the next channel to re-enter the network; if frequency hopping is not required, it continues to monitor subsequent services within the superframe period.

[0115] This process supports multi-level chain expansion, realizing a distributed hierarchical network from the ground backbone gateway to the edge node and then to the mobile node.

[0116] Furthermore, this evolutionary mechanism implicitly includes dynamic transition conditions between "off-chain" and "on-chain" states to achieve decentralized self-healing. When a slave gateway or lower-level master gateway that was originally in the "on-chain" state loses all broadcasts and responses from upper-level master gateways within a preset scanning period due to environmental changes or upper-level failures, it will automatically revert to the "off-chain terminal" state, temporarily maintaining basic data transmission capabilities in broadcast mode and continuously performing a hierarchical upward search. Once a valid upper-level signal is recaptured and confirmation interaction is completed, it immediately reverts to the identity of the corresponding level of chain gateway.

[0117] This state machine design ensures that mobile nodes (such as drones and vehicles) can maintain minimal communication interruption when crossing signal blind spots or when the network is partially damaged, and can seamlessly return to the hierarchical network when conditions are restored, without manual intervention or a full network restart, greatly enhancing the system's robustness in complex and dynamic environments.

[0118] It should be understood that although this embodiment names the identity as "off-chain terminal," in other implementations it can also be called an "isolated node," "node to be connected," or "roaming node," as long as it has the ability to maintain basic communication capabilities in the off-chain state and support subsequent re-entry into the chain. By making the off-chain state explicit and incorporating it into the protocol specification, this application avoids the problem of nodes falling into silence or deadlock after losing connection in traditional ad hoc networks, laying the logical foundation for the broadcast re-entry mechanism described in Embodiment 4, and significantly improving the network's tolerance and self-healing ability to mobile nodes and sudden failures.

[0119] Example 4

[0120] Based on the determination of the current node as a disconnected terminal in Example 3, this application further provides a self-healing and dynamic fusion mechanism for disconnected terminals to reconnect to the network.

[0121] Specifically, if the target network identity of the current node is determined to be a disconnected terminal, the disconnected terminal is controlled to broadcast service data within the data interaction composite time slot cluster. This action constitutes the core means for the disconnected terminal to actively seek network acceptance. Terminals in a disconnected state do not stop working or enter deep hibernation; instead, they switch to a special broadcast transmission mode. Unlike the conventional networking process of establishing a connection before transmitting data, the disconnected terminal directly broadcasts a message containing its own identifier and service requirements within the data interaction composite time slot cluster in a connectionless broadcast format. This reverse access logic of "send first, then establish connection" is specifically designed to address the predicament of mobile nodes (such as aircraft carriers and road vehicles) or newly powered-on nodes that cannot predict the surrounding network topology.

[0122] It should be understood that although this embodiment describes transmission within a "data interaction composite time slot cluster," in other implementations, a dedicated "access request time slot" or the remaining resources of a "broadcast time slot cluster" can also be configured to carry such broadcast data, as long as it can be detected and parsed by the surrounding main gateway. By utilizing the openness of the data interaction composite time slot cluster, the offline terminal can continuously announce its presence to the surrounding environment without occupying dedicated signaling resources, creating opportunities for subsequent link reconstruction.

[0123] If a disconnected terminal receives a confirmation message from any level of the master gateway after sending service data, it updates the target network identity of the current node to the corresponding level of the slave gateway or master gateway based on the level of the confirmation message, so as to reconnect to the wireless ad hoc network.

[0124] Specifically, when the broadcast data from the off-chain terminal is successfully received and parsed by a master gateway within a certain range (whether it's a level 0 master gateway or an n-level master gateway), the master gateway will return a reply confirmation message (ACK) to the off-chain terminal based on its own load capacity and preset strategy. This ACK is not only an acknowledgment of data reception but also a signal of network acceptance. Once the off-chain terminal detects this ACK, it triggers an identity update process: first, it identifies the level of the reply message source (e.g., identifying the replyer as a level 1 master gateway), and then initializes its own identity as a candidate node of that level. Subsequently, the node automatically calls the identity determination and competition logic described in Example 2, and based on the current received signal strength and MAC address comparison results, finally determines whether it will become a slave gateway of that level or be promoted to master gateway of that level through competition. This mechanism ensures that newly added nodes can be seamlessly embedded into the existing multi-level topology, rather than existing as an isolated bypass device.

[0125] The broadcast reentrancy chain mechanism described in this embodiment has the core technical effect of enabling mobile nodes or fault recovery nodes to integrate quickly and seamlessly, while maximizing the stability of the backbone network.

[0126] In traditional ad hoc networks, mobile node access often requires full-band scanning and complex handshake negotiations, which is not only time-consuming but can also interfere with ongoing communication services due to frequent channel switching. The "active broadcast + passive response" mode adopted in this application, however, delegates the initiative for network access to the network-side main gateway: only when a disconnected terminal truly enters the effective coverage area of ​​a main gateway, and the main gateway determines that it is capable of accepting a new node, will it issue an ACK in response. This means that the network access behavior of disconnected terminals is completely controlled by the existing network state, will not forcibly occupy the resources of busy links, and will not cause unnecessary topology oscillations.

[0127] Furthermore, because the identity update process reuses standard distributed competition rules, nodes re-entering the chain can immediately assume corresponding forwarding or management responsibilities without additional configuration or manual intervention. This is particularly important for highly dynamic scenarios such as low-altitude sensing and vehicle-mounted communication. For example, when a drone flies into a new mesh coverage area, it can automatically complete the identity transformation from "off-chain" to "Level 1 slave gateway" within milliseconds through the above mechanism and begin uploading sensing data, thereby ensuring business continuity and network robustness.

[0128] Example 5

[0129] Based on the physical layer frame structure described in Example 1, this application further provides specific implementation logic for performing channel avoidance or preemption based on service priority.

[0130] Specifically, when preparing to send a data frame within a composite time-slot cluster for data interaction, a node first listens to the physical layer signal of the current channel. This listening action is not traditional energy detection, but rather precise identification targeting specific physical layer characteristics. If a unified preamble sent by another node is detected, the node immediately decodes the frame start code sent by that node to obtain its service priority. The key here lies in the subject and timing of this "decoding" process.

[0131] In this embodiment, the decoding process is directly completed by the hardware logic circuitry or field-programmable gate array (FPGA) inside the RF chip, rather than relying on the central processing unit (CPU) to run the protocol stack software. Once the RF front-end receives the unified preamble and confirms the signal's validity, the hardware comparator parses the following Start Frame Delimiter (SFD) within nanoseconds and compares the priority identifier carried by the SFD with the priority of the local frame to be transmitted in real time. This hardware-level instant decision mechanism completely eliminates the uncertainties and delays caused by operating system scheduling, interrupt responses, and memory copying, ensuring that priority determination occurs before the data frame is fully received, thus providing deterministic timing guarantees for high real-time services.

[0132] Based on the service priority comparison results obtained from hardware decoding, the node executes one of the following three channel access strategies.

[0133] If the service priority of other nodes is higher than the service priority of the data frame, then control the current node to stop sending and perform silent avoidance.

[0134] Specifically, once the hardware logic determines that a higher-priority signal already exists in the channel, the transmission link will be immediately suspended or reset, regardless of whether the current node's transmission buffer is full or whether the software layer has issued a transmission command. For example, in low-altitude sensing and cooperative detection scenarios, core sensing data or time synchronization messages transmitted between sensing terminals are defined as high priority, while ordinary status reporting between flight vehicles is defined as low priority. When a flight vehicle is preparing to transmit ordinary status data, if it detects a high-priority SFD (Self-Device Detection and Distributed Data) from a nearby sensing terminal, its radio frequency front-end will automatically suppress the transmitter enable signal and force it into a silent state until the high-priority transmission ends. This "hard preemption" mechanism ensures that critical mission data can obtain absolute channel usage rights under any network load, avoiding collisions or queuing caused by software processing delays.

[0135] If the service priority of other nodes is equal to the service priority of the data frame, then channel contention is performed based on the received signal strength of the current node and other nodes.

[0136] Specifically, when priorities are equal, the system automatically reverts to the distributed competition mechanism described in Example 2. In this case, nodes no longer determine the winner solely based on priority, but instead compare the Received Signal Strength Indication (RSSI) or unique node identifiers (such as MAC addresses). This design achieves multi-dimensional fair arbitration: given equal service importance, the node with better link quality or whose identifier better conforms to preset rules gains the right to transmit. This ensures orderly scheduling among services of the same priority level and avoids continuous conflicts or starvation that may arise due to equal priorities, demonstrating the organic integration of the priority mechanism and the topology stability mechanism.

[0137] If the service priority of other nodes is lower than that of the data frame, the current node is controlled to continue sending data frames in order to preempt the channel.

[0138] Specifically, when the hardware logic confirms that the existing signal in the channel has a low priority, the current node will not perform any backoff operation. Instead, it will maintain or start the transmitter and directly begin transmitting its own high-priority data in the current time slot. Since the low-priority node has already performed silent avoidance the moment it detects the high-priority SFD, the transmission of the high-priority node is actually carried out on a "cleaned" channel, with almost no physical layer collisions. This reverse preemption capability is one of the core features that distinguishes this application from the traditional Carrier Sense Multiple Access with Collision Avoidance (CSMA / CA) mechanism. In traditional CSMA / CA, as long as the channel is detected to be busy, regardless of the other party's service, the node must backoff; however, in this application, the channel busy / idle state is relative to priority. High-priority services regard low-priority occupancy as "idle," thereby significantly improving the throughput and timeliness of core services.

[0139] It should be understood that although this embodiment uses the sensing terminal and the flight vehicle as examples of priority division, in other implementations, the definition of service priority can be flexibly configured according to specific application scenarios. For example, in emergency rescue scenarios, the priority of vital sign monitoring data can be set to the highest, while the priority of environmental temperature and humidity data can be set to the lowest; in industrial control scenarios, the priority of emergency stop commands is higher than that of conventional telemetry data.

[0140] Furthermore, the encoding method for the frame start code is not limited to a fixed-length binary field. Orthogonal sequences, different cyclic shifts, or specific waveform features can also be used to represent priority, as long as the hardware circuit can distinguish it from the unified preamble and complete the identification in a very short time. This embodiment, through the combination of the above three-level judgment logic and hardware-level decoding mechanism, constructs a channel access defense line independent of the software protocol stack, fundamentally solving the technical problem of ensuring the real-time performance of core services in large-scale heterogeneous node concurrency scenarios.

[0141] Example 6

[0142] Based on the distributed self-organizing network communication method constructed in Examples 1 to 5, this application further provides a channel evaluation and adaptive switching mechanism to cope with strong interference or network topology anomalies in complex electromagnetic environments.

[0143] Specifically, this mechanism involves silent monitoring of the current operating frequency band during the superframe period to statistically analyze channel congestion. This silent monitoring is typically scheduled within the guard interval or a dedicated channel assessment slot during the superframe period. During this time, nodes shut down their transmitters and only receive and analyze the energy characteristics or specific signal patterns on the channel through their radio frequency front-end. The statistical analysis includes not only the communication signals of the network node itself but also signals from other interference sources in the same frequency band. Channel congestion can be characterized by metrics such as channel occupancy rate per unit time, the number of detected preambles, or the average background noise level. This periodic proactive sensing allows nodes to monitor the health of the current wireless environment in real time, providing a quantitative basis for subsequent decision-making.

[0144] If the channel congestion exceeds a preset resource exhaustion threshold, or if the current-level master gateway fails, frequency hopping is triggered. This embodiment sets dual triggering conditions to address two different abnormal scenarios: environmental interference and topology failure. The first scenario is resource exhaustion, where although the master gateway still exists and the link is connected, severe co-channel interference or excessive network node density causes the available time slots in the current frequency band to be completely occupied, preventing nodes from competing for transmission opportunities for an extended period. In this case, even if the signal strength meets the requirements, the communication efficiency has dropped to an unacceptable level, necessitating frequency hopping to find new spectrum resources. The second scenario is master gateway failure, where a node fails to receive the broadcast signal or synchronization header from the current-level master gateway for several consecutive superframe periods, determining that the upstream node has gone offline or the link is interrupted. In this case, remaining in the original frequency band is meaningless, and the node needs to use frequency hopping to search for a backup master gateway that may exist in other frequency bands or rebuild the network. It should be understood that the resource exhaustion threshold is not fixed and can be dynamically adjusted according to the type of service in actual deployment. For example, for control services with high real-time requirements, the threshold can be set lower to trigger switching in advance; while for data acquisition services with higher tolerance, it can be set higher to make full use of spectrum resources.

[0145] Based on a pre-defined list of working frequency bands, the node iterates through and evaluates the channel idle status and existing network load of each candidate frequency band, selects the optimal candidate frequency band as the new working frequency band, and re-executes the target network identity determination process on the new working frequency band. When frequency hopping is triggered, the node does not randomly select a channel, but instead quickly scans and evaluates all candidate frequency bands according to a pre-defined priority list. The optimal candidate frequency band selection strategy here follows the principle of "integrate first, then build": the node prioritizes frequency bands that have a certain degree of channel idleness and have detected existing self-organizing network signals (such as identifying specific preambles or broadcast frames). This is because accessing an existing network with a moderate load is far more reliable in ensuring service continuity and overall network topology connectivity than rebuilding a new network on a completely idle but isolated frequency band. Only when all candidate frequency bands have no existing network signals, or when the load of the existing network has exceeded the acceptance threshold, will the node select the most idle frequency band as the new working frequency band, and re-execute the target network identity determination process described in Examples 1 to 3 on this frequency band to build or add a new topology from scratch.

[0146] This embodiment, through the aforementioned channel assessment and adaptive switching mechanism, endows the distributed ad hoc network system with physical-level survivability and self-healing capabilities. Unlike traditional schemes that rely solely on signal strength for switching, this application comprehensively considers both channel congestion and network load, effectively avoiding network fragmentation caused by blindly switching to seemingly idle but actually isolated frequency bands. Simultaneously, the dual trigger condition design enables the system to accurately distinguish between environmental degradation and node failure, adopting targeted recovery strategies. For example, in low-altitude sensing scenarios, when a swarm of drones enters a region with strong radar interference, nodes can quickly migrate to a backup frequency band using the resource depletion trigger condition to maintain formation communication; conversely, when the lead drone unexpectedly loses contact, the wingman can automatically search for the backup drone's frequency band and complete topology reconfiguration using the main gateway failure trigger condition. This distributed spectrum management and topology maintenance capability ensures that the wireless ad hoc network can maintain minimum connectivity and service carrying capacity even in extremely harsh environments.

[0147] Example 7

[0148] Based on the superframe periodic scheduling framework described in Example 1, this application further provides a specific implementation mechanism for performing hierarchical time synchronization within a time synchronization time slot cluster.

[0149] Specifically, within the superframe period, communication interactions are conducted within the corresponding functional time slot clusters based on the target network identity, including performing hierarchical time synchronization within the time synchronization time slot cluster. The core design intention of this mechanism is to resolve the technical contradiction in general ad hoc network protocols where "a single synchronization precision cannot meet the needs of heterogeneous services." In traditional solutions, uniformly using high-precision synchronization leads to low-power nodes running out of power due to frequent calibration and high-performance hardware overhead; uniformly using low-precision synchronization fails to meet the stringent time-sensitive requirements of collaborative detection, flight control, and other applications. This application introduces a service-driven adaptive synchronization strategy at the protocol layer, enabling the same set of networking rules to dynamically select the most suitable synchronization precision level based on the actual service type requirements of the nodes. This achieves an optimal balance between performance and power consumption while ensuring basic time consistency across the entire network, fully demonstrating the universality advantage of this method's decoupling from the physical layer.

[0150] The system retrieves the service type requirements of the current node. Specifically, the service type requirements are the basis for triggering the hierarchical synchronization logic. This requirement information can come from static configuration parameters when the node is powered on, from the header identifier of the service data packet received at runtime, or from dynamic instructions passed in real time through the application layer interface. For example, when a node is deployed as a base station in a low-altitude sensing network, its service type requirement is marked as high-precision positioning; while when the same type of node is used as an environmental monitoring sensor, its service type requirement is marked as low-power sensing. This classification method based on service semantics rather than hardware model ensures that the synchronization strategy can accurately adapt to the actual application scenario, avoiding resource mismatch caused by excessive or insufficient hardware capabilities.

[0151] If the service requirement is high-precision positioning, nanosecond or sub-microsecond time synchronization is performed based on a hardware timestamp mechanism. Specifically, for services highly sensitive to timing, such as cooperative detection and PNT (Positioning, Navigation, and Timing) positioning, the system uses the highest level of synchronization mode. In this mode, the time synchronization process completely bypasses the operating system and upper-layer protocol stack, and is directly completed by the hardware logic circuits inside the RF chip or FPGA. For example, in a specific implementation, the hardware stamping mechanism of the IEEE 1588v2 Precision Time Protocol (PTP) can be used to automatically insert a hardware counter value of the transmission time at a specific position in the physical layer frame (such as after the start of frame (SFD) code), and the arrival time is also recorded by hardware at the receiving end. By eliminating the uncertainties and delays at the software level, such as interrupt response, task scheduling, and memory copying, this mechanism can achieve synchronization accuracy at the nanosecond or even sub-microsecond level. This high-precision synchronization is the physical basis for ensuring the accuracy of multi-node distributed coherent detection and TDOA (Time Difference of Arrival) positioning calculation, and it is also one of the key features that distinguishes this application from ordinary IoT networking solutions.

[0152] If the service type requires highly dynamic networking or data interaction, microsecond-level or millisecond-level time synchronization is performed based on the alignment mechanism between the local clock and the broadcast time slot cluster. Specifically, for services such as Mesh route maintenance, regular data transmission, and command interaction, the timing requirements mainly focus on ensuring non-overlapping time slots and controllable handshake timeouts, without needing to achieve nanosecond-level precision. In this case, the system adopts a medium-precision synchronization mode. This mode utilizes the broadcast time slot cluster inherent in the superframe structure as a unified coarse synchronization benchmark for the entire network. When each node receives the broadcast frame header from the main gateway or the upstream chain gateway, it resets or corrects its local clock counter to the preset superframe start phase. Based on this, inter-frame timekeeping is performed in conjunction with the local RTC (Real-Time Clock) or crystal oscillator counter, with periodic calibration only performed when the next broadcast time slot arrives. This mechanism maintains synchronization accuracy at the microsecond or millisecond level, which is sufficient to support time-division multiplexing scheduling and avoid channel conflicts. It also significantly reduces the dependence on hardware stamping capabilities and the frequency of synchronization message interaction, effectively saving air interface resources and node power consumption. It is the most cost-effective solution for maintaining stable network operation in highly dynamic scenarios.

[0153] If the service type requires low-power sensing, then time synchronization at the second or sub-second level is performed based on a software timing protocol. Specifically, for services such as environmental temperature and humidity acquisition and meter reading reporting, which have extremely low real-time requirements but are extremely sensitive to battery life, the system enables the lowest level of synchronization mode. In this mode, nodes do not need to maintain a high-precision local clock, nor do they need to participate in synchronization interaction in every superframe. Time synchronization is achieved entirely through a software-level timing protocol. For example, the current absolute network timestamp is attached to the reply confirmation message of the composite time slot cluster of data interaction. The node only updates its own coarse time base using this timestamp after waking up and successfully sending and receiving data. The interval between two synchronizations may be as long as several seconds or even several minutes, during which second-level or sub-second time drift is allowed. This "on-demand synchronization, drift-tolerant" strategy allows low-cost MCUs without hardware stamping capabilities to access the network and minimizes the energy consumption caused by synchronization, greatly expanding the applicable terminal range and commercial feasibility of the method in this application.

[0154] It should be understood that although this embodiment lists three typical synchronization levels—high precision, medium precision, and low precision—and their corresponding implementation methods, in other embodiments, the number of synchronization levels and specific thresholds can be flexibly adjusted according to the actual service spectrum. For example, an "enhanced data synchronization" level, between high precision and medium precision, can be added to support services such as video streaming that are sensitive to jitter but not to absolute time. Furthermore, the switching between different synchronization levels can be dynamic. For instance, when a low-power sensing node detects an abnormal event and needs to switch to emergency reporting mode, it can temporarily request an upgrade to medium precision synchronization to ensure transmission reliability. This embodiment, through the aforementioned hierarchical time synchronization mechanism, successfully constructs a flexible and scalable time service system, enabling the same distributed self-organizing network protocol to seamlessly support diverse services ranging from nanosecond-level precise coordination to second-level long-tail sensing, fundamentally solving the technical challenge of achieving both generality and specialization.

[0155] The above describes a distributed ad hoc network communication method provided by the embodiments of this application. The following will describe the apparatus for performing the above distributed ad hoc network communication method.

[0156] Please see Figure 6 , Figure 6 This is a schematic diagram of a distributed self-organizing network communication device provided in an embodiment of this application. Figure 6 As shown, the distributed self-organizing network communication device includes:

[0157] The monitoring unit 11 is used to monitor the channel to obtain the received signal strength of broadcast signals sent by other nodes;

[0158] The identity determination unit 12 is used to determine the target network identity of the current node based on the comparison result between the received signal strength and a preset first signal quality boundary and a second signal quality boundary; wherein, the first signal quality boundary is used to define the coverage area of ​​resolvable communication, the second signal quality boundary is used to define the scope of identity competition, and the signal strength threshold of the second signal quality boundary is higher than the signal strength threshold of the first signal quality boundary.

[0159] The communication interaction unit 13 is used to perform communication interaction within the corresponding functional time slot cluster based on the target network identity during the superframe period; the superframe period includes a broadcast time slot cluster, a time synchronization time slot cluster, and a data interaction composite time slot cluster, and the data interaction composite time slot cluster includes at least one of a data transmission time slot cluster, an instruction transmission time slot cluster, and a reply confirmation time slot cluster.

[0160] The channel contention unit 14 is used to perform channel contention based on the physical layer frame structure within the data interaction composite time slot cluster; the physical layer frame structure includes a unified preamble and a frame start code for distinguishing service priorities; after detecting the unified preamble, the frame start code is decoded by hardware to obtain the service priority, and channel avoidance or preemption is performed based on the service priority.

[0161] Each unit in the aforementioned distributed ad hoc network communication device can be implemented entirely or partially through software, hardware, or a combination thereof. These units can be embedded in or independent of the processor in a computer device, or stored in the computer device's memory as software, so that the processor can call and execute the corresponding operations of each unit.

[0162] This application also provides an electronic device in its embodiments. (See reference...) Figure 7 The diagram illustrates a structural schematic suitable for implementing the electronic device in the embodiments of this application. The electronic device in the embodiments of this application may include, but is not limited to, fixed terminals such as mobile phones, laptops, PDAs (personal digital assistants), PADs (tablet computers), desktop computers, etc. Figure 7 The electronic device shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments of this application.

[0163] like Figure 7As shown, the electronic device may include a processing unit (e.g., a central processing unit, a graphics processing unit, etc.) 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage device 608 into a random access memory (RAM) 603. When the electronic device is powered on, the RAM 603 also stores various programs and data required for the operation of the electronic device. The processing unit 601, ROM 602, and RAM 603 are interconnected via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0164] Typically, the following devices can be connected to I / O interface 605: input devices 606 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 607 including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices 608 including, for example, memory cards, hard drives, etc.; and communication devices 609. Communication device 609 allows electronic devices to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 7 Electronic devices with various devices are shown, but it should be understood that it is not required to implement or have all of the devices shown. More or fewer devices may be implemented or have alternatively.

[0165] This application also provides a computer program product including computer-readable instructions, which, when executed on an electronic device, cause the electronic device to implement any of the distributed ad hoc network communication methods provided in this application.

[0166] This application also provides a computer-readable storage medium that carries one or more computer programs. When the one or more computer programs are executed by an electronic device, the electronic device can implement any of the distributed ad hoc network communication methods provided in this application.

[0167] It should also be noted that the device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. In addition, in the device embodiment drawings provided in this application, the connection relationship between modules indicates that they have a communication connection, which can be implemented as one or more communication buses or signal lines.

[0168] Through the above description of the embodiments, those skilled in the art can clearly understand that this application can be implemented by means of software plus necessary general-purpose hardware, or it can be implemented by special-purpose hardware including application-specific integrated circuits, special-purpose CPUs, special-purpose memory, special-purpose components, etc. Generally, any function performed by a computer program can be easily implemented by corresponding hardware, and the specific hardware structure used to implement the same function can also be diverse, such as analog circuits, digital circuits, or special-purpose circuits. However, for this application, software program implementation is more often the preferred implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a readable storage medium, such as a computer floppy disk, USB flash drive, mobile hard disk, ROM, RAM, magnetic disk, or optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, training equipment, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0169] In the above embodiments, the implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented in software, it can be implemented, in whole or in part, in the form of a computer program product.

[0170] The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions may be transmitted from one website, computer, training device, or data center to another website, computer, training device, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that a computer can store or a data storage device such as a training device or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media (e.g., solid-state drives (SSDs)).

Claims

1. A distributed ad hoc network communication method, applied to communication nodes in a wireless ad hoc network, characterized in that, The method includes: Listen to the channel to obtain the received signal strength of broadcast signals sent by other nodes; Based on the comparison results between the received signal strength and the preset first signal quality boundary and second signal quality boundary, the target network identity of the current node is determined; wherein, the first signal quality boundary is used to define the coverage area of ​​resolvable communication, the second signal quality boundary is used to define the scope of identity competition, and the signal strength threshold of the second signal quality boundary is higher than the signal strength threshold of the first signal quality boundary. Within the superframe period, communication interaction is performed in the corresponding functional time slot cluster based on the target network identity; the superframe period includes a broadcast time slot cluster, a time synchronization time slot cluster, and a data interaction composite time slot cluster, and the data interaction composite time slot cluster includes at least one of a data transmission time slot cluster, a command transmission time slot cluster, and a reply confirmation time slot cluster. Within the data interaction composite time slot cluster, channel contention is performed based on the physical layer frame structure. The physical layer frame structure includes a unified preamble and a frame start code used to distinguish service priorities. After detecting the unified preamble, the frame start code is decoded by hardware to obtain the service priority, and channel avoidance or preemption is performed based on the service priority.

2. The method according to claim 1, characterized in that, The determination of the target network identity of the current node based on the comparison result between the received signal strength and the preset first signal quality boundary and second signal quality boundary includes: If the received signal strength is less than or equal to the signal strength threshold corresponding to the first signal quality boundary, then it is determined that the other nodes are not within the coverage of the current node's resolvable communication, and the target network identity of the current node is determined to be the main gateway. If the received signal strength is greater than the signal strength threshold corresponding to the first signal quality boundary and less than or equal to the signal strength threshold corresponding to the second signal quality boundary, then it is determined that the current node and the other nodes are in an independent network state, and the target network identity of the current node is determined to be the main gateway. If the received signal strength is greater than the signal strength threshold corresponding to the second signal quality boundary, it is determined that the current node is in an identity competition state with the other nodes, and the target network identity of the current node is determined based on the unique node identifiers of the current node and the other nodes.

3. The method according to claim 2, characterized in that, The method further includes: When the current node does not receive the broadcast signal from the higher-level main gateway, it searches for the broadcast signal of the higher-level main gateway level by level. If the broadcast signal of the higher-level master gateway is found and a corresponding reply confirmation message is received, then based on the received signal strength and the signal quality boundary corresponding to the higher-level master gateway, the target network identity of the current node is determined to be the next-level master gateway or slave gateway at the level where the higher-level master gateway is located. If the current node does not receive the broadcast signal or the reply confirmation message from any level of main gateway within the preset scanning period, the target network identity of the current node is determined to be a disconnected terminal.

4. The method according to claim 3, characterized in that, If the target network identity of the current node is determined to be a disconnected terminal, the method further includes: The off-chain terminal is controlled to broadcast service data within the data interaction composite time slot cluster; If the disconnected terminal receives a reply confirmation message from any level of master gateway after sending the service data, it updates the target network identity of the current node to the corresponding level of slave gateway or master gateway based on the level of the reply confirmation message, so as to reconnect to the wireless ad hoc network.

5. The method according to claim 1, characterized in that, The process of performing channel avoidance or preemption based on the service priority includes: When preparing to send a data frame within the data interaction composite time slot cluster, the physical layer signal of the current channel is monitored; If the unified preamble sent by other nodes is detected, the start-of-frame code sent by the other nodes is decoded to obtain the service priority of the other nodes; If the service priority of the other node is higher than the service priority of the data frame, then control the current node to stop sending and perform silent avoidance; If the service priority of the other nodes is equal to the service priority of the data frame, then channel contention is performed based on the received signal strength of the current node and the other nodes; If the service priority of the other nodes is lower than the service priority of the data frame, then the current node is controlled to continue sending the data frame to preempt the channel.

6. The method according to claim 1, characterized in that, The method also includes a channel assessment and adaptive handover mechanism: During the superframe period, the current working frequency band is silently monitored, and the channel busyness within the current working frequency band is statistically analyzed. If the channel busyness exceeds a preset resource exhaustion threshold, or if the current level master gateway fails, a frequency hopping operation is triggered. Based on a pre-defined list of working frequency bands, the channel idle status and existing network load of each candidate frequency band are evaluated, the optimal candidate frequency band is selected as the new working frequency band, and the determination of the target network identity is re-executed on the new working frequency band.

7. The method according to claim 1, characterized in that, The communication interaction within the corresponding functional time slot cluster based on the target network identity during the superframe period includes performing hierarchical time synchronization within the time synchronization time slot cluster: Obtain the business type requirements of the current node; If the required service type is high-precision positioning, then nanosecond or submicrosecond time synchronization is performed based on the hardware timestamp mechanism. If the service type requirement is a highly dynamic networking or data interaction service, then microsecond-level or millisecond-level time synchronization is performed based on the local clock and broadcast time slot cluster alignment mechanism. If the service type requirement is a low-power sensing service, then second-level or sub-second-level time synchronization is performed based on a software timing protocol.

8. A computer program product, characterized in that, It includes computer-readable instructions that, when executed on an electronic device, cause the electronic device to implement the distributed ad hoc network communication method as described in any one of claims 1 to 7.

9. An electronic device, characterized in that, It includes at least one processor and a memory connected to the processor, wherein: The memory is used to store computer programs; The processor is used to execute the computer program to enable the electronic device to implement the distributed self-organizing network communication method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The storage medium carries one or more computer programs, which, when executed by an electronic device, enable the electronic device to implement the distributed self-organizing network communication method as described in any one of claims 1 to 7.

Images