Abstract
In this work we identify a seminal design guideline that prevents current Full-Duplex (FD) MAC protocols to scale the FD capacity gain (i.e. 2x the half-duplex throughput) in single-cell Wi-Fi networks. Under such guideline (referred to as 1:1), a MAC protocol attempts to initiate up to two simultaneous transmissions in the FD bandwidth. Since in single-cell Wi-Fi networks MAC performance is bounded by the PHY layer capacity, this implies gains strictly less than 2x over half-duplex at the MAC layer. To face this limitation, we argue for the 1:N design guideline. Under 1:N, FD MAC protocols 'see' the FD bandwidth through N > 1 orthogonal narrow-channel PHY layers. Based on theoretical results and software defined radio experiments, we show the 1:N design can leverage the Wi-Fi capacity gain more than 2x at and below the MAC layer. This translates the denser modulation scheme incurred by channel narrowing and the increase in the spatial reuse factor enabled by channel orthogonality. With these results, we believe our design guideline can inspire a new generation of Wi-Fi MAC protocols that fully embody and scale the FD capacity gain.

Abstract

Abstract
We propose a systematic concatenated coding scheme based on the combination of interleaving with powerful channel codes and jamming for wireless secrecy under the practical assumption of codes in the finite blocklength regime. The basic idea lies in generating a short random key that is used to shuffle/interleave information at the source, Alice. This key is then sent to the legitimate receiver, Bob, during a brief period of advantageous communication over the eavesdropper Eve (e.g., due to more interference from a jammer). Finally, the key is decoded at Bob to properly deinterleave the original information. Bob receives a better quality version of the interleaving key, therefore having the needed advantage over Eve. Information reliability is provided by a strong inner code, while security against Eve results from the proper selection of the outer code and interference levels over the key. We propose a methodology for selection of the outer code with reliability and security constraints. For that, we introduce bit error complementary cumulative distribution function metrics, suitable for security and reliability analysis of error correcting codes.

Abstract
This paper presents a new technique for providing the analysis and comparison of wiretap codes in the small blocklength regime over the binary erasure wiretap channel. A major result is the development of Monte Carlo strategies for quantifying a code's equivocation, which mirrors techniques used to analyze forward error correcting codes. For this paper, we limit our analysis to coset-based wiretap codes, and give preferred strategies for calculating and/or estimating the equivocation in order of preference. We also make several comparisons of different code families. Our results indicate that there are security advantages to using algebraic codes for applications that require small to medium blocklengths.

Abstract
The exploration of the physical layer characteristics of the wireless channel is currently the object of intensive research in order to develop advanced secrecy schemes that can protect information against eavesdropping attacks. Following this line of work, in this manuscript we consider a massive MIMO system and jointly design the channel precoder and security scheme. By doing that we ensure that the precoding operation does not reduce the degree of secrecy provided by the security scheme. The fundamental working principle of the proposed technique is to apply selective random rotations in the transmitted signal at the antenna level in order to achieve a compromise between legitimate and eavesdropper channel capacities. These rotations use the phase of the reciprocal wireless channel as a common random source between the transmitter and the intended receiver. To assess the security performance, the proposed joint scheme is compared with a recently proposed approach for massive MIMO systems. The results show that, with the proposed joint design, the number of antenna elements does not influence the eavesdropper channel capacity, which is proved to be equal to zero, in contrast to previous approaches.

Abstract
Predicting the inherent traffic behaviour of a network is an essential task, which can be used for various purposes, such as monitoring and managing the network's infrastructure. However, the recent surge of dynamic environments, such as Internet of Things and Cloud Computing have hampered this task. This means that the traffic on these networks is even more complex, displaying a nonlinear behaviour with specific aperiodic characteristics during daily operation. Traditional network traffic predictors are usually based on large historical data bases which are used to train algorithms. This may not be suitable for these highly volatile environments, where the strength of the force exerted in the interaction between past and current values may change quickly with time. In light of this, a taxonomy for network traffic prediction models, including the review of state of the art, is presented here. In addition, an analysis mechanism, focused on providing a standardized approach for evaluating the best candidate predictor models for these environments, is proposed. These contributions favour the analysis of the efficacy and efficiency of network traffic prediction among several prediction models in terms of accuracy, historical dependency, running time and computational overhead. An evaluation of several prediction mechanisms is performed by assessing the Normalized Mean Square Error and Mean Absolute Percent Error of the values predicted by using traces taken from two real case studies in cloud computing.