Delay Efficient Distributed Data Aggregation Algorithm in Wireless Sensor Networks

In wireless sensor networks data aggregation is a very important one and at the same time the aggregation should be energy efficient and a lesser amount of delay. To solve the problem the authors propose Delay Efficient distributed Data Aggregation (DEDA) Scheduling Algorithm for Wireless Sensor Network (WSN) to handle the delay and energy tradeoff in the process of aggregation using the timeout concept. In this paper, they are building the aggregated tree. After building the aggregation tree the Distributed Data Aggregation Scheduling algorithm to achieve the optimized energy efficiency and delay aware data aggregation. Decision Making Unit (DMU) has been used to handle energy and delay trade off. The DMU will control the tradeoff between energy and delay by generating the timeout values.

Provided by: International Journal of Computer Applications Topic: Mobility Date Added: May 2013 Format: PDF

Find By Topic