Study on Application Balanced Tree Algorithm to Wireless Sensor Network System

The applications of wireless sensor network (WSN) in many fields are limited due to insufficient of battery lifetime. In previous studies, a number of routing algorithms have been proposed to prolong the lifetime of WSN system. We found some drawbacks of balanced low-latency convergecast tree (BLLCT) algorithm while applying it to real-world application. To overcome the problems in BLLCT algorithm, this study proposed static and dynamic fixing schemes to prolong the lifetime of WSN system. In the experimental results, the proposed schemes can extend the lifetime of WSN.or every sub-tree constructed by BLLCT algorithm, static fixing scheme balances the loading of first-order nodes by diverting the nodes in max-loading sub-tree to the other sub-trees. Dynamic fixing scheme combines the BLLCT algorithm with consideration of remaining power of node’s parent node. The dynamic fixing scheme decides whether the node needs to change its parent node or not. entralized and distributed routing algorithms are also proposed in this study. These algorithms are suitable for many applications. The proposed distributed routing algorithm is applied to a WSN system that operates in one hop or two hops mode. he experimental results show that the network size of the WSN system affects the lifetime of WSN system slightly if the sensing nodes are deployed in a region with same area. The WSN’s lifetime using centralized routing algorithm is shortened because sink nodes need to collect large amount of information from the entire network. Thus, the centralized routing algorithm is more suitable for smaller networks, and the distributed routing algorithm is suitable for larger networks.