TW201025919A - Centralized balanced-tree algorithm and dynamic planning data transmission method for wireless sensor - Google Patents

Abstract

Centralized balanced-tree algorithm and dynamic planning data transmission method for wireless sensor is described. First, it constructs the entire wireless sensor network to form a hierarchical structure, one by one, with first-order load-balancing algorithm. Next, selects a wireless sensor to act as a child node from the lowest level of the sensor nodes, then selects a proper wireless sensor, from the node that may link to the upper node, to act as a father node of the child node. Therefore, the child node can send the detected data to the first level wireless sensor, via the father node, and then via the gateway to return to the master-control station to form a tree network. Before returning data, evaluate all electricity quantity of the father node. If the electric quantity of the father node is less than the cross product of the max value of other father nodes and default weighted parameter of electric quantity, then select another father node according to the priority of the original first-order load-balancing algorithm. If not, the current father node are continuously selected as a return path to achieve purpose of load correction and the service life of the wireless sensor network system can be improved.

Description

201025919 j VI. Description of the Invention: [Technical Field] The present invention relates to a centralized balanced tree algorithm dynamic programming data transmission method for a wireless sensor, in particular, a preset in each wireless sensor node A power weight parameter, and then determine whether the currently determined parent node power is less than the product value of the maximum power value of the other parent node and the specified power weight parameter as a centralized balance of a wireless sensor based on whether the parent node is replaced Tree algorithm dynamic programming data transmission method. [Prior Art] As shown in Figure 1, it is a topology diagram of a general centralized wireless sensor network. The figure shows rush=1'2,3, (wind 2,3,..,,) After the wireless sensor node 2 of the wireless sensor coffee sensor network system (WSN) in the network is completed, the gateway device will return the current network topology to the main At the 3 end of the control platform, when receiving the network topology, the main control platform 3 calculates the optimal return path of each node 2 by using the Balanced Low-Latency Convergecast Tree (BLLCT) algorithm. And the first-order load balancing tree routing algorithm plans the path mode of each node 2 to the gateway 1 'Before assuming that the sensor node 2 doing the Dina needs to go through N jumps before sending the data to In the case of the gateway device, the connection formed by the jump is the path from the node 2 to the gateway 1. The jump of ^ times passes through W-1 nodes 2, and for a sensor node 2 located at φ, the node 2 that can serve as the next jump of the node 2 in the layer V-1 is Parent node (parentnode). For a parent node, the lower layer has a number of nodes 2 that can jump to the upper layer via the parent node, and these lower nodes are said to be the child nodes of the parent node. A node 2 located on the return path, in addition to forwarding the data of its child nodes, also needs to transfer the data of the child nodes of its child nodes, so the node 2 load is defined as all information to be transmitted via the node 2 The number of nodes plus the sum of the number of its own nodes. The communication link relationship between the upper and lower nodes 2 forms a very complex network topology. The first-order load balancing tree routing algorithm utilizes the priority of establishing connections, and the connection of the lowest level nodes is layer by layer. To plan the path of each sensor node 2 to the gateway 1. And the first-order load-balancing tree routing algorithm determines the priority of establishing connections between nodes based on the relationship between the load of node 2 and its upper and lower nodes. 201025919 The smoothness and priority of each line depends on the relevant scales. Jia Ping miscellaneous structure. As shown in Figure 2, it is the flow of the order-level load balancing tree routing method. The first-order load Ι〇Γϋ寅 algorithm mainly selects the node with the most A load from the lowest arm and the money. The node i (parent node) that selects the minimum load among the upper nodes that can be connected establishes the upper and lower node connection 2〇5, and the multiple points of the parent node, the parent node 1 with the smallest side load, which is the parent node i All the nodes that can be connected to the previous layer are planted with a minimum of 2〇6, and the upper one is selected.

^ The node lion 7 of the node point j with the smallest load can be connected. When the selection is completed, the upper and lower layer connection points 205 are established. By repeating the action, the connection between all the nodes in the bottom layer and the upper nodes can be completed. After the bottom layer is completed, and then the layers are up and down, the optimal path of each sensor node to the gateway can be established. . However, the 'Gu-order load balancing tree routing algorithm can plan the best path of the city detector node ^When there is no ___ secret (WSN) running number _, the remaining sensor node of the largest load must be less For other sensor nodes, if the data transmission is continued by the sensor node with the largest load, the power of the ❹m node must be recorded, and the entire wireless sensor network system cannot be completely transmitted. SUMMARY OF THE INVENTION The object of the present invention is to provide a wireless sense-based centralized balance tree algorithm dynamic programming data transmission method, which is to select a node after the traditional-order load balancing tree routing algorithm. Each parent node's remaining power determines whether to replace the return path to other parent nodes. The object of the present invention is to provide a centralized balanced tree algorithm dynamic planning data transmission method for a wireless sensor, which collects the remaining power data of each wireless sensor node by the gateway, when each wireless sensor node The upper parent node of the connectable communication can use the power information as the evaluation basis of the dynamic routing correction because the load is unbalanced, so as to replace the parent node with more communication and more power to reach the upper parent node of each node. load. After achieving the above-mentioned invention, the centralized balanced tree algorithm dynamic planning data of the wireless sensor 4 201025919, the tree algorithm is used to calibrate the optimal path of the 11-node optimal route of the road to the data collection and return Actions. In the return to the second shell:, _ when 'the need to add the remaining information of the sensor node itself to the data packet' enables the gateway to receive the sensing data of all nodes, but also to obtain the current ribs Remaining battery information. After the looper passes back the sensing data of all nodes to the main control platform, 'the dynamic correction method is used to plan the transmission path of all the sensor nodes in the next round; then the execution procedure of the re-parameter Ϊ=Γ method is as follows First, when a pre-set power right = two turns is given, the power is evaluated according to the power of all the parent nodes of the node: Re-parameter ^ The power is less than the other green power maximum and the specified power weight occurs, Bay =, node The parent node needs to be changed to other parent nodes; if there is a case where the parent node of the node carries the method of selecting the parent node in the balanced tree routing algorithm, the repair is selected to evaluate all the sensing records of each layer in the WSN system, that is, [Embodiment] Please refer to the circle shown in Figure 3 as a flow chart of the method for transmitting data of the wireless sensor of the present invention. The steps are as follows: Quiet Tree Wide Algorithm Dynamic Φ Open Platform with First-Order Balanced Tree Routing Algorithm The method performs network topology, so that the gateway device is divided into the parent node and the child node 'and is closest to == 301; and each node is set as the first layer node to form a first-order balanced tree network topology value. Two == in each A power consumption sensor node preset weighting parameter 'Chinese Cloth weight range of parameter values in the right amount. Between 1 and 302; all nodes of each layer will follow the planned path, collect data and return data to join the data packet, and also need to enclose the remaining power of the sensor node itself. When the gateway receives the sensing data of all the nodes, it can also obtain 5 201025919 to take the remaining power information of each node 3〇3; Step 4 · When the closed device returns the sensing data of all nodes After the main control platform, the power weight parameter of the sensor node and the node remaining in each backhaul are used as the basis for evaluating whether to convert the currently set parent node. The method is in the second:::: = For the capital, the current __, _ use the _ parent node for the relationship, the decision ==== followed by the previous point between the two points of the data returned to the second node for each transmission of N data 'to conduct a capital transmission road repair The Γ control platform can be set to perform the wireless sensing point data back state every N. ==== Ming wireless sensor's centralized balance tree algorithm _ a :r::r -, - , the power of node C is 7.8, the power of node d is 8 (^ is 6.5 ' _ the power is 8.3, η pre- Let's assume that the power weight parameter is 0.9. At each = point = node and point W and whether it is less than ======= the remaining capacity of the tank is 6.5 <8.3χ().9=7·47, thus, I The product value of the weight parameter, that is, the node a is smaller than the product value. Therefore, the master platform will pass through again: ==== 201025919 Parent nodes b, c, d re-select a node as the parent node of node 21. As shown in FIG. 4B, if the node a_remaining power shown in FIG. 4A is 76, the remaining power is greater than the multiplication 747, and therefore, the node 3 is continuously used as the parent node of the backhaul data. The wireless sense-centralized balanced tree algorithm dynamic programming data transmission method has the following advantages when compared with other conventional technologies: 1. The present invention can avoid node failure or other reasons by using path node confirmation. 2. The invention can prevent the underlying wireless sensing II point data from being returned to the gateway due to the exhaustion of the upper wireless sensor node energy, thereby prolonging the life of the overall wireless sensor network system. * _ The above detailed description is directed to one possible embodiment of the present invention The detailed description is not intended to limit the scope of the invention, and the equivalents of the embodiments of the invention should be included in the scope of the patents of the present invention. In summary, the case is not only The technical idea is indeed innovative, and it can enhance the above-mentioned multiple functions compared with the conventional articles. It should fully comply with the statutory invention patent requirements of novelty and progressiveness, and submit an application according to law. Please ask your bureau to approve the application for this invention patent. [Simplified diagram] Figure 1 is a schematic diagram of a conventional centralized wireless sensor network; Φ Figure 2 is a flow chart of a conventional first-order load balancing tree routing algorithm; The flowchart of the dynamic planning data transmission method of the centralized balanced tree algorithm of the wireless sensor of the present invention; and FIG. 4A and B are the dynamic routing of the dynamic balanced data transmission method of the centralized balanced tree algorithm of the wireless sensor of the present invention The correction algorithm is schematic. [Main component symbol description] 1 Gateway 2 Wireless sensor node 3 Master platform 21 Subnode a~d Parent node

Claims (1)

201025919 VII. Patent application scope: 1. A centralized balanced tree algorithm for wireless sensors. Dynamic planning data transmission methods mainly include: Step 1: County-to-wireless sensor network layer-by-layering, so that the master control platform can Performing the first network topology' and using the -order balanced algorithm to block the calculus of the data back path of each layer without the county node, so that each layer has no _ detector node to know the parent node of the upper layer data back to cause the gateway Under the jurisdiction of the device, a plurality of subtrees are formed, and each node that is closest to the closed channel and can communicate with the gateway is set as a first layer node to form a hierarchical tree topology; Step 2: A power weight parameter is preset in the wireless sensor node, so that when the master control platform receives the gateway backhaul data, the power weight parameter and the remaining power information of each sensor node can be known; Step 3: The product value obtained by multiplying the largest power of all the parent nodes by the power weight parameter is determined according to the product value to be greater than the current parent node power; Step 4: If the currently selected parent node is found, the remaining Electricity If it is smaller than the product of the maximum value of the other parent nodes and the preset electric weight parameter, the other parent node is selected according to the priority order of the county-level load balancing tree routing algorithm; Step 5: If the currently selected parent node is found If the remaining power is greater than the product of the maximum value of the other parent nodes and the preset weight parameter, the current parent node is selected as the return path. 2. The centralized balanced tree algorithm dynamic planning data transmission method of the wireless sensor described in claim i of the invention, wherein the power weight parameter is pre-set in each sensor node. 3. The centralized balance tree algorithm dynamic planning data transmission method of the wireless sensor described in claim 2 of the patent scope is set to a range of 0 to 1 for the power weight parameter value. 4. A method for dynamically planning data transmission of a centralized balanced tree algorithm of a wireless sensor as described in claim 1, wherein the sensing node can self-side its own remaining power, and when returning data, The remaining power is transferred back to the gateway. , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , j Remaining power, evaluate each node's next-re-transmission and its upper and lower layer data age ^, its towel type _ algorithm dynamic data 'perform-time data control 2 can set each wireless sensing node every N times For example, if the application is exclusive, the __ planning data transmission method is described in the item 1. The main control platform can set the correction of the data return path of the sensor node every N. Ruler,,, and deep 8·