6,970 research outputs found
Smart Microgrids: Overview and Outlook
The idea of changing our energy system from a hierarchical design into a set
of nearly independent microgrids becomes feasible with the availability of
small renewable energy generators. The smart microgrid concept comes with
several challenges in research and engineering targeting load balancing,
pricing, consumer integration and home automation. In this paper we first
provide an overview on these challenges and present approaches that target the
problems identified. While there exist promising algorithms for the particular
field, we see a missing integration which specifically targets smart
microgrids. Therefore, we propose an architecture that integrates the presented
approaches and defines interfaces between the identified components such as
generators, storage, smart and \dq{dumb} devices.Comment: presented at the GI Informatik 2012, Braunschweig Germany, Smart Grid
Worksho
Matching Theory for Future Wireless Networks: Fundamentals and Applications
The emergence of novel wireless networking paradigms such as small cell and
cognitive radio networks has forever transformed the way in which wireless
systems are operated. In particular, the need for self-organizing solutions to
manage the scarce spectral resources has become a prevalent theme in many
emerging wireless systems. In this paper, the first comprehensive tutorial on
the use of matching theory, a Nobelprize winning framework, for resource
management in wireless networks is developed. To cater for the unique features
of emerging wireless networks, a novel, wireless-oriented classification of
matching theory is proposed. Then, the key solution concepts and algorithmic
implementations of this framework are exposed. Then, the developed concepts are
applied in three important wireless networking areas in order to demonstrate
the usefulness of this analytical tool. Results show how matching theory can
effectively improve the performance of resource allocation in all three
applications discussed
Unsplittable Load Balancing in a Network of Charging Stations Under QoS Guarantees
The operation of the power grid is becoming more stressed, due to the
addition of new large loads represented by Electric Vehicles (EVs) and a more
intermittent supply due to the incorporation of renewable sources. As a
consequence, the coordination and control of projected EV demand in a network
of fast charging stations becomes a critical and challenging problem.
In this paper, we introduce a game theoretic based decentralized control
mechanism to alleviate negative impacts from the EV demand. The proposed
mechanism takes into consideration the non-uniform spatial distribution of EVs
that induces uneven power demand at each charging facility, and aims to: (i)
avoid straining grid resources by offering price incentives so that customers
accept being routed to less busy stations, (ii) maximize total revenue by
serving more customers with the same amount of grid resources, and (iii)
provide charging service to customers with a certain level of
Quality-of-Service (QoS), the latter defined as the long term customer blocking
probability. We examine three scenarios of increased complexity that gradually
approximate real world settings. The obtained results show that the proposed
framework leads to substantial performance improvements in terms of the
aforementioned goals, when compared to current state of affairs.Comment: Accepted for Publication in IEEE Transactions on Smart Gri
Distributed Game Theoretic Optimization and Management of Multichannel ALOHA Networks
The problem of distributed rate maximization in multi-channel ALOHA networks
is considered. First, we study the problem of constrained distributed rate
maximization, where user rates are subject to total transmission probability
constraints. We propose a best-response algorithm, where each user updates its
strategy to increase its rate according to the channel state information and
the current channel utilization. We prove the convergence of the algorithm to a
Nash equilibrium in both homogeneous and heterogeneous networks using the
theory of potential games. The performance of the best-response dynamic is
analyzed and compared to a simple transmission scheme, where users transmit
over the channel with the highest collision-free utility. Then, we consider the
case where users are not restricted by transmission probability constraints.
Distributed rate maximization under uncertainty is considered to achieve both
efficiency and fairness among users. We propose a distributed scheme where
users adjust their transmission probability to maximize their rates according
to the current network state, while maintaining the desired load on the
channels. We show that our approach plays an important role in achieving the
Nash bargaining solution among users. Sequential and parallel algorithms are
proposed to achieve the target solution in a distributed manner. The
efficiencies of the algorithms are demonstrated through both theoretical and
simulation results.Comment: 34 pages, 6 figures, accepted for publication in the IEEE/ACM
Transactions on Networking, part of this work was presented at IEEE CAMSAP
201
- …