• Title/Summary/Keyword: Primal-Dual Algorithm

Search Result 53, Processing Time 0.018 seconds

Optimal Coordination of Intermittent Distributed Generation with Probabilistic Power Flow

  • Xing, Haijun;Cheng, Haozhong;Zhang, Yi
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.6
    • /
    • pp.2211-2220
    • /
    • 2015
  • This paper analyzes multiple active management (AM) techniques of active distribution network (ADN), and proposes an optimal coordination model of intermittent distributed generation (IDG) accommodation considering the timing characteristic of load and IDG. The objective of the model is to maximize the daily amount of IDG accommodation under the uncertainties of IDG and load. Various active management techniques such as IDG curtailment, on-load tap changer (OLTC) tap adjusting, voltage regulator (VR) tap adjusting, shunt capacitors compensation and so on are fully considered. Genetic algorithm and Primal-Dual Interior Point Method (PDIPM) is used for the model solving. Point estimate method is used to simulate the uncertainties. Different scenarios are selected for the IDG accommodation capability investigation under different active management schemes. Finally a modified IEEE 123 case is used to testify the proposed accommodation model, the results show that the active management can largely increase the IDG accommodation and penetration.

Lattice-Reduction-Aided Preceding Using Seysen's Algorithm for Multi-User MIMO Systems (다중 사용자 다중 입출력 시스템에서 Seysen 기법을 이용한 격자 감소 기반 전부호화 기법)

  • Song, Hyung-Joon;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.6
    • /
    • pp.86-93
    • /
    • 2009
  • We investigate lattice-reduction-aided precoding techniques for multi-user multiple-input multiple-output (MIMO) channels. When assuming full knowledge of the channel state information only at the transmitter, a vector perturbation (VP) is a promising precoding scheme that approaches sum capacity and has simple receiver. However, its encoding is nondeterministic polynomial time (NP)-hard problem. Vector perturbation using lattice reduction algorithms can remarkably reduce its encoding complexity. In this paper, we propose a vector perturbation scheme using Seysen's lattice reduction (VP-SLR) with simultaneously reducing primal basis and dual one. Simulation results show that the proposed VP-SLR has better bit error rate (BER) and larger capacity than vector perturbation with Lenstra-Lenstra-Lovasz lattice reduction (VP-LLL) in addition to less encoding complexity.

Adaptive Cross-Layer Resource Optimization in Heterogeneous Wireless Networks with Multi-Homing User Equipments

  • Wu, Weihua;Yang, Qinghai;Li, Bingbing;Kwak, Kyung Sup
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.784-795
    • /
    • 2016
  • In this paper, we investigate the resource allocation problem in time-varying heterogeneous wireless networks (HetNet) with multi-homing user equipments (UE). The stochastic optimization model is employed to maximize the network utility, which is defined as the difference between the HetNet's throughput and the total energy consumption cost. In harmony with the hierarchical architecture of HetNet, the problem of stochastic optimization of resource allocation is decomposed into two subproblems by the Lyapunov optimization theory, associated with the flow control in transport layer and the power allocation in physical (PHY) layer, respectively. For avoiding the signaling overhead, outdated dynamic information, and scalability issues, the distributed resource allocation method is developed for solving the two subproblems based on the primal-dual decomposition theory. After that, the adaptive resource allocation algorithm is developed to accommodate the timevarying wireless network only according to the current network state information, i.e. the queue state information (QSI) at radio access networks (RAN) and the channel state information (CSI) of RANs-UE links. The tradeoff between network utility and delay is derived, where the increase of delay is approximately linear in V and the increase of network utility is at the speed of 1/V with a control parameter V. Extensive simulations are presented to show the effectiveness of our proposed scheme.