An important issue in ad-hoc on-demand distance vector (AODV) routing protocols is route failure caused by node mobility in the MANETs. The AODV requires a new route discovery procedure whenever a route breaks and these frequent route discoveries increase transmission delays and routing overhead. The present study proposes a new method for AODVs using a genetic algorithm to improve the route recovery mechanism. When failure occurs in a route, the proposed method (GAAODV) makes decisions regarding the QOS parameter to select source or local repair. The task of the genetic algorithm is to find an appropriate combination of weights to optimize end-to-end delay. This paper evaluates the metrics of routing overhead, average end-to-end delay, and packet delivery ratio. Comparison of the new algorithm and AODV (RFC 3561) using a NS-2 simulator shows that GAAODV obtains better results for the QOS parameters.

Today, the world facing with huge flood of data and the recent advances in computer technology have provided the capability to process significant amount of data. On the other hand, analyzing the information requires resources that most institutions do not have, independently. To handle such circumstances, grid computing has emerged as an important research area where the calculation of distributed computing and clustering are different. In this study, we propose a grid computing architecture as a set of protocols that use the cumulative knowledge of computers, networks, databases and scientific instruments based on the implementation of Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) technique. The results of the implementation of the proposed algorithm on grid systems indicate the superiority of the proposed approach in terms of validation criteria scheduling algorithms, such as task completion time and the performance compared with some alternative method.

One of existing challenges in personalization of the web is increasing the efficiency of a web in meeting the users' requirements for the contents they require in an optimal state. All the information associated with the current user behavior following in web and data obtained from pervious users’ interaction in web can provide some necessary keys to recommend presentation of services, productions, and the required information of the users. This study aims at presenting a formal model based on colored Petri nets to identify the present user's interest, which is utilized to recommend the most appropriate pages ahead. In the proposed design, recommendation of the pages is considered with respect to information obtained from pervious users' profile as well as the current session of the present user. This model offers the updated proposed pages to the user by clicking on the web pages. Moreover, an example of web is modeled using CPN Tools. The results of the simulation show that this design improves the precision factor. We explain, through evaluation where the results of this method are more objective and the dynamic recommendations demonstrate that the results of the recommended method improve the precision criterion 15% more than the static method.

The fuzzy object oriented database model is often used to handle the existing imprecise and complicated objects for many real-world applications. The main focus of this paper is on fuzzy queries and tries to analyze a complicated and complex query to get more meaningful and closer responses. The method permits the user to provide the possibility of allocating the weight to various parts of the query, which makes it easier to follow better goals and return the target objects.