Title :
An Improved Method of Constructing a Data Aggregation Tree in Wireless Sensor Networks
Author :
Bing-Hong Liu ; Ying-Hong Jhuang ; Li-Ping Tung ; Jyun-Yu Jhang
Author_Institution :
Dept. of Electron. Eng., Nat. Kaohsiung Univ. of Appl. Sci., Kaohsiung, Taiwan
Abstract :
With the rapid application development for wireless sensor networks, effective information collection methods are becoming increasingly emphasized. the effectiveness of data aggregation is mainly determined by the routing structure while tree is an important structure for data aggregation. Many researchers have studied the problem of how to construct a routing tree in a wireless sensor network with relay nodes so that the total transmission and reception energy cost consumed by all sensors is minimized, the so-called Minimum Energy-Cost Aggregation Tree with Relay Nodes problem. in this paper, we propose an improved method to reconstruct a routing tree so that the total energy cost can be reduced. Using simulation, we demonstrate that a shortest path routing tree applied with our proposed Reconstruction algorithm could have lower total energy cost than the original one.
Keywords :
telecommunication network routing; wireless sensor networks; data aggregation tree construction method; information collection methods; minimum energy-cost aggregation tree; reception energy cost; reconstruction algorithm; relay node problem; routing structure; shortest path routing tree; wireless sensor networks; Approximation algorithms; Clustering algorithms; Reconstruction algorithms; Relays; Routing; Vegetation; Wireless sensor networks; algorithm; data aggregation; routing tree; wireless sensor network;
Conference_Titel :
Genetic and Evolutionary Computing (ICGEC), 2012 Sixth International Conference on
Conference_Location :
Kitakushu
Print_ISBN :
978-1-4673-2138-9
DOI :
10.1109/ICGEC.2012.53