Massive MIMO in sparse channels

Massive multi-user multiple-input multiple-output (MU-MIMO) systems are cellular networks where the base stations (BSs) are equipped with hundreds of antennas, N, and communicate with tens of mobile stations (MSs), K, such that, N ≫ K ≫ 1. Contrary to most prior works, in this paper, we consider the uplink of a single-cell massive MIMO system operating in sparse channels with limited scattering. This case is of particular importance in most propagation scenarios, where the prevalent Rayleigh fading assumption becomes idealistic. We derive analytical approximations for the achievable rates of maximum-ratio combining (MRC) and zero-forcing (ZF) receivers. Furthermore, we study the asymptotic behavior of the achievable rates for both MRC and ZF receivers, when N and K go to infinity under the condition that N/K → c ≥ 1. Our results indicate that the achievable rate of MRC receivers reaches an asymptotic saturation limit, whereas the achievable rate of ZF receivers grows logarithmically with the number of MSs.

Analisi del ruolo del porto di Ravenna nell’import/export di prodotti ortofrutticoli

L'elaborato tratta il ruolo del porto di Ravenna nell'import/export di prodotti ortofrutticoli. Dopo una accurata analisi dei dati, lo studio delle rotte marittime e l'uso di Dbms per gestire un database complesso, si propone un modello di programmazione lineare intera su un problema di ship routing, ship scheduling e full ship-load balancing. L'obiettivo è di massimizzare il profitto derivante da un prezzo di vendita e soggetto ai vari costi della logistica. Il modello sceglie la rotta ottimale da effettuare, in termini di ordine di visita dei vari porti che hanno un import e un export dei prodotti studiati. Inoltre, è in grado di gestire lo scorrere del tempo, fornendo come soluzione il giorno ottimale di visita dei vari porti considerati. Infine, trova la ripartizione ottima del numero di container a bordo della nave per ogni tipologia di prodotto.

Guest editorial distributed broadband wireless communications

The impetus for this special issue has been spurred by new technical trends in wireless communication and the need for high bit rate ( 1Gbit/s) services in future wireless systems. However, due to the limited transmit power, the wireless transmission distance cannot be too large if the data rate is very high. (...)

Dynamic Workload Parallelization and System Calibration on Single-Chip Cloud Computer

Many-core systems are emerging from the need of more computational power and power efficiency. However there are many issues which still revolve around the many-core systems. These systems need specialized software before they can be fully utilized and the hardware itself may differ from the conventional computational systems. To gain efficiency from many-core system, programs need to be parallelized. In many-core systems the cores are small and less powerful than cores used in traditional computing, so running a conventional program is not an efficient option. Also in Network-on-Chip based processors the network might get congested and the cores might work at different speeds. In this thesis is, a dynamic load balancing method is proposed and tested on Intel 48-core Single-Chip Cloud Computer by parallelizing a fault simulator. The maximum speedup is difficult to obtain due to severe bottlenecks in the system. In order to exploit all the available parallelism of the Single-Chip Cloud Computer, a runtime approach capable of dynamically balancing the load during the fault simulation process is used. The proposed dynamic fault simulation approach on the Single-Chip Cloud Computer shows up to 45X speedup compared to a serial fault simulation approach. Many-core systems can draw enormous amounts of power, and if this power is not controlled properly, the system might get damaged. One way to manage power is to set power budget for the system. But if this power is drawn by just few cores of the many, these few cores get extremely hot and might get damaged. Due to increase in power density multiple thermal sensors are deployed on the chip area to provide realtime temperature feedback for thermal management techniques. Thermal sensor accuracy is extremely prone to intra-die process variation and aging phenomena. These factors lead to a situation where thermal sensor values drift from the nominal values. This necessitates efficient calibration techniques to be applied before the sensor values are used. In addition, in modern many-core systems cores have support for dynamic voltage and frequency scaling. Thermal sensors located on cores are sensitive to the core's current voltage level, meaning that dedicated calibration is needed for each voltage level. In this thesis a general-purpose software-based auto-calibration approach is also proposed for thermal sensors to calibrate thermal sensors on different range of voltages.

Parallel partitioning of unstructured meshes

A method is outlined for optimising graph partitions which arise in mapping un- structured mesh calculations to parallel computers. The method employs a combination of iterative techniques to both evenly balance the workload and minimise the number and volume of interprocessor communications. They are designed to work efficiently in parallel as well as sequentially and when combined with a fast direct partitioning technique (such as the Greedy algorithm) to give an initial partition, the resulting two-stage process proves itself to be both a powerful and flexible solution to the static graph-partitioning problem. The algorithms can also be used for dynamic load-balancing and a clustering technique can additionally be employed to speed up the whole process. Experiments indicate that the resulting parallel code can provide high quality partitions, independent of the initial partition, within a few seconds.

DRAMA: Dynamic re-allocation of meshes for parallel finite element applications

In many areas of simulation, a crucial component for efficient numerical computations is the use of solution-driven adaptive features: locally adapted meshing or re-meshing; dynamically changing computational tasks. The full advantages of high performance computing (HPC) technology will thus only be able to be exploited when efficient parallel adaptive solvers can be realised. The resulting requirement for HPC software is for dynamic load balancing, which for many mesh-based applications means dynamic mesh re-partitioning. The DRAMA project has been initiated to address this issue, with a particular focus being the requirements of industrial Finite Element codes, but codes using Finite Volume formulations will also be able to make use of the project results.

Impact of node mobility in user-centric routing

Recent paradigms in wireless communication architectures describe environments where nodes present a highly dynamic behavior (e.g., User Centric Networks). In such environments, routing is still performed based on the regular packet-switched behavior of store-and-forward. Albeit sufficient to compute at least an adequate path between a source and a destination, such routing behavior cannot adequately sustain the highly nomadic lifestyle that Internet users are today experiencing. This thesis aims to analyse the impact of the nodes’ mobility on routing scenarios. It also aims at the development of forwarding concepts that help in message forwarding across graphs where nodes exhibit human mobility patterns, as is the case of most of the user-centric wireless networks today. The first part of the work involved the analysis of the mobility impact on routing, and we found that node mobility significance can affect routing performance, and it depends on the link length, distance, and mobility patterns of nodes. The study of current mobility parameters showed that they capture mobility partially. The routing protocol robustness to node mobility depends on the routing metric sensitivity to node mobility. As such, mobility-aware routing metrics were devised to increase routing robustness to node mobility. Two categories of routing metrics proposed are the time-based and spatial correlation-based. For the validation of the metrics, several mobility models were used, which include the ones that mimic human mobility patterns. The metrics were implemented using the Network Simulator tool using two widely used multi-hop routing protocols of Optimized Link State Routing (OLSR) and Ad hoc On Demand Distance Vector (AODV). Using the proposed metrics, we reduced the path re-computation frequency compared to the benchmark metric. This means that more stable nodes were used to route data. The time-based routing metrics generally performed well across the different node mobility scenarios used. We also noted a variation on the performance of the metrics, including the benchmark metric, under different mobility models, due to the differences in the node mobility governing rules of the models.

Impact of Thresholds and Load Patterns when Executing HPC Applications with Cloud Elasticity

Elasticity is one of the most known capabilities related to cloud computing, being largely deployed reactively using thresholds. In this way, maximum and minimum limits are used to drive resource allocation and deallocation actions, leading to the following problem statements: How can cloud users set the threshold values to enable elasticity in their cloud applications? And what is the impact of the application’s load pattern in the elasticity? This article tries to answer these questions for iterative high performance computing applications, showing the impact of both thresholds and load patterns on application performance and resource consumption. To accomplish this, we developed a reactive and PaaS-based elasticity model called AutoElastic and employed it over a private cloud to execute a numerical integration application. Here, we are presenting an analysis of best practices and possible optimizations regarding the elasticity and HPC pair. Considering the results, we observed that the maximum threshold influences the application time more than the minimum one. We concluded that threshold values close to 100% of CPU load are directly related to a weaker reactivity, postponing resource reconfiguration when its activation in advance could be pertinent for reducing the application runtime.

A Multi-Objective Approach for VNE: Problems using multiple ILP formulations

Network Virtualization is a key technology for the Future Internet, allowing the deployment of multiple independent virtual networks that use resources of the same basic infrastructure. An important challenge in the dynamic provision of virtual networks resides in the optimal allocation of physical resources (nodes and links) to requirements of virtual networks. This problem is known as Virtual Network Embedding (VNE). For the resolution of this problem, previous research has focused on designing algorithms based on the optimization of a single objective. On the contrary, in this work we present a multi-objective algorithm, called VNE-MO-ILP, for solving dynamic VNE problem, which calculates an approximation of the Pareto Front considering simultaneously resource utilization and load balancing. Experimental results show evidences that the proposed algorithm is better or at least comparable to a state-of-the-art algorithm. Two performance metrics were simultaneously evaluated: (i) Virtual Network Request Acceptance Ratio and (ii) Revenue/Cost Relation. The size of test networks used in the experiments shows that the proposed algorithm scales well in execution times, for networks of 84 nodes

Electric Vehicle Battery Charger: Wireless Power Transfer System Controlled by Magnetic Core Reactor

This paper presents a control process and frequency adjustment based on the magnetic core reactor for electric vehicle battery charger. Since few decades ago, there have been significant developments in technologies used in wireless power transfer systems, namely in battery charger. In the wireless power transfer systems is essential that the frequency of the primary circuit be equal to the frequency of the secondary circuit so there is the maximum energy transfer. The magnetic core reactor allows controlling the frequencies on both sides of the transmission and reception circuits. Also, the assembly diagrams and test results are presented.

Pacote de sincronização de réplicas de bases de dados

A replicação de base de dados tem como objectivo a cópia de dados entre bases de dados distribuídas numa rede de computadores. A replicação de dados é importante em várias situações, desde a realização de cópias de segurança da informação, ao balanceamento de carga, à distribuição da informação por vários locais, até à integração de sistemas heterogéneos. A replicação possibilita uma diminuição do tráfego de rede, pois os dados ficam disponíveis localmente possibilitando também o seu acesso no caso de indisponibilidade da rede. Esta dissertação baseia-se na realização de um trabalho que consistiu no desenvolvimento de uma aplicação genérica para a replicação de bases de dados a disponibilizar como open source software. A aplicação desenvolvida possibilita a integração de dados entre vários sistemas, com foco na integração de dados heterogéneos, na fragmentação de dados e também na possibilidade de adaptação a várias situações. ABSTRACT: Data replication is a mechanism to synchronize and integrate data between distributed databases over a computer network. Data replication is an important tool in several situations, such as the creation of backup systems, load balancing between various nodes, distribution of information between various locations, integration of heterogeneous systems. Replication enables a reduction in network traffic, because data remains available locally even in the event of a temporary network failure. This thesis is based on the work carried out to develop an application for database replication to be made accessible as open source software. The application that was built allows for data integration between various systems, with particular focus on, amongst others, the integration of heterogeneous data, the fragmentation of data, replication in cascade, data format changes between replicas, master/slave and multi master synchronization.

Realizzazione di una blockchain privata per la gestione di una rete di pagamenti

Nel seguente documento di tesi lo scopo della tecnologia blockchain è quello di creare un’architettura sicura per gli scambi di utility token basata su un sistema distribuito, ovvero un insieme eterogeneo formato da più calcolatori che appare all’utilizzatore come un unico dispositivo. Questa tesi descrive la progettazione e realizzazione di una rete blockchain Stellar permissioned capace di gestire transazioni di token applicabile a innumerevoli contesti all’interno di un ecosistema di pagamenti e di servizi. La tecnologia blockchain offre molteplici vantaggi tra cui la possibilità di diminuire le commissioni delle transazioni rispetto agli attuali sistemi di pagamento. L’architettura dell’infrastruttura di rete progettata prevede, oltre ai nodi della rete blockchain vera e propria, altri server che si occupano in particolare di offrire un servizio di database di custodia delle chiavi, un servizio di load balancing ed un servizio di accesso ai dati presenti nella rete tramite chiamate API fornite dai nodi Horizon. Oltre a questi è stato creato un elemento ad-hoc, ovvero il software BTKL, utilizzato per semplificare la comunicazione con la blockchain e per incrementare la sicurezza di comunicazione con il database di custodia.

Loading and damage modelling for an integrated SHM system of a prestressed concrete railway bridge in Naples

The thesis explores recent technology developments in the field of structural health monitoring and its application to railway bridge projects. It focuses on two main topics. First, service loads and effect of environmental actions are modelled. In particular, the train moving load and its interaction with rail track is considered with different degrees of detail. Hence, results are compared with real-time experimental measurements. Secondly, the work concerns the identification, definition and modelling process of damages for a prestressed concrete railway bridge, and their implementation inside FEM models. Along with a critical interpretation of the in-field measurements, this approach results in the development of undamaged and damaged databases for the AI-aided detection of anomalies and the definition of threshold levels to prompt automatic alert interventions. In conclusion, an innovative solution for the development of the railway weight-in-motion system is proposed.

Random Access Procedures in 5G IoT via NTN: System level performances

The Internet of Things (IoT) is a critical pillar in the digital transformation because it enables interaction with the physical world through remote sensing and actuation. Owing to the advancements in wireless technology, we now have the opportunity of using their features to the best of our abilities and improve over the current situation. Indeed, the Internet of Things market is expanding at an exponential rate, with devices such as alarms and detectors, smart metres, trackers, and wearables being used on a global scale for automotive and agriculture, environment monitoring, infrastructure surveillance and management, healthcare, energy and utilities, logistics, good tracking, and so on. The Third Generation Partnership Project (3GPP) acknowledged the importance of IoT by introducing new features to support it. In particular, in Rel.13, the 3GPP introduced the so-called IoT to support Low Power Wide Area Networks (LPWAN).As these devices will be distributed in areas where terrestrial networks are not feasible or commercially viable, satellite networks will play a complementary role due to their ability to provide global connectivity via their large footprint size and short service deployment time. In this context, the goal of this thesis is to investigate the viability of integrating IoT technology with satellite communication (SatCom) systems, with a focus on the Random Access(RA) Procedure. Indeed, the RA is the most critical procedure because it allows the UE to achieve uplink synchronisation, obtain the permanent ID, and obtain uplink transmission resources. The goal of this thesis is to evaluate preamble detection in the SatCom environment.

Photoelastic Analysis Of All-on-four Concept Using Different Implants Angulations For Maxilla.

Conventional tilted implants are used in oral rehabilitation for heavily absorbed maxilla to avoid bone grafts; however, few research studies evaluate the biomechanical behavior when different angulations of the implants are used. The aim of this study was evaluate, trough photoelastic method, two different angulations and length of the cantilever in fixed implant-supported maxillary complete dentures. Two groups were evaluated: G15 (distal tilted implants 15°) and G35 (distal tilted implants 35°) n = 6. For each model, 2 distal tilted implants (3.5 x 15 mm long cylindrical cone) and 2 parallel tilted implants in the anterior region (3.5 x 10 mm) were installed. Photoelastic models were submitted to three vertical load tests: in the end of cantilever, in the last pillar and in the all pillars at the same time. We obtained the shear stress by Fringes software and found values for total, cervical and apical stress. The quantitative analysis was performed using the Student tests and Mann-Whitney test; p ≥ 0.05. There is no difference between G15 and G35 for total stress regardless of load type. Analyzing the apical region, G35 reduced strain values considering the distal loads (in the cantilever p = 0.03 and in the last pillar p = 0.02), without increasing the stress level in the cervical region. Considering the load in all pillars, G35 showed higher stress concentration in the cervical region (p = 0.04). For distal loads, G15 showed increase of tension in the apical region, while for load in all pillars, G35 inclination increases stress values in the cervical region.