Delay-minimized Energy-efficient Data Aggregation in Wireless Sensor Networks

Published: 2012, Last Modified: 02 Nov 2024CyberC 2012EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Data aggregation is a fundamental problem in wireless sensor networks that has attracted great attention in recent years. To design a data aggregation scheme, delay and energy efficiencies are two crucial issues that require much consideration. In this paper, we propose a distributed, energy-efficient algorithm for collecting data from all sensor nodes with minimum latency called Delay-minimized Energy-efficient Data Aggregation algorithm (DEDA). The DEDA algorithm minimizes data aggregation latency by building a delay-efficient network structure. At the same time, it also considers the distances between network nodes for saving sensor transmission power and network energy. Energy consumption is also well-balanced between sensors to achieve an acceptable network lifetime. The simulation results show that the scheme could significantly decrease data aggregation delay and obtain a reasonable network lifetime compared with other approaches.
Loading