AEESPAN: Automata Based Energy Efficient Spanning Tree for Data Aggregation in Wireless Sensor Networks
- 1
- 2
Abstract
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.
- Z. Eskandari, M. H. Yaghmaee, and A. H. Mohajerzade, “Energy efficient spanning tree for data aggregation in wireless sensor networks,” ICCCN, 2008.
- F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: A survey, computer networks,” Computer Networks Journal, 2002.
- Y. Hu, N. Yu, X. H. Jia, “Energy efficient real time data aggregation in wireless sensor network,” IWCMC, 2006.
- M. Lee and V. W. S. Wong, “An energy-aware spanning tree algorithm for data aggregation in wireless sensor networks,” IEEE, 2005.
- J. N. Al-Karaki, and A. E. Kamal, “Routing techniques in wireless sensor networks: A survey, supported by the ICUBE initiative of Iowa State University, Ames.
- O. Younis and S. Fahmy, “HEED: A hybrid, energy- efficient, distributed clustering approach for ad hoc sensor networks,” IEEE, 2004.
- B. Krishnamachari, D. Estrin, and S. Wicker, “The impact of data aggregation in wireless sensor networks,” International Workshop on Distributed Event-Based Systems, 2002.
- M. Lee and V. W. S. Wong, “LPT for data aggregation in wireless sensor networks,” IEEE GLOBECOM, 2005.
- W. Zhang and G. Cao, “DCTC: Dynamic convoy tree- based collaboration for target tracking in sensor networks,” IEEE, 2004.
- S. Upadhyayula, V. Annamalai, and S. K. S. Gupta, “A low latency and energy-efficient algorithm for conver- gecast,” IEEE GLOBECOM, 2003.
- Z. eskandari, M. H. Yaghmaee, A. H. Mohajerzade, “Automata based energy efficient spanning tree for data aggregation in wireless sensor networks,” IEEE ICCS, 2008.
- S. Upadhyayula, V. Annamalai, and S. K. S. Gupta, “A lowlatency and energy-efficient algorithm for convergecast,” EEE GLOBECOM, 2003.
- Y. P. Chen, A. L. Liestman and J. Liu, “A hierarchical energy-efficient framework for data aggregation in wireless sensor networks,” IEEE, 2006.
- P. Radivojac, U. Korad, K. M. Sivalingam and Z. Obradovic, “Learning from class-imbalanced data in wireless sensor networks,” IEEE VTC, Fall 2003.
- P. Beyens, M. Peeters, K. Steenhaut, and A. Nowe, “Routing with compression in aireless sensor networks: A Q-learning approah,” AAMAS, 2005.
- M. Esnaashari, M. R. Meybodi,” “A learning automata based data aggregation method doe sensor networks,” CSICC, 2007.