High-level power optimisation for Digital Signal Processing in Recon gurable Logic

This thesis is concerned with the optimisation of Digital Signal Processing (DSP) algorithm implementations on recon gurable hardware via the selection of appropriate word-lengths for the signals in these algorithms, in order to minimise system power consumption. Whilst existing word-length optimisation work has concentrated on the minimisation of the area of algorithm implementations, this work introduces the rst set of power consumption models that can be evaluated quickly enough to be used within the search of the enormous design space of multiple word-length optimisation problems. These models achieve their speed by estimating both the power consumed within the arithmetic components of an algorithm and the power in the routing wires that connect these components, using only a high-level description of the algorithm itself. Trading o a small reduction in power model accuracy for a large increase in speed is one of the major contributions of this thesis. In addition to the work on power consumption modelling, this thesis also develops a new technique for selecting the appropriate word-lengths for an algorithm implementation in order to minimise its cost in terms of power (or some other metric for which models are available). The method developed is able to provide tight lower and upper bounds on the optimal cost that can be obtained for a particular word-length optimisation problem and can, as a result, nd provably near-optimal solutions to word-length optimisation problems without resorting to an NP-hard search of the design space. Finally the costs of systems optimised via the proposed technique are compared to those obtainable by word-length optimisation for minimisation of other metrics (such as logic area) and the results compared, providing greater insight into the nature of wordlength optimisation problems and the extent of the improvements obtainable by them

Energy-Efficient Resource Allocation in Cloud and Fog Radio Access Networks

PhD ThesisWith the development of cloud computing, radio access networks (RAN) is migrating to fully or partially centralised architecture, such as Cloud RAN (C- RAN) or Fog RAN (F-RAN). The novel architectures are able to support new applications with the higher throughput, the higher energy e ciency and the better spectral e ciency performance. However, the more complex energy consumption features brought by these new architectures are challenging. In addition, the usage of Energy Harvesting (EH) technology and the computation o oading in novel architectures requires novel resource allocation designs.This thesis focuses on the energy e cient resource allocation for Cloud and Fog RAN networks. Firstly, a joint user association (UA) and power allocation scheme is proposed for the Heterogeneous Cloud Radio Access Networks with hybrid energy sources where Energy Harvesting technology is utilised. The optimisation problem is designed to maximise the utilisation of the renewable energy source. Through solving the proposed optimisation problem, the user association and power allocation policies are derived together to minimise the grid power consumption. Compared to the conventional UAs adopted in RANs, green power harvested by renewable energy source can be better utilised so that the grid power consumption can be greatly reduced with the proposed scheme. Secondly, a delay-aware energy e cient computation o oading scheme is proposed for the EH enabled F-RANs, where for access points (F-APs) are supported by renewable energy sources. The uneven distribution of the harvested energy brings in dynamics of the o oading design and a ects the delay experienced by users. The grid power minimisation problem is formulated. Based on the solutions derived, an energy e cient o oading decision algorithm is designed. Compared to SINR-based o oading scheme, the total grid power consumption of all F-APs can be reduced signi cantly with the proposed o oading decision algorithm while meeting the latency constraint. Thirdly, an energy-e cient computation o oading for mobile applications with shared data is investigated in a multi-user fog computing network. Taking the advantage of shared data property of latency-critical applications such as virtual reality (VR) and augmented reality (AR) into consideration, the energy minimisation problem is formulated. Then the optimal computation o oading and communications resources allocation policy is proposed which is able to minimise the overall energy consumption of mobile users and cloudlet server. Performance analysis indicates that the proposed policy outperforms other o oading schemes in terms of energy e ciency. The research works conducted in this thesis and the thorough performance analysis have revealed some insights on energy e cient resource allocation design in Cloud and Fog RANs

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Optimisation of temporal networks under uncertainty

A wide variety of decision problems in operations research are defined on temporal networks, that is, workflows of time-consuming tasks whose processing order is constrained by precedence relations. For example, temporal networks are used to formalise the management of projects, the execution of computer applications, the design of digital circuits and the scheduling of production processes. Optimisation problems arise in temporal networks when a decision maker wishes to determine a temporal arrangement of the tasks and/or a resource assignment that optimises some network characteristic such as the network’s makespan (i.e., the time required to complete all tasks) or its net present value. Optimisation problems in temporal networks have been investigated intensively for more than fifty years. To date, the majority of contributions focus on deterministic formulations where all problem parameters are known. This is surprising since parameters such as the task durations, the network structure, the availability of resources and the cash flows are typically unknown at the time the decision problem arises. The tacit understanding in the literature is that the decision maker replaces these uncertain parameters with their most likely or expected values to obtain a deterministic optimisation problem. It is well-documented in theory and practise that this approach can lead to severely suboptimal decisions. The objective of this thesis is to investigate solution techniques for optimisation problems in temporal networks that explicitly account for parameter uncertainty. Apart from theoretical and computational challenges, a key difficulty is that the decision maker may not be aware of the precise nature of the uncertainty. We therefore study several formulations, each of which requires different information about the probability distribution of the uncertain problem parameters. We discuss models that maximise the network’s net present value and problems that minimise the network’s makespan. Throughout the thesis, emphasis is placed on tractable techniques that scale to industrial-size problems

Robust Resource Allocations in Temporal Networks

Temporal networks describe workflows of time-consuming tasks whose processing order is constrained by precedence relations. In many cases, the durations of the network tasks can be influenced by the assignment of resources. This leads to the problem of selecting an ‘optimal’ resource allocation, where optimality is measured by network characteristics such as the makespan (i.e., the time required to complete all tasks). In this paper, we study a robust resource allocation problem where the functional relationship between task durations and resource assignments is uncertain, and the goal is to minimise the worst-case makespan. We show that this problem is generically NP-hard. We then develop convergent bounds for the optimal objective value, as well as feasible allocations whose objective values are bracketed by these bounds. Numerical results provide empirical support for the proposed method.Robust Optimisation, Temporal Networks, Resource Allocation Problem

A Survey on the Contributions of Software-Defined Networking to Traffic Engineering

Since the appearance of OpenFlow back in 2008, software-defined networking (SDN) has gained momentum. Although there are some discrepancies between the standards developing organizations working with SDN about what SDN is and how it is defined, they all outline traffic engineering (TE) as a key application. One of the most common objectives of TE is the congestion minimization, where techniques such as traffic splitting among multiple paths or advanced reservation systems are used. In such a scenario, this manuscript surveys the role of a comprehensive list of SDN protocols in TE solutions, in order to assess how these protocols can benefit TE. The SDN protocols have been categorized using the SDN architecture proposed by the open networking foundation, which differentiates among data-controller plane interfaces, application-controller plane interfaces, and management interfaces, in order to state how the interface type in which they operate influences TE. In addition, the impact of the SDN protocols on TE has been evaluated by comparing them with the path computation element (PCE)-based architecture. The PCE-based architecture has been selected to measure the impact of SDN on TE because it is the most novel TE architecture until the date, and because it already defines a set of metrics to measure the performance of TE solutions. We conclude that using the three types of interfaces simultaneously will result in more powerful and enhanced TE solutions, since they benefit TE in complementary ways.European Commission through the Horizon 2020 Research and Innovation Programme (GN4) under Grant 691567 Spanish Ministry of Economy and Competitiveness under the Secure Deployment of Services Over SDN and NFV-based Networks Project S&NSEC under Grant TEC2013-47960-C4-3-

Multi-objective Pareto front and particle swarm optimization algorithms for power dissipation reduction in microprocessors

The progress of microelectronics making possible higher integration densities, and a considerable development of on-board systems are currently undergoing, this growth comes up against a limiting factor of power dissipation. Higher power dissipation will cause an immediate spread of generated heat which causes thermal problems. Consequently, the system's total consumed energy will increase as the system temperature increase. High temperatures in microprocessors and large thermal energy of computer systems produce huge problems of system confidence, performance, and cooling expenses. Power consumed by processors are mainly due to the increase in number of cores and the clock frequency, which is dissipated in the form of heat and causes thermal challenges for chip designers. As the microprocessor’s performance has increased remarkably in Nano-meter technology, power dissipation is becoming non-negligible. To solve this problem, this article addresses power dissipation reduction issues for high performance processors using multi-objective Pareto front (PF), and particle swarm optimization (PSO) algorithms to achieve power dissipation as a prior computation that reduces the real delay of a target microprocessor unit. Simulation is verified the conceptual fundamentals and optimization of joint body and supply voltages (Vth-VDD) which showing satisfactory findings

Software defined wireless backhauling for 5G networks

Some of the important elements to guarantee a network?s minimum level of performance are: i) using an efficient routing of the data traffic and, ii) a good resource allocation strategy. This project proposes tools to optimise these elements in an IEEE 802.11ac-based wireless backhaul network considering the constraints derived from an implementation in a software defined network. These tools have been designed using convex optimisation?s theory in order to provide an optimal solution that ensures a circuit mode routing where the impact in higher and lower layers of the network is considered. Additionally, the traffic dynamics of the network is controlled by a sensitivity analysis of the convex problem using the Lagrange multipliers to adapt the solution to the changes produced by the evolution of the traffic. Finally, results obtained using the proposed solutions show an improved performance in bit rate and end-to-end delay with respect to typical routing algorithms for simple and complex network deployments.Algunos elementos importantes para asegurar unos niveles mínimos de rendimiento en una red son: i) utilizar un enrutamiento eficiente del tráfico de datos y, ii) una buena estrategia en la asignación de recursos. Este proyecto propone herramientas para optimizar estos elementos en una red de backhaul inalámbrica basada en el protocolo IEEE 802.11ac considerando las restricciones derivadas de una implementación en una software defined network (red definida por software). Estas herramientas han sido diseñadas utilizando la teoría de optimización convexa para proponer una solución óptima que asegure un enrutamiento en modo circuito en el que se considere el impacto en capas altas y bajas de la red. Además, la dinámica del tráfico de la red se controla mediante un análisis se sensibilidad del problema convexo utilizando los multiplicadores de Lagrange para adaptar la solución a cambios de la red producidos por la evolución del tráfico. Finalmente, los resultados obtenidos a partir de las soluciones propuestas demuestran un mejor rendimiento en bit rate y latencia extremo a extremo respecto a algoritmos de enrutamiento típicos tanto en despliegues de redes sencillas como más complejas.Alguns elements importants per assegurar uns nivells mínims de rendiment en una xarxa són: i) utilitzar un encaminament eficient del trànsit de dades i, ii) una bona estratègia en l'assignació de recursos. Aquest projecte proposa eines per optimitzar aquests elements en una xarxa de backhaul sense fils basada en el protocol IEEE 802.11ac considerant les restriccions derivades d'una implementació en una software defined network (xarxa definida per software). Aquestes eines han estat dissenyades utilitzant la teoria d'optimització convexa per tal de proposar una solució òptima que asseguri un encaminament en mode circuit on es consideri l'impacte en capes altes i baixes de la xarxa. A més, la dinàmica del trànsit de la xarxa es controla mitjançant una anàlisi de sensibilitat del problema convex utilitzant els multiplicadors de Lagrange per adaptar la solució a canvis de la xarxa produïts per l'evolució del trànsit. Finalment, els resultats obtinguts a partir de les solucions proposades demostren un millor rendiment en bit rate i latència extrem a extrem respecte a algoritmes d'encaminament típics tant en desplegaments de xarxes senzilles com més complexes

A Framework for Enhancing the Energy Efficiency of IoT Devices in 5G Network

A wide range of services, such as improved mobile broadband, extensive machine-type communication, ultra-reliability, and low latency, are anticipated to be delivered via the 5G network. The 5G network has developed as a multi-layer network that uses numerous technological advancements to provide a wide array of wireless services to fulfil such a diversified set of requirements. Several technologies, including software-defined networking, network function virtualization, edge computing, cloud computing, and tiny cells, are being integrated into the 5G networks to meet the needs of various requirements. Due to the higher power consumption that will arise from such a complicated network design, energy efficiency becomes crucial. The network machine learning technique has attracted a lot of interest from the scientific community because it has the potential to play a crucial role in helping to achieve energy efficiency. Utilization factor, access latency, arrival rate, and other metrics are used to study the proposed scheme. It is determined that our system outperforms the present scheme after comparing the suggested scheme to these parameters

Battery States Monitoring and its Application in Energy Optimization of Hybrid Electric Vehicles

L'abstract è presente nell'allegato / the abstract is in the attachmen