Search

The smart grid refers to the modernization of the power grid infrastructure with new technologies, enabling a more intelligently networked automated system with the goal of improving efficiency, reliability, and security, while providing more transparency and choices to electricity customers. A key technology being widely deployed on the consumption side of the grid is advanced metering infrastructure (AMI)., National Science Foundation (U.S.) (Award CNS-1239054)

We propose a raffle-based scheme for the decongestion of a shared resource. Our scheme builds on ideas from the economic literature on incentivizing contributions to a public good. We formulate a game-theoretic model for the decongestion problem in a setup with a finite number of users, as well as in a setup with an infinite number of non-atomic users. We analyze both setups, and show that the former converges toward the latter when the number of users becomes large. We compare our results to existing results for the public good provision problem. Overall, our results establish that raffle-based schemes are useful in addressing congestion problems., National Science Foundation (U.S.) (Grant CNS-0910711), National Science Foundation (U.S.) (Grant CCF-0424422), United States. Air Force Office of Scientific Research (FA9550-06-1-0244)

IEEE This article introduces a Piecewise-Deterministic Queueing (PDQ) model to study the stability of traffic queues in parallel-link transportation systems facing stochastic capacity fluctuations. The saturation rate (capacity) of the PDQ model switches between a finite set of modes according to a Markov chain, and link inflows are controlled by a state-feedback policy. A PDQ system is stable only if a lower bound on the time-average link inflows does not exceed the corresponding time-average saturation rate. Furthermore, a PDQ system is stable if the following two conditions hold: the nominal mode's saturation rate is high enough that all queues vanish in this mode, and a Bilinear Matrix Inequality (BMI) involving an underestimate of the discharge rates of the PDQ in individual modes is feasible. The stability conditions can be strengthened for two-mode PDQs. These results can be used for design of routing policies that guarantee stability of traffic queues under stochastic capacity fluctuations., National Science Foundation (U.S.) (CNS-1239054 CPS Frontiers), National Science Foundation (U.S.). Faculty Early Career Development Program Award (CNS-145312), United States. Air Force Research Laboratory. Lablet-Secure and Resilient Cyber-Physical Systems

Mobile data traffic has been steadily rising in the past years. This has generated a significant interest in the deployment of incentive mechanisms to reduce peak-time congestion. Typically, the design of these mechanisms requires information about user demand and sensitivity to prices. Such information is naturally imperfect. In this paper, we propose a fixed-budget rebate mechanism that gives each user a reward proportional to his percentage contribution to the aggregate reduction in peak-time demand. For comparison, we also study a time-of-day pricing mechanism that gives each user a fixed reward per unit reduction of his peak-time demand. To evaluate the two mechanisms, we introduce a game-theoretic model that captures the public good nature of decongestion. For each mechanism, we demonstrate that the socially optimal level of decongestion is achievable for a specific choice of the mechanism's parameter. We then investigate how imperfect information about user demand affects the mechanisms' effectiveness. From our results, the fixed-budget rebate pricing is more robust when the users' sensitivity to congestion is “sufficiently” convex. This feature of the fixed-budget rebate mechanism is attractive for many situations of interest and is driven by its closed-loop property, i.e., the unit reward decreases as the peak-time demand decreases., National Science Foundation (U.S.) (Grant CNS-1239166), National Science Foundation (U.S.) (Grant CNS-0910711), National Science Foundation (U.S.) (CCF-0424422), United States. Air Force Office of Scientific Research (FA9550-06-1-0244)

This paper focuses on the security assessment of electricity distribution networks (DNs) with vulnerable distributed energy resource (DER) nodes. The adversary model is a simultaneous compromise of DER nodes by strategic manipulation of generation setpoints. The loss to the defender (DN operator) includes loss of voltage regulation and cost of induced load control under supply-demand mismatch caused by the attack. A three-stage defender-attacker-defender (DAD) game is formulated: in Stage 1, the defender chooses a security strategy to secure a subset of DER nodes; in Stage 2, the attacker compromises a set of vulnerable DERs and injects false generation setpoints; in Stage 3, the defender responds by controlling loads and non-compromised DERs. Solving this trilevel optimization problem is hard due to nonlinear power flows and mixed-integer decision variables. To address this challenge, the problem is approximated by a tractable formulation based on an ε-linear power-flow model. The set of critical DER nodes and the setpoint manipulations characterizing the optimal attack strategy are computed. An iterative greedy approach to computing attacker-defender strategies for the original nonlinear problem is proposed. These results provide guidelines for optimal security investment and defender response in preattack and postattack conditions, respectively., National Science Foundation (U.S.) (Award CNS-1238959), National Science Foundation (U.S.) (Award CNS-1238962), National Science Foundation (U.S.) (Award CNS- 1239054), National Science Foundation (U.S.) (Award CNS-1239166), Sandia National Laboratories, United States. Air Force. Research Laboratory (Award FA8750-14-2-0180)

We consider the initial-boundary value problem governed by systems of linear hyperbolic partial differential equations in the canonical diagonal form and study conditions for exponential stability when the system discontinuously switches between a finite set of modes. The switching system is fairly general in that the system matrix functions as well as the boundary conditions may switch in time. We show how the stability mechanism developed for classical solutions of hyperbolic initial boundary value problems can be generalized to the case in which weaker solutions become necessary due to arbitrary switching. We also provide an explicit dwell-time bound for guaranteeing exponential stability of the switching system when, for each mode, the system is exponentially stable. Our stability conditions only depend on the system parameters and boundary data. These conditions easily generalize to switching systems in the nondiagonal form under a simple commutativity assumption. We present tutorial examples to illustrate the instabilities that can result from switching.

The Internet is plagued with congestion problems of growing severity which are worst at peak periods. In this paper, we compare two schemes that incentivize users to shift part of their usage from the peak-time to the off-peak time. The traditional time-of-day pricing scheme gives a fixed reward per unit of shifted usage. Conversely, the raffle-based scheme provides a random reward distributed in proportion of each user's fraction of the total shifted usage. Using a game-theoretic model, we show that both schemes can achieve an optimal level of decongestion at a unique Nash equilibrium. We provide a comparison of the schemes' sensitivity to uncertainty of the users' utilities., National Science Foundation (U.S.) (Grant CNS-0910711)