International Journal of
Physical Sciences

  • Abbreviation: Int. J. Phys. Sci.
  • Language: English
  • ISSN: 1992-1950
  • DOI: 10.5897/IJPS
  • Start Year: 2006
  • Published Articles: 2533

Full Length Research Paper

A learning automata-based algorithm using stochastic minimum spanning tree for improving life time in wireless sensor networks

Chamran Asgari1*, Rohollah Rahmati Torkashvand2 and Masoud Barati3
1Department of Computer Engineering, Payame Noor University, Iran. 2Department of Computer Engineering, Islamic Azad University, Borujerd Branch, Lorestan, Iran. 3Department of Computer,Islamic Azad University, Kangavar branch, Kangavar, Iran.
Email: [email protected]

  •  Accepted: 28 August 2012
  •  Published: 16 May 2013


Several algorithms have already been provided for problems of data aggregation in wireless sensor networks, which somehow tried to increase networks lifetimes. In this study, we dealt with this problem using a more efficient method by taking parameters such as the distance between two sensors into account. In this paper, we presented a heuristic algorithm based on distributed learning automata with variable actions set for solving data aggregation problems within stochastic graphs where the weights of edges change with time. To aggregate data, the algorithm, in fact, creates a stochastic minimum spanning tree (SMST) in networks where variable distances of links are considered as edges, and sends data in the form of a single packet to central node after data was processed inside networks. To understand this subject better, we modeled the problem for a stochastic graph having edges with changing weights. Although this assumption that edges weights change with time makes our task difficult, the results of simulations indicate relatively optimal performance of this method.


Key words: Data aggregation, stochastic graph, learning automata, minimum spanning tree, life time.