Hierarchical Demand Response for Peak Minimization Using Dantzig-Wolfe Decomposition

Demand response (DR) algorithms manipulate the energy consumption schedules of controllable loads so as to satisfy grid objectives. Implementation of DR algorithms using a centralized agent can be problematic for scalability reasons, and there are issues related to the privacy of data and robustness to communication failures. Thus, it is desirable to use a scalable decentralized algorithm for the implementation of DR. In this paper, a hierarchical DR scheme is proposed for peak minimization based on Dantzig-Wolfe decomposition (DWD). In addition, a time weighted maximization option is included in the cost function, which improves the quality of service for devices seeking to receive their desired energy sooner rather than later. This paper also demonstrates how the DWD algorithm can be implemented more efficiently through the calculation of the upper and lower cost bounds after each DWD iteration.

Achievable sum-rate of multiuser massive MIMO downlink in ricean fading channels

We investigate the achievable ergodic sum-rate of multi-user multiple-input multiple-output systems in Ricean fading channels. We first derive a lower bound on the average signal-to-leakage-and-noise ratio by utilizing the Mullen's inequality, which is then used to analyze the effect of channel mean information on the achievable sum-rate. With these results, a novel statistical-eigenmode space-division multipleaccess downlink transmission scheme is proposed. For this scheme, we derive an exact closed-form expression for the achievable ergodic sum-rate. Our results show that the achievable ergodic sum-rate converges to a saturation value in the high signal-to-noise ratio (SNR) region and reaches to a lower limit value in the lower Ricean K-factor range. In addition, we present tractable upper and lower bounds, which are shown to be tight for any SNR and Ricean K-factor value. Finally, the theoretical analysis is validated via numerical simulations.