277,077 research outputs found

    Slow Adaptive OFDMA Systems Through Chance Constrained Programming

    Full text link
    Adaptive OFDMA has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wireless systems. The research over the last decade on adaptive OFDMA systems has focused on adapting the allocation of radio resources, such as subcarriers and power, to the instantaneous channel conditions of all users. However, such "fast" adaptation requires high computational complexity and excessive signaling overhead. This hinders the deployment of adaptive OFDMA systems worldwide. This paper proposes a slow adaptive OFDMA scheme, in which the subcarrier allocation is updated on a much slower timescale than that of the fluctuation of instantaneous channel conditions. Meanwhile, the data rate requirements of individual users are accommodated on the fast timescale with high probability, thereby meeting the requirements except occasional outage. Such an objective has a natural chance constrained programming formulation, which is known to be intractable. To circumvent this difficulty, we formulate safe tractable constraints for the problem based on recent advances in chance constrained programming. We then develop a polynomial-time algorithm for computing an optimal solution to the reformulated problem. Our results show that the proposed slow adaptation scheme drastically reduces both computational cost and control signaling overhead when compared with the conventional fast adaptive OFDMA. Our work can be viewed as an initial attempt to apply the chance constrained programming methodology to wireless system designs. Given that most wireless systems can tolerate an occasional dip in the quality of service, we hope that the proposed methodology will find further applications in wireless communications

    Adaptive Robust Optimization with Dynamic Uncertainty Sets for Multi-Period Economic Dispatch under Significant Wind

    Full text link
    The exceptional benefits of wind power as an environmentally responsible renewable energy resource have led to an increasing penetration of wind energy in today's power systems. This trend has started to reshape the paradigms of power system operations, as dealing with uncertainty caused by the highly intermittent and uncertain wind power becomes a significant issue. Motivated by this, we present a new framework using adaptive robust optimization for the economic dispatch of power systems with high level of wind penetration. In particular, we propose an adaptive robust optimization model for multi-period economic dispatch, and introduce the concept of dynamic uncertainty sets and methods to construct such sets to model temporal and spatial correlations of uncertainty. We also develop a simulation platform which combines the proposed robust economic dispatch model with statistical prediction tools in a rolling horizon framework. We have conducted extensive computational experiments on this platform using real wind data. The results are promising and demonstrate the benefits of our approach in terms of cost and reliability over existing robust optimization models as well as recent look-ahead dispatch models.Comment: Accepted for publication at IEEE Transactions on Power System

    Power Allocation for Conventional and Buffer-Aided Link Adaptive Relaying Systems with Energy Harvesting Nodes

    Full text link
    Energy harvesting (EH) nodes can play an important role in cooperative communication systems which do not have a continuous power supply. In this paper, we consider the optimization of conventional and buffer-aided link adaptive EH relaying systems, where an EH source communicates with the destination via an EH decode-and-forward relay. In conventional relaying, source and relay transmit signals in consecutive time slots whereas in buffer-aided link adaptive relaying, the state of the source-relay and relay-destination channels determines whether the source or the relay is selected for transmission. Our objective is to maximize the system throughput over a finite number of transmission time slots for both relaying protocols. In case of conventional relaying, we propose an offline and several online joint source and relay transmit power allocation schemes. For offline power allocation, we formulate an optimization problem which can be solved optimally. For the online case, we propose a dynamic programming (DP) approach to compute the optimal online transmit power. To alleviate the complexity inherent to DP, we also propose several suboptimal online power allocation schemes. For buffer-aided link adaptive relaying, we show that the joint offline optimization of the source and relay transmit powers along with the link selection results in a mixed integer non-linear program which we solve optimally using the spatial branch-and-bound method. We also propose an efficient online power allocation scheme and a naive online power allocation scheme for buffer-aided link adaptive relaying. Our results show that link adaptive relaying provides performance improvement over conventional relaying at the expense of a higher computational complexity.Comment: Submitted to IEEE Transactions on Wireless Communication

    SGD Frequency-Domain Space-Frequency Semiblind Multiuser Receiver with an Adaptive Optimal Mixing Parameter

    Get PDF
    A novel stochastic gradient descent frequency-domain (FD) space-frequency (SF) semiblind multiuser receiver with an adaptive optimal mixing parameter is proposed to improve performance of FD semiblind multiuser receivers with a fixed mixing parameters and reduces computational complexity of suboptimal FD semiblind multiuser receivers in SFBC downlink MIMO MC-CDMA systems where various numbers of users exist. The receiver exploits an adaptive mixing parameter to mix information ratio between the training-based mode and the blind-based mode. Analytical results prove that the optimal mixing parameter value relies on power and number of active loaded users existing in the system. Computer simulation results show that when the mixing parameter is adapted closely to the optimal mixing parameter value, the performance of the receiver outperforms existing FD SF adaptive step-size (AS) LMS semiblind based with a fixed mixing parameter and conventional FD SF AS-LMS training-based multiuser receivers in the MSE, SER and signal to interference plus noise ratio in both static and dynamic environments

    Real-time Dispatchable Region of Active Distribution Networks Based on a Tight Convex Relaxation Model

    Full text link
    The uncertainty in distributed renewable generation poses security threats to the real-time operation of distribution systems. The real-time dispatchable region (RTDR) can be used to assess the ability of power systems to accommodate renewable generation at a given base point. DC and linearized AC power flow models are typically used for bulk power systems, but they are not suitable for low-voltage distribution networks with large r/x ratios. To balance accuracy and computational efficiency, this paper proposes an RTDR model of AC distribution networks using tight convex relaxation. Convex hull relaxation is adopted to reformulate the AC power flow equations, and the convex hull is approximated by a polyhedron without much loss of accuracy. Furthermore, an efficient adaptive constraint generation algorithm is employed to construct an approximate RTDR to meet the requirements of real-time dispatch. Case studies on the modified IEEE 33-bus distribution system validate the computational efficiency and accuracy of the proposed method
    corecore