A wireless network networking method and wireless network structure
Through the tree-like wireless network networking method, the inefficiency and complex management problems caused by full connection of nodes in the existing wireless Mesh network are solved, low power consumption and ad hoc networking capabilities are achieved, and network coverage and spectrum resource utilization are improved. efficiency.
Patent Information
- Application Number
- CN202010499001.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-06-04
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2040-06-04
AI Technical Summary
The full connection of nodes in the existing wireless Mesh network topology causes inefficiency in network efficiency, oscillation in data transmission, complex routing management, and difficult to meet the needs of low power consumption and ad hoc networking.
Using a tree-like wireless network networking method, initiate connections through a network server, establish wireless connections of main nodes, child nodes, grandchild nodes, etc. step by step, form a tree-like structure, and optimize data transmission using dedicated channels and time slot allocation. Inter-data forwarding follows binary routing code rules.
It realizes a limited connection topology, avoids duplicate connections and data oscillation, improves network management simplicity and spectrum resource utilization, reduces node hardware costs and power consumption, and adapts to low-power and low-cost designs.
Smart Images

Figure CN113766602B_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of wireless communications, and in particular relates to a wireless network networking method and a wireless network structure. Background Art
[0002] Wireless Mesh Network, or "wireless mesh network", is a wireless multi-hop network. Wireless Mesh Network is a new network structure based on multi-hop routing and peer-to-peer network technology. Through the mutual cooperation between numerous wireless access points distributed in a mesh shape, it has the advantages of broadband, high speed and high spectrum efficiency, and has outstanding features such as dynamic self-organizing network, self-management and self-maintenance.
[0003] The advent of the 5G era covers eMBB, URLLC, and eMTC services in communications, among which IoT applications have exploded. Wireless Mesh Network is a highly reliable and wide-coverage WLAN network, and is a wireless regional network solution suitable for covering large open areas (including outdoor and indoor). Due to its good adaptability, network reliability, self-configuration capability, and flexible networking, Mesh Network is widely used in IoT such as intelligent transportation and Internet of Vehicles.
[0004] The traditional mesh network topology in the existing technology has some shortcomings, such as Figure 1 As shown in the figure, each node in the traditional mesh network topology is a relay node, which fully connects all surrounding nodes or more than 2 and less than a certain number of nodes to achieve network coverage of the locations that need to be deployed. Disadvantages: When the nodes are fully connected, invalid and repeated connections are inevitable, so the network efficiency is low, data transmission oscillation occurs, high requirements for routing management technology, and complex logic circuit design are required.
[0005] In view of the problems of low network efficiency in the existing technology, it is necessary to optimize and improve the network structure. Summary of the invention
[0006] In view of this, the technical problem to be solved by the present invention is to provide a low-power wireless network with a new topology structure to meet the needs of customers for low-power IoT networks, as a supplement to the existing IoT, to truly cover the three major scenarios of 5G and become a strong competitor of 3GPP. The networking process of IoT devices requires a self-organizing networking technology that does not require the intervention of base stations to enhance networking capabilities and environmental adaptability.
[0007] An embodiment of the present invention provides a wireless network networking method, including:
[0008] The network server (the initial master node of the network) initiates the connection and initiates the child node search through a dedicated channel.
[0009] The network master node searches, obtains one or two child nodes, and establishes a wireless connection with the child nodes;
[0010] The dedicated channel is used to establish a networking process. When the number of connected child nodes is less than 2, the master node periodically sends a listening signal on the dedicated channel. The nearby terminal receives the listening signal and becomes a child node of the master node through a response signal.
[0011] The child node continues searching to obtain one or two grandchild nodes, and the child node establishes a wireless connection with the grandchild nodes;
[0012] The grandchild node continues to search, obtains one or two subsequent nodes, and establishes a wireless connection with the subsequent nodes; in this way, the nodes in the predetermined area are connected together step by step to form a wireless network with a tree structure.
[0013] Preferably, each node performs a search including:
[0014] In a predetermined time period, a search frame (Search) is sent, and confirmation signals ACK fed back by other nodes are received. Then, two nodes are selected as child nodes according to the strength of each received confirmation signal ACK.
[0015] Among them, the search frame (Search) includes:
[0016] Preamble, frame type bit (ordertype), terminal ID number sending the frame (sourceID), transmission power (Gainlevel), time information of transmitting the frame, channel information (chID) and integrity verification bit.
[0017] Preferably, the networking method further comprises:
[0018] Each node in the tree-structured wireless network is assigned a time slot of a predetermined length to enable each node to transmit data. In particular, when the identity of the parent node and the child node changes, the time division switching is completed using different time slots of the communication cycle to ensure that the data is transmitted in the network in a pipelined manner. The corresponding time slots are called uplink time slots and downlink time slots.
[0019] The present invention provides a wireless network, including a main node, several child nodes, and a grandchild node, wherein the main node establishes a wireless connection with one or two child nodes; the child node establishes a wireless connection with one or two grandchild nodes; the grandchild node establishes a wireless connection with one or two subsequent nodes; and the nodes connected step by step in this way constitute a wireless network with a tree structure.
[0020] During data communication, each child node can send and receive data with the parent node, and the parent node can forward the communication between the two child nodes, thereby achieving the mesh network characteristics that each node in the network can reach. Each data frame contains the transmission data and a string of binary routing codes. Each node forwards data according to the lowest bit of the binary routing code. After forwarding, the binary routing code is shifted at the node. The number of bits of the routing code decreases by 1 each time it is transmitted, and the routing code is cleared when it reaches the destination. Each node is regarded as a binary unit, and the high and low bits of the 1-bit routing code represent the choice of the forked path. Whether the child node transmits data to the parent node or the parent node transmits data to the child node, the high and low bit routing selection rules are followed. For example, when the parent node generates a child node, it will number the child nodes as child node 0 and child node 1 according to the access order. Therefore, when the parent node sends data to the child node, if the lowest bit of the routing code is 0, the parent node sends the data to child node 0 when the downlink time slot comes; otherwise, the parent node sends data to child node 1. When a child node transmits data to a parent node and the parent node needs to forward the data, by default the routing code bit that the parent node transmits to the upper layer is low, and the routing code bit that is forwarded to another child node is high.
[0021] The beneficial effects achieved by the present invention are:
[0022] 1. This solution adopts a limited connection topology, avoiding the possibility of repeated connections and data oscillation in the traditional Mesh network topology.
[0023] 2. The binary tree network topology in this application has the same spatial coverage capability as the traditional Mesh network, can adapt to omnidirectional networking layout, and the connection logic of the binary tree is easier to manage.
[0024] 3. The Mesh topology of this solution is more economical in the use of spectrum resources and the algorithm design is simpler, which reduces the node hardware design cost and power consumption, thus meeting the design requirements of extremely low power consumption and extremely low cost.
[0025] 4. The time slot design of this solution can provide flexible communication interval arrangement to adapt to the compromise between data size and terminal low power consumption in application scenarios.
[0026] For the above and related purposes, one or more embodiments include features that will be described in detail below and particularly pointed out in the claims. The following description and the accompanying drawings describe certain exemplary aspects in detail, and are indicative of only some of the various ways in which the principles of the various embodiments may be employed. Other benefits and novel features will become apparent as the following detailed description is considered in conjunction with the accompanying drawings, and the disclosed embodiments are intended to include all such aspects and their equivalents. BRIEF DESCRIPTION OF THE DRAWINGS
[0027] Figure 1It is a schematic diagram of the traditional Mesh network topology structure provided by the present invention;
[0028] Figure 2 It is a flow chart of a wireless network networking method provided by the present invention;
[0029] Figure 3 This is a flow chart of a wireless network networking method provided by an embodiment of the present invention
[0030] Figure 4 is a schematic diagram of a wireless network architecture provided by an embodiment of the present invention;
[0031] Figure 5a and 5b A schematic diagram of the timing distribution of the wireless network networking process provided by the present invention;
[0032] Figure 6 This is a schematic diagram of wireless network data transmission provided by an embodiment of the present invention;
[0033] Figure 7 It is a schematic diagram of a connection state that may be formed by a wireless network networking provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0034] The following description and the accompanying drawings fully illustrate specific embodiments of the present invention so that those skilled in the art can practice them. Other embodiments may include structural, logical, electrical, process and other changes. The examples represent possible changes only. Unless explicitly required, separate components and functions are optional, and the order of operation may vary. Parts and features of some embodiments may be included in or replace parts and features of other embodiments. The scope of the embodiments of the present invention includes the entire scope of the claims, and all available equivalents of the claims. In this article, these embodiments of the present invention may be represented individually or collectively by the term "invention", which is only for convenience, and if more than one invention is actually disclosed, it is not intended to automatically limit the scope of the application to any single invention or inventive concept.
[0035] like Figure 2 As shown, a wireless network networking method of the present invention includes:
[0036] S201, the network master node searches, obtains one or two child nodes, and establishes a wireless connection with the child nodes;
[0037] S202, the child node continues to search and obtains one or two grandchild nodes, and the child node establishes a wireless connection with the grandchild nodes;
[0038] S203, the grandchild node continues searching, obtains one or two subsequent nodes, and establishes a wireless connection with the subsequent nodes; in this way, the nodes in the predetermined area are connected together step by step to form a wireless network with a tree structure.
[0039] Each node searches, including:
[0040] In a predetermined time period, a search frame (Search) is sent, and confirmation signals ACK fed back by other nodes are received. Then, two nodes are selected as child nodes according to the strength of each received confirmation signal ACK.
[0041] In a specific embodiment, the search frame (Search) generally includes:
[0042] Preamble, frame type bit (ordertype), terminal ID number sending the frame (sourceID), transmission power (Gainlevel), time information of transmitting the frame, channel information (chID) and integrity verification bit.
[0043] The wireless network networking method further comprises:
[0044] Each node in the tree-structured wireless network is allocated a time slot of a predetermined length so that each node can perform data transmission.
[0045] like Figure 3 As shown, the wireless network networking method provided in the embodiment of the present invention includes:
[0046] S301, a network master node (usually a network device, such as a network server) initiates networking to connect to a child node (such as a mobile terminal), and the network master node, as a parent node, establishes a connection link with one or two child nodes;
[0047] Specifically, a dedicated channel is set up for the network master node to establish a connection with the nearby nodes. The dedicated channel is used to establish a networking process. The network server initiates the networking and searches for nearby mobile terminals (child nodes). The network master node sends a listening signal through the dedicated channel to establish a communication connection with the nearby mobile terminals (child nodes).
[0048] Specifically, the network master node sends a listening signal through the dedicated channel, and the nearby terminals (child nodes) are all terminals that can receive the listening signal;
[0049] S302, the nearby child node receives the monitoring signal and sends a response signal to the network master node through the dedicated channel;
[0050] The response signal includes the ID number of the child node.
[0051] S303, the network master node receives a response signal sent by a nearby terminal in a pre-allocated time period, and selects a child node according to the signal strength of the response signal; and selects two terminals with the strongest signal strength as child nodes;
[0052] Each node has one and only one parent node, and each node has no more than two child nodes.
[0053] S304, the network master node acts as a parent node and sends a confirmation signal to the selected child node;
[0054] The confirmation signal includes the ID number of the sub-node terminal.
[0055] S305: The selected child node receives a confirmation signal and confirms that it has become a child node of the network master node.
[0056] These child nodes act as parent nodes and continue to form a network.
[0057] The entire network is organized in a tree structure.
[0058] It should be noted that each terminal has one and only one parent node, and each terminal as a parent node derives at most two transmission paths and has no more than two child nodes.
[0059] For each node, it is both a child node and a parent node. Figure 4 As shown, node 3 is the child node of node 2. Node 3 is networked as a parent node. Node 3 has two child nodes: node 4 and node 5. Node 6 and node 8 are only child nodes of the upper level, not parent nodes.
[0060] Figure 5a and 5b A schematic diagram of timing distribution of a wireless network networking process provided by the present invention shows the search and connection process of a self-organizing network.
[0061] like Figure 5a As shown in the figure, the communication time of each node is arranged periodically. The cycle in the example here is the pre-allocated duration. Each cycle has three communication windows, which are arranged for the parent node, the primary child node, and the secondary child node. The time interval arrangement ensures that there will be no channel interference between adjacent nodes on the network.
[0062] like Figure 5a As shown in , when searching for child nodes as a parent node for the first time, two child nodes are obtained, and then the time windows of the primary child node and the secondary child node are directly arranged to enter the normal communication mode. Figure 5b As shown, in the first time window as a parent node, only one child node ACK is obtained, and then a search frame (Search frame) is initiated in the secondary node cycle of each cycle to search.
[0063] Search process: The parent node uses a dedicated channel in the selected time window. For example, CH3 is used in one embodiment of the present invention. Each node has only three channels available, and the Search channel is a channel common to all nodes and is set to CH3. After the nodes establish communication, the communication channel used switches between CH1 and CH2. For example, within the same cycle, a node uses CH1 to communicate with its parent node, and this node uses CH2 to communicate with its child node. Conversely, if CH2 is used to communicate with the parent node, CH1 is used to communicate with the child node. The specific choice is set when the communication network is established from the root node, and is arranged through the networking process. A Search frame is sent, and the frame format is as follows:
[0064] Preamble indicates the preamble sequence, ordertype indicates the frame type (here is the Search type code), sourceID indicates the terminal ID number that sends this frame, Gainlevel indicates the current transmission power level, time indicates the timing of the current transmission of this frame (which can be expressed in cycle timing), ch indicates the channel code (corresponding to the carrier setting of the RF front end), and MIC is a 4-bit word for integrity verification.
[0065] The description table of Ordertype is as follows:
[0066] ordertype Function 000 Search frame format 001 ACK frame format 010 Sondata subnode transmission frame 011 Data frame format 100 REF 101 REF 110 REF 111 REF
[0067] There are three possible results after a Search frame is sent: (1) no ACK signal; (2) only one ACK signal; (3) two or more ACK signals.
[0068] For the child nodes that can receive the Search frame, they are always in the rx open state after power-on and listen to the Search signal. Once the Search signal is received, the rx is closed and a random number between 1 and 5 is generated locally as the time window number for sending ACK. The sending time point is one of the five time windows. The ACK frame is sent using the ch3 channel, and the ACK frame structure is as follows:
[0069] In the above frame structure, ordertype is ACK encoding, targetID indicates the ID of the parent node, sourceID indicates the ID of the child node, RSSI indicates the strength of the Search signal received by the child node, and MIC indicates the signal integrity verification word.
[0070] The parent node turns on RX after sending Search and waits for a window length of 5 to receive ACK.
[0071] In case 1, when the parent node initiates the Search process for the first time, if no ACK signal is received after three rounds of Search process, the Search process is terminated and the Search process is started again when the next cycle time window arrives, but the Search is not initiated again at this time.
[0072] In case 2, only one ACK signal is received, the parent node turns off RX, turns on TX and uses the channel represented by the ch code given in Search (ch1 / ch2 channel), and sends the global setting data transmitted from the parent node of the parent node to the master child node. This frame is called a Sondata frame:
[0073] Among them, ordertype is the Sondata type, TargetID is the child node ID, sourceID is the parent node ID, Time is the current time count value, ch is the channel that the child node of the next cycle should use to communicate with the current parent node, starttime indicates the time offset for starting the next communication, period indicates the period for setting the next communication, and append indicates the continuation mark. Serverdata is the global setting data transmitted from the server, and MIC indicates the signal integrity verification word.
[0074] After that, the parent node initiates the Search process again after 1 / 2 cycle. If ACK is received, it will be added as the second child node. Otherwise, the Search process will be initiated in this time window in each cycle. This makes it convenient for the network to add nodes at any time and fully utilize the branch structure network.
[0075] In case 3, the parent node determines the first two terminal nodes with the largest RSSI as the primary and secondary nodes according to the RSSI of the received ACK signal. Then, the parent node sends Sondata to the primary and secondary nodes. After half a cycle, the parent node opens the secondary node time window and sends Sondata to the secondary node. In this way, communication is performed periodically.
[0076] Figure 6 The present invention provides a wireless network data transmission schematic diagram.
[0077] After all network nodes have established connection links, the communication process (and data transmission) is carried out. Figure 6 , as follows:
[0078] For any terminal performing data transmission, it can only send or receive through one channel at a time, that is, the same terminal can only act as a sender or a receiver at the same time, realizing point-to-point data transmission;
[0079] Only two channels are opened and used for data transmission at the same time; the two channels are the first channel CH1 and the second channel CH2;
[0080] Furthermore, at the same time, any two adjacent point-to-point connections use different channels, and the two point-to-point connections are communications between two terminals; at different times, the two terminals establish point-to-point connections and use the first channel and the second channel alternately. Figure 6 As shown, there are 5 terminals in the system. At time T1, terminal 1 and terminal 2 transmit data through channel CH1; terminals 2 and 3 do not communicate; terminal 3 and terminal 4 transmit data through channel CH2; terminal 4 and terminal 5 do not communicate; at the same time, the connection established between terminal 1 and terminal 2 and the connection established between terminal 3 and terminal 4 are adjacent point-to-point connections, and the adjacent point-to-point connections use different channels for communication to avoid possible channel interference.
[0081] At time T2, terminal 1 and terminal 2 do not communicate; terminal 2 and terminal 3 transmit data through channel CH1; terminal 3 and terminal 4 do not communicate; terminal 4 and terminal 5 transmit data through channel CH2;
[0082] At time T3, terminal 1 and terminal 2 perform data transmission via channel CH2; terminal 2 and terminal 3 do not communicate; terminal 3 and terminal 4 perform data transmission via channel CH1; terminal 4 and terminal 5 do not communicate;
[0083] At time T4, terminal 1 and terminal 2 do not communicate; terminal 2 and terminal 3 transmit data through channel CH2; terminal 3 and terminal 4 do not communicate; terminal 4 and terminal 5 transmit data through channel CH1;
[0084] Taking the communication between terminal 1 and terminal 2 as an example, at time T1, terminal 1 and terminal 2 transmit data through channel CH1; at time T2, terminal 1 and terminal 2 do not communicate; at time T3, terminal 1 and terminal 2 transmit data through channel CH2; at time T4, terminal 1 and terminal 2 do not communicate; at time T5, terminal 1 and terminal 2 transmit data through channel CH1; at different times, the point-to-point communication connection of the two terminals alternately uses the first channel and the second channel.
[0085] It should be noted that the data transmitted from the network server to the last child node needs to be relayed by the intermediate parent node.
[0086] A wireless network provided by the present invention includes a master node, a plurality of child nodes, and a grandchild node;
[0087] The master node establishes a wireless connection with one or two of the sub-nodes;
[0088] The child node establishes a wireless connection with the one or two grandchild nodes;
[0089] The grandchild node establishes a wireless connection with one or two subsequent nodes;
[0090] The nodes connected step by step in this way form a wireless network with a tree structure.
[0091] Figure 7 It is a schematic diagram of a network topology structure that may be formed by a wireless network networking provided by an embodiment of the present invention.
[0092] The technical solution provided by the present invention increases the logical settings of the parent node and the child node, defines the transmission status of each node, and enables the network to automatically grow into a wireless network covering all nodes through the binary tree networking method. It has the advantages of automatic networking layout, and the limited connection topology avoids invalid and repeated connections while realizing omnidirectional networking; the communication process is point-to-point data transmission, which is suitable for occasions that do not require high communication time but have high requirements on hardware costs.
[0093] Compared with the solutions in the prior art, the present invention has the following advantages:
[0094] 1. The present invention adopts a limited connection topology to avoid the possibility of repeated connection and data oscillation in the traditional Mesh network topology.
[0095] 2. The binary tree network topology in the present invention has the same spatial coverage capability as the traditional Mesh network, can adapt to omnidirectional networking layout, and the connection logic of the binary tree is easier to manage.
[0096] 3. The network topology structure provided by the present invention is more economical in the use of spectrum resources and has a simpler algorithm design, which reduces the node hardware design cost and power consumption, thereby meeting the design requirements of extremely low power consumption and extremely low cost.
[0097] It will be appreciated by those skilled in the art that the various exemplary method steps and device units described herein in conjunction with the disclosed embodiments can all be implemented in electronic hardware, software, or a combination of the two. In order to clearly illustrate the interchangeability between hardware and software, the various exemplary steps and units are generally described in the form of their functionality. Whether this functionality is implemented in hardware or software depends on the design constraints implemented by the specific application and the entire system. Those skilled in the art can implement the described functionality in a variety of ways for each specific application, but the results of this implementation should not be interpreted as departing from the scope of the present invention.
[0098] The steps of the method described in conjunction with the above disclosed embodiments may be directly embodied as hardware, a software module executed by a processor, or a combination of the two. The software module may exist in a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. A typical storage medium is coupled to a processor so that the processor can read information from the storage medium and write information to the storage medium. In an alternative embodiment, the storage medium is an integral part of the processor. The processor and the storage medium may exist in an ASIC. The ASIC may exist in a user station. In an alternative embodiment, the processor and the storage medium may exist as discrete components in a user station.
[0099] According to the disclosed embodiments, it is possible for those skilled in the art to implement or use the present invention. It is obvious to those skilled in the art that various modifications of these embodiments are possible, and the general principles defined herein can also be applied to other embodiments without departing from the scope and gist of the present invention. The embodiments described above are only preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.
Claims
1. A wireless network networking method, comprising: a network master node searches for a child node and establishes a wireless connection with the child node; the child node continues to search for a grandchild node; and the child node establishes a wireless connection with the grandchild node, characterized in that: When searching for child nodes as a parent node for the first time, the parent node turns on RX after sending the search frame and waits for a window length of 5 to receive ACK; In the case of no ACK signal after the search frame is sent: when the parent node initiates the search process for the first time, if no ACK signal is received after three rounds of search, the search process is terminated and the search process is restarted when the next cycle time window arrives, and the search is not repeated at this time; In the case of an ACK signal after the search frame is sent: an ACK signal is received, the parent node turns off RX, turns on the channel used by TX, and sends the global setting data transmitted from the parent node of the parent node to the primary child node. This frame is called a Sondata frame. After that, the parent node initiates the search process again after 1 / 2 cycle. If ACK is obtained, it will join as a secondary child node. Otherwise, the Search process will be initiated in this time window in each cycle in the future. When there are more than or equal to 2 ACK signals after the search frame is sent: the parent node determines the first two terminal nodes with larger RSSI as the primary and secondary child nodes according to the RSSI size of the received ACK signal, and sends the Sondata frame to the primary and secondary child nodes. After half a cycle, the secondary child node time window is opened to send the Sondata frame to the secondary child node. After all network nodes have established connection links, the communication process and data transmission are carried out, as follows: For any terminal performing data transmission, it can only send or receive through one channel at a time, that is, the same terminal can only act as a sender or a receiver at the same time, realizing point-to-point data transmission; Only two channels are opened and used for data transmission at the same time; the two channels are the first channel CH1 and the second channel CH2; At the same time, any two adjacent point-to-point connections use different channels. The two point-to-point connections are communications between two terminals. At different times, two terminals establish point-to-point connections and alternately use the first channel and the second channel.
