Skip to main content
Article thumbnail
Location of Repository

Topology Control Scheduling Based on the Distributed Learning Automata

By Mina Shirali, Mohammad Reza Meybodi and Hamid Daneshvar Tarigh

Abstract

Abstract—This paper, presents a learning automata based algorithm (LABTA) to determine an appropriate time interval for topology control, while capturing network updates and minimizing algorithm overhead. This algorithm is application dependent and it is possible to consider other parameters like delay, etc. In this paper, we describe how to merge parameters and compute the fitness. We have implemented the proposed algorithm with both of standard and distributed models of the learning automata. Simulation results show that our proposed algorithm outperforms periodic topology control. In addition, a comparison can be also found between two most well known topology control protocols; LMST and K-Neigh. Keywords-component; topology control; learning automata; scheduling; hello interval I

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.418.7721
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ceit.aut.ac.ir/~meybodi... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.