Efficient Routing Tree Formation to Reduce Energy in Lightweight Routing in Wireless Sensor Networks.

Abstract- Wireless Sensor Network (WSNs) has many sensor nodes, each with communication and energy. In WSNs one or more events occur at a time. Instead of each event sending its data to the sink node, overlapping of paths is done in order to maximize the data aggregation. When two or more event occurs data aggregation is maximized but the performance of the network is less. There is no balance between data aggregation and energy of a sensor node. By just aggregating the data it will cause premature death of nodes which will lead to unstable network structure. Based on the problems, in this paper, a novel efficient routing tree formation algorithm for data aggregation is proposed to reduce energy. The algorithm maximizes the possible data aggregation by building a Hop-Tree and then updating the Hop-Tree. While building the Hop-Tree it first takes the local state of nodes and then maintains the Hop-Tree value to gain better adaptation. Then the algorithm compares with the new shortest path and also the aggregated path when two or more events occur, so that there is a load balance between the nodes and also the consumption of energy will be less. Thus the proposed systems shows that instead of aggregating the data without knowing how far the events are occurring,it checks for the shortest path by comparing with new route path and aggregated path,the one with less number of Hops to the sink is selected as an new path. Keywords—wireless sensor networks, hop-tree, cluster formation, data aggregation, energy balance. I