List of Articles Genetic Algorithms

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - Determination of Optimum SVMs Based on Genetic Algorithm in Classification of Hyper spectral Imagery
  farhad samadzadegan hadise hassani
  Hyper spectral remote sensing imagery, due to its rich source of spectral information provides an efficient tool for ground classifications in complex geographical areas with similar classes. Referring to robustness of Support Vector Machines (SVMs) in high dimensional More

  Hyper spectral remote sensing imagery, due to its rich source of spectral information provides an efficient tool for ground classifications in complex geographical areas with similar classes. Referring to robustness of Support Vector Machines (SVMs) in high dimensional space, they are efficient tool for classification of hyper spectral imagery. However, there are two optimization issues which strongly effect on the SVMs performance: Optimum SVMs parameters determination and optimum feature subset selection. Traditional optimization algorithms are appropriate in limited search space but they usually trap in local optimum in high dimensional space, therefore it is inevitable to apply meta-heuristic optimization algorithms such as Genetic Algorithm to obtain global optimum solution. This paper evaluates the potential of different proposed optimization scenarios in determining of SVMs parameters and feature subset selection based on Genetic Algorithm (GA). Obtained results on AVIRIS Hyper spectral imagery demonstrate superior performance of SVMs achieved by simultaneously optimization of SVMs parameters and input feature subset. In Gaussian and Polynomial kernels, the classification accuracy improves by about 5% and15% respectively and more than 90 redundant bands are eliminated. For comparison, the evaluation is also performed by applying it to Simulated Annealing (SA) that shows a better performance of Genetic Algorithm especially in complex search space where parameter determination and feature selection are solve simultaneously. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - Toward Energy-Aware Traffic Engineering in Intra-Domain IP Networks Using Heuristic and Meta-Heuristics Approaches
  Muharram Mansoorizadeh
  10.7508/jist.2018.02.005
  Because of various ecological, environmental, and economic issues, energy efficient networking has been a subject of interest in recent years. In a typical backbone network, all the routers and their ports are always active and consume energy. Average link utilization i More

  Because of various ecological, environmental, and economic issues, energy efficient networking has been a subject of interest in recent years. In a typical backbone network, all the routers and their ports are always active and consume energy. Average link utilization in internet service providers is about 30-40%. Energy-aware traffic engineering aims to change routing algorithms so that low utilized links would be deactivated and their load would be distributed over other routes. As a consequence, by turning off these links and their respective devices and ports, network energy consumption is significantly decreased. In this paper, we propose four algorithms for energy-aware traffic engineering in intra-domain networks. Sequential Link Elimination (SLE) removes links based on their role in maximum network utilization. As a heuristic method, Extended Minimum Spanning Tree (EMST) uses minimum spanning trees to eliminate redundant links and nodes. Energy-aware DAMOTE (EAD) is another heuristic method that turns off links with low utilization. The fourth approach is based on genetic algorithms that randomly search for feasible network architectures in a potentially huge solution space. Evaluation results on Abilene network with real traffic matrix indicate that about 35% saving can be obtained by turning off underutilized links and routers on off-peak hours with respect to QoS. Furthermore, experiments with GA confirm that a subset of links and core nodes with respect to QoS can be switched off when traffic is in its off-peak periods, and hence energy can be saved up to 37%. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  3 - Reducing Energy Consumption in Sensor-Based Internet of Things Networks Based on Multi-Objective Optimization Algorithms
  Mohammad sedighimanesh Hessam  Zandhessami Mahmood  Alborzi Mohammadsadegh  Khayyatian
  10.52547/jist.15639.10.39.180
  Energy is an important parameter in establishing various communications types in the sensor-based IoT. Sensors usually possess low-energy and non-rechargeable batteries since these sensors are often applied in places and applications that cannot be recharged. The mos More

  Energy is an important parameter in establishing various communications types in the sensor-based IoT. Sensors usually possess low-energy and non-rechargeable batteries since these sensors are often applied in places and applications that cannot be recharged. The most important objective of the present study is to minimize the energy consumption of sensors and increase the IoT network's lifetime by applying multi-objective optimization algorithms when selecting cluster heads and routing between cluster heads for transferring data to the base station. In the present article, after distributing the sensor nodes in the network, the type-2 fuzzy algorithm has been employed to select the cluster heads and also the genetic algorithm has been used to create a tree between the cluster heads and base station. After selecting the cluster heads, the normal nodes become cluster members and send their data to the cluster head. After collecting and aggregating the data by the cluster heads, the data is transferred to the base station from the path specified by the genetic algorithm. The proposed algorithm was implemented with MATLAB simulator and compared with LEACH, MB-CBCCP, and DCABGA protocols, the simulation results indicate the better performance of the proposed algorithm in different environments compared to the mentioned protocols. Due to the limited energy in the sensor-based IoT and the fact that they cannot be recharged in most applications, the use of multi-objective optimization algorithms in the design and implementation of routing and clustering algorithms has a significant impact on the increase in the lifetime of these networks. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  4 - Analyzing Weighted Attack Graphs Using Genetic Algorithms
  M. Abadi Saeed Jalili
  Each attack graph represents a collection of possible attack scenarios in a computer network. In this paper, we use weighted attack graphs (WAGs) for vulnerability assessment of computer networks. In these directed graphs, a weight is assigned to each exploit by the sec More

  Each attack graph represents a collection of possible attack scenarios in a computer network. In this paper, we use weighted attack graphs (WAGs) for vulnerability assessment of computer networks. In these directed graphs, a weight is assigned to each exploit by the security analyst. The weight of an exploit is proportionate to the cost required to prevent that exploit. The aim of analyzing a weighted attack graph is to find a critical set of exploits such that the sum of their weights is minimum and by preventing them no attack scenario is possible. In this paper, we propose a greedy algorithm, a genetic algorithm with a greedy mutation operator, and a genetic algorithm with a dynamic fitness function for analyzing the weighted attack graphs. The proposed algorithms are used to analyze a sample weighted attack graph and several randomly generated large-scale weighted attack graphs. The results of experiments show that the proposed genetic algorithms outperform the greedy algorithm and find a critical set of exploits with less total weight. Finally, we compare the performance of the second genetic algorithm with an approximation algorithm for analyzing several randomly generated large-scale simple attack graphs. The results of experiments show that our proposed genetic algorithm has better performance than the approximation algorithm and finds a critical set of exploits with less cardinality. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  5 - Blind Modulation Recognition of Communication Signals Based on Support Vector Machines
  S. Shaerbaf M. Khademi Mohammad Molavi
  Automatic modulation type classifier is a system which recognizes the modulation type of received signal automatically from some possible, pre-assumed types. Automatic modulation classification has applications such as spectrum surveillance, signal confirmation, interfe More

  Automatic modulation type classifier is a system which recognizes the modulation type of received signal automatically from some possible, pre-assumed types. Automatic modulation classification has applications such as spectrum surveillance, signal confirmation, interference identification, software radio, etc. This paper, proposes a new method for recognition of 9 famous digital and analog modulations, which no need for prior knowledge of the signal to be recognized. This system is used to separate AM, FM, DSB and SSB in Analog modulations and 2ASK, 2PSK, 2FSK, 4PAM and 16QAM in digital modulations. Support Vector Machines (SVM) is used to classify these modulations and Genetic Algorithm is used to optimize Classifier Structure. Simulation results show that proposed algorithms have a good performance in comparison with other algorithms. Computational simplicity, High training speed and High classification rate, are the advantages of proposed algorithms. Manuscript profile