Optimize the Tree Routing Efficiency in Wireless Sensor Network by using Orphan Nodes
Ming-Hua Cheng, Wen-Shyang Hwang, Yan‐Jing Wu, Cheng‐Han Lin, Wenming Chen · 2019
Nowadays, wireless sensor networks (WSN) have been widely developed. The feature of WSN is that it supports the short-range and low-speed transmission as well as low-power consumption. ZigBee is a standard for WSN based on IEEE 802.15.4. Through connection, it will produce a tree topology and orphan nodes isolated from the network. During the transmission, tree routing is used to compare the location of nodes for relaying the data. As the network enlarge, the depth of the nodes increases. So does the frequency of the relay during transmission. Even though the distance between source and destination nodes is close, tree routing is still used because they are not located on the same branch. Too many times of relay waste the cost of route, which will influence the overall life cycle of nodes over a long period of time. In order to modify the problem of the relay caused by Zigbee, this paper proposed the using Orphan nodes to Improves the Tree Routing (OITR) mechanism. By the way of rejoining, the orphan node is joined in the connection with the allocation address proposed by this thesis. After the orphan node joining the network, the information of neighbor table is built by the periodically synchronous characteristics of Zigbee network. This enables the neighbor nodes to own each other's information. Through this way, the source node can be relayed to the destination node and the condition of too many times of relay will be improved.