%0 Journal Article
%T AEESPAN: Automata Based Energy Efficient Spanning Tree for Data Aggregation in Wireless Sensor Networks
%A Zahra ESKANDARI
%A Mohammad Hossien YAGHMAEE
%J Wireless Sensor Network
%P 316-323
%@ 1945-3086
%D 2009
%I Scientific Research Publishing
%R 10.4236/wsn.2009.14039
%X In Wireless Sensor Networks (WSNs), sensor nodes are developed densely. They have limit processing ca-pability and low power resources. Thus, energy is one of most important constraints in these networks. In some applications of sensor networks, sensor nodes sense data from the environment periodically and trans-mit these data to sink node. In order to decrease energy consumption and so, increase network¡¯s lifetime, volume of transmitted data should be decreased. A solution, which is suggested, is aggregation. In aggrega-tion mechanisms, the nodes aggregate received data and send aggregated result instead of raw data to sink, so, the volume of the transmitted data is decreased. Aggregation algorithms should construct aggregation tree and transmit data to sink based on this tree. In this paper, we propose an automaton based algorithm to con-struct aggregation tree by using energy and distance parameters. Automaton is a decision-making machine that is able-to-learn. Since network¡¯s topology is dynamic, algorithm should construct aggregation tree peri-odically. In order to aware nodes of topology and so, select optimal path, routing packets must be flooded in entire network that led to high energy consumption. By using automaton machine which is in interaction with environment, we solve this problem based on automat learning. By using this strategy, aggregation tree is reconstructed locally, that result in decreasing energy consumption. Simulation results show that the pro-posed algorithm has better performance in terms of energy efficiency which increase the network lifetime and support better coverage.
%K Automata Learning
%K Wireless Sensor Networks
%K Data Aggregation
%K Energy Efficient
%K Spanning Tree
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=855