Publication

Abstract : Wireless Sensor Networks (WSNs) have already emerged as an efficient method to collect data from harsh and human-not-reachable environments. They are employed in many delay-constrained applications where the data collected from the network is analyzed to give timely critical warnings. Such systems need to complete data aggregation and analysis with in minimum time. This research paper is concerned with the design of Multi Level and Two Level Balanced Tree WSN. This research proves that configuration plays a vital role in data aggregation delay, node failure, power optimization and network ifetime when designing a Tree WSN. This paper deals with a method to calculate the overall time for data aggregation in hierarchical network like balanced tree. Our simulation results analyze balanced multi level tree WSN and balanced two level tree WSN on number of computations needed to complete each process and tolerance of node failures. These Balanced configuration leads to less data aggregation delay. The study also deals with an interesting relation between node failure and data aggregation delay in balanced multi level tree WSN.