期刊文献+

AEESPAN: Automata Based Energy Efficient Spanning Tree for Data Aggregation in Wireless Sensor Networks 被引量:1

AEESPAN: Automata Based Energy Efficient Spanning Tree for Data Aggregation in Wireless Sensor Networks
下载PDF
导出
摘要 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. 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.
机构地区 不详
出处 《Wireless Sensor Network》 2009年第4期316-323,共8页 无线传感网络(英文)
关键词 AUTOMATA Learning WIRELESS SENSOR Networks Data AGGREGATION Energy Efficient SPANNING TREE Automata Learning Wireless Sensor Networks Data Aggregation Energy Efficient Spanning Tree
  • 相关文献

同被引文献11

  • 1Akyildiz I F,Su W,Sankarasubramaniam Y,et al.A Survey on Sensor Networks[J].IEEE Communications Magazine,2002,40(8):102-114.
  • 2Estrin D,Girod L,Pottie G,et al.Instrumenting the World with Wireless Sensor Networks.International Conference on Acoustics[J].Speech and Signal Processing,2001,3:13-20.
  • 3Wang A,Heinzelmar W B,Sinha A,et al.Energy-scalable Pro-tocols for Bettery-operated Microsensor Networks[J].Journal of VLSI Signal Processing,2001,29(3):223-237.
  • 4Sharaf M,Beaver J,Labrinidis A,et al.A Scheme for Tempo-ral Coherency-aware In-network Aggregation[J].In Mo-biDE,2003,31:219-223.
  • 5Mhatre V,Rosenberg C.Homogeneous vs Heterogeneous Clus-tered Sensor Networks.A Comparative Study[J].IEEE Interna-tional Conference on Communications,2004,6:3646-3651.
  • 6Kumar D,Aseri T C,Patel R B.Energy-effcient Cluster Head Election Protocol for Heterogeneous Wireless Sensor Net-works[C] //Proceedings of the International Conference on Advances in Computing,Communication and Control,2009:75-80.
  • 7Du X,Xiao Y.Energy Effcient Chessboard Clustering and Routing in Heterogeneous Sensor Networks[J].International Journal of Wireless and Mobile Computing,2006,1:121-130.
  • 8Abbasi A A,Younis M.A Survey on Clustering Algorithms for Wireless Sensor Networks[J].Computer Communica-tions,2007,30(14-15):2826-2841.
  • 9Doherty L,Ghaoui L E,Pister K S J.Convex Position Estima-tion in Wireless Sensor Networks[J].IEEE Infocom,2001,22:33-39.
  • 10Savvides A,Han C,Strivastava M.Dynamic Fine-grained lo-calization in Ad-hoc Networks of Sensors[J].ACM Press,2001,3:166-179.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部