Wireless Communications

The Smart Grid, regarded as the next generation power grid, uses two-way flows of electricity and information to create a widely distributed automated energy delivery network. In this article, we survey the literature till 2011 on the enabling technologies for the Smart Grid. We explore three major systems, namely the smart infrastructure system, the smart management system, and the smart protection system. We also propose possible future directions in each system. colorred{Specifically, for the smart infrastructure system, we explore the smart energy subsystem, the smart information subsystem, and the smart communication subsystem.} For the smart management system, we explore various management objectives, such as improving energy efficiency, profiling demand, maximizing utility, reducing cost, and controlling emission. We also explore various management methods to achieve these objectives. For the smart protection system, we explore various failure protection mechanisms which improve the reliability of the Smart Grid, and explore the security and privacy issues in the Smart Grid.

/pdf/smart-grid-the-new-and-improved-power-grid-a-survey-4jypbbgv3j.pdf

Smart Grid — The New and Improved Power Grid: A Survey

Smart Grid - The New and Improved Power Grid:

A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the most appropriate distributed algorithm for a given network resource allocation problem, and quantifies the comparison across architectural alternatives of modularized network design. Decomposition theory naturally provides the mathematical language to build an analytic foundation for the design of modularized and distributed control of networks. In this tutorial paper, we first review the basics of convexity, Lagrange duality, distributed subgradient method, Jacobi and Gauss-Seidel iterations, and implication of different time scales of variable updates. Then, we introduce primal, dual, indirect, partial, and hierarchical decompositions, focusing on network utility maximization problem formulations and the meanings of primal and dual decompositions in terms of network architectures. Finally, we present recent examples on: systematic search for alternative decompositions; decoupling techniques for coupled objective functions; and decoupling techniques for coupled constraint sets that are not readily decomposable

/pdf/a-tutorial-on-decomposition-methods-for-network-utility-2lh5n4f5y9.pdf

A tutorial on decomposition methods for network utility maximization

Information flow in a telecommunication network is accomplished through the interaction of mechanisms at various design layers with the end goal of supporting the information exchange needs of the applications. In wireless networks in particular, the different layers interact in a nontrivial manner in order to support information transfer. In this text we will present abstract models that capture the cross-layer interaction from the physical to transport layer in wireless network architectures including cellular, ad-hoc and sensor networks as well as hybrid wireless-wireline. The model allows for arbitrary network topologies as well as traffic forwarding modes, including datagrams and virtual circuits. Furthermore the time varying nature of a wireless network, due either to fading channels or to changing connectivity due to mobility, is adequately captured in our model to allow for state dependent network control policies. Quantitative performance measures that capture the quality of service requirements in these systems depending on the supported applications are discussed, including throughput maximization, energy consumption minimization, rate utility function maximization as well as general performance functionals. Cross-layer control algorithms with optimal or suboptimal performance with respect to the above measures are presented and analyzed. A detailed exposition of the related analysis and design techniques is provided.

/pdf/resource-allocation-and-cross-layer-control-in-wireless-1bikwdtjww.pdf

Resource Allocation and Cross Layer Control in Wireless Networks

In wireless cellular or ad hoc networks where Quality of Service (QoS) is interference-limited, a variety of power control problems can be formulated as nonlinear optimization with a system-wide objective, e.g., maximizing the total system throughput or the worst user throughput, subject to QoS constraints from individual users, e.g., on data rate, delay, and outage probability. We show that in the high Signal-to- interference Ratios (SIR) regime, these nonlinear and apparently difficult, nonconvex optimization problems can be transformed into convex optimization problems in the form of geometric programming; hence they can be very efficiently solved for global optimality even with a large number of users. In the medium to low SIR regime, some of these constrained nonlinear optimization of power control cannot be turned into tractable convex formulations, but a heuristic can be used to compute in most cases the optimal solution by solving a series of geometric programs through the approach of successive convex approximation. While efficient and robust algorithms have been extensively studied for centralized solutions of geometric programs, distributed algorithms have not been explored before. We present a systematic method of distributed algorithms for power control that is geometric-programming-based. These techniques for power control, together with their implications to admission control and pricing in wireless networks, are illustrated through several numerical examples.

/pdf/power-control-by-geometric-programming-2799lyyh3b.pdf

Power Control By Geometric Programming

We present a novel energy management system for residential demand response. The algorithm, named CAES, reduces residential energy costs and smooths energy usage. CAES is an online learning application that implicitly estimates the impact of future energy prices and of consumer decisions on long term costs and schedules residential device usage. CAES models both energy prices and residential device usage as Markov, but does not assume knowledge of the structure or transition probabilities of these Markov chains. CAES learns continuously and adapts to individual consumer preferences and pricing modifications over time. In numerical simulations CAES reduced average end-user financial costs from $16\%$ to $40\%$ with respect to a price-unaware energy allocation.

/pdf/residential-demand-response-using-reinforcement-learning-171gv9yft4.pdf

Residential Demand Response Using Reinforcement Learning

For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput and minimize delay. The distinguishing characteristics of these resource allocation formulations is that, by using convex optimization, they accommodate a variety of realistic QoS and fairness constraints. Their globally optimal solutions can be computed efficiently through polynomial time interior point methods, even though they use nonlinear objectives and constraints. Through power control in wireless cellular networks, we optimize SIR and delay for a particular QoS class, subject to QoS constraints for all other QoS classes. For wireless ad hoc networks with multihop transmissions and Rayleigh fading, we optimize various objectives, such as the overall system throughput, subject to constraints on power, probability of outage, and data rates. These formulations can also be used for admission control and relative pricing. Both proportional and minmax fairness can be implemented under the convex optimization framework, where fairness parameters can be jointly optimized with QoS criteria. Simple heuristics are also shown and tested using the convex optimization tools.

/pdf/qos-and-fairness-constrained-convex-optimization-of-resource-51dgwotrjm.pdf

QoS and fairness constrained convex optimization of resource allocation for wireless cellular and ad hoc networks

Demand response (DR) for residential and small commercial buildings is estimated to account for as much as 65% of the total energy savings potential of DR, and previous work shows that a fully automated energy management system (EMS) is a necessary prerequisite to DR in these areas. In this paper, we propose a novel EMS formulation for DR problems in these sectors. Specifically, we formulate a fully automated EMS’s rescheduling problem as a reinforcement learning (RL) problem, and argue that this RL problem can be approximately solved by decomposing it over device clusters. Compared with existing formulations, our new formulation does not require explicitly modeling the user’s dissatisfaction on job rescheduling, enables the EMS to self-initiate jobs, allows the user to initiate more flexible requests, and has a computational complexity linear in the number of device clusters. We also demonstrate the simulation results of applying Q-learning, one of the most popular and classical RL algorithms, to a representative example.

/pdf/optimal-demand-response-using-device-based-reinforcement-3v2vkh5jm8.pdf

Optimal Demand Response Using Device-Based Reinforcement Learning

As we transition toward a power grid that is increasingly based on renewable resources like solar and wind, the intelligent control of distributed energy resources (DERs) including photovoltaic (PV) arrays, controllable loads, energy storage, and plug-in electric vehicles (EVs) will be critical to realizing a power grid that can handle both the variability and unpredictability of renewable energy sources as well as increasing system complexity. Realizing such a decentralized and dynamic infrastructure will require the ability to solve large scale problems in real-time with hundreds of thousands of DERs simultaneously online. Because of the scale of the optimization problem, we use an iterative distributed algorithm previously developed in our group to operate each DER independently and autonomously within this environment. The algorithm is deployed within a framework that allows the microgrid to dynamically adapt to changes in the operating environment. Specifically, we consider a commercial site equipped with on-site PV generation, partially curtailable load, EV charge stations and a battery electric storage unit. The site operates as a small microgrid that can participate in the wholesale market on the power grid. We report results for simulations using real-data that demonstrate the ability of the optimization framework to respond dynamically in real-time to external conditions while maintaining the functional requirements of all DERs.

Daniel O'Neill

Papers

Power Control By Geometric Programming

Residential Demand Response Using Reinforcement Learning

QoS and fairness constrained convex optimization of resource allocation for wireless cellular and ad hoc networks

Optimal Demand Response Using Device-Based Reinforcement Learning

Dynamic Control and Optimization of Distributed Energy Resources in a Microgrid