Joint Power Allocation and User Association Optimization for Massive MIMO Systems

This paper investigates the joint power allocation and user association problem in multi-cell Massive MIMO (multiple-input multiple-output) downlink (DL) systems. The target is to minimize the total transmit power consumption when each user is served by an optimized subset of the base stations (BSs), using non-coherent joint transmission. We first derive a lower bound on the ergodic spectral efficiency (SE), which is applicable for any channel distribution and precoding scheme. Closed-form expressions are obtained for Rayleigh fading channels with either maximum ratio transmission (MRT) or zero forcing (ZF) precoding. From these bounds, we further formulate the DL power minimization problems with fixed SE constraints for the users. These problems are proved to be solvable as linear programs, giving the optimal power allocation and BS-user association with low complexity. Furthermore, we formulate a max-min fairness problem which maximizes the worst SE among the users, and we show that it can be solved as a quasi-linear program. Simulations manifest that the proposed methods provide good SE for the users using less transmit power than in small-scale systems and the optimal user association can effectively balance the load between BSs when needed. Even though our framework allows the joint transmission from multiple BSs, there is an overwhelming probability that only one BS is associated with each user at the optimal solution.Comment: 16 pages, 12 figures, Accepted by IEEE Trans. Wireless Commu

Scalable cell-free massive MIMO networks with LEO satellite support

This paper presents an integrated network architecture combining a cell-free massive multiple-input multiple-output (CF-M-MIMO) terrestrial layout with a low Earth orbit satellite segment where the scalability of the terrestrial segment is taken into account. The main purpose of such an integrated scheme is to transfer to the satellite segment those users that somehow limit the performance of the terrestrial network. Towards this end, a correspondingly scalable technique is proposed to govern the ground-to-satellite user diversion that can be tuned to different performance metrics. In particular, in this work the proposed technique is configured to result in an heuristic that improves the minimum per-user rate and the sum-rate of the overall network. Simulation results serve to identify under which conditions the satellite segment can become an attractive solution to enhance users’ performance. Generally speaking, although the availability of the satellite segment always leads to an improvement of users’ rates, it is in those cases where the terrestrial CF-M-MIMO network exhibits low densification traits that the satellite backup becomes crucial.This work was supported in part by the Agencia Estatal de Investigación, Ministerio de Ciencia e Innovación (MCIN/AEI/10.13039/501100011033) through the R+D+i Project under Grant PID2020-115323RB-C32 and Grant PID2020-115323RB-C31; and in part by the Centre Tecnológic de Telecomunicacions de Catalunya Researchers through the Grant from the Spanish Ministry of Economic Affairs and Digital Transformation and the European Union-NextGenerationEU under Grant UNICO-5G I+D/AROMA3D-Hybrid TSI-063000-2021-71.Peer ReviewedPostprint (published version

Data security and trading framework for smart grids in neighborhood area networks

Due to the drastic increase of electricity prosumers, i.e., energy consumers that are also producers, smart grids have become a key solution for electricity infrastructure. In smart grids, one of the most crucial requirements is the privacy of the final users. The vast majority of the literature addresses the privacy issue by providing ways of hiding user’s electricity consumption. However, open issues in the literature related to the privacy of the electricity producers still remain. In this paper, we propose a framework that preserves the secrecy of prosumers’ identities and provides protection against the traffic analysis attack in a competitive market for energy trade in a Neighborhood Area Network (NAN). In addition, the amount of bidders and of successful bids are hidden from malicious attackers by our framework. Due to the need for small data throughput for the bidders, the communication links of our framework are based on a proprietary communication system. Still, in terms of data security, we adopt the Advanced Encryption Standard (AES) 128bit with Exclusive-OR (XOR) keys due to their reduced computational complexity, allowing fast processing. Our framework outperforms the state-of-the-art solutions in terms of privacy protection and trading flexibility in a prosumer-to-prosumer design

Expectation-Driven Interaction: a Model Based on Luhmann's Contingency Approach

We introduce an agent-based model of interaction, drawing on the contingency approach from Luhmann\'s theory of social systems. The agent interactions are defined by the exchange of distinct messages. Message selection is based on the history of the interaction and developed within the confines of the problem of double contingency. We examine interaction strategies in the light of the message-exchange description using analytical and computational methods.Contingency, Message Exchange Model, Interaction, Expectation-Expectation, Asymptotic Analysis

Ray: A Distributed Execution Engine for the Machine Learning Ecosystem

In recent years, growing data volumes and more sophisticated computational procedures have greatly increased the demand for computational power. Machine learning and artificial intelligence applications, for example, are notorious for their computational requirements. At the same time, Moores law is ending and processor speeds are stalling. As a result, distributed computing has become ubiquitous. While the cloud makes distributed hardware infrastructure widely accessible and therefore offers the potential of horizontal scale, developing these distributed algorithms and applications remains surprisingly hard. This is due to the inherent complexity of concurrent algorithms, the engineering challenges that arise when communicating between many machines, the requirements like fault tolerance and straggler mitigation that arise at large scale and the lack of a general-purpose distributed execution engine that can support a wide variety of applications.In this thesis, we study the requirements for a general-purpose distributed computation model and present a solution that is easy to use yet expressive and resilient to faults. At its core our model takes familiar concepts from serial programming, namely functions and classes, and generalizes them to the distributed world, therefore unifying stateless and stateful distributed computation. This model not only supports many machine learning workloads like training or serving, but is also a good t for cross-cutting machine learning applications like reinforcement learning and data processing applications like streaming or graph processing. We implement this computational model as an open-source system called Ray, which matches or exceeds the performance of specialized systems in many application domains, while also offering horizontally scalability and strong fault tolerance properties