Multi-domain agile communication method and device, electronic equipment and storage medium

Abstract

The application relates to the technical field of communication, and discloses a multi-domain agile communication method and device, electronic equipment and a storage medium. In the application, a first neighbor beacon is periodically sent to each neighbor node, and a second neighbor beacon sent by the neighbor node is periodically received; the first neighbor beacon contains node information of each first node, and the first node at least contains the neighbor node; the second neighbor beacon contains node information of each second node; a neighbor table stored in the self is updated according to the second neighbor beacon; and network routing is established with each third node in turn by using the neighbor node. Therefore, the medium-independent network networking and path addressing functions under the condition of no center are realized. The communication efficiency reduction problem caused by the IP layer routing process is avoided. The service compatibility is good, a larger networking scale is supported, and a lower network overhead is maintained.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a multi-domain agile communication method, apparatus, electronic device, and storage medium. Background Technology

[0002] At disaster sites, rescue workers need communication methods to understand the situation and carry out rescue operations. A rapid-response and efficient emergency communication system is crucial for minimizing disaster losses.

[0003] The overall design concept of the multi-domain communication network system is to rapidly deploy a self-organizing network composed of multi-domain agile communication equipment connected by relay links such as terrestrial microwave, satellite and drones after a disaster to meet the communication and command needs of rescue teams and the region, and to provide intelligent communication link selection and combination to adapt to complex terrain, harsh environment and different communication distance requirements.

[0004] A multi-domain agile communication network system consists of one or more regional communication systems and inter-network relay links. Each regional communication system comprises multiple multi-domain agile communication devices and links between them. These devices function as both terminals and relays. Regional communication links primarily utilize terrestrial microwave transmission links, supplemented by fiber optic / satellite / UAV links when necessary. Inter-regional links primarily use satellite / UAV links, with terrestrial microwave links used for short-range situations. Furthermore, the regional mobile transmission network at the disaster site can communicate with the rear command center via satellite / UAV / fiber optics. The terrestrial multi-domain agile communication network has a flexible topology, capable of forming both grid and chain-like networks, extending a certain distance through canyons, tunnels, and underground passages. This serves as the nerve endings of the emergency communication system, irreplaceable by satellite or UAV networks. To enhance accessibility and resilience, multiple UAVs can be used to construct an aerial wireless transmission network. The UAV transmission network acts as an inter-regional communication relay and also serves as a high-elevation-angle link between nodes within the terrestrial microwave transmission network, thus helping to resolve link disruptions caused by obstructions. Compared to terrestrial networks, drones can reach disaster sites much faster, serving not only as communication relays but also enabling them to use onboard reconnaissance equipment to perceive various conditions at the scene and transmit data back to the ground in a timely manner. In cases where fixed communication infrastructure is partially damaged, multi-domain agile transmission networks can be used to provide connectivity between cellular base stations (or mobile base stations) and mobile switching centers, as well as between base stations themselves.

[0005] Traditional network architectures typically rely on specific communication media (such as cellular networks and satellite communications) and fixed network topologies (such as centralized base stations or pre-defined routes). Typical networking methods depend on routing protocols at the Internet Protocol (IP) layer for data forwarding, while the Media Access Control (MAC) layer is usually only responsible for link management of a single medium and cannot dynamically adapt to multi-media environments. While ad hoc networking technologies support decentralized networking, their convergence speed is slow when network topology changes. Due to reliance on IP layer routing, packet forwarding latency increases, especially in multi-hop networks where the overhead of routing calculations and packet encapsulation significantly impacts real-time performance. Furthermore, pre-configuration of network parameters (such as IP address allocation and routing table settings) is required, resulting in low deployment efficiency. When specific frequency bands or media are interfered with, the lack of automatic switching to backup links increases the risk of communication interruptions, making it difficult to efficiently cope with highly dynamic environments (such as battlefields and emergency disaster relief scenarios). Summary of the Invention

[0006] The purpose of this application is to provide a multi-domain agile communication method, apparatus, electronic device, and storage medium, which realizes media-independent network networking and path addressing functions, and efficiently adapts to different physical media. It avoids the communication efficiency reduction problem caused by IP layer routing. It has good service compatibility, enables rapid networking under decentralized conditions, supports large-scale networking, and maintains low network overhead.

[0007] To address the aforementioned technical problems, embodiments of this application provide a multi-domain agile communication method, comprising: periodically sending a first neighbor beacon to each neighbor node, and periodically receiving a second neighbor beacon sent by the neighbor nodes; wherein the first neighbor beacon contains node information of each first node, the first node being a beacon node in its internally stored neighbor table, and the first node at least includes the neighbor nodes; wherein the second neighbor beacon contains node information of each second node, the second node being a beacon node in the neighbor table stored internally by the neighbor node; updating the internally stored neighbor table according to the second neighbor beacon, wherein beacon nodes in the updated internally stored neighbor table that have not established network routes are third nodes; and using the neighbor nodes, sequentially establishing network routes with each of the third nodes.

[0008] Embodiments of this application also provide a multi-domain agile communication device, comprising: a beacon sending module for periodically sending first neighbor beacons to each neighbor node; a beacon receiving module for periodically receiving second neighbor beacons sent by the neighbor nodes; wherein the first neighbor beacons contain node information of each first node, the first node being a beacon node in its internally stored neighbor table, and the first node at least includes the neighbor nodes; wherein the second neighbor beacons contain node information of each second node, the second node being a beacon node in the neighbor table stored internally by the neighbor node; a table updating module for updating its internally stored neighbor table according to the second neighbor beacons, wherein beacon nodes in the updated internally stored neighbor table that have not established network routes are third nodes; and a route establishment module for establishing network routes with each of the third nodes sequentially using the neighbor nodes.

[0009] Embodiments of this application also provide an electronic device, including: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the multi-domain agile communication method described above.

[0010] Embodiments of this application also provide a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described multi-domain agile communication method.

[0011] In this embodiment, a first neighbor beacon is periodically sent to each neighbor node, and a second neighbor beacon sent by the neighbor nodes is periodically received. The first neighbor beacon contains node information for each first node, which is a beacon node in its internally stored neighbor table and contains at least one neighbor node. The second neighbor beacon contains node information for each second node, which is a beacon node in its internally stored neighbor table. The neighbor table is updated based on the second neighbor beacon, and beacon nodes in the updated table that have not yet established network routes are designated as third nodes. Network routes are then established sequentially with each of the third nodes using the neighbor nodes. This achieves media-independent network topology and path addressing under decentralized conditions. It avoids the communication efficiency reduction problem caused by IP layer routing. It offers good service compatibility, supports large network scales, and maintains low network overhead. Attached Figure Description

[0012] One or more embodiments are illustrated by way of example with reference numerals in the accompanying drawings. These illustrations do not constitute a limitation on the embodiments. Elements with the same reference numerals in the drawings are denoted as similar elements. Unless otherwise stated, the figures in the drawings are not to be limited by scale.

[0013] Figure 1 This is a schematic diagram of a modular architecture for multi-domain agile communication according to an embodiment of this application;

[0014] Figure 2 This is a schematic diagram of a multi-domain agile communication Layer 2 networking technology according to an embodiment of this application;

[0015] Figure 3 This is a flowchart of a multi-domain agile communication method according to an embodiment of this application;

[0016] Figure 4 This is a schematic diagram of node communication interaction during network establishment according to an embodiment of this application;

[0017] Figure 5 This is a schematic diagram of node communication interaction after network establishment according to an embodiment of this application;

[0018] Figure 6 This is a schematic diagram of node communication interaction when adding a new node according to an embodiment of this application;

[0019] Figure 7 This is a schematic diagram of node communication interaction during node deletion according to an embodiment of this application;

[0020] Figure 8 This is a schematic diagram of the communication interaction between chain-like nodes according to an embodiment of this application;

[0021] Figure 9 This is a flowchart of a mesh routing communication method according to an embodiment of this application;

[0022] Figure 10 This is a schematic diagram of a mesh structure node wireless connection according to an embodiment of this application;

[0023] Figure 11 This is a flowchart of a mesh routing method according to an embodiment of this application;

[0024] Figure 12 This is a schematic diagram of the structure of a multi-domain agile communication device according to another embodiment of this application;

[0025] Figure 13 This is a schematic diagram of the structure of an electronic device according to another embodiment of this application. Detailed Implementation

[0026] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the various embodiments of this application will be described in detail below with reference to the accompanying drawings. However, those skilled in the art will understand that many technical details have been presented in the various embodiments of this application to enable readers to better understand this application. However, even without these technical details and various changes and modifications based on the following embodiments, the technical solutions claimed in this application can be implemented. The division of the various embodiments below is for the convenience of description and should not constitute any limitation on the specific implementation of this application. The various embodiments can be combined with and referenced by each other without contradiction.

[0027] One embodiment of this application relates to a multi-domain agile communication method, which can be applied to beacon nodes. Beacon nodes can be computer devices such as mobile phones and computers, or electronic devices composed of electronic components such as chips. In this embodiment, a first neighbor beacon is periodically sent to each neighbor node, and a second neighbor beacon sent by the neighbor nodes is periodically received. The first neighbor beacon contains node information of each first node, and each first node is a beacon node in its internally stored neighbor table, containing at least one neighbor node. The second neighbor beacon contains node information of each second node, and each second node is a beacon node in its internally stored neighbor table. The neighbor table is updated according to the second neighbor beacon, and beacon nodes in the updated internally stored neighbor table that have not yet established network routes are designated as third nodes. Network routes are then established sequentially with each third node using the neighbor nodes. This achieves media-independent network topology and path addressing under decentralized conditions. It avoids the communication efficiency reduction problem caused by IP layer routing. It has good service compatibility, supports large network scales, and maintains low network overhead. The following is a detailed description of the implementation details of the multi-domain agile communication method in this embodiment. The following content is only for the convenience of understanding and is not necessary for implementing this solution.

[0028] The multi-domain agile communication method adopts a modular architecture, corresponding to different layers of the network model, such as... Figure 1As shown. To ensure timely processing and response, the wireless device driver, MAC layer driver (CSMA / CA protocol), and communication protocol driver are implemented in driver form and operate in the system kernel. The communication protocol driver module provides a standard Ethernet transmission interface to the system, enabling transparent transport of the Transmission Control Protocol (TCP) or IP protocol stack. System management can achieve flexible IP layer address and routing planning through standard IP layer management tools. The application layer accesses network transmission services (network management) through the standard Socket interface and can reuse the system's existing complete TCP / IP protocol stack transmission services (business applications), facilitating the portability and development of various applications. This architecture improves both the response speed of the networking protocol and the overall portability and scalability of the system.

[0029] The most significant characteristic of multi-domain agile communication in applications is that network topology and link quality are constantly changing rapidly. The overall design philosophy of fast and efficient networking and routing protocols is to maintain the lowest protocol overhead while keeping the network topology in a state of rapid change.

[0030] Multi-domain agile networking core technology is based on Layer 2 networking technology, such as... Figure 2 As shown, the result is achieved through the coordinated work of a series of technical mechanisms. Layer 1 is the physical layer, and key technologies include wireless waveform / wired transmission. Layer 1.5 is the MAC layer, and key technologies include contention-based channel access control. Layer 2 is the logical link control (LLC) layer, which includes networking and routing protocols, neighbor protocols, and perceptive link adaptation protocols. This embodiment focuses on the study of the neighbor protocol.

[0031] The Neighbor Protocol is responsible for discovering local topology and basic network information within a two-hop radius (i.e., the direct neighbors of direct neighbors). Local routes (i.e., the one-hop to the destination node) transmit information directly through links between neighbor nodes (NBRs). Neighbor node beacons are periodically broadcast (but not forwarded) within a one-hop radius. When receiving neighbor node beacons, the neighbor table information is updated. Based on changes in the neighbor table, the neighbor routing table queries the cost values ​​of each link during periodic updates to update the information in its routing table. The amount of neighbor information does not change with the overall network size but is affected by network density. Links between neighbor nodes change rapidly and are the primary control object for local paths. Therefore, the amount of neighbor information should be as small as possible, and the propagation period should be as short as possible to improve adaptability to rapid local changes. Sending information first queries the Neighbor Routing Table to directly utilize local routes for transmission. Based on the detailed information carried by neighboring node beacons, various beacons are periodically broadcast, thus periodically updating the Neighbor Table. When receiving a neighboring node beacon, the first step is to check for changes in the Neighbor Table. According to these changes, the neighbor routing table, during periodic updates, queries the cost values ​​of each link to update the information in its routing table. Based on the routing situation, it selects a routing neighbor from the neighbor table for local routing. A node needs to store two types of information: link status information from the node to neighboring nodes and routing information from the node to the destination node. The routing information from the node to the destination node is based on the link status information from the node to neighboring nodes. As the number of destination nodes increases, the amount of routing information from the node to the destination node also increases, but the amount of link status information from the node to neighboring nodes does not change significantly with the increase in the number of destination nodes. Neighboring nodes change rapidly, so the amount of information should be small, and the broadcast period should be short, while routing information, which has a large amount of information, should be broadcast less frequently. The detailed information contained in the neighbor node beacon (NBR Beacon) is dynamically adjusted in its occurrence period, thereby achieving the advantages of timely adaptation to network topology changes and reducing routing beacon overhead. The neighbor protocol periodically propagates neighbor beacons to achieve self-claim of node information, handshake of neighbor communication links, and aggregation of basic network information. Neighbor beacons are transmitted only within a single hop (referring to the current node's direct neighbors), without hop-by-hop forwarding, limiting the impact of neighbor protocol overhead on the overall network protocol overhead.

[0032] The neighbor node protocol frame contains information such as the transmission channel ID, transmission power, interval, node type, neighbor node number, and neighbor node triples. Link relationships and neighbor node relationships can be established through received neighbor node protocol frames. Sending a neighbor node protocol frame can include information about special neighbor nodes (Special NBRs) and all neighbors except for those special neighbor nodes. The neighbor node protocol frame is required to carry transmission period and neighbor node type information. A certain number of neighbors are selected as close neighbors based on mutual visibility between the two parties. This process can be supplemented by existing close neighbor selection mechanisms. Close neighbors can also include the best neighbor pointed to by the existing gradient.

[0033] The multi-domain agile communication method flow in this embodiment is as follows: Figure 3 As shown, in step 101, the beacon node periodically sends a first neighbor beacon to each neighbor node and periodically receives a second neighbor beacon sent by the neighbor nodes; wherein, the first neighbor beacon contains node information of each first node, and the first node is a beacon node in its internally stored neighbor table, and the first node contains at least neighbor nodes; wherein, the second neighbor beacon contains node information of each second node, and the second node is a beacon node in the neighbor table stored internally by the neighbor node.

[0034] In one example, each beacon node in the internally stored neighbor table has its own corresponding timestamp; the timestamp is used to record the time or number of periods when the node information of each beacon node in the internally stored neighbor table is updated to the internally stored neighbor table.

[0035] In one example, such as Figure 4 As shown, node A's neighbor is node B, node B's neighbors are nodes A and C, and node C's neighbor is node B. When the network is established, each beacon node powers on simultaneously or sequentially, and each node sends neighbor beacons to its neighbors. Each node stores the received neighbor beacon information in its internal neighbor table (also known as the nbr table), for example... Figure 4 The tab shows that node B saves node A in its internal neighbor table during period n+1 (TIME), and saves node C in its internal neighbor table during period n+2 (TIME). Node C saves node B in its internal neighbor table during period n+1 (TIME), thus establishing the network.

[0036] In step 102, the beacon node updates its internal neighbor table based on the second neighbor beacon. The beacon nodes in the updated internal neighbor table that have not established a network route are the third nodes.

[0037] In one example, updating the internally stored neighbor table based on the second neighbor beacon can be done by taking the union of the node information of the second node contained in the second neighbor beacon and the node information of the first node, resulting in the updated internally stored neighbor table. In other words, nodes that are not stored in the internally stored neighbor table but are stored in the neighbor nodes are added to the internally stored neighbor table. This allows the neighbor nodes to act as a bridge to connect with the third node.

[0038] In one example, such as Figure 5 As shown, after the network is established, when each node is running normally, a certain time interval is set as the network maintenance heartbeat. Each node sends neighbor beacons to neighboring nodes according to the heartbeat time. Each node stores the information of the received neighbor beacons in its own neighbor table. Node A, node B and node C establish network routes in n+X periods. Each node's internal neighbor table stores the node information of all beacon nodes except itself.

[0039] In one example, as a beacon receiver, when it receives a second neighbor beacon sent by a neighbor node not recorded in its internally stored neighbor table, it adds the neighbor node's node information to its own internally stored neighbor table. For example... Figure 6 As shown, after the network is established, new nodes (such as...) are added. Figure 6 Node D in the process starts up and sends a neighbor beacon to its nearest neighbor node. The neighbor node stores the received neighbor beacon information in its own nbr table and simultaneously sends its own neighbor beacon to the new node, which then stores the received neighbor beacon in its own neighbor table. For example, if node D's neighbor beacon is node C, and node D attempts to join in cycle n+1... Figure 5 In the network shown, in period n+1, node D adds its node information to node C's neighbor table by sending a beacon. Node C then discovers that node D is its neighbor, so in period n+2, node C sends its node information to node D, synchronizing node C's node information to node D's neighbor table. As for nodes A and B, since they are not neighbors of node D, they will establish network routes with node D in subsequent periods, using node C as a bridge.

[0040] In one example, as a beacon receiver, if it fails to receive a second neighbor beacon sent by a neighbor node within a preset time interval, it deletes the neighbor node's node information from its internally stored neighbor table. For example... Figure 7As shown, after the network is established, some nodes stop running (e.g. Figure 7 In the network, node D is a node that periodically sends neighbor beacons to its nearest neighbor. If a node does not receive a neighbor beacon within a specified time, it deletes the information of the node that did not receive the beacon from its own NBR table. Since a network route (chain structure) has been established between nodes A, B, and C, node D's information can be directly deleted from its internal neighbor table based on information synchronization.

[0041] In step 103, the beacon node uses its neighboring nodes to establish network routes with each third node in turn. That is, it establishes network routes between itself and the third nodes by using neighboring nodes as bridges. In one example, step 103 could be: initiating route establishment requests to establish network routes with each third node in turn; based on the responses received from neighboring nodes to the route establishment requests, forwarding the route establishment requests directly or indirectly to the corresponding third node using the neighboring nodes; and establishing network routes with the third nodes based on the responses forwarded by the neighboring nodes from the third nodes.

[0042] In one example, the network route establishment process is as follows: Figure 8 As shown, Figure 8 An attempt is made to establish a route from node A to node C using node B as a bridge. Node A (in period n+1) initiates a route request to node C, and node B (in period n+1) responds to node A. Node C is a neighbor of node B. Node B (in period n+2) forwards the route request from node A to node C. Node C receives the route request forwarded by node B and responds to node A through node B. Thus, the route from node A to node C is established.

[0043] Step 103, which involves forwarding the route establishment request directly or indirectly to the corresponding third node based on the received response from the neighbor node, can also be: (e.g.) Figure 9 As shown, for any routing request, if multiple responses to the routing establishment request are received from neighboring nodes within a preset time, the path establishment loss for each neighboring node is calculated sequentially. The neighboring node with the lowest path establishment loss is selected to forward the routing establishment request directly or indirectly to the corresponding third node. The path establishment loss is the loss incurred when the source node and the third node generate a routing path through neighboring nodes. The source node first needs to initiate a routing request, then send routing beacons to neighboring nodes. If multiple neighboring nodes respond, indicating that multiple path schemes from the source node to the target node have been found, the source node sequentially compares the path link loss of each path (path A, path B, ..., path N) and selects the path with the lowest loss to establish.

[0044] In one example, suppose a node can be established by multiple paths, such as Figure 10 As shown, nodes A, B, and C have already established a routing network via routing beacons. Node D is a neighbor of both node B and node C. When node D attempts to establish a route with node A, there are two paths: DBA and DCA. It is then necessary to compare the path establishment costs of these two paths and select the one with the lowest cost. The specific establishment process is as follows: Figure 11 As shown, in a mesh network structure, the route establishment process from node D to node A is as follows: node D initiates a route request to node A, and nodes B and C respond to node D. Node A is their neighbor. Node D compares the losses of the two routes DBA and DCA. If the loss of DCA is less than the loss of DBA, then the DCA route is established; if the loss of DCA is greater than the loss of DBA, then the DBA route is established.

[0045] In this embodiment, the following technical effects are achieved:

[0046] It enables media-independent network topology and path addressing. It solves converged communication under various transmission media. Networking devices equipped with multi-domain agile networking technology can achieve dynamic and efficient adaptation to different communication media through MAC layer intelligent networking technology. It provides a unified standard interface for business units, enabling transparent, decentralized, self-organizing network data communication services.

[0047] It achieves MAC layer self-organization, enabling efficient adaptation to different physical media. The tight integration of the MAC and physical layers allows for timely assessment of channel quality and accurate selection of relay paths and transmission rates. Furthermore, the MAC layer self-organization technology imposes no restrictions on network IP layer planning and avoids the communication efficiency reduction issues caused by IP layer routing. It offers good service compatibility, transparently carrying various IP services. The process of new service units joining the network or connecting to new communication media is simple and rapid, fully meeting the needs of battlefield command and emergency response.

[0048] Enables rapid network deployment in a decentralized environment, supports large-scale networks while maintaining low network overhead. It possesses the capabilities of automatic organization, automatic healing, automatic transmission path selection, and automatic selection of transmission links for different media and frequency bands.

[0049] It has the ability to adapt to network topology changes at the millisecond level, and can meet the networking requirements of all nodes in the network under highly dynamic conditions, while maintaining low transmission latency.

[0050] No complex network topology planning or configuration is required beforehand, nor is cumbersome infrastructure support necessary. The network automatically forms upon power-on, and the devices provide intuitive link status indicators, making them simple and easy to use. The entire network can be assembled within minutes, demonstrating excellent rapid deployment capabilities.

[0051] It has the ability to adaptively select multiple media, multiple bands and multiple links. When one medium band link is interfered with, it can automatically select another medium band link to send and receive data. Even if all links are interfered with, network connectivity can still be guaranteed through automatic relay transmission between multiple devices. When some devices malfunction, are damaged or interfered with, it can quickly and automatically select other nodes for communication.

[0052] It features open, universal interfaces, supporting various standard service terminal interfaces and providing interfaces for various communication link devices. It can connect to service terminal devices such as personal computers (PCs), network cameras, smartphones, and tablets, and can also easily interconnect with network communication equipment such as satellite, microwave, fiber optic, VHF radio, and Long Term Evolution (LTE) base stations.

[0053] The steps described above are for clarity only. In practice, they can be combined into one step or some steps can be split into multiple steps. As long as they include the same logical relationship, they are all within the scope of protection of this application. Adding insignificant modifications or introducing insignificant designs to the algorithm or process, but without changing the core design of the algorithm and process, are also within the scope of protection of this application.

[0054] Another embodiment of this application relates to a multi-domain agile communication device, such as Figure 12 As shown, it includes: a beacon sending module 401, used to periodically send first neighbor beacons to each neighbor node; a beacon receiving module 402, used to periodically receive second neighbor beacons sent by neighbor nodes; wherein, the first neighbor beacons contain node information of each first node, and the first node is a beacon node in its internally stored neighbor table, and the first node contains at least neighbor nodes; wherein, the second neighbor beacons contain node information of each second node, and the second node is a beacon node in the neighbor table stored internally by the neighbor node; a table updating module 403, used to update its internally stored neighbor table according to the second neighbor beacons, and the beacon nodes in the updated internally stored neighbor table that have not established network routes are third nodes; and a route establishment module 404, used to establish network routes with each third node sequentially using the neighbor nodes.

[0055] In one example, updating the internally stored neighbor table based on the second neighbor beacon can be achieved by taking the union of the node information of the second node contained in the second neighbor beacon with the node information of the first node to obtain the updated internally stored neighbor table.

[0056] In one example, using neighboring nodes to establish network routes with each third node in sequence can be done by: initiating route establishment requests to each third node in sequence; based on the responses received from neighboring nodes to the route establishment requests, forwarding the route establishment requests directly or indirectly to the corresponding third node using the neighboring nodes; and establishing network routes with the third nodes based on the responses forwarded by the neighboring nodes from the third nodes.

[0057] In one example, based on the received responses from neighboring nodes to the route establishment request, the route establishment request can be forwarded directly or indirectly to the corresponding third node using the neighboring nodes. This can be achieved by: for any route request, if multiple responses from neighboring nodes are received within a preset time, calculating the path establishment loss for each neighboring node in turn, and selecting the neighboring node with the lowest path establishment loss to forward the route establishment request directly or indirectly to the corresponding third node; where the path establishment loss is the loss incurred when the third node and the request are generated through neighboring nodes.

[0058] In one example, each beacon node in the internally stored neighbor table has its own corresponding timestamp; the timestamp is used to record the time or number of periods when the node information of each beacon node in the internally stored neighbor table is updated to the internally stored neighbor table.

[0059] In one example, the table update module 403 is also used to delete the neighbor node's node information from its internally stored neighbor table when it fails to receive a second neighbor beacon sent by a neighbor node within a preset time interval.

[0060] In one example, the table update module 403 is also used as a beacon receiver, when it receives a second neighbor beacon sent by a neighbor node that is not recorded in its own internally stored neighbor table, it adds the node information of the neighbor node to its own internally stored neighbor table.

[0061] In this embodiment, a first neighbor beacon is periodically sent to each neighbor node, and a second neighbor beacon sent by the neighbor nodes is periodically received. The first neighbor beacon contains node information for each first node, which is a beacon node in its internally stored neighbor table and contains at least one neighbor node. The second neighbor beacon contains node information for each second node, which is a beacon node in its internally stored neighbor table. The neighbor table is updated based on the second neighbor beacon; beacon nodes in the updated table that have not yet established network routes are designated as third nodes. Network routes are then established sequentially with each of the third nodes using the neighbor nodes. This achieves media-independent network topology and path addressing under decentralized conditions. It avoids the communication efficiency reduction issues caused by IP layer routing. It offers good service compatibility, supports large network scales, and maintains low network overhead.

[0062] It is not difficult to see that this embodiment is a device embodiment corresponding to the above method embodiments, and this embodiment can be implemented in conjunction with the above method embodiments. The relevant technical details mentioned in the above method embodiments are still valid in this embodiment, and will not be repeated here to reduce repetition. Accordingly, the relevant technical details mentioned in this embodiment can also be applied to the above method embodiments.

[0063] It is worth mentioning that all modules involved in this embodiment are logical modules. In practical applications, a logical unit can be a physical unit, a part of a physical unit, or a combination of multiple physical units. Furthermore, to highlight the innovative aspects of this application, this embodiment does not introduce units that are not closely related to solving the technical problems proposed in this application; however, this does not mean that other units are absent in this embodiment.

[0064] Another embodiment of this application relates to an electronic device, such as... Figure 13 As shown, it includes at least one processor 501; and a memory 502 communicatively connected to the at least one processor; wherein the memory 502 stores instructions executable by the at least one processor 501, the instructions being executed by the at least one processor 501 to enable the at least one processor 501 to perform the multi-domain agile communication method as described above.

[0065] The memory 502 and processor 501 are connected via a bus, which can include any number of interconnecting buses and bridges. The bus connects various circuits of one or more processors 501 and memory 502 together. The bus can also connect various other circuits, such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver can be a single element or multiple elements, such as multiple receivers and transmitters, providing a unit for communicating with various other devices over a transmission medium. Data processed by processor 501 is transmitted over a wireless medium via an antenna, which further receives data and transmits it to processor 501.

[0066] Processor 501 is responsible for managing the bus and general processing, and can also provide various functions, including timing, peripheral interfaces, voltage regulation, power management, and other control functions. Memory 502 can be used to store data used by processor 501 during operation.

[0067] Another embodiment of this application relates to a computer-readable storage medium storing a computer program. When executed by a processor, the computer program implements the method embodiments described above.

[0068] That is, those skilled in the art will understand that all or part of the steps in the methods of the above embodiments can be implemented by a program instructing related hardware. This program is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as a USB flash drive, a portable hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0069] Those skilled in the art will understand that the above embodiments are specific implementations of this application, and in practical applications, various changes can be made in form and detail without departing from the spirit and scope of this application.

Claims

1. A multi-domain agile communication method, characterized in that, include: The system periodically sends a first neighbor beacon to each neighbor node and periodically receives a second neighbor beacon sent by the neighbor nodes. The first neighbor beacon contains node information of each first node, and the first node is a beacon node in its internally stored neighbor table. The first node contains at least the neighbor nodes. The second neighbor beacon contains node information for each second node, and the second node is a beacon node in the neighbor table stored inside the neighbor node. The neighbor table stored internally is updated according to the second neighbor beacon. In the updated neighbor table stored internally, the beacon node that has not established a network route is the third node. Using the neighbor nodes, network routes are established sequentially with each of the third nodes; The first neighbor beacon and the second neighbor beacon are transmitted only within a single hop and are not forwarded hop-by-hop. The network routing described herein is MAC layer routing and does not rely on IP layer routing protocols. The step of updating the internally stored neighbor table according to the second neighbor beacon includes: The node information of the second node contained in the second neighbor beacon is combined with the node information of the first node to obtain the updated neighbor table stored internally. The step of establishing network routes with each of the third nodes sequentially using the neighbor nodes includes: Initiate route establishment requests sequentially to establish network routes with each of the aforementioned third nodes; Based on the received response from the neighbor node to the route establishment request, the neighbor node is used to directly or indirectly forward the route establishment request to the corresponding third node; Based on the response forwarded by the neighbor node from the third node, establish a network route with the third node; The step of forwarding the route establishment request directly or indirectly to the corresponding third node using the neighbor node based on the received response from the neighbor node to the route establishment request includes: For any route establishment request, if multiple responses from the neighboring nodes are received within a preset time, the path establishment loss corresponding to each neighboring node is calculated sequentially, and the neighboring node with the lowest path establishment loss is selected to forward the route establishment request directly or indirectly to the corresponding third node. The path establishment loss is the loss incurred when the node and the third node generate a routing path through the neighboring node.

2. The multi-domain agile communication method according to claim 1, characterized in that, Each beacon node in the internally stored neighbor table has its own corresponding timestamp; the timestamp is used to record the time or number of cycles when the node information of each beacon node in the internally stored neighbor table is updated to the internally stored neighbor table.

3. The multi-domain agile communication method according to any one of claims 1 to 2, characterized in that, The method further includes: As a beacon receiver, when it receives a second neighbor beacon sent by a neighbor node that is not recorded in its own internal neighbor table, it adds the node information of the neighbor node to its own internal neighbor table.

4. The multi-domain agile communication method according to claim 3, characterized in that, The method further includes: As a beacon receiver, if it fails to receive the second neighbor beacon sent by the neighbor node within a preset time interval, it deletes the node information of the neighbor node from its internally stored neighbor table.

5. A multi-domain agile communication device, characterized in that, include: The beacon sending module is used to periodically send the first neighbor beacon to each neighbor node; A beacon receiving module is used to periodically receive second neighbor beacons sent by the neighbor nodes; The first neighbor beacon contains node information of each first node, and the first node is a beacon node in its internally stored neighbor table. The first node contains at least the neighbor nodes. The second neighbor beacon contains node information for each second node, and the second node is a beacon node in the neighbor table stored inside the neighbor node. The table update module is used to update the neighbor table stored internally according to the second neighbor beacon. The beacon nodes in the updated neighbor table stored internally that have not established network routes are the third nodes. The routing establishment module is used to establish network routes with each of the third nodes sequentially using the neighbor nodes; The first neighbor beacon and the second neighbor beacon are transmitted only within a single hop and are not forwarded hop-by-hop. The network routing described herein is MAC layer routing and does not rely on IP layer routing protocols. The step of updating the internally stored neighbor table according to the second neighbor beacon includes: The node information of the second node contained in the second neighbor beacon is combined with the node information of the first node to obtain the updated neighbor table stored internally. The step of establishing network routes with each of the third nodes sequentially using the neighbor nodes includes: Initiate route establishment requests sequentially to establish network routes with each of the aforementioned third nodes; Based on the received response from the neighbor node to the route establishment request, the neighbor node is used to directly or indirectly forward the route establishment request to the corresponding third node; Based on the response forwarded by the neighbor node from the third node, establish a network route with the third node; The step of forwarding the route establishment request directly or indirectly to the corresponding third node using the neighbor node based on the received response from the neighbor node to the route establishment request includes: For any route establishment request, if multiple responses from the neighboring nodes are received within a preset time, the path establishment loss corresponding to each neighboring node is calculated sequentially, and the neighboring node with the lowest path establishment loss is selected to forward the route establishment request directly or indirectly to the corresponding third node. The path establishment loss is the loss incurred when the node and the third node generate a routing path through the neighboring node.

6. An electronic device, characterized in that, include: At least one processor; as well as, A memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor to enable the at least one processor to perform the multi-domain agile communication method as described in any one of claims 1 to 4.

7. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it implements the multi-domain agile communication method as described in any one of claims 1 to 4.

Images