58,776 research outputs found
Optimal placement of distributed energy storage systems in distribution networks using artificial bee colony algorithm
The deployment of utility-scale energy storage systems (ESSs) can be a significant avenue for improving the performance of distribution networks. An optimally placed ESS can reduce power losses and line loading, mitigate peak network demand, improve voltage profile, and in some cases contribute to the network fault level diagnosis. This paper proposes a strategy for optimal placement of distributed ESSs in distribution networks to minimize voltage deviation, line loading, and power losses. The optimal placement of distributed ESSs is investigated in a medium voltage IEEE-33 bus distribution system, which is influenced by a high penetration of renewable (solar and wind) distributed generation, for two scenarios: (1) with a uniform ESS size and (2) with non-uniform ESS sizes. System models for the proposed implementations are developed, analyzed, and tested using DIgSILENT PowerFactory. The artificial bee colony optimization approach is employed to optimize the objective function parameters through a Python script automating simulation events in PowerFactory. The optimization results, obtained from the artificial bee colony approach, are also compared with the use of a particle swarm optimization algorithm. The simulation results suggest that the proposed ESS placement approach can successfully achieve the objectives of voltage profile improvement, line loading minimization, and power loss reduction, and thereby significantly improve distribution network performance
Optimal Placement of Distributed Energy Storage in Power Networks
We formulate the optimal placement, sizing and control of storage devices in
a power network to minimize generation costs with the intent of load shifting.
We assume deterministic demand, a linearized DC approximated power flow model
and a fixed available storage budget. Our main result proves that when the
generation costs are convex and nondecreasing, there always exists an optimal
storage capacity allocation that places zero storage at generation-only buses
that connect to the rest of the network via single links. This holds regardless
of the demand profiles, generation capacities, line-flow limits and
characteristics of the storage technologies. Through a counterexample, we
illustrate that this result is not generally true for generation buses with
multiple connections. For specific network topologies, we also characterize the
dependence of the optimal generation cost on the available storage budget,
generation capacities and flow constraints.Comment: 15 pages, 9 figures, generalized result to include line losses in
Section 4
Amorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad-Hoc Networks
Abstract—Personal communication devices are increasingly being equipped with sensors that are able to passively collect information from their surroundings – information that could be stored in fairly small local caches. We envision a system in which users of such devices use their collective sensing, storage, and communication resources to query the state of (possibly remote) neighborhoods. The goal of such a system is to achieve the highest query success ratio using the least communication overhead (power). We show that the use of Data Centric Storage (DCS), or directed placement, is a viable approach for achieving this goal, but only when the underlying network is well connected. Alternatively, we propose, amorphous placement, in which sensory samples are cached locally and informed exchanges of cached samples is used to diffuse the sensory data throughout the whole network. In handling queries, the local cache is searched first for potential answers. If unsuccessful, the query is forwarded to one or more direct neighbors for answers. This technique leverages node mobility and caching capabilities to avoid the multi-hop communication overhead of directed placement. Using a simplified mobility model, we provide analytical lower and upper bounds on the ability of amorphous placement to achieve uniform field coverage in one and two dimensions. We show that combining informed shuffling of cached samples upon an encounter between two nodes, with the querying of direct neighbors could lead to significant performance improvements. For instance, under realistic mobility models, our simulation experiments show that amorphous placement achieves 10% to 40% better query answering ratio at a 25% to 35% savings in consumed power over directed placement.National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 0202067
Edge-Caching Wireless Networks: Performance Analysis and Optimization
Edge-caching has received much attention as an efficient technique to reduce
delivery latency and network congestion during peak-traffic times by bringing
data closer to end users. Existing works usually design caching algorithms
separately from physical layer design. In this paper, we analyse edge-caching
wireless networks by taking into account the caching capability when designing
the signal transmission. Particularly, we investigate multi-layer caching where
both base station (BS) and users are capable of storing content data in their
local cache and analyse the performance of edge-caching wireless networks under
two notable uncoded and coded caching strategies. Firstly, we propose a coded
caching strategy that is applied to arbitrary values of cache size. The
required backhaul and access rates are derived as a function of the BS and user
cache size. Secondly, closed-form expressions for the system energy efficiency
(EE) corresponding to the two caching methods are derived. Based on the derived
formulas, the system EE is maximized via precoding vectors design and
optimization while satisfying a predefined user request rate. Thirdly, two
optimization problems are proposed to minimize the content delivery time for
the two caching strategies. Finally, numerical results are presented to verify
the effectiveness of the two caching methods.Comment: to appear in IEEE Trans. Wireless Commu
A Taxonomy for Management and Optimization of Multiple Resources in Edge Computing
Edge computing is promoted to meet increasing performance needs of
data-driven services using computational and storage resources close to the end
devices, at the edge of the current network. To achieve higher performance in
this new paradigm one has to consider how to combine the efficiency of resource
usage at all three layers of architecture: end devices, edge devices, and the
cloud. While cloud capacity is elastically extendable, end devices and edge
devices are to various degrees resource-constrained. Hence, an efficient
resource management is essential to make edge computing a reality. In this
work, we first present terminology and architectures to characterize current
works within the field of edge computing. Then, we review a wide range of
recent articles and categorize relevant aspects in terms of 4 perspectives:
resource type, resource management objective, resource location, and resource
use. This taxonomy and the ensuing analysis is used to identify some gaps in
the existing research. Among several research gaps, we found that research is
less prevalent on data, storage, and energy as a resource, and less extensive
towards the estimation, discovery and sharing objectives. As for resource
types, the most well-studied resources are computation and communication
resources. Our analysis shows that resource management at the edge requires a
deeper understanding of how methods applied at different levels and geared
towards different resource types interact. Specifically, the impact of mobility
and collaboration schemes requiring incentives are expected to be different in
edge architectures compared to the classic cloud solutions. Finally, we find
that fewer works are dedicated to the study of non-functional properties or to
quantifying the footprint of resource management techniques, including
edge-specific means of migrating data and services.Comment: Accepted in the Special Issue Mobile Edge Computing of the Wireless
Communications and Mobile Computing journa
- …