D. Ramya KrishnaM.Kamaraju
Gudlavalleru Engineering College, India

Wireless Sensor Networks (WSN) refers to a gathering of spatially scattered and committed sensors used for to sense the environmental and physical conditions. The WSN collects and aggregates the data from all the sensor nodes and send it to the sink. But the delay required for Radio transmission of collected information to the sink is very high. If the delay of the network is high then the power consumption may be high it leads to decrease in node life time. So to avoid that problem the delay of the network must be kept at minimum in order to increase the node lifetime. If number of computations required for data aggregation process are low then automatically the delay of the network is also very less. At present a carry look ahead adder with parallel prefix algorithm for data aggregation is used but with this approach is having the disadvantages like high latency and memory. To avoid all those disadvantages a novel tree approach is proposed. The expected results are reduced in latency that is it increase the speed of data aggregation process in Wireless sensor nodes along with less memory requirement for that Tree structure.

Nodes, Wireless Sensor Networks (WSN), Folded tree, Wallace Tree