A decentralized communication method and system based on wireless ad hoc network
By using wireless ad hoc networking technology in complex environments, the communication topology diagram and network are constructed based on the node's encrypted address code, which solves the problem that wireless MESH network cannot support large-capacity data transmission and dependence on relay devices in complex environments, and realizes the problem of wireless MESH network not being able to support large-capacity data transmission and dependence on relay devices in complex environments. Instant communication and large-capacity data transmission of maintenance personnel are reduced.
Patent Information
- Application Number
- CN202410359391.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-03-27
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2044-03-27
AI Technical Summary
Existing wireless MESH networks cannot support large-capacity data transmission in complex environments, and rely too heavily on relay devices, which can easily lead to network paralysis when the equipment is damaged or powered off.
Adopt the decentralized communication method based on wireless ad hoc network to establish a communication connection topology diagram by obtaining the encrypted address code of the node, and build a communication network based on the communication quality between nodes, generate a communication connection path, and realize instant communication and large-scale communication between nodes. Capacity data transmission to avoid dependence on relay devices.
The communication connection topology diagram between maintenance personnel is created in complex environments, enabling the rapid transmission of large-capacity data, reducing communication costs, and improving network reliability and flexibility.
Smart Images

Figure CN118019081B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of communication technology, and in particular to a decentralized communication method and system based on wireless ad hoc networks for complex environments. Background Art
[0002] At present, with the in-depth development of river basin maintenance, maintenance operations face three complex environments: enclosed shielded spaces such as the unit volute and the inside of the main transformer equipment; GIL large caverns and long vertical shafts, long flow channels of the unit, gate chambers of the hoist and gate machine, and other high-altitude shaft spaces; outdoor spaces such as the protection tanks of the discharge buildings, water cushion ponds, and energy dissipation pools. How to maintain instant communication among maintenance personnel in these complex operating environments is an urgent problem to be solved. In recent years, wireless MESH multi-hop self-organizing network transmission technology has been widely used in the fields of the Internet of Things and complex environment maintenance as a self-organized network or the "last mile" network connected to the Internet due to its advantages such as convenient and flexible network construction. However, traditional wireless MESH networks have problems with network delay and narrow bandwidth, cannot support large-capacity data transmission, and must rely on designated relay equipment. Once the relay equipment is damaged or powered off, the entire network is facing paralysis. Therefore, the existing technology needs to be improved. Summary of the invention
[0003] The present invention provides a decentralized communication method and system based on wireless ad hoc network to solve the problem of instant communication for maintenance workers in complex working environments. The existing wireless MESH network cannot support large-capacity data transmission and relies too heavily on relay equipment.
[0004] In order to solve the above technical problems, the first aspect of the present invention provides a decentralized communication method based on a wireless ad hoc network, comprising:
[0005] Acquire the address code of the node, and establish a communication connection topology diagram according to the node and its address code; the address code includes an encrypted string and an address sending time, and the encrypted string is formed by encrypting the physical address of the node;
[0006] Generating a communication network of the node according to the address code of the node;
[0007] The source node and the target node in the communication connection topology diagram are obtained, and a communication connection path is generated according to the communication network of the source node and the communication network of the target node, so that the source node and the target node communicate through the communication connection path.
[0008] Furthermore, the acquiring of the address codes of the nodes and establishing a communication connection topology diagram according to the nodes and their address codes includes:
[0009] Each of the nodes collects address codes of adjacent nodes in real time and sends its own address code to the adjacent nodes;
[0010] Each of the nodes determines the distance between itself and an adjacent node according to its own address code and the address code of the adjacent node;
[0011] According to the distance between itself and the adjacent nodes, the adjacent nodes that meet the preset distance conditions are selected as communicable nodes and added to its own communication list;
[0012] Each node is connected to the communicable node in its communication list to obtain the communication connection topology diagram.
[0013] Further, each of the nodes determines the distance between itself and an adjacent node according to its own address code and the address code of the adjacent node, including:
[0014] The encrypted string in its own address code is compared with the encrypted string in the address code of the adjacent node, and the number of different characters in the corresponding position is used as the distance between itself and the adjacent node.
[0015] Furthermore, the step of connecting each node with a communicable node in its communication list to obtain the communication connection topology diagram includes:
[0016] Each of the nodes sends a connection request to the communicable nodes in its own communication list;
[0017] The communicable node verifies the received connection request and determines whether the node sending the connection request is in its own communication list;
[0018] If so, the communicative node responds to the connection request and establishes a connection with the node sending the connection request to obtain the communication connection topology diagram; if not, no response is given, so that the node sending the connection request removes the communicative nodes that have not responded within a preset time from its own communication list.
[0019] Further, generating the communication network of the node according to the address code of the node includes:
[0020] Select any node in the communication connection topology diagram as a basic node;
[0021] Subtract the time when the base node receives the adjacent node address code from the time when the address in the adjacent node address code is sent to obtain a time difference;
[0022] weighting the distance between the base node and the adjacent node by the time difference to obtain the communication quality of the adjacent node relative to the base node;
[0023] Determining the node level of the adjacent nodes relative to the base node according to the communication quality and a preset quality interval, and connecting the adjacent nodes of the same level to obtain a communication network of the base node;
[0024] The basic nodes are updated, and a communication network of the updated basic nodes is constructed until a communication network of all nodes is obtained.
[0025] Furthermore, the communication network includes a primary communication network, a secondary communication network and a tertiary communication network; the nodes in the primary communication network are fast response nodes of the nodes belonging to the primary communication network, the nodes in the secondary communication network are medium-speed response nodes of the nodes belonging to the primary communication network, and the nodes in the tertiary communication network are low-speed response nodes of the nodes belonging to the primary communication network.
[0026] Further, the acquiring of the source node and the target node in the communication connection topology diagram, and generating a communication connection path according to the communication network of the source node and the communication network of the target node, so that the source node and the target node communicate through the communication connection path, includes:
[0027] Acquire a source node and a target node in the communication connection topology diagram, and determine a positional relationship between the source node and the target node;
[0028] If the target node is in the primary communication network of the source node, the two are directly connected for communication;
[0029] If the target node is in the secondary communication network of the source node, the node with the shortest distance to the target node is selected from the primary communication network of the source node as a jumping node, and the node with the shortest distance to the target node is selected from the primary communication network of the jumping node as an updated jumping node, until the target node appears in the primary communication network of the updated jumping node, and multiple jumping nodes are connected to form a communication connection path; if the jumping nodes are more than the preset number of nodes and there are jumping nodes that are medium-speed response nodes and / or low-speed response nodes of the source node and / or the target node, the source node and the target node are directly connected for communication, otherwise the source node and the target node communicate through the communication connection path;
[0030] If the target node is in the third-level communication network of the source node or is not in the communication network of the source node, the node with the shortest distance to the target node is selected from the first-level communication network of the source node as the jumping node, and the node with the shortest distance to the target node is selected from the first-level communication network of the jumping node as the updated jumping node, until the target node appears in the first-level communication network of the updated jumping node, and multiple jumping nodes are connected to form a communication connection path, so that the source node and the target node communicate through the communication connection path.
[0031] A second aspect of the present invention provides a decentralized communication system based on a wireless ad hoc network, comprising:
[0032] A topology map building module, used to obtain the address code of the node and establish a communication connection topology map according to the node and its address code; the address code includes an encrypted string and an address sending time, and the encrypted string is formed by encrypting the physical address of the node;
[0033] A communication network generation module, used to generate a communication network of the node according to the address code of the node;
[0034] The connection path generation module is used to obtain the source node and the target node in the communication connection topology diagram, and generate a communication connection path according to the communication network of the source node and the communication network of the target node, so that the source node and the target node communicate through the communication connection path.
[0035] Furthermore, the topology map construction module includes:
[0036] An address code transceiver unit, used for each of the nodes to collect address codes of adjacent nodes in real time and send its own address code to the adjacent nodes;
[0037] The node distance calculation unit is used for each node to determine the distance between itself and the adjacent node according to its own address code and the address code of the adjacent node;
[0038] A communication list establishing unit, used to select adjacent nodes that meet preset distance conditions as communicable nodes and add them to its own communication list according to the distance between itself and the adjacent nodes;
[0039] The communication node connection unit is used to connect each node with the communicable node in its communication list to obtain the communication connection topology diagram.
[0040] Furthermore, the communication network generation module includes:
[0041] A basic node selection unit, used to select any node in the communication connection topology diagram as a basic node;
[0042] A time difference calculation unit, used for subtracting the time when the base node receives the adjacent node address code from the address sending time in the adjacent node address code to obtain the time difference;
[0043] a communication quality calculation unit, configured to weight the distance between the base node and the adjacent node by the time difference to obtain the communication quality of the adjacent node relative to the base node;
[0044] A communication network construction unit, configured to determine the node level of the adjacent nodes relative to the base node according to the communication quality and a preset quality interval, and connect the adjacent nodes of the same level to obtain a communication network of the base node;
[0045] The network construction iteration unit is used to update the basic nodes and construct the communication network of the updated basic nodes until the communication network of all nodes is obtained.
[0046] Compared with the prior art, the embodiments of the present invention have the following beneficial effects:
[0047] The present invention provides a decentralized communication method and system based on wireless ad hoc network, wherein the method includes: obtaining the address code of the node, and establishing a communication connection topology diagram according to the node and its address code; the address code includes an encrypted string and an address sending time, and the encrypted string is formed by encrypting the physical address of the node; generating the communication network of the node according to the address code of the node; obtaining the source node and the target node in the communication connection topology diagram, and generating a communication connection path according to the communication network of the source node and the communication network of the target node, so that the source node and the target node communicate through the communication connection path. The present invention creates a communication connection topology diagram between maintenance personnel in complex and limited spaces such as closed shielded spaces, high-altitude shaft spaces, and outdoor spaces through wireless ad hoc network technology, avoiding dependence on relay equipment, and establishing a communication network structure for each maintenance personnel according to the communication quality between nodes. When maintenance personnel need to communicate, a connection channel is quickly created, which not only realizes the rapid transmission of large-capacity data, but also reduces communication costs. BRIEF DESCRIPTION OF THE DRAWINGS
[0048] In order to more clearly illustrate the technical solution of the present invention, the drawings required for use in the implementation mode will be briefly introduced below. Obviously, the drawings described below are only some implementation modes of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0049] Figure 1It is a flow chart of a decentralized communication method based on a wireless ad hoc network provided by a certain embodiment of the present invention;
[0050] Figure 2 is a flowchart of step S1 provided in one embodiment of the present invention;
[0051] Figure 3 is a flowchart of step S14 provided by an embodiment of the present invention;
[0052] Figure 4 is a flowchart of step S2 provided by an embodiment of the present invention;
[0053] Figure 5 is a flowchart of step S3 provided by an embodiment of the present invention;
[0054] Figure 6 It is a device diagram of a decentralized communication system based on a wireless ad hoc network provided by a certain embodiment of the present invention;
[0055] Figure 7 is a structural diagram of a topology map construction module 10 provided in one embodiment of the present invention;
[0056] Figure 8 It is a structural diagram of a communication network generation module 20 provided in one embodiment of the present invention. DETAILED DESCRIPTION
[0057] The following is a clear and complete description of the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings and embodiments. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0058] It should be understood that the step numbers used in this document are only for convenience of description and are not intended to limit the order in which the steps are executed.
[0059] It should be understood that the terms used in the present specification are only for the purpose of describing specific embodiments and are not intended to limit the present invention. As used in the present specification and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include plural forms.
[0060] The terms “include” and “comprising” indicate the presence of described features, integers, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or combinations thereof.
[0061] The term "and / or" means and includes any and all possible combinations of one or more of the associated listed items.
[0062] In one embodiment, if Figure 1 As shown, the first aspect of the present invention provides a decentralized communication method based on a wireless ad hoc network, comprising:
[0063] S1. Obtaining the address code of the node, and establishing a communication connection topology map according to the node and its address code; the address code includes an encrypted string and an address sending time, and the encrypted string is formed by encrypting the physical address of the node;
[0064] In one embodiment, step S1 is as follows: Figure 2 As shown, including:
[0065] S11, each of the nodes collects address codes of adjacent nodes in real time, and sends its own address code to the adjacent nodes;
[0066] Specifically, when maintenance personnel are performing maintenance in enclosed shielded spaces such as the unit volute, the inside of the main transformer equipment, GIL large caverns and long vertical shafts, unit long flow channels, hoist gate chambers and other high-altitude shaft spaces, and outdoor spaces such as the protection tanks of water discharge buildings, water cushion ponds, and energy dissipation pools, they usually carry communication equipment with them to facilitate information communication while performing maintenance work, such as: head-mounted audio and video communication terminals, neck-hanging audio and video communication terminals, safety helmet external audio and video communication terminals, intelligent communication work recorders, universal wireless video signal output and communication devices, wireless communication control balls, etc. Maintenance workers carry these communication equipment to record the maintenance process and connect these devices as nodes to communicate. It should be noted that there is no specific distance limit for adjacent nodes in this step. In a limited and closed complex space, all nodes except itself can be called adjacent nodes of the node. Each node receives the address code from the adjacent node at all times and sends its own address code to the adjacent node in real time to establish a communication connection based on the address code to ensure instant communication.
[0067] S12, each of the nodes determines the distance between itself and an adjacent node according to its own address code and the address code of the adjacent node;
[0068] In one embodiment, step S12 includes:
[0069] The encrypted string in its own address code is compared with the encrypted string in the address code of the adjacent node, and the number of different characters in the corresponding position is used as the distance between itself and the adjacent node.
[0070] Specifically, the present application encrypts the physical address through the SHA1 algorithm, and the encrypted string can also be formed by encrypting the address string formed by splicing the physical address and the IP address through the SHA1 algorithm. The present application compares whether the characters in the corresponding positions of the encrypted strings of the adjacent nodes are the same as those in the encrypted strings of the adjacent nodes, and takes the number of different characters as the distance between the adjacent node and the current node; wherein, the distance calculation method is explained by an 8-bit hash value: if the encrypted string of node A is 00001111, and the encrypted string of its adjacent node B is 10001110, the first and eighth bits in the encrypted strings of the two nodes are different, so the return value is 2; and the encrypted string used in the present application is a 160-bit binary string, then when compared, the return value is 0-160, 0 is returned when all bits are the same, and 160 is returned when all bits are different, and in this way, the distance between the node and its adjacent nodes can be determined. The present application evaluates the distance between nodes based on the hash value of SHA1, which has good randomness, thereby ensuring the balance of the cluster of each node, and not having too many nodes in the same cluster, so that the communication network can be homogenized.
[0071] S13, according to the distance between itself and the adjacent node, select the adjacent node that meets the preset distance condition as the communicable node to add to its own communication list;
[0072] Each node in the present application receives the address code from the adjacent node in real time, and updates its own communication list in real time according to the address code. Since the distance between the adjacent node and itself is different and it is in a limited closed space, the information transmission rate will also be affected. Then the adjacent node at a certain distance cannot receive the address code or information sent by itself in real time. Therefore, a preset distance condition is set to screen the adjacent nodes to communicate with itself, and those that meet the conditions are added to its own communication list as communicable nodes; wherein, the preset distance condition is not limited to a specific value, and can be adaptively adjusted according to actual conditions. In addition, the distance between nodes is far or near, and the time of sending and receiving the address code is also in sequence. Then, as time goes by, the more advanced the node in the list is, the higher its stability and communication quality will be.
[0073] S14, connecting each node to the communicable node in its communication list to obtain the communication connection topology diagram;
[0074] In one embodiment, step S14 is as follows: Figure 3 As shown, including:
[0075] S141, each of the nodes sends a connection request to the communicable nodes in its own communication list;
[0076] S142, the communicable node verifies the received connection request, and determines whether the node sending the connection request is in its own communication list;
[0077] S143. If yes, the communicative node responds to the connection request and establishes a connection with the node that sends the connection request to obtain the communication connection topology diagram; if no, no response is given, so that the node that sends the connection request removes the communicative nodes that have not responded within a preset time from its own communication list.
[0078] Specifically, after the two nodes receive the address code of each other, the sending of the address code is suspended between the two nodes, and the connection request is verified, and a communication connection topology is established according to the verification result. This embodiment is illustrated by an example: Node A can receive the address code of Node B, then Node B is the communicable node of Node A. If the two want to communicate, Node A needs to send a connection request to Node B. Since the communication is bidirectional, after receiving the connection request from Node A, Node B first verifies whether Node A belongs to its own communicable node. After the verification is passed, Node B responds to the connection request and connects with Node A. If the verification fails, Node B does not respond, then Node A and Node B cannot communicate, and Node A deletes Node B from its own communication list; through the above method, after all nodes verify the connection with their communicable nodes, a communication connection topology can be obtained. This application uses wireless ad hoc networking technology to create a communication connection topology between maintenance personnel in complex and limited spaces such as enclosed shielded spaces, high-altitude shaft spaces, and outdoor spaces, avoiding dependence on relay equipment.
[0079] S2. Generate a communication network of the node according to the address code of the node;
[0080] In one embodiment, step S2 is as follows: Figure 4 As shown, including:
[0081] S21, selecting any node in the communication connection topology graph as a basic node;
[0082] S22, subtracting the time when the base node receives the adjacent node address code from the address sending time in the adjacent node address code to obtain a time difference;
[0083] S23, weighting the distance between the basic node and the adjacent node by the time difference to obtain the communication quality of the adjacent node relative to the basic node;
[0084] S24, judging the node level of the adjacent nodes relative to the base node according to the communication quality and the preset quality interval, and connecting the adjacent nodes of the same level to obtain a communication network of the base node;
[0085] S25, updating the basic nodes, and constructing a communication network of the updated basic nodes, until a communication network of all nodes is obtained;
[0086] Among them, the communication network includes a primary communication network, a secondary communication network and a tertiary communication network; the nodes in the primary communication network are fast response nodes of the nodes belonging to the primary communication network, the nodes in the secondary communication network are medium-speed response nodes of the nodes belonging to the primary communication network, and the nodes in the tertiary communication network are low-speed response nodes of the nodes belonging to the primary communication network.
[0087] Specifically, since the communication quality of two nodes that are close to each other is not necessarily good, and this is also related to the communication time, the time difference obtained by subtracting the address sending time carried in the address code from the address code receiving time is used as a weight, and the distance between the two nodes is weighted to obtain the communication quality between the two nodes. If the communication quality between the two nodes (A and B) is in the first quality interval, then node B is a first-level node relative to node A, that is, node B is a first-level node of node A. If the communication quality between nodes A and B is in the second quality interval, then node B is a second-level node of node A. If the communication quality between nodes A and B is in the third quality interval, then node B is a third-level node of node A. Connect all the first-level nodes of node A to form a first-level communication network of node A. Similarly, node A also has a second-level communication network and a third-level communication network. According to this method, the communication network of all nodes in the communication connection topology diagram can be obtained. It should be noted that the first quality interval, the second quality interval, and the third quality interval are not limited to specific values again, and the specific values are determined according to actual conditions.
[0088] This application weights the distance between nodes by the information response time between nodes, and then obtains the communication quality between the two nodes. For a certain node, connecting the nodes with the same communication quality can form the network structure diagram of the node. The optimal transmission path between the node and any node can be quickly determined through the network structure diagram. The nodes in the primary communication network are all fast response nodes, generally close distance and the shortest response; the nodes in the secondary communication network are all medium-speed response nodes, generally moderate distance and moderate response time; the nodes in the tertiary communication network are all low-speed response nodes, generally far away and long response time; it should be noted that the division of fast, medium and low speed here is relative, which does not mean that the distance is close, which is necessarily a fast response node. It is necessary to make a comprehensive judgment on the weighted result of the distance according to time. This application classifies the adjacent nodes of a certain node by the communication quality obtained after time weighting the distance, and forms a corresponding communication network, which is convenient for subsequent acceleration of the creation of connection channels, thereby reducing communication costs.
[0089] S3, obtaining a source node and a target node in the communication connection topology diagram, and generating a communication connection path according to a communication network of the source node and a communication network of the target node, so that the source node and the target node communicate through the communication connection path;
[0090] In one embodiment, step S3 is as follows Figure 5 As shown, including:
[0091] S31, obtaining a source node and a target node in the communication connection topology diagram, and determining a positional relationship between the source node and the target node;
[0092] S321. If the target node is in the primary communication network of the source node, the two are directly connected for communication;
[0093] S322. If the target node is in the secondary communication network of the source node, then select the node with the shortest distance to the target node from the primary communication network of the source node as a jumping node, and select the node with the shortest distance to the target node from the primary communication network of the jumping node as an updated jumping node, until the target node appears in the primary communication network of the updated jumping node, and connect multiple jumping nodes to form a communication connection path; if the jumping nodes are more than the preset number of nodes and there are jumping nodes that are medium-speed response nodes and / or low-speed response nodes of the source node and / or the target node, directly connect the source node and the target node for communication, otherwise the source node and the target node communicate through the communication connection path;
[0094] S323. If the target node is in the third-level communication network of the source node or is not in the communication network of the source node, then select the node with the shortest distance to the target node from the first-level communication network of the source node as the jumping node, and select the node with the shortest distance to the target node from the first-level communication network of the jumping node as the updated jumping node, until the target node appears in the first-level communication network of the updated jumping node, and connect multiple jumping nodes to form a communication connection path, so that the source node and the target node communicate through the communication connection path.
[0095] Specifically, if nodes A and B in the communication connection topology diagram (it should be noted that A and B refer to any node, not a fixed node) want to communicate, then node A is used as the source node and node B is used as the target node. The positional relationship between the two is first determined, that is, whether the communication networks between the two are connected or intersected. If node B is in the primary communication network of node A, that is, node B is the primary node of node A (fast response node), then a direct connection between the two can achieve fast communication; if node B is in the secondary communication network of node A, that is, node B is the secondary node of node A (medium-speed response node), then a direct connection between the two is not necessarily the best. The communication connection path needs to find a jump node in the primary communication network of nodes A and B, and use the jump node as a bridge to form the optimal communication connection path for communication. When the number of jump nodes is more than the preset number of nodes and there are medium-speed response nodes and / or low-speed response nodes of nodes A and / or B in the jump nodes, nodes A and B are directly connected for communication; if node B is in the third-level communication network of node A, that is, node B is the third-level node (medium-speed response node) of node A, or is not in the communication network of node A, it is necessary to find a jump node in the primary communication network of nodes A and B, and use the jump node as a bridge to form the optimal communication connection path for communication. When maintenance personnel need to communicate, the present application determines the optimal communication connection path through the communication network of the node corresponding to the maintenance personnel, thereby realizing the rapid creation of connection channels and the rapid transmission of large-capacity data.
[0096] In the embodiment of the present application, based on the instant communication of maintenance workers in complex working environments, the existing wireless MESH network has the problem of being unable to support large-capacity data transmission and being overly dependent on relay devices. A decentralized communication method based on a wireless ad hoc network is designed, which realizes obtaining the address code of the node and establishing a communication connection topology according to the node and its address code; the address code includes an encrypted string and an address sending time, and the encrypted string is formed by encrypting the physical address of the node; the communication network of the node is generated according to the address code of the node; the source node and the target node in the communication connection topology are obtained, and a communication connection path is generated according to the communication network of the source node and the communication network of the target node, so that the source node and the target node communicate through the communication connection path. The technical solution; the present invention creates a communication connection topology between maintenance personnel in complex and limited spaces such as closed shielded spaces, high-altitude shaft spaces, and outdoor spaces through wireless ad hoc network technology, avoids dependence on relay devices, and establishes a communication network structure for each maintenance personnel according to the communication quality between nodes. When maintenance personnel need to communicate, a connection channel is quickly created, which not only realizes the rapid transmission of large-capacity data, but also reduces communication costs.
[0097] It should be noted that although the steps in the above flowchart are shown in sequence according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified in this document, there is no strict order restriction for the execution of these steps, and these steps can be executed in other orders.
[0098] In another embodiment, if Figure 6 As shown, the second aspect of the present invention provides a decentralized communication system based on a wireless ad hoc network, comprising:
[0099] A topology map building module 10 is used to obtain the address code of the node and establish a communication connection topology map according to the node and its address code; the address code includes an encrypted string and an address sending time, and the encrypted string is formed by encrypting the physical address of the node;
[0100] A communication network generation module 20, configured to generate a communication network of the node according to the address code of the node;
[0101] The connection path generation module 30 is used to obtain the source node and the target node in the communication connection topology diagram, and generate a communication connection path according to the communication network of the source node and the communication network of the target node, so that the source node and the target node communicate through the communication connection path.
[0102] In one embodiment, the structure of the topology map building module 10 is as follows: Figure 7 As shown, including:
[0103] An address code transceiver unit 101, used for each of the nodes to collect address codes of adjacent nodes in real time and send its own address code to the adjacent nodes;
[0104] The node distance calculation unit 102 is used for each node to determine the distance between itself and the adjacent node according to its own address code and the address code of the adjacent node;
[0105] The communication list establishing unit 103 is used to select adjacent nodes that meet the preset distance condition as communicable nodes and add them to its own communication list according to the distance between itself and the adjacent nodes;
[0106] The communication node connecting unit 104 is used to connect each node with the communicable node in its communication list to obtain the communication connection topology diagram.
[0107] In one embodiment, the structure of the communication network generation module 20 is as follows: Figure 8 As shown, including:
[0108] A basic node selection unit 201, configured to select any node in the communication connection topology diagram as a basic node;
[0109] A time difference calculation unit 202, configured to obtain a time difference by subtracting a time when the base node receives the adjacent node address code from an address sending time in the adjacent node address code;
[0110] A communication quality calculation unit 203, configured to weight the distance between the base node and the adjacent node by the time difference to obtain the communication quality of the adjacent node relative to the base node;
[0111] A communication network construction unit 204, configured to determine the node level of the adjacent nodes relative to the base node according to the communication quality and a preset quality interval, and connect the adjacent nodes of the same level to obtain a communication network of the base node;
[0112] The network construction iteration unit 205 is used to update the basic nodes and construct the communication network of the updated basic nodes until the communication network of all nodes is obtained.
[0113] It should be noted that each module in the above-mentioned decentralized communication system based on wireless ad hoc network can be implemented in whole or in part through software, hardware and their combination. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory in the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules. For the specific definition of a decentralized communication system based on wireless ad hoc network, please refer to the definition of a decentralized communication method based on wireless ad hoc network in the above text. The two have the same functions and effects, which will not be repeated here.
[0114] In summary, the present invention relates to the field of communication technology, and discloses a decentralized communication method and system based on wireless ad hoc networks, wherein the method includes: obtaining the address code of a node, and establishing a communication connection topology diagram according to the node and its address code; the address code includes an encrypted string and an address sending time, and the encrypted string is formed by encrypting the physical address of the node; generating a communication network of the node according to the address code of the node; obtaining the source node and the target node in the communication connection topology diagram, and generating a communication connection path according to the communication network of the source node and the communication network of the target node, so that the source node and the target node communicate through the communication connection path. The present invention creates a communication connection topology diagram in complex and limited spaces such as closed shielded spaces, high-altitude shaft spaces, and outdoor spaces through wireless ad hoc network technology, avoids dependence on relay equipment, realizes rapid transmission of large-capacity data, and reduces communication costs.
[0115] Each embodiment in this specification is described in a progressive manner, and the same or similar parts of each embodiment can be directly referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment. It should be noted that the technical features of the above-mentioned embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above-mentioned embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0116] The above-mentioned embodiments only express several preferred implementation modes of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for ordinary technicians in the technical field, several improvements and substitutions can be made without departing from the technical principles of the present invention, and these improvements and substitutions should also be regarded as the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be based on the protection scope of the claims.
Claims
1. A decentralized communication method based on wireless ad hoc network, characterized in that: include: Obtaining the address code of the node, and establishing a communication connection topology diagram according to the node and its address code; The address code includes an encrypted string and an address sending time, wherein the encrypted string is formed by encrypting the physical address of the node; Generating a communication network of the node according to the address code of the node; Acquire a source node and a target node in the communication connection topology diagram, and generate a communication connection path according to a communication network of the source node and a communication network of the target node, so that the source node and the target node communicate through the communication connection path; The step of obtaining the address code of the node and establishing a communication connection topology diagram according to the node and its address code includes: Each of the nodes collects address codes of adjacent nodes in real time and sends its own address code to the adjacent nodes; Each of the nodes determines the distance between itself and an adjacent node according to its own address code and the address code of the adjacent node; According to the distance between itself and the adjacent nodes, the adjacent nodes that meet the preset distance conditions are selected as communicable nodes and added to its own communication list; Connect each node to the communicable nodes in its communication list to obtain the communication connection topology diagram; The generating of the communication network of the node according to the address code of the node comprises: Select any node in the communication connection topology diagram as a basic node; Subtract the time when the base node receives the adjacent node address code from the time when the address in the adjacent node address code is sent to obtain a time difference; weighting the distance between the base node and the adjacent node by the time difference to obtain the communication quality of the adjacent node relative to the base node; Determining the node level of the adjacent nodes relative to the base node according to the communication quality and a preset quality interval, and connecting the adjacent nodes of the same level to obtain a communication network of the base node; Updating the basic nodes and constructing a communication network of the updated basic nodes until a communication network of all nodes is obtained; The communication network includes a primary communication network, a secondary communication network and a tertiary communication network; the nodes in the primary communication network are fast response nodes of the nodes belonging to the primary communication network, the nodes in the secondary communication network are medium-speed response nodes of the nodes belonging to the primary communication network, and the nodes in the tertiary communication network are low-speed response nodes of the nodes belonging to the primary communication network; The acquiring of the source node and the target node in the communication connection topology graph, and generating a communication connection path according to the communication network of the source node and the communication network of the target node, so that the source node and the target node communicate through the communication connection path, comprises: Acquire a source node and a target node in the communication connection topology diagram, and determine a positional relationship between the source node and the target node; If the target node is in the primary communication network of the source node, the two are directly connected for communication; If the target node is in the secondary communication network of the source node, the node with the shortest distance to the target node is selected from the primary communication network of the source node as a jumping node, and the node with the shortest distance to the target node is selected from the primary communication network of the jumping node as an updated jumping node, until the target node appears in the primary communication network of the updated jumping node, and multiple jumping nodes are connected to form a communication connection path; if the jumping nodes are more than the preset number of nodes and there are jumping nodes that are medium-speed response nodes and / or low-speed response nodes of the source node and / or the target node, the source node and the target node are directly connected for communication, otherwise the source node and the target node communicate through the communication connection path; If the target node is in the third-level communication network of the source node or is not in the communication network of the source node, the node with the shortest distance to the target node is selected from the first-level communication network of the source node as the jumping node, and the node with the shortest distance to the target node is selected from the first-level communication network of the jumping node as the updated jumping node, until the target node appears in the first-level communication network of the updated jumping node, and multiple jumping nodes are connected to form a communication connection path, so that the source node and the target node communicate through the communication connection path.
2. According to claim 1, a decentralized communication method based on wireless ad hoc network is characterized in that: Each of the nodes determines the distance between itself and an adjacent node according to its own address code and the address code of the adjacent node, including: The encrypted string in its own address code is compared with the encrypted string in the address code of the adjacent node, and the number of different characters in the corresponding position is used as the distance between itself and the adjacent node.
3. According to claim 1, a decentralized communication method based on wireless ad hoc network is characterized in that: The step of connecting each node to a communicable node in its communication list to obtain the communication connection topology diagram includes: Each of the nodes sends a connection request to the communicable nodes in its own communication list; The communicable node verifies the received connection request and determines whether the node sending the connection request is in its own communication list; If so, the communicative node responds to the connection request and establishes a connection with the node sending the connection request to obtain the communication connection topology diagram; if not, no response is given, so that the node sending the connection request removes the communicative nodes that have not responded within a preset time from its own communication list.
4. A decentralized communication system based on wireless ad hoc network, characterized in that: include: A topology map building module is used to obtain the address code of the node and establish a communication connection topology map according to the node and its address code; The address code includes an encrypted string and an address sending time, wherein the encrypted string is formed by encrypting the physical address of the node; A communication network generation module, used to generate a communication network of the node according to the address code of the node; A connection path generation module, used to obtain a source node and a target node in the communication connection topology diagram, and generate a communication connection path according to a communication network of the source node and a communication network of the target node, so that the source node and the target node communicate through the communication connection path; The topology map building module includes: An address code transceiver unit, used for each of the nodes to collect address codes of adjacent nodes in real time and send its own address code to the adjacent nodes; The node distance calculation unit is used for each node to determine the distance between itself and the adjacent node according to its own address code and the address code of the adjacent node; A communication list establishing unit, used to select adjacent nodes that meet preset distance conditions as communicable nodes and add them to its own communication list according to the distance between itself and the adjacent nodes; A communication node connection unit, used to connect each node to a communicable node in its communication list to obtain the communication connection topology diagram; The communication network generation module comprises: A basic node selection unit, used to select any node in the communication connection topology diagram as a basic node; A time difference calculation unit, used for subtracting the time when the base node receives the adjacent node address code from the address sending time in the adjacent node address code to obtain the time difference; a communication quality calculation unit, configured to weight the distance between the base node and the adjacent node by the time difference to obtain the communication quality of the adjacent node relative to the base node; A communication network construction unit, configured to determine the node level of the adjacent nodes relative to the base node according to the communication quality and a preset quality interval, and connect the adjacent nodes of the same level to obtain a communication network of the base node; A network construction iteration unit, used to update the basic nodes and construct a communication network of the updated basic nodes until a communication network of all nodes is obtained; The communication network includes a primary communication network, a secondary communication network and a tertiary communication network; the nodes in the primary communication network are fast response nodes of the nodes belonging to the primary communication network, the nodes in the secondary communication network are medium-speed response nodes of the nodes belonging to the primary communication network, and the nodes in the tertiary communication network are low-speed response nodes of the nodes belonging to the primary communication network; The connection path generation module comprises: Acquire a source node and a target node in the communication connection topology diagram, and determine a positional relationship between the source node and the target node; If the target node is in the primary communication network of the source node, the two are directly connected for communication; If the target node is in the secondary communication network of the source node, the node with the shortest distance to the target node is selected from the primary communication network of the source node as a jumping node, and the node with the shortest distance to the target node is selected from the primary communication network of the jumping node as an updated jumping node, until the target node appears in the primary communication network of the updated jumping node, and multiple jumping nodes are connected to form a communication connection path; if the jumping nodes are more than the preset number of nodes and there are jumping nodes that are medium-speed response nodes and / or low-speed response nodes of the source node and / or the target node, the source node and the target node are directly connected for communication, otherwise the source node and the target node communicate through the communication connection path; If the target node is in the third-level communication network of the source node or is not in the communication network of the source node, the node with the shortest distance to the target node is selected from the first-level communication network of the source node as the jumping node, and the node with the shortest distance to the target node is selected from the first-level communication network of the jumping node as the updated jumping node, until the target node appears in the first-level communication network of the updated jumping node, and multiple jumping nodes are connected to form a communication connection path, so that the source node and the target node communicate through the communication connection path.
Citation Information
Patent Citations
Communication method of wireless mesh ad hoc network
CN114786231A
Distributed routing protocol method suitable for large-scale unmanned aerial vehicle cluster network
CN116545923A
Decentralized ad hoc network method and device
CN116760762A
Network address field of a node in a meter reading wireless mesh network and related systems
JP2013503589A
