The locality of a graph problem is the smallest distance T such that each node can choose its own part solution based on radius-T neighborhood. In many settings, be solved efficiently with distributed or parallel algorithm if and only it has small locality. this work we seek to automate study solvability locality: given description Π, would like determine Π solvable what asymptotic as function ...

Presence of redundant nodes is common in wireless sensor networks because of various reasons such as high probability of failures and necessity of long lifetime. When such redundancy exists, some distributed algorithms are needed for selecting minimal subset of nodes as active nodes in a manner that network area is covered entirely with the selected active nodes. In this paper, a distributed al...

Performance of ad hoc networks dramatically declines as network grows. Cluster formation in which the network hosts are hierarchically partitioned into several autonomous nonoverlapping groups, based on proximity, is a promising approach to alleviate the scalability problem of ad hoc networks. In this paper, we propose a localized learning automata-based clustering algorithm for wireless ad hoc...

17 A solution to channel assignment problem in cellular networks is self-organizing channel assignment algorithm with distributed control. In this paper, we propose three cellu-19 lar learning automata based dynamic channel assignment algorithms. In the first two algorithms, no information about the status of of channels in the whole network will 21 be used by cells for channel assignment where...

Grid Computing is a parallel and distributed system that facilitates the virtualization of distributed computing and enables coordinating and sharing of computing and storage resources. Mechanism based on economic models is an effective approach to solve the problem of grid resources management. The essence of this problem is how to discover resources for achieving the goal of a highly efficien...

A system which combines the descriptional power of symbolic representations with the parallel and distributed processing model of cellular automata and the speed and robustness of connectionist symbol processing is described. Following a cellular automata based approach , the aim of the system is to transform initial symbolic descriptions of patterns to corresponding object level descriptions i...

Current academic Internet environment has enabled fast transfers of huge amounts of data, and has made high quality multimedia and collaborative applications a reality. This article describes a model for distributed multimedia retrieval which performs the retrieval of different multimedia to a variety of clients using learning automata algorithm named LAGridMSS. LAGridMSS allocates a proportion...

Abstract We present algorithms for model checking and controller synthesis of timed automata, seeing a automaton as parallel composition large finite-state machine relatively smaller automaton, using compositional reasoning on this composition. use automata learning to learn finite approximations the component, in order reduce problem at hand or synthesis. an experimental evaluation our approach.

In this paper, we look into the problem of channel assignment in multi-channel multi-radio wireless mesh networks. We propose a new learning automata based channel assignment scheme that adaptively improve network overall throughput by expecting channel state. Since the ability of sending packets via upstream links will be evaluation bases for assigning channels to radio interfaces on each node...

With distributed computing beginning to play a major role in modern Computer Science, the theory of grammar systems and distributed automata has been developed in order to model distributed computing. In this paper, we introduce the notion of distributed automata in the sequential sense. Distributed Automata are a group of automata working in unison to accept one language. We build the theory o...