Professional Documents
Culture Documents
Demand-Side Management For The Smart Grid: Fabrice Saffre and Richard Gedge
Demand-Side Management For The Smart Grid: Fabrice Saffre and Richard Gedge
I. INTRODUCTION
c
978-1-4244-6039-7/10/$26.00 2010
IEEE
300
Authorized licensed use limited to: Politecnico di Torino. Downloaded on July 16,2010 at 12:07:47 UTC from IEEE Xplore. Restrictions apply.
B. Price updates
The price per Watt for all future time-steps is calculated
using the currently known aggregated load. Basically, a
centralized entity (the aggregator) keeps track of all existing
loads and computes a unit-price accordingly: whenever the
forecasted aggregated load reaches a multiple of a specific
value S for any given future time-step, the corresponding price
tag is incremented.
This effectively means that the cost of power increases as a
step function of the known aggregated load on every future
time-step. It is easy to understand intuitively that this reactive
pricing mechanism tends to prevent the clustering of loads in
time as, the higher the demand, the higher the unit-cost and the
higher the probability that new loads will enter stand-by mode,
so as to avoid crowded periods.
When a price update occurs for at least one future time-step
as a result of a new load starting its execution, a message is
broadcasted to all households to notify them of the tariff
change(s). At the chosen simulation scale, there can be many
such broadcasts per time-step.
It is worth noting that, when a load is initiated, the cost of
its immediate execution (on which the decision of entering
stand-by mode or not is being made) reflects the forecasted
aggregated demand, not the actual one (which may depend on
future events and decisions by other households). As a result,
a fair billing mechanism would need to be put into place
whereby the total price paid for any given load is that which
was advertised at the time when its execution started.
C. Key parameters
The key parameters that will determine the outcome of the
simulation include the average target price X, the probability
of spontaneous execution P and the width of the aggregated
load intervals between price increments S. The duration of a
time-step (granularity) mostly affect the length of the
simulation and the resolution of the data. For all the results
presented here, it was kept constant at 1 minute.
D. Measured variables
Six variables are recorded for every time step: (1) the actual
aggregated load, (2) the final price tag, (3) the number of
broadcast messages, (4) the number of point-to-point
messages, (5) the number of ongoing individual loads and (6)
the number of loads in stand-by mode. The fraction of loads
having successfully executed below their price target and the
frequency distribution of all loads as a function of how many
time-steps they spent in stand-by mode before execution are
also recorded.
III. RESULTS
Fig. 1 shows the effect of our DSM algorithm on the shape
of the aggregated flexible load, for 3 different values of P and
over a period of 3 days. Constant parameter values are X = 50,
S = 10,000.
Authorized licensed use limited to: Politecnico di Torino. Downloaded on July 16,2010 at 12:07:47 UTC from IEEE Xplore. Restrictions apply.
301
(B)
302
Authorized licensed use limited to: Politecnico di Torino. Downloaded on July 16,2010 at 12:07:47 UTC from IEEE Xplore. Restrictions apply.
(A)
V. FUTURE WORK
Future work will involve refining the simulation engine so
as to increase its capabilities. For instance, we will explicitly
take into account the interplay between flexible and inflexible
demand (the latter not being part of the present study). We
will also introduce time-based fluctuations on the supply side,
which will likely characterize the future Smart Grid [8].
Finally, we will consider geographical constraints in a more
distributed generation and distribution infrastructure (e.g.
micro-grids). In that context, power from renewable sources
may be used up locally in priority, which would lead to even
more dynamic pricing, with different prices being advertised
simultaneously in different parts of the network by weakly
coupled aggregators.
ACKNOWLEDGMENT
(B)
[2]
[3]
[4]
[5]
[6]
[7]
[8]
Authorized licensed use limited to: Politecnico di Torino. Downloaded on July 16,2010 at 12:07:47 UTC from IEEE Xplore. Restrictions apply.
303