Decentralized ad hoc network communication method and system

Abstract

The invention belongs to the technical field of wireless communication. According to the decentralized ad hoc network communication method and system, during data transmission, an upper-level node broadcasts data, and a receiving node firstly judges the data integrity and whether the same networking exists or not; if yes, comparing the packet header target identification code and the frame number of the current data with the packet header target identification code and the frame number of the cache data, discarding if the data are consistent, and storing if the data are not consistent; and finally, judging whether the target identification code is self or not, if so, completing communication, otherwise, modifying the sending node identification code to be self and continuing to broadcast the relay until the data is transmitted to the target node. The problems that in the prior art, a gateway is high in cost, insufficient in coverage range, prone to being affected by gateway faults and difficult in field deployment are solved, after the multiple LoRa nodes are simply configured, decentralized networking can be achieved, unicast and broadcast functions are achieved, automatic relay is supported, and large-range remote communication in a wide-area scene can be achieved.

Description

Technical Field

[0001] This invention relates to the field of wireless communication technology, specifically to a decentralized self-organizing network communication method and system. Background Technology

[0002] The statements in this section are merely background information related to the present invention and do not necessarily constitute prior art.

[0003] Among common wireless networking solutions, traditional short-range wireless communication methods such as FSK, Bluetooth, Zigbee, and Wi-Fi, while offering fast transmission speeds, generally suffer from drawbacks in networking schemes like centralized AP networking, AC+AP networking, and Mesh roaming networking. These limitations result in short transmission distances and small coverage areas. Achieving large-area coverage necessitates increasing base station density, significantly raising construction costs. In contrast, among long-range wireless technologies like NB-IoT, LoRa, and FLRC, LoRa technology stands out for its long range, interference resistance, operator independence, and decent transmission speeds, making it a significant advantage in wide-area wireless networking scenarios.

[0004] However, common LoRa networking solutions on the market, such as LoRa WAN and LoRa private protocol networking, are generally star topologies. They require LoRa gateways for unified data forwarding, which are easily limited by the gateway's coverage, performance, and cost. They cannot be effectively applied in wide-area scenarios without operator base stations, such as deserts, mountains, grasslands, and seas. Moreover, existing solutions also have problems such as difficulties in on-site deployment and the risk of the entire communication network being paralyzed due to gateway damage. Summary of the Invention

[0005] To address the problems of high gateway costs, insufficient coverage, susceptibility to gateway failures, and difficulties in on-site deployment in existing technologies, this invention provides a decentralized self-organizing network communication method and system. After simple configuration, multiple LoRa nodes can achieve decentralized networking, have unicast and broadcast functions, support automatic relay, and enable large-scale remote communication in wide-area scenarios.

[0006] To achieve the above objectives, the present invention adopts the following technical solution: In a first aspect, the present invention provides a decentralized self-organizing network communication method.

[0007] A decentralized self-organizing network communication method is applied to the receiving node, where nodes within the same network communicate via broadcast, and includes the following process: Determine the integrity of the received current data and whether it is in the same network as the previous data sending node. If the current data is complete and in the same network, then determine whether there is cached data. If cached data exists, the target identifier and frame sequence number in the header of the current data are compared with the target identifier and frame sequence number in the header of the cached data. If they match, the current data is discarded; if they do not match, the current data is added as cached data and stored in the receiving node, and it is determined whether the target identifier in the data is its own identifier. If the identifier is the same as the user's own identifier, then communication is complete; otherwise, the identifier of the previous data sending node is changed to the user's own identifier, and data is forwarded again in broadcast form.

[0008] In one implementation of the first aspect of the present invention, if there is no cached data, it is directly determined whether the target identifier code in the data is its own identifier code. If it is its own identifier code, the communication is completed; if it is not its own identifier code, the identifier code of the previous level data sending node is modified to its own identifier code, and the data is forwarded in the form of broadcast.

[0009] In one implementation of the first aspect of the present invention, if the current data is incomplete, or if the receiving node and the source node are not in the same network, the current data is discarded.

[0010] In one implementation of the first aspect of the present invention, a random delay time is added when forwarding the current data; and before forwarding the current data, it is checked and confirmed whether the current communication channel is occupied.

[0011] Secondly, the present invention provides a decentralized self-organizing network communication system.

[0012] A decentralized self-organizing network communication system is applied to receiving nodes, where nodes within the same network communicate via broadcast, including: The data compliance judgment unit is configured to: judge the integrity of the received current data and whether it is in the same network as the previous level data sending node; if the current data is complete and in the same network, then judge whether there is cached data. The data cache comparison unit is configured to: if cached data exists, compare the target identifier and frame sequence number in the header of the current data with the target identifier and frame sequence number in the header of the cached data; if they match, discard the current data; if they do not match, store the current data as new cached data in the receiving node, and determine whether the target identifier in the data is its own identifier. The data forwarding processing unit is configured such that: if the identifier is its own identifier, the communication is complete; if it is not its own identifier, the identifier of the previous data sending node is modified to its own identifier, and data forwarding continues in broadcast form.

[0013] Thirdly, the present invention provides a decentralized self-organizing network communication system.

[0014] A decentralized self-organizing network communication system includes multiple networks, each network includes multiple nodes, and the nodes in the same network communicate in a broadcast manner. Each node has reserved cache space, and the cache space can store multiple cached data. The upstream data sending node broadcasts the current data. The receiving node determines the integrity of the current data and whether it is in the same network as the upstream data sending node based on the network identifier. If the current data is complete and in the same network, the receiving node determines whether there is cached data. If cached data exists, the target identifier and frame sequence number in the header of the current data are compared with the target identifier and frame sequence number in the header of the cached data. If they match, the current data is discarded. If they do not match, the current data is added as cached data and stored in the receiving node. The node then determines whether the target identifier in the data is its own identifier. If the identifier is the same as the target identifier, the communication is complete; otherwise, the identifier of the previous data sending node is changed to the target identifier, and the relay is continued in broadcast form until the data is transmitted to the target node corresponding to the target identifier.

[0015] In one implementation of the third aspect of the present invention, if there is no cached data, it is directly determined whether the target identifier code in the data is its own identifier code. If it is its own identifier code, the communication is completed; if it is not its own identifier code, the identifier code of the previous level data sending node is modified to its own identifier code, and the data is forwarded in the form of broadcast.

[0016] In one implementation of the third aspect of the present invention, if the current data is incomplete, or if the receiving node and the source node are not in the same network, the current data is discarded.

[0017] In one implementation of the third aspect of the present invention, a random delay time is added when forwarding the current data; and before forwarding the current data, it is checked and confirmed whether the current communication channel is occupied.

[0018] Fourthly, the present invention provides a node device, comprising: a processor and a computer-readable storage medium; A processor, adapted to execute computer programs; A computer-readable storage medium storing a computer program, which, when executed by the processor, implements the decentralized self-organizing network communication method of the first aspect of the present invention.

[0019] Compared with the prior art, the beneficial effects of the present invention are: Since the solution of this invention does not require a network entry process or a communication connection link, and the nodes do not need to record information of other devices, theoretically there is no limit to the number of network devices. However, depending on factors such as actual communication speed, signal interference, and node location distribution, it is estimated that the number of nodes installed in a single network can reach 20 to 100, which can ensure communication speed while retaining the advantages of LoRa long-distance transmission.

[0020] This invention improves data transmission distance by forwarding data between multiple relay nodes, thereby multiplying the overall coverage area of ​​the network while keeping the transmission distance of a single node unchanged. Combined with the long-distance communication advantage of LoRa communication itself, the coverage area of ​​a single network is expected to reach 10-50 square kilometers.

[0021] This invention uses a network identifier code to ensure that multiple networks within the same area do not interfere with each other. The parameter configuration of this invention is simple; only the network identifier code and conventional LoRa parameters need to be configured to quickly build a network communication environment. Adding new nodes and removing old nodes are simple operations, making it easy to expand and maintain the network.

[0022] Since there are no gateway devices or connection link restrictions, this invention can find the data transmission path on its own when broadcasting data, which improves the resilience of the network. When a node fails or moves, there is no need to reorganize the network and it will not cause the entire network to be paralyzed.

[0023] Advantages of additional aspects of the invention 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 the invention. Attached Figure Description

[0024] The accompanying drawings, which form part of this invention, are used to provide a further understanding of the invention. The illustrative embodiments of the invention and their descriptions are used to explain the invention and do not constitute an improper limitation of the invention.

[0025] Figure 1 A schematic diagram of node broadcast transmission provided as an exemplary embodiment of the present invention; Figure 2 A schematic diagram of a relay transmission path and redundant data transmission provided as an exemplary embodiment of the present invention; Figure 3 A schematic diagram of a broadcast data processing flow provided as an exemplary embodiment of the present invention; Figure 4 A schematic diagram of a decentralized self-organizing network communication system provided as an exemplary embodiment of the present invention; Figure 5 A schematic diagram of a decentralized self-organizing network communication system applied to a receiving node, provided as an exemplary embodiment of the present invention; Figure 6 This is a schematic diagram of a node device provided as an exemplary embodiment of the present invention. Detailed Implementation

[0026] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0027] It should be noted that the following detailed descriptions are exemplary and intended to provide further illustration of the invention. Unless otherwise specified, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains.

[0028] This invention proposes a decentralized self-organizing network communication system based on LoRa technology, enabling communication over a wide area without operator base stations or gateways. After simple configuration, multiple LoRa nodes can achieve decentralized networking, possessing unicast and broadcast functions, supporting automatic relay, and enabling large-scale remote communication in wide-area scenarios. It is mainly designed for wide-area environments without operator base stations, such as deserts, mountains, grasslands, and seas, and can be applied to scenarios with low data volume or low real-time requirements, such as environmental monitoring, disaster early warning, and large-scale remote control. It can meet the requirements of rapid networking, wide coverage, high fault resistance, and low maintenance cost.

[0029] Unlike gateway networking, this invention uses a decentralized approach to networking. Unlike Wi-Fi or Bluetooth MESH communication, there is no fixed connection between devices. Data communication within the network is broadcast (the specific communication method will be detailed later). You only need to fill in the correct network ID (i.e., network identifier) ​​and node parameters to broadcast within the group. No network entry operation is required, and you can communicate directly within the network.

[0030] In this invention, the data format transmitted between nodes is shown in Table 1.

[0031] Table 1: Data Format.

[0032]

[0033] In this invention, the network ID is used to distinguish different network environments. Devices with the same network ID are considered to be in the same network, and data with different network numbers are not processed. For communication between nodes in the same network, in addition to the LoRa conventional radio frequency parameters (bandwidth, spreading factor, etc.) being the same, the network ID must also be the same in order to communicate.

[0034] In this invention, a node ID (i.e., node identification code) is set for each node, which is the address of each node in the current network. During data communication, the source node ID is the ID of the sending device itself, and the target ID is the ID of the node that needs to receive the data. Setting the target ID to 0xFFFF is for broadcast transmission.

[0035] Each node sends the data in broadcast format according to the data format specified in Table 1, such as... Figure 1 As shown, the receiving node determines whether the target ID in the data is its own ID. If it is not its own ID, it continues to broadcast and send data, thus realizing the data relay function. When relaying, the source node ID is changed to its own node ID. If the target ID is its own ID, broadcasting or relaying will no longer be performed, and the current communication ends.

[0036] Since communication and relay between nodes are all conducted via broadcast, a large amount of data will inevitably be transmitted between nodes, such as... Figure 2 As shown by the direction line in the middle, this will inevitably lead to a large amount of redundant data transmission (the direction line marked with an ×), which is very likely to cause interference with the same frequency signal when transmitting data. Therefore, it is necessary to reduce the amount of redundant data and improve the anti-interference capability of the same frequency.

[0037] To achieve the above objectives, in this invention, cache space should be reserved within each node. The number of cache entries can be determined based on the device's memory size. Preferably, the minimum number of cache entries is 30 or more (other numbers can be used in other implementations, but at least one cached data entry must be available). Figure 3 As shown, when a node receives data, it first verifies the integrity of the current data packet and whether the network ID is under the same network according to the verification rules. Then, it compares the target ID and frame sequence number in the header of the current data packet with the target ID and frame sequence number in the header of the cached data packet to determine whether duplicate data has been received. Duplicate data (i.e., the judgment is consistent) is directly discarded without processing or caching. If it is new data (i.e., the judgment is inconsistent), the header information of this data packet is recorded in the cache, and it is determined whether the target ID in the header of the current data packet is the ID of this node. If it is, the data can be retrieved normally for application layer processing. If it is not the ID of this node, the current data is rebroadcast and sent until the target node corresponding to the target ID receives the data.

[0038] This invention uses the Channel Activity Detection (CAD) mechanism unique to LoRa technology for LBT (Listen Before Talk) detection, confirming whether the current channel is occupied before each node sends data. Simultaneously, a random delay of 5ms-30ms is added before relay nodes forward data, which also prevents multiple relay nodes from forwarding data simultaneously.

[0039] In summary, this invention adopts a decentralized networking approach, eliminating the need for a central node or gateway device, network entry procedures, and connection links. Intra-network communication is achieved directly through a pre-configured network ID and device ID. This invention does not specify the direction of relay forwarding, has no fixed hop count limit or hop direction, and uses broadcast for free-diffusion data transmission between nodes. This invention distinguishes between duplicate broadcast data by comparing the current data packet header with the source node ID and frame sequence number in the cached record, reducing redundant data transmission. This invention utilizes LoRa Channel Activity Detection (CAD) technology to monitor channel activity before data transmission (LBT), and, combined with the random delay time of the relay, solves the problem of co-channel interference during intra-network data communication.

[0040] Optionally, in other implementations, by increasing the number of LoRa channels, adding data types or transmission directions, and modifying LoRa communication parameters (such as SF, BW, and CR), data of different types or transmission directions can be distributed to different channels and with different parameter configurations for transmission. This can optimize data relay efficiency, further reduce the transmission of redundant data, and reduce co-channel interference within the network. By adding a fast reply function, fast reply is achieved on known communication paths. For data of the fast reply type, relay nodes that have cached the same frame sequence number packet header can directly send the reply data to the designated node or relay node without requiring other nodes to continue broadcasting, thus reducing the impact on the overall communication efficiency within the network.

[0041] Based on the aforementioned decentralized self-organizing network communication system, this implementation also proposes a decentralized self-organizing network communication method, which can be applied independently to the receiving node, such as... Figure 4 As shown, the process includes the following: S401: Determine the integrity of the received current data and whether it is in the same network as the previous level data sending node (if the receiving node is a second level node, then the previous level data sending node is the source node; if the receiving node is a node after the second level, then the previous level data sending node is the relay node forwarding the current data). If the current data is complete and in the same network, then determine whether there is cached data. S402: If cached data exists, compare the target identifier and frame sequence number in the header of the current data with the target identifier and frame sequence number in the header of the cached data. If they match, discard the current data. If they do not match, store the current data as new cached data in the receiving node and determine whether the target identifier in the data is its own identifier. S403: If it is the self-identifier, then communication is complete; if it is not the self-identifier, then the identifier of the previous data sending node is modified to the self-identifier, and data is forwarded in broadcast form.

[0042] Furthermore, Figure 5 A decentralized self-organizing network communication system applied to receiving nodes is shown, comprising: The data compliance judgment unit 501 is configured to: judge the integrity of the received current data and whether it is in the same network as the previous level data sending node; if the current data is complete and in the same network, then judge whether there is cached data. The data cache comparison unit 502 is configured to: if cached data exists, compare the target identifier and frame sequence number in the header of the current data with the target identifier and frame sequence number in the header of the cached data; if they match, discard the current data; if they do not match, store the current data as new cached data in the receiving node, and determine whether the target identifier in the data is its own identifier. The data forwarding processing unit 503 is configured such that: if the identifier is its own identifier, the communication is complete; if it is not its own identifier, the identifier of the previous data sending node is modified to its own identifier, and the data is forwarded in broadcast form.

[0043] It is understood that the aforementioned units can be individually or entirely merged into one or more other units, or some of the units can be further divided into multiple functionally smaller units. This achieves the same operation without affecting the technical effects of the embodiments of this application. The aforementioned units are based on logical functional division. In practical applications, the function of one unit can be implemented by multiple units, or the function of multiple units can be implemented by one unit. In other embodiments of this application, the system may also include other units. In practical applications, these functions can also be implemented with the assistance of other units, and can be implemented collaboratively by multiple units.

[0044] According to another embodiment of this application, the system described in this embodiment can be constructed by running a computer program (including program code) capable of performing the steps involved in the corresponding method of the present invention on a general-purpose computing device, such as a computer, which includes processing elements and storage elements such as a central processing unit (CPU), random access memory (RAM), and read-only memory (ROM). The computer program can be recorded on, for example, a computer-readable recording medium, loaded into the aforementioned computing device through the computer-readable recording medium, and run therein.

[0045] Figure 6 A node device is shown, which includes a processor 601, a communication interface 602, and a computer-readable storage medium 603. The processor 601, communication interface 602, and computer-readable storage medium 603 can be connected via a bus or other means.

[0046] The communication interface 602 is used to receive and send data. The computer-readable storage medium 603 can be stored in the memory of the electronic device. The computer-readable storage medium 603 is used to store computer programs, which include program instructions. The processor 601 is used to execute the program instructions stored in the computer-readable storage medium 603.

[0047] The processor 601 is the computing and control core of an electronic device. It is suitable for implementing one or more instructions, specifically for loading and executing one or more instructions to achieve the corresponding method flow or corresponding function.

[0048] The processor 601 is configured to perform the following process: Determine the integrity of the received current data and whether it is in the same network as the previous data sending node. If the current data is complete and in the same network, then determine whether there is cached data. If cached data exists, the target identifier and frame sequence number in the header of the current data are compared with the target identifier and frame sequence number in the header of the cached data. If they match, the current data is discarded; if they do not match, the current data is added as cached data and stored in the receiving node, and it is determined whether the target identifier in the data is its own identifier. If the identifier is the same as the user's own identifier, then communication is complete; otherwise, the identifier of the previous data sending node is changed to the user's own identifier, and data is forwarded again in broadcast form.

[0049] This invention also provides a computer-readable storage medium, which is a memory device in an electronic device for storing programs and data. It is understood that the computer-readable storage medium here may include both built-in storage media in the electronic device and extended storage media supported by the electronic device. The computer-readable storage medium provides storage space for storing the processing system of the electronic device.

[0050] Furthermore, this storage space also contains one or more instructions suitable for loading and execution by the processor. These instructions can be one or more computer programs (including program code). It should be noted that the computer-readable storage medium here can be a high-speed RAM memory; alternatively, it can also be at least one computer-readable storage medium located remotely from the aforementioned processor.

[0051] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed in this application can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0052] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented in software, it can be implemented, in whole or in part, as a computer program product. A computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the flow or function according to the embodiments of this application is generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in or transmitted through a computer-readable storage medium. The computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic cable, digital cable) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that a computer can access or a data processing device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid-state drive), etc.

[0053] The above description is merely a preferred embodiment of the present invention and is not intended to limit the invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A decentralized self-organizing network communication method, characterized in that, Applied to receiving nodes, where nodes within the same network communicate via broadcast, the process includes the following: Determine the integrity of the received current data and whether it is in the same network as the previous data sending node. If the current data is complete and in the same network, then determine whether there is cached data. If cached data exists, the target identifier and frame sequence number in the header of the current data are compared with the target identifier and frame sequence number in the header of the cached data. If they match, the current data is discarded; if they do not match, the current data is added as cached data and stored in the receiving node, and it is determined whether the target identifier in the data is its own identifier. If the identifier is the same as the user's own identifier, then communication is complete; otherwise, the identifier of the previous data sending node is changed to the user's own identifier, and data is forwarded again in broadcast form.

2. The decentralized self-organizing network communication method as described in claim 1, characterized in that, If no cached data exists, it directly checks whether the target identifier in the data is its own identifier. If it is its own identifier, the communication is complete; otherwise, it modifies the identifier of the previous data sending node to its own identifier and continues to forward the data in the form of broadcast.

3. The decentralized self-organizing network communication method as described in claim 1 or 2, characterized in that, If the current data is incomplete, or if the receiving node and the source node are not in the same network, the current data will be discarded.

4. The decentralized self-organizing network communication method as described in claim 1 or 2, characterized in that, Add a random delay time when forwarding the current data; and check and confirm whether the current communication channel is occupied before forwarding the current data.

5. A decentralized self-organizing network communication system, characterized in that, Applied to receiving nodes, nodes within the same network communicate using broadcast communication, including: The data compliance judgment unit is configured to: judge the integrity of the received current data and whether it is in the same network as the previous level data sending node; if the current data is complete and in the same network, then judge whether there is cached data. The data cache comparison unit is configured to: if cached data exists, compare the target identifier and frame sequence number in the header of the current data with the target identifier and frame sequence number in the header of the cached data; if they match, discard the current data; if they do not match, store the current data as new cached data in the receiving node, and determine whether the target identifier in the data is its own identifier. The data forwarding processing unit is configured such that: if the identifier is its own identifier, the communication is complete; if it is not its own identifier, the identifier of the previous data sending node is modified to its own identifier, and data forwarding continues in broadcast form.

6. A decentralized self-organizing network communication system, characterized in that, It includes multiple networks, each network has an independent identification code, each network includes multiple nodes, the nodes under the same network communicate in a broadcast manner, each node has reserved cache space, and the cache space can store multiple cache data; The upstream data sending node broadcasts the current data. The receiving node determines the integrity of the current data and whether it is in the same network as the upstream data sending node based on the network identifier. If the current data is complete and in the same network, the receiving node determines whether there is cached data. If cached data exists, the target identifier and frame sequence number in the header of the current data are compared with the target identifier and frame sequence number in the header of the cached data. If they match, the current data is discarded. If they do not match, the current data is added as cached data and stored in the receiving node. The node then determines whether the target identifier in the data is its own identifier. If the identifier is the same as the target identifier, the communication is complete; otherwise, the identifier of the previous data sending node is changed to the target identifier, and the relay is continued in broadcast form until the data is transmitted to the target node corresponding to the target identifier.

7. The decentralized self-organizing network communication system as described in claim 6, characterized in that, If no cached data exists, it directly checks whether the target identifier in the data is its own identifier. If it is its own identifier, the communication is complete; otherwise, it modifies the identifier of the previous data sending node to its own identifier and continues to forward the data in the form of broadcast.

8. The decentralized self-organizing network communication system as described in claim 6 or 7, characterized in that, If the current data is incomplete, or if the receiving node and the source node are not in the same network, the current data will be discarded.

9. The decentralized self-organizing network communication system as described in claim 6 or 7, characterized in that, Add a random delay time when forwarding the current data; and check and confirm whether the current communication channel is occupied before forwarding the current data.

10. A node device, characterized in that, include: Processor and computer-readable storage media; A processor, adapted to execute computer programs; A computer-readable storage medium storing a computer program, which, when executed by the processor, implements the decentralized self-organizing network communication method as described in any one of claims 1 to 4.

Images