Energy management in communication networks: a journey through modelling and optimization glasses

The widespread proliferation of Internet and wireless applications has produced a significant increase of ICT energy footprint. As a response, in the last five years, significant efforts have been undertaken to include energy-awareness into network management. Several green networking frameworks have been proposed by carefully managing the network routing and the power state of network devices. Even though approaches proposed differ based on network technologies and sleep modes of nodes and interfaces, they all aim at tailoring the active network resources to the varying traffic needs in order to minimize energy consumption. From a modeling point of view, this has several commonalities with classical network design and routing problems, even if with different objectives and in a dynamic context. With most researchers focused on addressing the complex and crucial technological aspects of green networking schemes, there has been so far little attention on understanding the modeling similarities and differences of proposed solutions. This paper fills the gap surveying the literature with optimization modeling glasses, following a tutorial approach that guides through the different components of the models with a unified symbolism. A detailed classification of the previous work based on the modeling issues included is also proposed

Optimal Economic Schedule for a Network of Microgrids With Hybrid Energy Storage System Using Distributed Model Predictive Control

Artículo Open Access en el sitio web el editor. Pago por publicar en abierto.In this paper, an optimal procedure for the economic schedule of a network of interconnected microgrids with hybrid energy storage system is carried out through a control algorithm based on distributed model predictive control (DMPC). The algorithm is specifically designed according to the criterion of improving the cost function of each microgrid acting as a single system through the network mode operation. The algorithm allows maximum economical benefit of the microgrids, minimizing the degradation causes of each storage system, and fulfilling the different system constraints. In order to capture both continuous/discrete dynamics and switching between different operating conditions, the plant is modeled with the framework of mixed logic dynamic. The DMPC problem is solved with the use of mixed integer linear programming using a piecewise formulation, in order to linearize a mixed integer quadratic programming problem.Ministerio de Economía, Industria y Competitivadad DPI2016-78338-RComisión Europea 0076-AGERAR-6-

An Exact Algorithm for Side-Chain Placement in Protein Design

Computational protein design aims at constructing novel or improved functions on the structure of a given protein backbone and has important applications in the pharmaceutical and biotechnical industry. The underlying combinatorial side-chain placement problem consists of choosing a side-chain placement for each residue position such that the resulting overall energy is minimum. The choice of the side-chain then also determines the amino acid for this position. Many algorithms for this NP-hard problem have been proposed in the context of homology modeling, which, however, reach their limits when faced with large protein design instances. In this paper, we propose a new exact method for the side-chain placement problem that works well even for large instance sizes as they appear in protein design. Our main contribution is a dedicated branch-and-bound algorithm that combines tight upper and lower bounds resulting from a novel Lagrangian relaxation approach for side-chain placement. Our experimental results show that our method outperforms alternative state-of-the art exact approaches and makes it possible to optimally solve large protein design instances routinely

Cracking in asphalt materials

This chapter provides a comprehensive review of both laboratory characterization and modelling of bulk material fracture in asphalt mixtures. For the purpose of organization, this chapter is divided into a section on laboratory tests and a section on models. The laboratory characterization section is further subdivided on the basis of predominant loading conditions (monotonic vs. cyclic). The section on constitutive models is subdivided into two sections, the first one containing fracture mechanics based models for crack initiation and propagation that do not include material degradation due to cyclic loading conditions. The second section discusses phenomenological models that have been developed for crack growth through the use of dissipated energy and damage accumulation concepts. These latter models have the capability to simulate degradation of material capacity upon exceeding a threshold number of loading cycles.Peer ReviewedPostprint (author's final draft

Reliable Energy-Efficient Routing Algorithm for Vehicle-Assisted Wireless Ad-Hoc Networks

We investigate the design of the optimal routing path in a moving vehicles involved the internet of things (IoT). In our model, jammers exist that may interfere with the information exchange between wireless nodes, leading to worsened quality of service (QoS) in communications. In addition, the transmit power of each battery-equipped node is constrained to save energy. We propose a three-step optimal routing path algorithm for reliable and energy-efficient communications. Moreover, results show that with the assistance of moving vehicles, the total energy consumed can be reduced to a large extend. We also study the impact on the optimal routing path design and energy consumption which is caused by path loss, maximum transmit power constrain, QoS requirement, etc.Comment: 6 pages, 5 figures, rejected by IEEE Globecom 2017,resubmit to IEEE WCNC 201

Mapping constrained optimization problems to quantum annealing with application to fault diagnosis

Current quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with a fixed sparse set of interactions, and propose two new decomposition algorithms for solving problems too large to map directly into hardware. The mapping technique is locally-structured, as hardware compatible Ising models are generated for each problem constraint, and variables appearing in different constraints are chained together using ferromagnetic couplings. In contrast, global embedding techniques generate a hardware independent Ising model for all the constraints, and then use a minor-embedding algorithm to generate a hardware compatible Ising model. We give an example of a class of CSPs for which the scaling performance of D-Wave's QA hardware using the local mapping technique is significantly better than global embedding. We validate the approach by applying D-Wave's hardware to circuit-based fault-diagnosis. For circuits that embed directly, we find that the hardware is typically able to find all solutions from a min-fault diagnosis set of size N using 1000N samples, using an annealing rate that is 25 times faster than a leading SAT-based sampling method. Further, we apply decomposition algorithms to find min-cardinality faults for circuits that are up to 5 times larger than can be solved directly on current hardware.Comment: 22 pages, 4 figure