Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Stochastic Bounded Diameter Minimum Spanning Tree Problem

Torkestani J. A.

Fundamenta Informaticae

2015

Vol. 140, nr 2

205--219

In this paper, a learning automata-based algorithm is proposed for approximating a near optimal solution to the bounded diameter minimum spanning tree (BDMST) problem in stochastic graphs. A stochastic graph is a graph in which the weight associated with each edge is a random variable. Stochastic BDMST problem seeks for finding the BDMST in a stochastic graph. To the best of our knowledge, no work has been done on solving the stochastic BDMST problem, where the weight associated with the graph edge is random variable. In this study, we assume that the probability distribution of the edges random weight is unknown a priori. This makes the stochastic BDMST problem incredibly hard-to-solve. To show the efficiency of the proposed algorithm, its results are compared with those of the standard sampling method (SSM). Numerical results show the superiority of the proposed sampling algorithm over the SSM both in terms of the sampling rate and convergence rate.

An Energy-Efficient MCDS-based Routing Algorithm for Wireless Sensor Networks: Learning Automata Approach

Rezaei Z., Torkestani J.A.

Przegląd Elektrotechniczny

2012

R. 88, nr 11a

147-151

Wireless sensor networks which are used to monitor and control a specific area, are made of many small sensor nodes; they are compressed and spread in an environment. One of the most challenges in these types of networks is Energy limitation which has direct influence on sensor network lifetime. Unicast routing in wireless sensor networks is a way for data delivery to a receiver. In this paper we are intended to present a unicast routing algorithm in wireless sensor networks, and we make a virtual backbone out of Minimum Connected Dominating Set (MCDS). This virtual backbone is initiated according to Energy level, Neighboring, and distance from Sink node. So, to this end we use an algorithm based on learning automata named UMCDS- LA deal with the unicast routing problem. Finally, we simulate proposed method by ns2 simulator. Thus the results show high performance of the proposed algorithm.

W artykule zaprezentowano algorytm routowania typu unicast w sieci bezprzewodowej (ang. Wireless Sensor Network). Szkielet sieci oparty został na strukturze typu MCDS (ang. Minimum Connected Dominating Set). Do realizacji wykorzystano algorytm oparty na automacie uczącym się UMCDS-LA. Metodę przebadano na symulatorze ns2.