• Title/Summary/Keyword: network optimization

Search Result 2,239, Processing Time 0.03 seconds

A Study on Multi-objective Optimal Power Flow under Contingency using Differential Evolution

  • Mahdad, Belkacem;Srairi, Kamel
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.1
    • /
    • pp.53-63
    • /
    • 2013
  • To guide the decision making of the expert engineer specialized in power system operation and control; the practical OPF solution should take in consideration the critical situation due to severe loading conditions and fault in power system. Differential Evolution (DE) is one of the best Evolutionary Algorithms (EA) to solve real valued optimization problems. This paper presents simple Differential Evolution (DE) Optimization algorithm to solving multi objective optimal power flow (OPF) in the power system with shunt FACTS devices considering voltage deviation, power losses, and power flow branch. The proposed approach is examined and tested on the standard IEEE-30Bus power system test with different objective functions at critical situations. In addition, the non smooth cost function due to the effect of valve point has been considered within the second practical network test (13 generating units). The simulation results are compared with those by the other recent techniques. From the different case studies, it is observed that the results demonstrate the potential of the proposed approach and show clearly its effectiveness to solve practical OPF under contingent operation states.

Optimization of longitudinal viscous dampers for a freight railway cable-stayed bridge under braking forces

  • Yu, Chuanjin;Xiang, Huoyue;Li, Yongle;Pan, Maosheng
    • Smart Structures and Systems
    • /
    • v.21 no.5
    • /
    • pp.669-675
    • /
    • 2018
  • Under braking forces of a freight train, there are great longitudinal structural responses of a large freight railway cable-stayed bridge. To alleviate such adverse reactions, viscous dampers are required, whose parametric selection is one of important and arduous researches. Based on the longitudinal dynamics vehicle model, responses of a cable-stayed bridge are investigated under various cases. It shows that there is a notable effect of initial braking speeds and locations of a freight train on the structural responses. Under the most unfavorable braking condition, the parameter sensitivity analyses of viscous dampers are systematically performed. Meanwhile, a mixing method called BPNN-NSGA-II, combining the Back Propagation neural network (BPNN) and Non-Dominated Sorting Genetic Algorithm With Elitist Strategy (NSGA-II), is employed to optimize parameters of viscous dampers. The result shows that: 1. the relationships between the parameters of viscous dampers and the key longitudinal responses of the bridge are high nonlinear, which are completely different from each other; 2. the longitudinal displacement of the bridge main girder significantly decreases by the optimized viscous dampers.

Minimum cost strengthening of existing masonry arch railway bridges

  • Rafiee, Amin
    • Structural Engineering and Mechanics
    • /
    • v.75 no.2
    • /
    • pp.271-282
    • /
    • 2020
  • The preservation of historic masonry-arch railway bridges is of paramount importance due to their economic benefits. These bridges which belong to past centuries may nowadays be expected to carry loads higher than those for which they were designed. Such an increase in loads may be because of increase in transportation speed or in the capacity of freight-wagons. Anyway, adequate increase in their load-carrying-capacity through structural-strengthening is required. Moreover, the increasing costs of material/construction urge engineers to optimize their designs to obtain the minimum-cost one. This paper proposes a novel numerical optimization method to minimize the costs associated with strengthening of masonry-arch railway bridges. To do so, the stress/displacement responses of Sahand-Goltappeh bridge are assessed under ordinary train pass as a case study. For this aim, 3D-Finite-Element-Model is created and calibrated using experimental test results. Then, it is strengthened such that following goals are achieved simultaneously: (1) the load-carrying-capacity of the bridge is increased; (2) the structural response of the bridge is reduced to a certain limit; and, (3) the costs needed for such strengthening are minimized as far as possible. The results of the case study demonstrate the applicability/superiority of the proposed approach. Some economic measures are also recommended to further reduce the total strengthening cost.

Optimization Model for Location Management in WCDMA Networks (WCDMA 네트워크에서의 일치관리 최적화 모형)

  • Chung, Yong-Joo
    • Korean Management Science Review
    • /
    • v.26 no.3
    • /
    • pp.23-35
    • /
    • 2009
  • This study deals with the location management in WCDMA (Wideband Code Division Multiple Access) networks. The new location management method is the one of the many techniques used to provide the packet switched (PS) services effectively in WCDMA networks. WCDMA introduces RA (routing area) for the PS services in addition to LA (location area) for the circuit switched (CS) services. WCDMA system also adopts the cooperative paging and the combined area update which are to decrease signaling traffic using the PS network resources for the CS services. Considering the characteristics of the WCDMA networks, this study formulate into the mathematical programming problem for the location management. Rather than the existing researches which consider the single MSC/SGSN networks, we deal with the multi MSC/SGSN networks, where both MSC area and SGSN area should be determined as well. Fairness between traffic loads of MSC/SGSN and the system cost incurred to MSC/SGSN are also incorporated into our model, which make the model more realistic. We propose greedy algorithms for the problems, which consists of the merger of two neighboring areas and the movement of an area. Extensive experiment has been done based on the realistic problem examples. Followed by the analysis of parameter effect on the final solutions and the quality of final solutions obtained by our greedy algorithms. Our proposed model and analysis result can be used to determine WCDMA system areas and to predict the system performance measures by the determination.

Adaptive Cloud Offloading of Augmented Reality Applications on Smart Devices for Minimum Energy Consumption

  • Chung, Jong-Moon;Park, Yong-Suk;Park, Jong-Hong;Cho, HyoungJun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.3090-3102
    • /
    • 2015
  • The accuracy of an augmented reality (AR) application is highly dependent on the resolution of the object's image and the device's computational processing capability. Naturally, a mobile smart device equipped with a high-resolution camera becomes the best platform for portable AR services. AR applications require significant energy consumption and very fast response time, which are big burdens to the smart device. However, there are very few ways to overcome these burdens. Computation offloading via mobile cloud computing has the potential to provide energy savings and enhance the performance of applications executed on smart devices. Therefore, in this paper, adaptive mobile computation offloading of mobile AR applications is considered in order to determine optimal offloading points that satisfy the required quality of experience (QoE) while consuming minimum energy of the smart device. AR feature extraction based on SURF algorithm is partitioned into sub-stages in order to determine the optimal AR cloud computational offloading point based on conditions of the smart device, wireless and wired networks, and AR service cloud servers. Tradeoffs in energy savings and processing time are explored also taking network congestion and server load conditions into account.

Joint Mode Selection, Link Allocation and Power Control in Underlaying D2D Communication

  • Zhang, Wei;He, Wanbing;Wu, Dan;Cai, Yueming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5209-5228
    • /
    • 2016
  • Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

Feature Selection to Mine Joint Features from High-dimension Space for Android Malware Detection

  • Xu, Yanping;Wu, Chunhua;Zheng, Kangfeng;Niu, Xinxin;Lu, Tianling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4658-4679
    • /
    • 2017
  • Android is now the most popular smartphone platform and remains rapid growth. There are huge number of sensitive privacy information stored in Android devices. Kinds of methods have been proposed to detect Android malicious applications and protect the privacy information. In this work, we focus on extracting the fine-grained features to maximize the information of Android malware detection, and selecting the least joint features to minimize the number of features. Firstly, permissions and APIs, not only from Android permissions and SDK APIs but also from the developer-defined permissions and third-party library APIs, are extracted as features from the decompiled source codes. Secondly, feature selection methods, including information gain (IG), regularization and particle swarm optimization (PSO) algorithms, are used to analyze and utilize the correlation between the features to eliminate the redundant data, reduce the feature dimension and mine the useful joint features. Furthermore, regularization and PSO are integrated to create a new joint feature mining method. Experiment results show that the joint feature mining method can utilize the advantages of regularization and PSO, and ensure good performance and efficiency for Android malware detection.

IKPCA-ELM-based Intrusion Detection Method

  • Wang, Hui;Wang, Chengjie;Shen, Zihao;Lin, Dengwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.3076-3092
    • /
    • 2020
  • An IKPCA-ELM-based intrusion detection method is developed to address the problem of the low accuracy and slow speed of intrusion detection caused by redundancies and high dimensions of data in the network. First, in order to reduce the effects of uneven sample distribution and sample attribute differences on the extraction of KPCA features, the sample attribute mean and mean square error are introduced into the Gaussian radial basis function and polynomial kernel function respectively, and the two improved kernel functions are combined to construct a hybrid kernel function. Second, an improved particle swarm optimization (IPSO) algorithm is proposed to determine the optimal hybrid kernel function for improved kernel principal component analysis (IKPCA). Finally, IKPCA is conducted to complete feature extraction, and an extreme learning machine (ELM) is applied to classify common attack type detection. The experimental results demonstrate the effectiveness of the constructed hybrid kernel function. Compared with other intrusion detection methods, IKPCA-ELM not only ensures high accuracy rates, but also reduces the detection time and false alarm rate, especially reducing the false alarm rate of small sample attacks.

A Study on the Intrusion Detection System's Nodes Scheduling Using Genetic Algorithm in Sensor Networks (센서네트워크에서 유전자 알고리즘을 이용한 침입탐지시스템 노드 스케줄링 연구)

  • Seong, Ki-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.10
    • /
    • pp.2171-2180
    • /
    • 2011
  • Security is a significant concern for many sensor network applications. Intrusion detection is one method of defending against attacks. However, standard intrusion detection techniques are not suitable for sensor networks with limited resources. In this paper, propose a new method for selecting and managing the detect nodes in IDS(intrusion detection system) for anomaly detection in sensor networks and the node scheduling technique for maximizing the IDS's lifetime. Using the genetic algorithm, developed the solutions for suggested optimization equation and verify the effectiveness of proposed methods by simulations.

Relaying Protocols and Delay Analysis for Buffer-aided Wireless Powered Cooperative Communication Networks

  • Zhan, Jun;Tang, Xiaohu;Chen, Qingchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3542-3566
    • /
    • 2018
  • In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.