Self-organizing network communication methods, devices, systems and media

Abstract

This application discloses a self-organizing network communication method, apparatus, system, and medium. The method includes: for each node in the self-organizing network, updating the communication status with neighboring nodes; updating the optional transmission paths with other nodes in the self-organizing network based on the communication status; sending the optional transmission paths to neighboring nodes so that each node in the self-organizing network can update its own routing information; determining the data transmission mode based on the geographical location of the node; determining the optimal transmission path with the target node in the data transmission mode from the optional transmission paths; and sending the collected target data to the target node according to the optimal transmission path so that the target node can upload the target data through the external network. This method enables reliable networking in areas with poor wireless signal coverage and transmits the data collected by each monitoring device to the external network through the network, which is low-cost and easy to implement.

Description

Technical Field

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

[0002] With the gradual improvement of infrastructure and the increasing prevalence of networks, there is a need for data transmission in areas with no signal or poor signal coverage. For example, with the rapid development of ultra-high voltage (UHV) power transmission technology, UHV transmission lines are being deployed across the country. Most of these lines traverse plateaus, mountains, virgin forests, and areas with poor wireless signal coverage, posing significant challenges to daily operation and maintenance, as well as accident inspection and emergency repair. Transmission line monitoring devices are needed to monitor the transmission lines and promptly transmit relevant information back to the backend system so that faults can be detected in a timely manner.

[0003] Currently, there are two main methods for transmitting data in areas with no signal or poor signal coverage: one is for each monitoring device to directly connect to the backend system via wireless public network GPRS / 3G / 4G communication; the other is to lay optical cables and transmit data via optical fibers. In developing this application, the inventors discovered that the first method suffers from poor public network signal coverage, making it difficult to implement in the aforementioned areas and incurring significant communication costs. The second method has higher line communication costs, and laying the lines in these areas is more difficult.

[0004] It should be noted that the information disclosed in this background section is only for understanding the background technology of the present application concept, and therefore may include information that does not constitute prior art. Summary of the Invention

[0005] The first objective of this application is to propose a self-organizing network communication method that can reliably form a network in areas with poor wireless signal coverage and transmit the data collected by each monitoring device to the external network through the network, which is low-cost and easy to implement.

[0006] The second objective of this application is to provide a computer-readable storage medium.

[0007] The third objective of this application is to propose a self-organizing network communication device.

[0008] The fourth objective of this application is to propose another self-organizing network communication device.

[0009] The fifth objective of this application is to propose a self-organizing network communication system.

[0010] To achieve the above objectives, a first aspect of this application proposes a self-organizing network communication method, the method comprising: for each node in the self-organizing network, updating the communication status with neighboring nodes; updating the optional transmission paths with other nodes in the self-organizing network based on the communication status; sending the optional transmission paths to the neighboring nodes so that each node in the self-organizing network updates its own routing information, wherein the routing information includes optional transmission paths between itself and other nodes in the self-organizing network; determining a data transmission mode based on the geographical location of its own node; determining the optimal transmission path with the target node under the data transmission mode from the optional transmission paths; and sending the collected target data to the target node according to the optimal transmission path so that the target node uploads the target data via an external network.

[0011] The self-organizing network communication method proposed in this application can build a local area network in areas with no signal or poor signal coverage. Each node sends the collected data to a preset target node that can communicate with the external network, and the target node uploads the target data, enabling remote monitoring of areas with no signal or poor signal coverage. Furthermore, by updating the communication status of the nodes, the selectable transmission path between the source node and the target node can be updated, ensuring the correctness of the transmission path even when a node fails, so that the target data of each node can be successfully transmitted to the target node. In addition, it has low requirements for the topology of the self-organizing network and can be widely applied to various network topologies such as mesh, star, and hybrid. Furthermore, it can reduce networking costs and operating costs.

[0012] According to one embodiment of this application, updating the communication status with a neighboring node includes: sending a first message to the neighboring node; determining the communication status with the neighboring node based on the neighboring node's feedback on the first message, wherein the communication status includes a connectivity status and a timeout status.

[0013] According to one embodiment of this application, the first message is an inquiry message. Determining the communication status with the neighboring node based on the neighboring node's response to the first message includes: if a response message from the neighboring node to the inquiry message is received within a preset time, the communication status with the neighboring node is determined to be a connected state; if a response message from the neighboring node to the inquiry message is not received within the preset time, the communication status with the neighboring node is determined to be a timeout state.

[0014] According to one embodiment of this application, updating the optional transmission path between the self-organizing network and other nodes based on the communication status includes: determining a connected path as an optional transmission path from the initial path between the self-organizing network and other nodes based on the communication status.

[0015] According to one embodiment of this application, the method for generating the initial path includes: for each node in the ad hoc network, determining its own neighboring nodes; sending its own neighboring node list to the neighboring nodes; receiving the node connection relationship list sent by the neighboring nodes; and determining the initial path between itself and other nodes in the ad hoc network based on the neighboring node list and the node connection relationship list.

[0016] According to one embodiment of this application, the data transmission mode includes a high-speed transmission mode and a stable transmission mode.

[0017] According to one embodiment of this application, determining the optimal transmission path between the target node and the optional transmission paths under the data transmission mode includes: if the data transmission mode is a high-speed transmission mode, determining a first transmission path with the shortest path distance to the target node from the optional transmission paths, and using the first transmission path as the optimal transmission path; if the data transmission mode is a stable transmission mode, determining a second transmission path with the best communication quality to the target node from the optional transmission paths, and using the second transmission path as the optimal transmission path.

[0018] According to one embodiment of this application, the method further includes: each node in the ad hoc network sending a distance vector between nodes to its neighboring nodes so that each node can determine the path distance of the optional transmission path, wherein the distance vector represents the spatial distance of the link, and the routing information further includes the distance vector of the optional transmission path; and the path distance of the optional transmission path is the sum of the distance vectors between adjacent nodes included in the optional transmission path.

[0019] According to one embodiment of this application, the method further includes: each node in the ad hoc network sending communication parameters to its neighboring nodes so that each node determines the communication parameters of the optional transmission path, wherein the communication parameters include the node's current load rate and the channel quality between nodes, and the routing information further includes the communication parameters; and the communication quality of the optional transmission path is obtained by evaluating the communication parameters of the optional transmission path.

[0020] To achieve the above objectives, a second aspect of this application provides a computer-readable storage medium storing an ad hoc network communication program, which, when executed by a processor, implements the ad hoc network communication method as described in the above embodiments.

[0021] To achieve the above objectives, a third aspect of this application provides an ad hoc network communication device, including a memory, a processor, and an ad hoc network communication program stored in the memory and executable on the processor. When the processor executes the ad hoc network communication program, it implements the ad hoc network communication method as described in the above embodiments.

[0022] To achieve the above objectives, a fourth aspect of this application proposes another ad hoc network communication device. The device includes a main control module and an antenna. The main control module is used to update the communication status with neighboring nodes, update the optional transmission paths with other nodes in the ad hoc network based on the communication status, send the optional transmission paths to the neighboring nodes through the antenna so that each node in the ad hoc network updates its own routing information, and determine a data transmission mode based on its own geographical location. It then determines the optimal transmission path with the target node under the specified data transmission mode from the optional transmission paths and sends the collected target data to the target node according to the optimal transmission path so that the target node can upload the target data via the external network. The routing information includes the optional transmission paths between itself and other nodes in the ad hoc network.

[0023] To achieve the above objectives, a fifth aspect of this application proposes a self-organizing network communication system, the system comprising: a plurality of self-organizing network communication devices, wherein the self-organizing network communication devices are the self-organizing network communication devices described in the fourth aspect of the above-described embodiments, and the plurality of self-organizing network communication devices form a mesh network, a star network, or a mesh-star hybrid network.

[0024] Additional aspects and advantages of this application will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of this application. Attached Figure Description

[0025] Figure 1 This is a flowchart illustrating an embodiment of an ad hoc network communication method according to this application.

[0026] Figure 2 This is a schematic diagram of the topology of a self-organizing network in one embodiment of this application, showing normal communication between all nodes.

[0027] Figure 3 This is a schematic diagram of the topology of a self-organizing network in an embodiment of this application where node n3 fails.

[0028] Figure 4 This is a schematic diagram of the topology of a self-organizing network in an embodiment of this application, showing node n1 initially determining its neighboring nodes.

[0029] Figure 5 Therefore Figure 2 Based on the topological structure, a schematic diagram of a distance vector is given.

[0030] Figure 6 Therefore Figure 3 Based on the topological structure, a schematic diagram of a distance vector is given.

[0031] Figure 7 Therefore Figure 2 Based on the topology, a schematic diagram of communication parameters is given.

[0032] Figure 8 This is a structural block diagram of a self-organizing network communication device according to an embodiment of this application.

[0033] Figure 9 This is a structural block diagram of a self-organizing network communication device according to another embodiment of this application. Detailed Implementation

[0034] The embodiments of this application are described in detail below. Examples of the embodiments described below are shown in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and intended to explain this application, and should not be construed as limiting this application.

[0035] The following description, with reference to the accompanying drawings, describes a self-organizing network communication method, apparatus, system, and medium according to embodiments of this application.

[0036] Please see Figure 1 The self-organizing network communication method in this application embodiment includes the following steps 100 to 400.

[0037] S100 updates the communication status with neighboring nodes for each node in the ad hoc network.

[0038] The self-organizing network in this embodiment can be a mesh network, a star network, or a hybrid mesh-star network. This allows wireless communication nodes to be distributed in locations where monitoring is needed, and the network architecture can be flexibly changed according to the terrain of the target area to expand the monitoring range and enhance the monitoring effect when networking and communication are carried out in areas with no signal or poor public network signal coverage (hereinafter collectively referred to as the target area).

[0039] Please see Figure 2A self-organizing network consists of several wireless communication nodes (hereinafter referred to as nodes). The number of nodes in a self-organizing network is usually limited by the hardware and software of the nodes, and can be 31 or other numbers. Figure 2 The network topology shown contains six nodes, n0 to n5. Each node has a wireless communication connection with one or more other nodes in the network. All nodes that have a direct communication connection with the same node n are its neighbors or adjacent nodes. For example, the neighbors of node n1 are n0, n2, n3, and n4, and the neighbors of node n5 are n3 and n4. The adjacency relationships between nodes can be pre-configured or selected through set rules.

[0040] Each node stores its communication state with its neighbors, using this state to indicate whether communication is possible. This state is recorded in the node's routing table. For example, node n1's routing table records the communication states between n1 and n0, n2, n3, and n4. Figure 2 In this context, n1 can communicate normally with n0, n2, n3, and n4.

[0041] Each node also periodically or at set intervals determines its communication status with all neighboring nodes in order to update the communication status in the routing table. The timing of each node determining the communication status can be the same or in a preset order.

[0042] Please see Figure 3 If node n3 fails, all its neighboring nodes will detect this when determining their communication status with n3 and update their communication status to "unable to communicate." Specifically, for node n1, after confirming that its communication status with n3 has changed to "unable to communicate," node n1 will update its own routing table with this new status. After the update, the communication status between n1 and n0, n2, and n4 remains unchanged, but the communication status between n1 and n3 becomes "unable to communicate." The same logic applies to nodes n2, n4, and n5. Figure 3 The path of communication state change is shown by dotted lines. For node n0, since n3 is not a neighbor node of n0, n0 will not update its communication state.

[0043] Understandably, the way to update the communication status can be either to completely overwrite the existing communication status with the new communication status, or to compare the new communication status with the existing communication status and only update the items where the communication status has changed.

[0044] S200 updates the optional transmission path between the network and other nodes based on the communication status.

[0045] Each node's routing table records the optional transmission paths between itself and all other nodes. When transmitting data, the source node sends data based on the optional transmission paths.

[0046] When the communication status remains unchanged, each node transmits data based on existing available transmission paths. Please refer to [link / reference]. Figure 2 Taking the example of node n1 sending data to node n5, where n1 is the source node and n5 is the destination node, assume that the routing table of source node n1 records three transmission paths L11 to L13 between n1 and n5. Path L11 is {n1->n3->n5}, path L12 is {n1->n4->n5}, and path L13 is {n1->n2->n3->n5}. Figure 2 The path indicated by the dashed arrow is path L11.

[0047] After a change in communication status, this change may cause alterations to the transmission paths between some nodes and others. Please refer to [link to relevant documentation]. Figure 3 Because node n3 fails, its neighbors n1, n2, and n4 will update their transmission paths with other nodes in the ad hoc network. Continuing with the example of source node n1 sending data to destination node n5, source node n1's routing table records the three transmission paths L11 to L13 between n1 and n5. Paths L11 and L13 both contain node n3, meaning data forwarding needs to be done through node n3. Therefore, after source node n1 updates the available transmission paths with destination node n5, paths L11 and L13 will be removed from the routing table, leaving only path L12. Figure 3 The path indicated by the dashed arrow is path L12. The same applies to nodes n2 and n4.

[0048] At this point, for node n0, since the communication state between n0 and n1 has not changed, the optional transmission paths between n0 and n1 to n5 are the same before and after node n0 updates itself. However, when node n0 subsequently receives the optional transmission path sent by n1, n0 will update its own optional transmission path and at the same time learn of the n3 failure.

[0049] S300 sends optional transmission paths to neighboring nodes so that each node in the ad hoc network can update its own routing information, which includes optional transmission paths between itself and other nodes in the ad hoc network.

[0050] After updating its own routing information, each node will send the updated routing information to its neighboring nodes, which will then propagate the new alternative transmission paths resulting from the change in communication status to all nodes in the ad hoc network.

[0051] Continue reading Figure 3 Taking the communication between source node n0 and destination node n5 as an example, after node n1 updates the optional transmission paths in its own routing table, the transmission path between node n1 and node n5 includes path L12. Therefore, path L12 is sent to neighbor node n0. It can be understood that the data transmission between node n1 and source node n0 can include not only path L12, but also other information used in subsequent processes.

[0052] Before the source node n0 receives path L12, the routing table of the source node n0 contains the optional transmission paths between n0 and n1 to n5 respectively. Here, it is assumed that the transmission path between n0 and n5 includes transmission paths L01 to L03, where path L01 is {n0->n1->n3->n5}, path L02 is {n0->n1->n4->n5}, and path L03 is {n0->n1->n2->n3->n5}.

[0053] After receiving path L12, source node n0 updates its own routing information based on path L12. Since n0 and n1 are neighboring nodes, node n0 can determine its own paths with other nodes through the paths between node n1 and other nodes. Specifically, the transmission path between source node n0 and destination node n5 is a combination of the transmission paths between node n1 and node n5 and between node n0 and node n1. Therefore, the transmission path between node n0 and node n5 is updated to {n0->n1->n4->n5}, which is path L02, and paths L01 and L03 are canceled. This process continues for nodes other than source node n0 and destination node n5. Node n1 will also send the transmission paths between n1 and n2 and n4 to node n0, and node n0 will update its own transmission paths between n2 and n4 based on these transmission paths.

[0054] The S400 determines its data transmission mode based on the geographical location of its nodes.

[0055] Since the network deployment is carried out in areas with no signal or poor public network signal coverage, and the nodes communicate wirelessly with each other through antennas or other communication devices, the geographical location of the nodes will have a certain impact on the communication effect. For example, in mountainous areas, some nodes may be located on flat ground, some on hillsides, and some in depressions. Therefore, there may be significant height differences between adjacent nodes, which may affect the transmission stability of the antenna. Therefore, it is necessary to first determine whether to use high-speed transmission mode or stable transmission mode based on the geographical location of the source node. High-speed transmission mode focuses on transmission rate, such as shorter transmission time; stable transmission mode focuses on transmission stability, such as lower packet loss rate.

[0056] S500 determines the optimal transmission path between the target node and the data transmission path in the data transmission mode from the available transmission paths.

[0057] Please see Figure 2 Taking the sending of target data from source node n1 to target node n5 as an example, in Figure 2 In the topology shown, all nodes are functioning correctly. The routing table of source node n1 records the following optional transmission paths to target node n5: path L11{n1->n3->n5}, path L12{n1->n4->n5}, path L13{n1->n2->n3->n5}, and path L14{n1->n4->n3->n5}.

[0058] After determining the data transmission mode, the optimal transmission path is selected from the available transmission paths between the source and destination nodes based on the data transmission mode. At this time, the available transmission paths include L11 to L14. The optimal path is selected from L11 to L14. Assuming the data transmission mode is high-speed transmission mode, L11 can be selected; assuming the data transmission mode is stable transmission mode, L12 can be selected.

[0059] The S600 sends the collected target data to the target node according to the optimal transmission path, so that the target node can upload the target data through the external network.

[0060] The target node is a node in the ad hoc network connected to the external network. Since this embodiment is implemented in areas with no signal or poor signal, an internal local area network (LAN) is formed among the nodes through the ad hoc network. However, the ad hoc network needs to include one or more nodes capable of interacting with the external network. The nodes in the ad hoc network will perform corresponding data collection, such as monitoring power transmission lines, and transmit the collected data to the external network through the target node, and then upload it to the backend system, realizing remote monitoring of areas with no signal or poor signal. Because the optional transmission paths between the source node and the target node are recorded in the routing table, the data to be sent is transmitted according to the optional transmission paths in the routing table. The backend system can be an information platform for system software deployed remotely via a server.

[0061] It should be noted that the target node refers to the node in the ad hoc network that is connected to the external network, while the destination node refers to the end node in a transmission path. Furthermore, the period at which the source node sends target data to the target node, the period at which the node updates its communication status, and the period at which it sends transmission paths to neighboring nodes can be the same or all different.

[0062] Please see Figure 2 ,exist Figure 2 In the self-organizing network shown, N1 represents the external network. Only node n5 in the self-organizing network can directly interact with the external network N1. Therefore, n5 is the node responsible for communicating with the external network in the self-organizing network. Nodes n0 to n4 all need to send their collected target data to the target node n5.

[0063] Please see Figure 3 For source node n1, after n1 updates its own routing information, the transmission path for sending data to n5 in the routing table only includes path L12. Therefore, when data needs to be sent out, the target data is sent to the target node n5 according to path L12. For source node n0, after n0 updates its own routing information (later than the time when n1 updates its own routing information), the transmission path for sending data to n5 in the routing table only includes path L02. Therefore, when data needs to be sent out, the target data is sent to the target node n5 according to path L02.

[0064] The self-organizing network communication method proposed in this application can build a local area network in areas with no signal or poor signal coverage. Each node sends the collected data to a preset target node that can communicate with the external network, and the target node uploads the target data, enabling remote monitoring of areas with no signal or poor signal coverage. Furthermore, by updating the communication status of the nodes, the selectable transmission path between the source node and the target node can be updated, ensuring the correctness of the transmission path even when a node fails, so that the target data of each node can be successfully transmitted to the target node. In addition, it has low requirements for the topology of the self-organizing network and can be widely applied to various network topologies such as mesh, star, and hybrid. Furthermore, it can reduce networking costs and operating costs.

[0065] In some embodiments, the method of updating the communication status with neighboring nodes in step 100 may specifically include steps 110 and 120.

[0066] S110, send the first message to the neighboring node.

[0067] S120, determine the communication status with neighboring nodes based on the feedback from neighboring nodes to the first message.

[0068] Please see Figure 2 Taking node n1 as an example, node n1 sends a first message to its neighbors n0, n2, n3, and n4 respectively. If nodes n0, n2, n3, and n4 receive the first message from n1, they will respond to n1. Node n1 determines the communication status with nodes n0, n2, n3, and n4 based on the responses from these nodes. The communication status includes connectivity and timeout. Connectivity indicates that communication between node n1 and its neighbors is normal, while timeout indicates that communication between node n1 and its neighbors is not possible. Thus, the communication status characterizes whether the communication path between adjacent nodes is a valid path. After determining the communication status with its neighbors, node n1 updates its own routing table.

[0069] As one possible implementation, the first message in step 110 is a query message, and the method for determining the communication status with neighboring nodes in step 120 can be as follows: if a response message from a neighboring node to the query message is received within a preset time, the communication status with the neighboring node is determined to be a connected state; if no response message from a neighboring node to the query message is received within a preset time, the communication status with the neighboring node is determined to be a timeout state.

[0070] Continuing with node n1 as an example, node n1 sends query messages to its neighbors n0, n2, n3, and n4. If it receives a response message from a neighbor within a preset time, it is determined that node n1 and the neighbor that sent the response message are in a connected state. If it does not receive a response message from a neighbor within the preset time, for example, if the neighbor does not send a response message at all, or if it receives a response message after the preset time has elapsed, it is determined that node n1 and the neighbor that sent the response message are in a timeout state. The preset time can be a period of time calculated from when node n1 sends the query message.

[0071] By querying neighboring nodes and judging their responses, it is possible to determine in a timely manner whether neighboring nodes can forward messages. This allows for immediate adjustment of the transmission path when a neighboring node fails, thus preventing data transmission failure.

[0072] In some embodiments, the method of updating the optional transmission path with other nodes in the ad hoc network in step 200 may specifically include step 210.

[0073] S210, based on the communication status, determines a connected path from the initial path between the network and other nodes in the ad hoc network as an optional transmission path.

[0074] Please see Figure 2 Taking node n1 as an example, the routing table of n1 can record the following initial paths: {n1->n0}; {n1->n2}, {n1->n3->n2}; {n1->n3}, {n1->n2->n3}, {n1->n4->n3}; {n1->n4}, {n1->n3->n4}; {n1->n3->n5}, {n1->n4->n5}, {n1->n2->n3->n5}. These initial paths can be pre-configured in the routing table or determined through communication and interaction between nodes.

[0075] Before node n1 updates its communication state, all the initial paths mentioned above are in a path state, and therefore all are connected paths, which can all be used as optional transmission paths for n1 to communicate with other nodes. After node n1 updates its communication state, if the communication state between node n1 and its neighboring nodes is the same as before the update, the number and composition of optional transmission paths recorded in n1's routing table remain unchanged; if the communication state between node n1 and its neighboring nodes changes, such as... Figure 3 As shown, {n1->n3} in the above initial path is considered a broken path. Therefore, the initial paths with n3 as the intermediate node or the destination node are all considered broken paths. The connected path determined by node n1 is the other path in the initial path except for the broken path, thus obtaining a new optional transmission path.

[0076] As one possible implementation, generating the initial path may include steps 11 to 14.

[0077] S11, for each node in the ad hoc network, determine its own neighbor nodes.

[0078] During the network setup phase, each node is unaware of its neighbors or their numbers. Therefore, nodes determine which nodes are within their signal coverage area by broadcasting query messages. Please refer to [link / reference]. Figure 4 Taking node n1 as an example, n1 broadcasts a query message to the outside world and receives response messages from nodes n0, n2, n3, and n4. Therefore, n1 determines its neighboring nodes to include nodes n0, n2, n3, and n4. Other nodes are too far away from n1 to receive the message broadcast by n1 and therefore cannot respond.

[0079] S12, send its own node connection list to neighboring nodes.

[0080] The node connection list is a list containing the path relationships between nodes. Since this is the initial transmission to neighboring nodes, the list only includes links between nodes. For example, node n1's node connection list at this point includes the link relationships between n1 and nodes n0, n2, n3, and n4. Node n1 sends this list to nodes n0, n2, n3, and n4 respectively to inform its neighboring nodes of its node connection relationships.

[0081] S13, Receive the list of node connection relationships sent by the neighboring node.

[0082] When node n1 sends its node connection list to its neighboring nodes, node n0, which is a neighbor of n1, will also send its own node connection list to n1. Similarly, nodes n2, n3, and n4 will also send their node connection lists to n1. Because the sending times of these nodes may differ, the node connection list sent by n1's neighboring nodes may not be the first time that neighboring node has sent its node connection list.

[0083] S14, determine the initial path between itself and other nodes in the ad hoc network based on the list of neighboring nodes and the list of node connection relationships.

[0084] If node n0 sends a list containing the link between n0 and n1, then n1 will update this link to its own node connection list. Since the link already exists in its own node connection list, no further update is needed. If node n3 sends a list containing links between n3 and n1, n2, n4, and n5, then n1 will update these links to its own node connection list, determining the new adjacent node link: n3->n5, and the new paths: {n1->n3->n2}, {n1->n2->n3}, {n1->n4->n3}, {n1->n3->n4}, {n1->n3->n5}, {n1->n4->n5}, and {n1->n2->n3->n5}. Figure 2 The network topology shown is such that the new link and the new path are both part of the initial path of n1.

[0085] Understandably, each node can send its stored list of all node connections to its neighbors at a set time or period; or whenever its stored list changes, such as when it receives a list from a neighbor and updates its own list, it sends its stored list of all node connections to its neighbors. Each node can set its sending time to a different time to avoid conflicting node connection lists being transmitted in the ad hoc network. Therefore, nodes may send their stored node connection lists multiple times. This allows nodes with large hop distances to update each other's connection information, even in complex network structures or with a large number of nodes. Through multiple sending, receiving, and updating processes, each node ultimately obtains the correct and complete path relationships. Furthermore, the node connection list sent by a node can include only links originating from itself, without needing to include links originating from other nodes.

[0086] By transmitting node connection relationships outward in the early stages of network setup, each node can update and supplement its available paths, providing a basis for different path selections for subsequent data transmission.

[0087] In some embodiments, step 500 may specifically include: if the data transmission mode is a high-speed transmission mode, then determining the first transmission path with the shortest path distance to the target node from the optional transmission paths, and using the first transmission path as the optimal transmission path; if the data transmission mode is a stable transmission mode, then determining the second transmission path with the best communication quality to the target node from the optional transmission paths, and using the second transmission path as the optimal transmission path.

[0088] Specifically, since the high-speed transmission mode focuses on transmission rate, the shortest path distance is selected as the optimal transmission path, while the stable transmission mode focuses on transmission stability, so the path with the best communication quality is selected as the optimal transmission path.

[0089] In some embodiments, the ad hoc network communication method may further include the following step 21. S21, each node in the ad hoc network sends a distance vector between nodes to its neighboring nodes so that each node can determine the path distance of an alternative transmission path.

[0090] Distance vectors represent the spatial distance of links. For example, if node A is located on a hillside and node B is located at the foot of the hill, and nodes A and B are neighbors, then their horizontal distance is relatively short, but their spatial distance is relatively far, hence their distance vectors are large. Please refer to [link to relevant documentation]. Figure 5 , Figure 5 The diagram illustrates distance vectors between nodes. For example, the distance vector between neighboring nodes n1 and n0 is 7, indicating a spatial distance of 7 between the links of nodes n1 and n0; the distance vector between neighboring nodes n3 and n5 is 18, indicating a spatial distance of 18 between the links of nodes n3 and n5; and so on for other neighboring nodes. It is understood that the distance vector values ​​in the diagram are exemplary values ​​and can be expressed as dimensionless values ​​obtained by normalizing actual values, or as dimensional values ​​after data processing.

[0091] Taking node n1 as an example, n1 sends all the distance vectors between itself and n0, n2, n3 and n4 to n0, n2, n3 and n4. When n0 receives the distance vectors sent by n1, n0 also knows the distance vectors between n1 and n2, n3 and n4.

[0092] Node n1 will also receive distance vectors from n3, which contain distance vectors between n3 and n2, n4, and n5 respectively. Furthermore, node n1 will also receive distance vectors from n4, which contain distance vectors between n4 and n5. At this point, n1 stores the distance vectors between all its adjacent nodes. Figure 5 Given all the distance vector values, node n1 can obtain the path distance of the optional transmission path through all the distance vectors between its adjacent nodes.

[0093] The path distance of an optional transmission path is the sum of the distance vectors between adjacent nodes contained in the optional transmission path. For example, the path distance of path L11{n1->n3->n5} is 9+18=27 (not shown in the figure), the path distance of path L12{n1->n4->n5} is 16+16=32 (not shown in the figure), and the path distance of path L13{n1->n2->n3->n5} is 12+11+18=41 (not shown in the figure). The sum of the distance vectors between adjacent nodes can be calculated and stored before the target data transmission is required and directly retrieved when needed, or it can be calculated each time the target data transmission is required.

[0094] Alternatively, nodes can obtain the path distance of an optional transmission path by using the distance vector of the transmission path sent by neighboring nodes. For example, if the inter-node distance vector sent by node n1 to n0 includes the path distance of path L11, then when node n0 calculates the path distance of path L01, it can directly calculate the sum of the path distance of path L11 and the distance vector of {n0->n1}.

[0095] Routing information includes distance vectors for optional transmission paths. Each node can record the path distances of all transmission paths with itself as the source node and other nodes as the destination node in its own routing table, and can also record the distance vectors between itself and its neighboring nodes in its own routing table.

[0096] Understandably, each node can send all its stored distance vectors to its neighboring nodes at a set time or according to a set period; or whenever its stored distance vectors change, such as when it receives a distance vector from a neighboring node and updates its own stored distance vectors, it sends all its stored distance vectors to its neighboring nodes. The sending time for each node can be set to a different time to avoid conflicting distance vectors being transmitted in the ad hoc network. Therefore, nodes may send their stored distance vectors multiple times. This allows nodes with a large number of hops apart to update each other's distance vector information, even in complex network structures or with a large number of nodes. Through multiple sending, receiving, and updating processes, each node ultimately obtains a correct and complete distance vector.

[0097] Continue reading Figure 5When selecting the optimal path, taking the transmission of target data from source node n0 to target node n5 as an example, if the data transmission mode is high-speed transmission mode, the optional transmission paths from n0 to n5 recorded in the routing table of source node n0 include: path L01{n0->n1->n3->n5}, path L02{n0->n1->n4->n5}, path L03{n0->n1->n2->n3->n5}, and path L04{n0->n1->n4->n3->n5}. The path distances of paths L01 to L04 are 34, 39, 48, and 50 respectively. Among them, the shortest path distance is path L01. Therefore, path L01 is selected as the optimal transmission path.

[0098] Please see Figure 6 Continuing with the example of sending target data from source node n0 to target node n5, if node n3 fails, and if the data transmission mode is high-speed transmission mode, the only optional transmission path from n0 to n5 recorded in the routing table of source node n0 is path L02. Paths L01, L03, and L04 are no longer optional transmission paths due to updates in the communication status. Therefore, only path L02 can be selected as the optimal transmission path.

[0099] By calculating the path distance using distance vectors, the transmission path with the minimum distance overhead can be determined during target data transmission, thereby increasing the data transmission rate.

[0100] In some embodiments, the ad hoc network communication method further includes the following step 31. S31, each node in the ad hoc network sends communication parameters to its neighboring nodes so that each node can determine the communication parameters of an optional transmission path. The communication parameters include the node's current load rate and the channel quality between nodes.

[0101] Current load rate refers to the ratio of the number of neighboring nodes currently connected to a node to the node's maximum allowed number of connections. A higher load rate indicates greater data throughput, but lower stability and fault tolerance. Nodes can directly obtain their own current load rate. Channel quality refers to the quality of data transmitted through the node, which can be determined through heartbeat messages. Higher channel quality indicates less noise during data transmission, resulting in higher output data quality. Routing information may also include communication parameters, which each node can record in its routing table.

[0102] The communication quality of an optional transmission path is obtained by evaluating its communication parameters. For example, in path L11{n1->n3->n5}, there are sub-paths 1{n1->n3} and 2{n3->n5}, where the load rates of nodes n1, n3, and n5 are F1, F2, and F3, respectively. The channel quality of sub-path 1 is CQI1, and the channel quality of sub-path 2 is CQI2. The communication quality of path L11 is obtained by evaluating F1-F3 and CQI1-CQI2. Communication quality can be represented numerically; for example, a higher numerical value indicates higher communication quality.

[0103] Understandably, each node can send all its stored communication parameters to its neighboring nodes at a set time or according to a set period; or whenever its stored communication parameters change, such as when it receives communication parameters from a neighboring node and updates its own stored parameters, it sends all its stored communication parameters to its neighboring node. The sending time for each node can be set to a different time to avoid conflicting communication parameters being transmitted in the ad hoc network. Therefore, nodes may send their stored communication parameters multiple times. This allows nodes with a large number of hops apart to update each other's communication parameter information, even in complex network structures or with a large number of nodes. Through multiple sending, receiving, and updating processes, each node ultimately obtains the correct and complete communication parameters.

[0104] Please see Figure 5 When selecting the optimal path, taking the transmission of target data from source node n0 to target node n5 as an example, if the data transmission mode is stable transmission mode, the optional transmission paths from n0 to n5 recorded in the routing table of source node n0 include: path L01{n0->n1->n3->n5}, path L02{n0->n1->n4->n5}, path L03{n0->n1->n2->n3->n5}, and path L04{n0->n1->n4->n3->n5}. The communication quality of paths L01 to L04 is 70, 78, 65, and 67 respectively. Among them, path L02 has the highest communication quality, so path L02 is selected as the optimal transmission path.

[0105] If some nodes in a self-organizing network fail, the method for determining the communication parameters of the alternative transmission path can be obtained in the same way, except that the alternative transmission paths involved in determining the communication parameters may be different.

[0106] By calculating the communication quality based on load rate and channel quality, the transmission path with the highest signal transmission stability can be determined during target data transmission, thus ensuring the stability of data transmission.

[0107] As one possible implementation, the communication parameters of an optional transmission path can be evaluated by: determining the highest load rate from the load rates of all nodes included in the optional transmission path; determining the lowest channel quality from the channel quality between all adjacent nodes included in the optional transmission path; and evaluating the communication quality of the optional transmission path based on the highest load rate and the lowest channel quality.

[0108] The communication quality of an optional transmission path can be evaluated using the least stable portion of the entire path, specifically the link between the node with the highest load rate and its adjacent node with the lowest channel quality. Please refer to [link / reference]. Figure 7 If the data transmission mode is stable, let's evaluate the communication parameters using paths L11 ({n1->n3->n5}) and L12 ({n1->n4->n5}) as examples. Specifically, assume the load rates of nodes n1, n3, n4, and n5 are 0.6, 0.8, 0.6, and 0.4, respectively; and the channel quality of paths {n1->n3}, {n1->n4}, {n3->n5}, and {n4->n5} are 20, 14, 14, and 12, respectively. Therefore, path L11 has a maximum load rate of 0.8 and a minimum channel quality of 14, while path L12 has a maximum load rate of 0.6 and a minimum channel quality of 12.

[0109] If the highest load rate and lowest channel quality among the various optional transmission paths participating in the evaluation belong to the same optional transmission path, then that optional transmission path is directly selected as the optimal transmission path. If the highest load rate and lowest channel quality belong to different optional transmission paths, then the highest load rate and lowest channel quality can be calculated using preset weights to obtain the path score. Assuming the preset weight for load rate is w1 and the preset weight for channel quality is w2, the highest load rate of all optional transmission paths is first normalized to obtain u1 for path L11 and u2 for path L12, and the lowest channel quality of all optional transmission paths is normalized to obtain k1 for path L11 and k2 for path L12. The evaluation score for path L11 is w1*u1 + w2*k1, and the evaluation score for path L12 is w1*u2 + w2*k2. This evaluation score represents the quality of communication; for example, the higher the evaluation score, the better the communication quality.

[0110] If some nodes in a self-organizing network fail, the method for evaluating communication parameters can be obtained in the same way, except that the optional transmission paths for evaluation may be different.

[0111] By utilizing the rule that the stability of a transmission path depends primarily on the weakest link, and using the weakest link in the transmission path to represent the communication quality of the path, accurate communication quality evaluation results can be obtained, which is beneficial for selecting the path with the best stability from all available paths.

[0112] In addition, embodiments of this application also provide a computer-readable storage medium storing an ad hoc network communication program, which, when executed by a processor, implements the ad hoc network communication method as described in the above embodiments.

[0113] It should be noted that for details not disclosed in the computer-readable storage medium of this embodiment, please refer to the details disclosed in the embodiments of the self-organizing network communication method in this application, which will not be repeated here.

[0114] According to the computer-readable storage medium proposed in the embodiments of this application, a local area network can be built through an ad hoc network in areas with no signal or poor signal coverage. Each node sends the collected data to a preset target node that can communicate with the external network, and the target node uploads the target data, thereby realizing remote monitoring of areas with no signal or poor signal coverage. Furthermore, by updating the communication status of the nodes, the selectable transmission path between the source node and the target node can be updated, ensuring the correctness of the transmission path even when a node fails, so that the target data of each node can be successfully transmitted to the target node. In addition, the ad hoc network has low requirements for the topology structure and can be widely applied to various network topologies such as mesh, star, and hybrid. Furthermore, it can reduce networking costs and operating costs.

[0115] Additionally, please see Figure 8 The embodiments of this application also provide an ad hoc network communication device 10, including a memory 11, a processor 12, and an ad hoc network communication program stored in the memory 11 and executable on the processor 12. When the processor 12 executes the ad hoc network communication program, it implements the ad hoc network communication method as described in the above embodiments.

[0116] It should be noted that for details not disclosed in the self-organizing network communication device 10 of this embodiment, please refer to the details disclosed in the embodiments of the self-organizing network communication method in this application, which will not be repeated here.

[0117] The self-organizing network communication device proposed in the embodiments of this application can build a local area network in areas with no signal or poor signal coverage. Each node sends the collected data to a preset target node that can communicate with the external network, and the target node uploads the target data, realizing remote monitoring of areas with no signal or poor signal coverage. Furthermore, by updating the communication status of the nodes, the optional transmission path between the source node and the target node can be updated, ensuring the correctness of the transmission path even when a node fails, so that the target data of each node can be successfully transmitted to the target node. In addition, it has low requirements for the topology of the self-organizing network and can be widely applied to various network topologies such as mesh, star, and mesh-star hybrid TD-LTE. Furthermore, it can reduce networking costs and operating costs.

[0118] Additionally, please see Figure 9 The embodiments of this application also provide an ad hoc network communication device 20, including: a main control module 21 and an antenna 22, wherein the main control module 21 is used to update the communication status with neighboring nodes, update the optional transmission paths with other nodes in the ad hoc network according to the communication status, send the optional transmission paths to neighboring nodes through the antenna 22 so that each node in the ad hoc network can update its own routing information, and determine the data transmission mode according to the geographical location of its own node, determine the optimal transmission path with the target node in the data transmission mode from the optional transmission paths, and send the collected target data to the target node through the antenna 22 according to the optimal transmission path so that the target node can upload the target data through the external network; wherein, the routing information includes the optional transmission paths between itself and other nodes in the ad hoc network.

[0119] Specifically, the self-organizing network communication device 20 may further include a data acquisition device, a signal amplification module, an auxiliary communication module, and a power supply module. The data acquisition device may include a camera and sensors to monitor the target and obtain target data (monitoring data). The monitored target may be a power transmission line in an area with no signal or poor public network signal coverage. The signal amplification module is connected to the main control module 21 and the antenna 22 respectively, and is used to amplify the target data to be transmitted. The auxiliary communication module is connected to the main control module 21 and the data acquisition device respectively, and is used to transmit the target data acquired by the camera and sensors to the main control module 21. The auxiliary communication module may include different interfaces, such as an RS485 interface, a USB interface, or a network port, to adapt to different types of data acquisition devices. The power supply module is used to power the nodes.

[0120] The self-organizing network communication device 20 may also include a Bluetooth module. Since the node 20 is usually configured at the top of the tower to enhance signal transmission and reception, setting up a Bluetooth module makes it easier for engineers to remotely debug the node without having to climb the tower for wired connection debugging.

[0121] In some embodiments, the main control module 21 updates the communication status with neighboring nodes in the following ways: the main control module sends a first message to the neighboring node; and determines the communication status with the neighboring node based on the neighboring node's response to the first message, wherein the communication status includes a connectivity status and a timeout status.

[0122] In some embodiments, the first message is a query message, and the main control module determines the communication status with neighboring nodes in the following ways: if a response message from a neighboring node to the query message is received within a preset time, the communication status with the neighboring node is determined to be a connected state; if a response message from a neighboring node to the query message is not received within a preset time, the communication status with the neighboring node is determined to be a timeout state.

[0123] In some embodiments, the method by which the master control module 21 updates the optional transmission path with other nodes in the self-organizing network includes: the master control module determining a connected path as an optional transmission path from the initial path with other nodes in the self-organizing network based on the communication status.

[0124] In some embodiments, the main control module 21 generates the initial path by: determining its own neighboring nodes; sending its own list of neighboring nodes to the neighboring nodes; receiving a list of node connection relationships from the neighboring nodes; and determining the initial path between itself and other nodes in the ad hoc network based on the list of neighboring nodes and the list of node connection relationships.

[0125] In some embodiments, the data transmission mode includes a high-speed transmission mode and a stable transmission mode.

[0126] In some embodiments, the main control module 21 determines the optimal transmission path between itself and the target node in a data transmission mode, including: if the data transmission mode is a high-speed transmission mode, determining the first transmission path with the shortest path distance between itself and the target node from the available transmission paths, and using the first transmission path as the optimal transmission path; if the data transmission mode is a stable transmission mode, determining the second transmission path with the best communication quality between itself and the target node from the available transmission paths, and using the second transmission path as the optimal transmission path.

[0127] In some embodiments, the main control module 21 is further configured to send distance vectors between nodes to its neighboring nodes so that each node can determine the path distance of the optional transmission path, wherein the distance vector represents the spatial distance of the link, the routing information also includes the distance vector of the optional transmission path; and the path distance of the optional transmission path is the sum of the distance vectors between adjacent nodes included in the optional transmission path.

[0128] In some embodiments, the main control module 21 is further configured to send communication parameters to its neighboring nodes so that each node can determine the communication parameters of the optional transmission path. The communication parameters include the node's current load rate and the channel quality between nodes. The routing information also includes the communication parameters. Furthermore, the communication quality of the optional transmission path is obtained by evaluating the communication parameters of the optional transmission path.

[0129] As one possible implementation, the main control module 21 can evaluate the communication parameters of the optional transmission path in the following ways: determine the highest load rate from the load rates of all nodes included in the optional transmission path; determine the lowest channel quality from the channel quality between all adjacent nodes included in the optional transmission path; and evaluate the communication quality of the optional transmission path based on the highest load rate and the lowest channel quality.

[0130] It should be noted that for details not disclosed in the self-organizing network communication device 20 of this embodiment, please refer to the details disclosed in the embodiments of the self-organizing network communication method in this application, which will not be repeated here.

[0131] Additionally, please see Figure 2 This application also proposes an ad hoc network communication system, including multiple ad hoc network communication devices that form a mesh network, a star network, or a mesh-star hybrid network. Each ad hoc network communication device includes a main control module and an antenna. The main control module is used to update the communication status with neighboring nodes, update the optional transmission paths with other nodes in the ad hoc network based on the communication status, send the optional transmission paths to neighboring nodes through the antenna so that each node in the ad hoc network can update its own routing information, determine the data transmission mode based on its own geographical location, determine the optimal transmission path with the target node in the data transmission mode from the optional transmission paths, and send the collected target data to the target node through the antenna according to the optimal transmission path so that the target node can upload the target data through the external network. The routing information includes the optional transmission paths between itself and other nodes in the ad hoc network.

[0132] It should be noted that for details not disclosed in the self-organizing network communication system of this embodiment, please refer to the details disclosed in the embodiments of the self-organizing network communication method in this application, which will not be repeated here.

[0133] The self-organizing network communication system proposed in this application can build a local area network in areas with no signal or poor signal coverage. Each node sends the collected data to a preset target node that can communicate with the external network, and the target node uploads the target data, realizing remote monitoring of areas with no signal or poor signal coverage. Furthermore, by updating the communication status of the nodes, the optional transmission path between the source node and the target node can be updated, ensuring the correctness of the transmission path even when a node fails, so that the target data of each node can be successfully transmitted to the target node. In addition, it has low requirements for the topology of the self-organizing network and can be widely applied to various network topologies such as mesh, star, and hybrid. Furthermore, it can reduce networking costs and operating costs.

[0134] It should be noted that the logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as a sequenced list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by, or in conjunction with, an instruction execution system, apparatus, or device (such as a computer-based system, a processor-included system, or other system that can fetch and execute instructions from, an instruction execution system, apparatus, or device). For the purposes of this specification, "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transmit programs for use by, or in conjunction with, an instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of computer-readable media include: an electrical connection having one or more wires (electronic device), a portable computer disk drive (magnetic device), random access memory (RAM), read-only memory (ROM), erasable and editable read-only memory (EPROM or flash memory), fiber optic devices, and portable optical disc read-only memory (CDROM). Alternatively, the computer-readable medium may be paper or other suitable media on which the program can be printed, since the program can be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, interpreting, or otherwise processing as necessary, and then stored in a computer memory.

[0135] It should be understood that various parts of this application can be implemented using hardware, software, firmware, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented using software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, it can be implemented using any one or a combination of the following techniques known in the art: discrete logic circuits having logic gates for implementing logical functions on data signals, application-specific integrated circuits (ASICs) having suitable combinational logic gates, programmable gate arrays (PGAs), field-programmable gate arrays (FPGAs), etc.

[0136] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of this application. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples.

[0137] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this application, "a plurality of" means at least two, such as two, three, etc., unless otherwise expressly specified. Relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another entity or operation and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0138] The various embodiments in this specification are described in a related manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on describing the differences from other embodiments. In particular, the embodiments of apparatus, electronic devices, and computer-readable storage media are basically similar to the method embodiments, and therefore the descriptions are relatively simple; relevant parts can be referred to the descriptions of the method embodiments.

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

Claims

1. A self-organizing network communication method, characterized in that, The method includes: For each node in the ad hoc network, update the communication status with neighboring nodes; Update the optional transmission path with other nodes in the ad hoc network based on the communication status; The optional transmission path is sent to the neighboring nodes so that each node in the ad hoc network updates its own routing information, wherein the routing information includes optional transmission paths between itself and other nodes in the ad hoc network; The data transmission mode is determined based on the geographical location of its own node; specifically, the data transmission mode is determined to be either high-speed transmission mode or stable transmission mode based on the geographical location of its own node. Determine the optimal transmission path between the target node and the selected transmission paths under the data transmission mode; The collected target data is sent to the target node according to the optimal transmission path, so that the target node can upload the target data via the external network; Determining the optimal transmission path between the candidate transmission paths and the target node under the data transmission mode includes: If the data transmission mode is a high-speed transmission mode, then the first transmission path with the shortest path distance to the target node is determined from the optional transmission paths, and the first transmission path is taken as the optimal transmission path. If the data transmission mode is a stable transmission mode, then the second transmission path with the best communication quality with the target node is determined from the optional transmission paths, and the second transmission path is taken as the optimal transmission path.

2. The method according to claim 1, characterized in that, Update the communication state with neighboring nodes, including: Send a first message to the neighboring node; The communication status with the neighboring node is determined based on the neighboring node's feedback on the first message, wherein the communication status includes a connectivity status and a timeout status.

3. The method according to claim 2, characterized in that, The first message is a query message. The communication status with the neighboring node is determined based on the neighboring node's response to the first message, including: If a response message from the neighboring node to the query message is received within a preset time, then the communication status with the neighboring node is determined to be connected. If no response message is received from the neighboring node for the query message within a preset time, the communication status with the neighboring node is determined to be a timeout status.

4. The method according to claim 1, characterized in that, Update the optional transmission path between the network and other nodes in the ad hoc network based on the communication status, including: Based on the communication status, a connected path is determined from the initial path between the network and other nodes in the self-organizing network as an optional transmission path.

5. The method according to claim 4, characterized in that, The methods for generating the initial path include: For each node in the ad hoc network, determine its own neighboring nodes; Send its own list of neighboring nodes to the neighboring nodes; Receive the list of node connection relationships sent by the neighboring node; The initial path between itself and other nodes in the ad hoc network is determined based on the list of neighboring nodes and the list of node connection relationships.

6. The method according to claim 1, characterized in that, The method further includes: Each node in the ad hoc network sends a distance vector between itself and its neighboring nodes so that each node can determine the path distance of the optional transmission path. The distance vector represents the spatial distance of the link, and the routing information also includes the distance vector of the optional transmission path. Furthermore, the path distance of the optional transmission path is the sum of the distance vectors between adjacent nodes included in the optional transmission path.

7. The method according to claim 1 or 6, characterized in that, The method further includes: Each node in the ad hoc network sends communication parameters to its neighboring nodes so that each node can determine the communication parameters of the optional transmission path. The communication parameters include the node's current load rate and the channel quality between nodes. The routing information also includes the communication parameters. Furthermore, the communication quality of the optional transmission path is obtained by evaluating the communication parameters of the optional transmission path.

8. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a self-organizing network communication program, which, when executed by a processor, implements the self-organizing network communication method as described in any one of claims 1-7.

9. A self-organizing network communication device, characterized in that, It includes a memory, a processor, and a self-organizing network communication program stored in the memory and executable on the processor. When the processor executes the self-organizing network communication program, it implements the self-organizing network communication method as described in any one of claims 1-7.

10. A self-organizing network communication device, characterized in that, The device includes a main control module and an antenna. The main control module updates the communication status with neighboring nodes, updates the optional transmission paths with other nodes in the ad hoc network based on the communication status, sends the optional transmission paths to neighboring nodes via the antenna so that each node in the ad hoc network updates its own routing information, and determines a data transmission mode based on its geographical location (either a high-speed transmission mode or a stable transmission mode). It also determines the optimal transmission path with a target node from the optional transmission paths under the specified data transmission mode, and sends the collected target data to the target node via the optimal transmission path so that the target node can upload the target data via the external network. The routing information includes the optional transmission paths between the node and other nodes in the ad hoc network. The main control module is further configured to, if the data transmission mode is a high-speed transmission mode, determine the first transmission path with the shortest path distance to the target node from the optional transmission paths, and use the first transmission path as the optimal transmission path; if the data transmission mode is a stable transmission mode, determine the second transmission path with the best communication quality to the target node from the optional transmission paths, and use the second transmission path as the optimal transmission path.

11. The apparatus according to claim 10, characterized in that, The main control module updates the communication status with neighboring nodes in the following ways: The main control module sends a first message to the neighboring node; The communication status with the neighboring node is determined based on the neighboring node's feedback on the first message, wherein the communication status includes a connectivity status and a timeout status.

12. The apparatus according to claim 11, characterized in that, The first message is a query message, and the main control module determines the communication status with the neighboring node in the following ways: If a response message from the neighboring node to the query message is received within a preset time, then the communication status with the neighboring node is determined to be connected. If no response message is received from the neighboring node for the query message within a preset time, the communication status with the neighboring node is determined to be a timeout status.

13. The apparatus according to claim 10, characterized in that, The main control module updates the optional transmission paths with other nodes in the self-organizing network in the following ways: The main control module determines a connected path as an optional transmission path from the initial path between itself and other nodes in the self-organizing network based on the communication status.

14. The apparatus according to claim 13, characterized in that, The main control module generates the initial path in the following ways: The main control module determines its own neighbor nodes; Send its own list of neighboring nodes to the neighboring nodes; Receive the list of node connection relationships sent by the neighboring node; The initial path between itself and other nodes in the ad hoc network is determined based on the list of neighboring nodes and the list of node connection relationships.

15. The apparatus according to claim 10, characterized in that, The main control module is also used to send distance vectors between nodes to its neighboring nodes so that each node can determine the path distance of the optional transmission path. The distance vector represents the spatial distance of the link, and the routing information also includes the distance vector of the optional transmission path. Furthermore, the path distance of the optional transmission path is the sum of the distance vectors between adjacent nodes included in the optional transmission path.

16. The apparatus according to claim 10, characterized in that, The main control module is also used to send communication parameters to its neighboring nodes so that each node can determine the communication parameters of the optional transmission path. The communication parameters include the node's current load rate and the channel quality between nodes. The routing information also includes the communication parameters. Furthermore, the communication quality of the optional transmission path is obtained by evaluating the communication parameters of the optional transmission path.

17. A self-organizing network communication system, characterized in that, The system includes: multiple self-organizing network communication devices, wherein the self-organizing network communication device is any one of claims 10-16, and the multiple self-organizing network communication devices form a mesh network, a star network, or a mesh-star hybrid network.

Images