Sharif Digital Repository

The mobility model of typical Mobile Ad-hoc NETworks (MANET) can be used for more efficient performance evaluation of such networks. There are a large number of researches for generating various mobility models to use in performance evaluation of mobile ad-hoc networks and also on performance evaluation itself of these networks. But in most of these researches the mobility model of MANET is predefined and based on this mobility model, the performance evaluation goes on. Since in real world applications the mobility model of MANETs is unknown or may be changed during the time, the need for a method of detecting or estimating the MANET's mobility model is evident. In this paper a learning... 

There is no method to determine the optimal topology for multi-layer neural networks for a given problem. Usually the designer selects a topology for the network and then trains it. Since determination of the optimal topology of neural networks belongs to class of NP-hard problems, most of the existing algorithms for determination of the topology are approximate. These algorithms could be classified into four main groups: pruning algorithms, constructive algorithms, hybrid algorithms and evolutionary algorithms. These algorithms can produce near optimal solutions. Most of these algorithms use hill-climbing method and may be stuck at local minima. In this article, we first introduce a... 

Reconfigurability for a component of a distributed component-based system means ability to replace the component with a new one, in presence of the other components. In this context, substitutability and compatibility of components should be analyzed. In this paper, we use I/O-Constraint Automata to model behavior of components and propose enough formalism for substitutability and compatibility analysis. We show that in the context of distributed non-blocking components, there is a relation weaker than usual simulation relation in automata theory for notion of substitutability. We illustrate the relation between substitutability and compatibility to reason about the reconfigurability of a... 

In this paper, two learning automata based adaptive limited fractional guard channel algorithms for cellular mobile networks are proposed. These algorithms try to minimize the blocking probability of new calls subject to the constraint on the dropping probability of the handoff calls. To evaluate the proposed algorithms, computer simulations are conducted. The simulation results show that the performance of the proposed algorithms are close to the performance of the limited fractional guard channel algorithm for which prior knowledge about traffic parameters are needed. The simulation results also show that the proposed algorithms outperforms the recently introduced dynamic guard channel...