Docker security in web simulation tools: a layered approach

International Conference on Wireless Networks and Mobile Communication (EUIWNMC), 26/08/2021-27/08/2021, Marrakesh, Marruecos.In this work, container security issues and strengths are studied using Docker as the main implementation. First, the container infrastructure is described and compared against the traditional approach of virtual machines. Secondly, the Docker containers security is discussed by the different infrastructure layers that compose them and different solutions are proposed to try to decrease the attack surface over this kind of applications.Universidad de Alcal

On the use of ray tracing programmable frameworks for radio wave propagation prediction

International Conference on Wireless Networks and Mobile Communication (EUIWNMC), 26/08/2021-27/08/2021, Marrakesh, Marruecos.This work focuses on the use of ray tracing programmable frameworks, like Nvidia Optix, for radio wave propagation prediction. Although these frameworks are oriented to graphics visualization, they can be tailored to calculate specular reflections on walls and diffractions in edges of buildings. Once all the paths between the transmitter and the receiver are obtained, Maxwell"s equations can be applied to compute the path loss or the received power.Comunidad de Madri

Linear complexity universal decoding with exponential error probability decay

In this manuscript we consider linear complexity binary linear block encoders and decoders that operate universally with exponential error probability decay. Such scenarios may be relevant in wireless scenarios where probability distributions may not be fully characterized due to the dynamic nature of wireless environments. More specifically, we consider the setting of fixed length-to-fixed length near-lossless data compression of a memoryless binary source of unknown probability distribution as well as the dual setting of communicating on a binary symmetric channel (BSC) with unknown crossover probability. We introduce a new 'min-max distance' metric, analogous to minimum distance, that addresses the universal binary setting and has the same properties as that of minimum distance on BSCs with known crossover probability. The code construction and decoding algorithm are universal extensions of the 'expander codes' framework of Barg and Zemor and have identical complexity and exponential error probability performance

Presence analytics: density-based social clustering for mobile users

We demonstrate how social density-based clustering of WLAN traces can be utilised to detect granular social groups of mobile users within a university campus. Furthermore, the ability to detect such social groups, which can be linked to the learning activities taking place at target locations, provides an invaluable opportunity to understand the presence and movement of people within such an environment. For example, the proposed density-based clustering procedure, which we call Social-DBSCAN, has real potential to support human mobility studies such as the optimisation of space usage strategies. It can automatically detect the academic term period, the classes, and the attendance data. From a large Eduroam log of an academic site, we chose as a proof concept, selected locations with known capacity for the evaluation of our proposed method, which we successfully utilise to detect the regular learning activities at those locations, and to provide accurate estimates about the attendance levels over the academic term period

The Trapping Redundancy of Linear Block Codes

We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the notion of the trapping redundancy of a code, which quantifies the relationship between the number of redundant rows in any parity-check matrix of a given code and the size of its smallest trapping set. Trapping sets with certain parameter sizes are known to cause error-floors in the performance curves of iterative belief propagation decoders, and it is therefore important to identify decoding matrices that avoid such sets. Bounds on the trapping redundancy are obtained using probabilistic and constructive methods, and the analysis covers both general and elementary trapping sets. Numerical values for these bounds are computed for the [2640,1320] Margulis code and the class of projective geometry codes, and compared with some new code-specific trapping set size estimates.Comment: 12 pages, 4 tables, 1 figure, accepted for publication in IEEE Transactions on Information Theor