arrow
Return

Optimal Power Allocation Under Communication Network Externalities

delete2012-03-01
delete26
PRE
AI
K
Kallitsis, Michael G. *
G
George Michailidis
M
Michael Devetsikiotis
DOI:10.1109/TSG.2011.2169995delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Efficient resource allocation is an important problem that aims for a greener and more environmentally friendly electric power grid. The smart behavior of the newly emerged grid, combined with two-way communication between users and the operator allows for actions like measurement, monitoring, prediction, and control signaling so as to maximize social welfare. We introduce a framework for optimal resource allocation in smart grids that also considers the uncertainty in message signaling. This introduces communication network externalities, added on top of the existing transmission network ones. The task at hand resembles the so called local public goods problem in mathematical economics terminology, a problem impractical to solve using centralized mechanisms. We propose an iterative, decentralized algorithm for its solution. The algorithm is scalable for deployment in large networks since it requires only messages per network user per iteration, where is the number of users. Moreover, it is guaranteed to converge, does not require revelation of private information from each user and all algorithm actions can be realized by programmable smart devices of the grid.
Keywords:
Delay systems
distributed control
optimization
power distribution
smart grids
uncertainty
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Smart Grid cover
IEEE Transactions on Smart Grid
IF:
9.8
Papers:
5.7K
Citations:
4.3W

Organization

U
University of Michigan
Scholars:
6.4W
Papers: 5.3W
Citations: 124
U
university of michigan system
Scholars:
9.1W
Papers: 8.6W
Citations: 133