The combination of cloud computing capabilities at the network edge and artificial intelligence promise to turn future mobile networks into service- and radio-aware entities, able to address the requirements of upcoming latency-sensitive applications
. In this context, a challenging research goal is to exploit edge intelligence to dynamically and optimally manage the Radio Access Network Slicing (that is a less mature and more complex technology than fifth-generation Network Slicing) and Radio Resource Management, which is a very complex task due to the mostly unpredictably nature of the wireless channel. This paper presents a novel architecture that leverages Deep Reinforcement Learning at the edge of the network in order to address Radio Access Network Slicing and Radio Resource Management optimization supporting latency-sensitive applications. The effectiveness of our proposal against baseline methodologies is investigated through computer simulation, by considering an autonomous-driving use-case.
We investigate a multi-user multiple-input multiple-output interference network in the presence of multiple reconfigurable intelligent surfaces (RISs). The entire system is described by using a circuit-based model for the transmitters, receivers, and
RISs. This is obtained by leveraging the electromagnetic tool of mutual impedances, which accounts for the signal propagation and the mutual coupling among closely-spaced scattering elements. An iterative and provably convergent optimization algorithm that maximizes the sum-rate of RIS-assisted multi-user interference channels is introduced. Numerical results show that the sum-rate is enhanced if the mutual coupling among the elements of the RISs is accounted for at the optimization stage.
In this paper, we consider a multi-user multiple-input multiple-output (MIMO) system aided by multiple intelligent reflecting surfaces (IRSs) that are deployed to increase the coverage and, possibly, the rank of the channel. We propose an optimizatio
n algorithm to configure the IRSs, which is aimed at maximizing the network sum-rate by exploiting only the statistical characterization of the environment, such as the distribution of the locations of the users and the distribution of the multipath channels. As a consequence, the proposed approach does not require the estimation of the instantaneous channel state information (CSI) for system optimization, thus significantly relaxing (or even avoiding) the need of frequently reconfiguring the IRSs, which constitutes one of the most critical issues in IRS-assisted systems. Numerical results confirm the validity of the proposed approach. It is shown, in particular, that IRS-assisted wireless systems that are optimized based on statistical CSI still provide large performance gains as compared to the baseline scenarios in which no IRSs are deployed.
In this paper, we study the problem of power and channel allocation for multicarrier non-orthogonal multiple access (NOMA) full duplex (FD) systems. In such a system there are multiple interfering users transmitting over the same channel and the allo
cation task is a non-convex and extremely challenging problem. The objective of our work is to propose a solution that is close to the theoretic optimum but is of limited complexity. Following a block coordinate descent approach, we propose two algorithms based on the decomposition of the original allocation problem in lower-complexity sub-problems, which can be solved in the Lagrangian dual domain with a great reduction of the computational load. Numerical results show the effectiveness of approach we propose, which outperforms other schemes designed to address NOMA-FD allocation and attains performance similar to the optimal solution with much lower complexity.
In this paper we study the problem of power and channel allocation with the objective of maximizing the system sum-rate for multicarrier non-orthogonal multiple access (NOMA) full duplex (FD) systems. Such an allocation problem is non-convex and, thu
s, with the goal of designing a low complexity solution, we propose a scheme based on the minimization of the weighted mean square error, which achieves performance reasonably close to the optimum and allows to clearly outperforms a conventional orthogonal multiple access approach. Numerical results assess the effectiveness of our algorithm.
We consider a simple, yet widely studied, set-up in which a Fusion Center (FC) is asked to make a binary decision about a sequence of system states by relying on the possibly corrupted decisions provided by byzantine nodes, i.e. nodes which deliberat
ely alter the result of the local decision to induce an error at the fusion center. When independent states are considered, the optimum fusion rule over a batch of observations has already been derived, however its complexity prevents its use in conjunction with large observation windows. In this paper, we propose a near-optimal algorithm based on message passing that greatly reduces the computational burden of the optimum fusion rule. In addition, the proposed algorithm retains very good performance also in the case of dependent system states. By first focusing on the case of small observation windows, we use numerical simulations to show that the proposed scheme introduces a negligible increase of the decision error probability compared to the optimum fusion rule. We then analyse the performance of the new scheme when the FC make its decision by relying on long observation windows. We do so by considering both the case of independent and Markovian system states and show that the obtained performance are superior to those obtained with prior suboptimal schemes. As an additional result, we confirm the previous finding that, in some cases, it is preferable for the byzantine nodes to minimise the mutual information between the sequence system states and the reports submitted to the FC, rather than always flipping the local decision.
The implementation of device-to-device (D2D) underlaying or overlaying pre-existing cellular networks has received much attention due to the potential of enhancing the total cell throughput, reducing power consumption and increasing the instantaneous
data rate. In this paper we propose a distributed power allocation scheme for D2D OFDMA communications and, in particular, we consider the two operating modes amenable to a distributed implementation: dedicated and reuse modes. The proposed schemes address the problem of maximizing the users sum rate subject to power constraints, which is known to be nonconvex and, as such, extremely difficult to be solved exactly. We propose here a fresh approach to this well-known problem, capitalizing on the fact that the power allocation problem can be modeled as a potential game. Exploiting the potential games property of converging under better response dynamics, we propose two fully distributed iterative algorithms, one for each operation mode considered, where each user updates sequentially and autonomously its power allocation. Numerical results, computed for several different user scenarios, show that the proposed methods, which converge to one of the local maxima of the objective function, exhibit performance close to the maximum achievable optimum and outperform other schemes presented in the literature.
Optimum decision fusion in the presence of malicious nodes - often referred to as Byzantines - is hindered by the necessity of exactly knowing the statistical behavior of Byzantines. By focusing on a simple, yet widely studied, set-up in which a Fusi
on Center (FC) is asked to make a binary decision about a sequence of system states by relying on the possibly corrupted decisions provided by local nodes, we propose a game-theoretic framework which permits to exploit the superior performance provided by optimum decision fusion, while limiting the amount of a-priori knowledge required. We first derive the optimum decision strategy by assuming that the statistical behavior of the Byzantines is known. Then we relax such an assumption by casting the problem into a game-theoretic framework in which the FC tries to guess the behavior of the Byzantines, which, in turn, must fix their corruption strategy without knowing the guess made by the FC. We use numerical simulations to derive the equilibrium of the game, thus identifying the optimum behavior for both the FC and the Byzantines, and to evaluate the achievable performance at the equilibrium. We analyze several different setups, showing that in all cases the proposed solution permits to improve the accuracy of data fusion. We also show that, in some instances, it is preferable for the Byzantines to minimize the mutual information between the status of the observed system and the reports submitted to the FC, rather than always flipping the decision made by the local nodes as it is customarily assumed in previous works.
The most common approach to mitigate the impact that the presence of malicious nodes has on the accuracy of decision fusion schemes consists in observing the behavior of the nodes over a time interval T and then removing the reports of suspect nodes
from the fusion process. By assuming that some a-priori information about the presence of malicious nodes and their behavior is available, we show that the information stemming from the suspect nodes can be exploited to further improve the decision fusion accuracy. Specifically, we derive the optimum fusion rule and analyze the achievable performance for two specific cases. In the first case, the states of the nodes (corrupted or honest) are independent of each other and the fusion center knows only the probability that a node is malicious. In the second case, the exact number of corrupted nodes is fixed and known to the fusion center. We also investigate the optimum corruption strategy for the malicious nodes, showing that always reverting the local decision does not necessarily maximize the loss of performance at the fusion center.
