A self-organizing network method and self-organizing network system
By constructing an intermediate network in the tree network to form a mesh structure, and uniformly configure the network timestamp of the node, the data transmission delay and response time difference caused by the increase in the number of network equipment in the existing technology have been solved. Communication and response.
Patent Information
- Application Number
- CN202111020643.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-09-01
- Publication Date
- 2025-01-28
- Estimated Expiration
- 2041-09-01
AI Technical Summary
In the existing networking technology, as the number of networking devices increases and the area expands, the data transmission delay caused by the tree architecture increases, and the uncertain delay of wireless signals leads to a difference in device response time, affecting the user experience.
By constructing an intermediate network through the same or cross -level of the tree network, a mesh structure is formed, the data transmission path is shortened, and the network timestamp of the network is unified configuration and the synchronous node to reduce the response time difference.
Effectively shorten the communication distance between the tree network at all levels, speed up the communication speed, reduce the time difference between the node response to the same control command, and optimize the user experience.
Smart Images

Figure CN113747473B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of self-organizing networks, and in particular to a self-organizing network method and a self-organizing network system. Background Art
[0002] The bluebee private networking technology launched by Pairlink can support one-to-many and many-to-many transmission and communication capabilities of Bluetooth nodes. The networking (Mesh) technology will be more suitable for building automation, wireless sensor networks and other IoT solutions that require tens of thousands of devices to transmit and transfer information in a safe, reliable and stable environment.
[0003] In current networking technology, as the number of networking devices increases and the networking area expands, the original tree-like architecture will lead to longer routing paths, which will ultimately result in increased data transmission delays.
[0004] In addition, after the group control wireless signal is sent from the transmitter (switch, remote control, mobile phone APP, etc.), due to various uncertain delays in the transmission of the system, such as retransmission caused by different link quality, waiting caused by data accumulation, and different forwarding times, the time required for the signal to reach the controlled terminal is different. This brings about an asynchrony problem. For example, when lighting up the lights in the entire room, when the time difference between the lights receiving the signal exceeds the reaction ability of the human eye, there will be a problem of lighting up in sequence that is visible to the naked eye, which will lead to a relatively poor user experience.
[0005] There is an urgent need to propose a technology that can shorten the communication path between network nodes and reduce the time difference between receiving signals between nodes to optimize the user experience. Summary of the invention
[0006] The object of the present invention is to provide a method and system for ad hoc networking to overcome the above problems.
[0007] In order to solve the above technical problems, a method for self-organizing network is provided below, comprising the following steps:
[0008] Providing nodes, wherein the nodes can be connected to each other and can at least form a tree-like network with a top-bottom structure;
[0009] An intermediate network is constructed between the same level or across levels of the tree network formed by the nodes to connect two nodes of the same level or two nodes across levels in the tree network.
[0010] Optionally, the tree network includes a root node, an intermediate node and a leaf node, the intermediate node is arranged between the root node and the leaf node, and the root node and the intermediate node, as well as the intermediate node and the leaf node, can communicate with each other.
[0011] Optionally, when constructing an intermediate network between the same level or across levels of the tree network formed by the nodes, at least the following is included:
[0012] An intermediate network is formed between the root node and any leaf node in the tree network, or
[0013] An intermediate network is formed between the intermediate nodes in the tree network and the leaf nodes of other intermediate nodes, or
[0014] An intermediate network is formed between any two intermediate nodes of the tree network, or
[0015] An intermediate network is formed between any two leaf nodes of the tree network.
[0016] Optionally, before constructing an intermediate network between the same level or across levels of the tree network formed by the nodes, the following steps are also included:
[0017] Construct signal area;
[0018] An intermediate network is formed for the nodes in the tree network within the signal area according to a preset rule.
[0019] Optionally, after the nodes are interconnected and can form the tree network, a network timestamp is configured for the nodes in the signal area.
[0020] Optionally, after configuring the network timestamp for the nodes in the signal area, the following steps are also included:
[0021] Each node broadcasts its own network timestamp to other nodes;
[0022] Each node receives the network timestamp broadcasted by other nodes;
[0023] Each node detects whether the received network timestamp includes a first network timestamp, and the first network timestamp is ahead of the network timestamp of the node itself;
[0024] If yes, the network timestamp of the node is controlled to be synchronized with the first network timestamp.
[0025] Optionally, when two nodes exchange data, the data sent includes their own network timestamp.
[0026] Optionally, after the node receives the data, the following steps are further included:
[0027] Compare the node's own network timestamp with the network timestamp in the received data;
[0028] If the network timestamp in the data is earlier than the network timestamp of the node itself, delaying the response to the data according to the time difference between the network timestamp in the received data and the network timestamp of the node itself;
[0029] If the network timestamp in the data is behind the network timestamp of the node itself, the data is responded to.
[0030] The following also provides a self-organizing network system, including:
[0031] A node, capable of implementing the self-organizing network method, and comprising at least a Bluetooth node;
[0032] The beacon base is used to form a signal area and network the nodes within the signal area.
[0033] The self-organizing network method and the self-organizing network system in the present application form the intermediate network between the same level or across levels of the tree network, so that the communication distance between the levels of the tree network can be greatly shortened and the communication speed can be accelerated. In addition, since the network timestamps of all nodes are uniformly operated and unified to the most advanced network timestamp, the probability of time difference when each node responds to the same control command is reduced, which can optimize the user experience when people use the network for communication. BRIEF DESCRIPTION OF THE DRAWINGS
[0034] Figure 1 The figure is a flowchart of the steps of the self-organizing network method in a specific implementation manner.
[0035] Figure 2 It is a schematic diagram of the structure of a tree network in the prior art.
[0036] Figure 3 This is a schematic diagram of the structure of the tree network after adding the intermediate network in this application. DETAILED DESCRIPTION
[0037] The following is a further detailed description of a self-organizing network method and a self-organizing network system proposed by the present invention in conjunction with the accompanying drawings and specific implementation methods.
[0038] See also Figures 1 to 3 ,in Figure 1 A schematic diagram of the steps of the self-organizing network method in a specific implementation manner is shown. Figure 2 It is a schematic diagram of the structure of a tree network in the prior art. Figure 3 This is a schematic diagram of the structure of the tree network after adding the intermediate network in this application.
[0039] In this specific implementation, a method for self-organizing a network is provided, comprising the following steps:
[0040] Step S101: providing nodes, wherein the nodes can be connected to each other and can at least form a tree network with a top-bottom structure;
[0041] See also Figure 2 ,exist Figure 2 In the embodiment shown, when the nodes are networked to form a tree network, there is only one path for data from one node to reach another node, which will greatly extend the data transmission path between nodes. Figure 2 In the ad hoc network shown, when node A transmits data to node B, it must be forwarded five times and pass through point C before reaching point B.
[0042] Step S102: constructing an intermediate network between the same level or across levels of the tree network formed by the nodes to connect two nodes of the same level or two nodes across levels in the tree network.
[0043] See also Figure 3 ,exist Figure 3 In the illustrated embodiment, the network structure formed by the node networking can be developed from a tree-like structure to a mesh-like structure. There are multiple paths for data from one node to reach another node, and the best path can be calculated through an algorithm.
[0044] In this embodiment, from Figure 3 Node A of the ad hoc network shown transmits data to node B. The data can pass through point D and reach point B after three forwardings.
[0045] When the number of networking devices increases and the networking area expands, the original tree-like architecture of this self-organizing networking method will lead to a longer routing path, which will eventually result in an increase in data transmission delay.
[0046] The self-organizing network method in this embodiment can develop links horizontally based on the original network, select the best shortcut through the algorithm, and develop the tree structure into a mesh structure, which can effectively shorten the number of data forwarding times and is compatible with the tree network. This means that the iteration of existing products based on this networking technology can be seamlessly connected.
[0047] In this embodiment, in addition to being able to connect to each other to form a tree network, each node can also enable a beacon function, which means that the device using the self-organizing network method described in this embodiment can enable the beacon function without adding any hardware, such as indoor positioning, APP application wake-up, electronic fence, advertising push and other applications based on beacon technology.
[0048] exist Figure 2 , Figure 3In the embodiment shown, the nodes in the ad hoc network can be acquired by the controller 103, and thus controlled by the controller 103. The controller includes a smart terminal such as a smart phone, and a remote controller. The nodes can also broadcast signals to the outside, and the broadcast signals can be acquired by the external sensor 104. Figure 2 , Figure 3 In the illustrated embodiment, the controller 103 is shown as a square block, and the sensor 104 is shown as a triangle block. The sensor 104 can receive the data broadcasted by the node.
[0049] The tree network includes a root node 100, an intermediate node 101 and a leaf node 102. The intermediate node 101 is arranged between the root node 100 and the leaf node 102. The root node 100 and the intermediate node 101, as well as the intermediate node 101 and the leaf node 102 can communicate with each other.
[0050] When an intermediate network is constructed between the same level or across levels of the tree network formed by the nodes, it at least includes: forming an intermediate network between the root node 100 in the tree network and any leaf node 102, so that the root node 100 in the tree network can communicate directly with the leaf node 102 without going through the intermediate node 101 set in the middle, thereby shortening the communication distance.
[0051] When an intermediate network is constructed between the same level or across levels of the tree network formed by the nodes, it also includes at least: forming an intermediate network between the intermediate node 101 in the tree network and the leaf node 102 of other intermediate nodes 101, so that the intermediate node 101 in the tree network can communicate directly with the leaf node 102 of another intermediate node 101 without the help of the root node 100 or another intermediate node 101, thereby shortening the communication distance.
[0052] When constructing an intermediate network between the same level or across levels of the tree network formed by the nodes, it also includes at least: forming an intermediate network between any two intermediate nodes 101 in the tree network, so that the intermediate nodes 101 of the same level in the tree network can communicate directly with another intermediate node 101 without the help of the root node 100, thereby shortening the communication distance.
[0053] When an intermediate network is constructed between the same level or across levels of the tree network formed by the nodes, it also includes at least: forming an intermediate network between any two leaf nodes 102 of the tree network, so that leaf nodes 102 of the same level in the tree network can communicate directly with another leaf node 102 without the help of intermediate nodes 101 and root nodes 100, thereby shortening the communication distance.
[0054] In this embodiment, before constructing an intermediate network between the same level or across levels of the tree network formed by the nodes, the following steps are also included: constructing a signal area; and forming an intermediate network for the nodes in the tree network within the signal area according to a preset rule. Only nodes within the same signal area can form a network.
[0055] In this embodiment, the signal area is established by a beacon base, and a routing table is stored in the beacon base. When an intermediate network needs to be set up, the addresses of the two nodes where the intermediate network needs to be set up are updated to the routing table. The routing table records the communication path between the A node and the B node at the same level or across levels in the tree network.
[0056] Messages sent via the beacon base or messages sent via nodes in the signal area constructed by the beacon base can be communicated directly between nodes of the same level or across levels in the tree network based on the updated routing table, thereby shortening the communication distance. In addition, in one embodiment, the routing table is shared within the network formed by the nodes, and when sending messages through the nodes in the network, the shortest path can be calculated based on the routing table.
[0057] After the nodes are connected to each other and formed into the tree network, network timestamps are configured for the nodes in the signal area.
[0058] Specifically, after the network node starts working, a low-frequency independent synchronous broadcast signal will be turned on. The broadcast signal carries the network ID and the synchronous network timestamp. The network timestamp carried in each broadcast signal is real-time.
[0059] Since all devices in the network independently time the synchronized network timestamp, and the clocks they rely on have certain accuracy errors, errors will occur after a long period of timing. Therefore, after configuring the network timestamp for the nodes in the signal area, the following steps are also included: each node broadcasts its own network timestamp to the remaining nodes; each node receives the network timestamp broadcasted by the remaining nodes; each node detects whether the received network timestamp contains a first network timestamp, which is ahead of the node's own network timestamp; if so, the node's network timestamp is controlled to be synchronized with the first network timestamp.
[0060] The above mechanism can quickly synchronize the network timestamp across the entire network after power is turned on. The end result is that each device has a very close network timestamp, which can be controlled within 50 milliseconds.
[0061] Due to the above-mentioned function of synchronizing the network timestamp, the signal sender can directly synchronize the network timestamp with the connected device after entering the network, and then independently time it, and keep synchronizing its own network timestamp regularly during the connection process.
[0062] In this embodiment, when data is exchanged between two nodes, the sent data includes its own network timestamp.
[0063] After the node receives the data, the following steps are also included: comparing the node's own network timestamp with the network timestamp in the received data; if the network timestamp in the data is ahead of the node's own network timestamp, delaying the response to the data according to the time difference between the network timestamp in the received data and the node's own network timestamp; if the network timestamp in the data is behind the node's own network timestamp, responding to the data.
[0064] When each node in the network receives the same signal, the response time difference of each node can be greatly reduced. When each node is applied to a lighting environment, each light source is configured with the node and is controlled to light up by the group control signal received by the node. At this time, the time difference of each node responding to and lighting up can be controlled within a range invisible to the naked eye, so that even if the group control signal does not arrive at the nodes installed on each light source at the same time, the nodes installed on each light source can respond to the group control signal synchronously, control the synchronous lighting of each light source, and optimize the user experience.
[0065] The following also provides a self-organizing network system, including: the node, which can implement the self-organizing network method in the above embodiment and at least includes a Bluetooth node; a beacon base, which is used to form a signal area and network the nodes in the signal area.
[0066] The Bluetooth nodes at least include Bluetooth nodes that comply with Bluetooth core 4.2 and above specifications.
[0067] The self-organizing network method and the self-organizing network system in the present application form the intermediate network between the same level or across levels of the tree network, so that the communication distance between the levels of the tree network can be greatly shortened and the communication speed can be accelerated. In addition, since the network timestamps of all nodes are uniformly operated and unified to the most advanced network timestamp, the probability of time difference when each node responds to the same control command is reduced.
[0068] The above is only a preferred embodiment of the present invention and does not limit the present invention in any form. Although the present invention has been disclosed as above in the preferred embodiment, it is not used to limit the present invention. Any technician familiar with the art can make many possible changes and modifications to the technical solution of the present invention by using the methods and technical contents disclosed above without departing from the scope of the technical solution of the present invention, or modify it into an equivalent embodiment of equivalent changes. Therefore, any simple modification, equivalent change and modification made to the above embodiments according to the technical essence of the present invention without departing from the content of the technical solution of the present invention still falls within the scope of protection of the technical solution of the present invention.
[0069] The above is only a preferred embodiment of the present invention. It should be pointed out that ordinary technicians in this technical field can make several improvements and modifications without departing from the principle of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
Claims
1. A method for self-organizing a network, characterized in that: The following steps are involved: Providing nodes, wherein the nodes can be connected to each other and can at least form a tree-like network with a top-bottom structure; An intermediate network is constructed between the same level or across levels of the tree network formed by the nodes to connect two nodes of the same level or two nodes across levels in the tree network; After the nodes are connected to each other and formed into the tree network, a network timestamp is configured for the nodes in the signal area; After configuring the network timestamp for the nodes in the signal area, the following steps are also included: Each node broadcasts its own network timestamp to other nodes; Each node receives the network timestamp broadcasted by other nodes; Each node detects whether the received network timestamp includes a first network timestamp, and the first network timestamp is ahead of the network timestamp of the node itself; If yes, controlling the network timestamp of the node to be synchronized with the first network timestamp; When two nodes interact with each other, the data sent contains their own network timestamp; After the node receives the data, the following steps are also included: Compare the node's own network timestamp with the network timestamp in the received data; If the network timestamp in the data is earlier than the network timestamp of the node itself, delaying the response to the data according to the time difference between the network timestamp in the received data and the network timestamp of the node itself; If the network timestamp in the data is behind the network timestamp of the node itself, the data is responded to.
2. The method for self-organizing network according to claim 1, characterized in that: The tree network includes a root node, an intermediate node and a leaf node. The intermediate node is arranged between the root node and the leaf node. The root node and the intermediate node, as well as the intermediate node and the leaf node can communicate with each other.
3. A method for self-organizing network according to claim 2, characterized in that: When constructing an intermediate network between the same level or across levels of the tree network formed by the nodes, it at least includes: An intermediate network is formed between the root node and any leaf node in the tree network, or An intermediate network is formed between the intermediate nodes in the tree network and the leaf nodes of other intermediate nodes, or An intermediate network is formed between any two intermediate nodes of the tree network, or An intermediate network is formed between any two leaf nodes of the tree network.
4. The method for self-organizing network according to claim 1, characterized in that: Before constructing an intermediate network between the same level or across levels of the tree network formed by the nodes, the following steps are also included: Construct signal area; An intermediate network is formed for the nodes in the tree network within the signal area according to a preset rule.
5. A self-organizing network system, characterized in that: A method for implementing the self-organizing network described in any one of claims 1 to 4, comprising: The nodes at least include Bluetooth nodes; The beacon base is used to form a signal area and network the nodes within the signal area.
Citation Information
Patent Citations
Multi-jump wireless self-organizing network construction method based on partition tree
CN101197748A
Fast routing protocol of wireless sensor network
CN101420445A
Wireless sensor network address allocation mechanism
CN101420463A
Predictive overlay network architecture
CN110915168A