DocumentCode
2576169
Title
Delay-minimized Energy-efficient Data Aggregation in Wireless Sensor Networks
Author
Le, Huu Nghia ; Zalyubovskiy, Vyacheslav ; Choo, Hyunseung
Author_Institution
Coll. of Inf. & Commun. Eng., Sungkyunkwan Univ., Suwon, South Korea
fYear
2012
fDate
10-12 Oct. 2012
Firstpage
401
Lastpage
407
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.
Keywords
data analysis; telecommunication computing; wireless sensor networks; DEDA algorithm; delay-minimized energy-efficient data aggregation; energy consumption; latency minimization; network energy; network nodes; sensor nodes; sensor transmission power; wireless sensor networks; Buildings; Clustering algorithms; Delay; Distributed databases; Energy consumption; Protocols; Wireless sensor networks; data aggregation; delay-constrained; energy-efficient; wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2012 International Conference on
Conference_Location
Sanya
Print_ISBN
978-1-4673-2624-7
Type
conf
DOI
10.1109/CyberC.2012.73
Filename
6385000
Link To Document