Search

The millimeter wave (mmWave) band will be exploited to address the growing demand for high data rates and low latency. The higher frequencies, however, are prone to limitations on the propagation of the signal in the environment. Thus, highly directional beamforming is needed to increase the antenna gain. Another crucial problem of the mmWave frequencies is their vulnerability to blockage by physical obstacles. To this aim, we studied the problem of modeling the impact of second-order effects on mmWave channels, specifically the susceptibility of the mmWave signals to physical blockers. With respect to existing works on this topic, our project focuses on scenarios where mmWaves interact with multiple, dynamic blockers. Our open source software includes diffraction-based blockage models and interfaces directly with an open source Radio Frequency (RF) ray-tracing software., Comment: 9 pages, 7 figures, 1 tables. This paper has been accepted for presentation at the 20th Mediterranean Communication and Computer Networking Conference. Copyright IEEE 2022

Over the past few years, the concept of VR has attracted increasing interest thanks to its extensive industrial and commercial applications. Currently, the 3D models of the virtual scenes are generally stored in the VR visor itself, which operates as a standalone device. However, applications that entail multi-party interactions will likely require the scene to be processed by an external server and then streamed to the visors. However, the stringent Quality of Service (QoS) constraints imposed by VR's interactive nature require Network Slicing (NS) solutions, for which profiling the traffic generated by the VR application is crucial. To this end, we collected more than 4 hours of traces in a real setup and analyzed their temporal correlation. More specifically, we focused on the CBR encoding mode, which should generate more predictable traffic streams. From the collected data, we then distilled two prediction models for future frame size, which can be instrumental in the design of dynamic resource allocation algorithms. Our results show that even the state-of-the-art H.264 CBR mode can have significant fluctuations, which can impact the NS optimization. We then exploited the proposed models to dynamically determine the Service Level Agreement (SLA) parameters in an NS scenario, providing service with the required QoS while minimizing resource usage., Comment: 17 pages. 18 figures. This paper has been submitted to IEEE Transactions on Mobile Computing. Copyright may change without notice. arXiv admin note: substantial text overlap with arXiv:2201.07043

Over the past few years, eXtended Reality (XR) has attracted increasing interest thanks to its extensive industrial and commercial applications, and its popularity is expected to rise exponentially over the next decade. However, the stringent Quality of Service (QoS) constraints imposed by XR's interactive nature require Network Slicing (NS) solutions to support its use over wireless connections: in this context, quasi-Constant Bit Rate (CBR) encoding is a promising solution, as it can increase the predictability of the stream, making the network resource allocation easier. However, traffic characterization of XR streams is still a largely unexplored subject, particularly with this encoding. In this work, we characterize XR streams from more than 4 hours of traces captured in a real setup, analyzing their temporal correlation and proposing two prediction models for future frame size. Our results show that even the state-of-the-art H.264 CBR mode can have significant frame size fluctuations, which can impact the NS optimization. Our proposed prediction models can be applied to different traces, and even to different contents, achieving very similar performance. We also show the trade-off between network resource efficiency and XR QoS in a simple NS use case., Comment: 10 pages, 10 figures. The paper has been submitted to IEEE WoWMoM 2022. Copyright may change without notice

Thanks to recent advancements in the technology, eXtended Reality (XR) applications are gaining a lot of momentum, and they will surely become increasingly popular in the next decade. These new applications, however, require a step forward also in terms of models to simulate and analyze this type of traffic sources in modern communication networks, in order to guarantee to the users state of the art performance and Quality of Experience (QoE). Recognizing this need, in this work, we present a novel open-source traffic model, which researchers can use as a starting point both for improvements of the model itself and for the design of optimized algorithms for the transmission of these peculiar data flows. Along with the mathematical model and the code, we also share with the community the traces that we gathered for our study, collected from freely available applications such as Minecraft VR, Google Earth VR, and Virus Popper. Finally, we propose a roadmap for the construction of an end-to-end framework that fills this gap in the current state of the art., Comment: 15 pages, 8 figures, 2 tables, 1 algorithm. This paper has been submitted to IEEE Access, copyright might change without notice. Please cite it as: M. Lecci, M. Drago, A. Zanella, M. Zorzi, "An Open Framework for Analyzing and Modeling XR Network Traffic," Submitted to IEEE Access, Pre-print available on arXiv

The latest IEEE 802.11 amendments provide support to directional communications in the Millimeter Wave spectrum and, thanks to the wide bandwidth available at such frequencies, makes it possible to wirelessly approach several emergent use cases, such as virtual and augmented reality, telepresence, and remote control of industrial facilities. However, these applications require stringent Quality of Service, that only contention-free scheduling algorithms can guarantee. In this paper, we propose an end-to-end framework for the joint admission control and scheduling of periodic traffic streams over mmWave Wireless Local Area Networks based on Network Simulator 3, a popular full-stack open-source network simulator. Moreover, we design a baseline algorithm to handle scheduling requests, and we evaluate its performance with a full-stack perspective. The algorithm is tested in three scenarios, where we investigated different configurations and features to highlight the differences and trade-offs between contention-based and contention-free access strategies., Comment: 6 pages, 3 figures, 1 table. This paper has been submitted to IEEE GLOBECOM 2021. Copyright may change without notice

Next-generation wireless communication technologies will allow users to obtain unprecedented performance, paving the way to new and immersive applications. A prominent application requiring high data rates and low communication delay is Virtual Reality (VR), whose presence will become increasingly stronger in the years to come. To the best of our knowledge, we propose the first traffic model for VR applications based on traffic traces acquired from a commercial VR streaming software, allowing the community to further study and improve the technology to manage this type of traffic. This work implements ns-3 applications able to generate and process large bursts of packets, enabling the possibility of analyzing APP-level end-to-end metrics, making the source code as well as the acquired VR traffic traces publicly available and open-source., Comment: 9 pages, 6 figures. Please cite it as: M. Lecci, A. Zanella, M. Zorzi, "An ns-3 Implementation of a Bursty Traffic Framework for Virtual Reality Sources," in Workshop on ns-3 (WNS3), Jun. 2021, Virtual Event, US

Many current and future multimedia and industrial applications, like video streaming, eXtended Reality or remote robot control, are characterized by periodic data transmissions with strict latency and reliability constraints. In an effort to meet the stringent demand of such traffic sources, the WiGig standards support a contention-free channel access mechanism, named Service Period, that makes it possible to allocate dedicated time intervals to certain wireless stations. However, the standard only covers the fundamental aspects that ensure interoperability, while the actual schedule logic is left to vendors. In this paper, we propose two algorithms for joint admission control and scheduling of periodic traffic streams with contrasting performance objectives, specifically a simple scheduler and a max-min fair scheduler. The schemes are compared in two different scenarios, in order to characterize and highlight some fundamental trade-offs. As expected from their design principles, the simple scheduler tends to trade acceptance rate for resource availability, contrary to the max-min fair scheduler, giving to implementers a clear performance trade-off, although performance cannot be balanced by means of a tunable parameter., Comment: 8 pages, 6 figures, 2 algorithms. This paper was submitted to IEEE MedComNet 2021

Millimeter wave (mmWave) communication represents one of the main innovations of the next generation of wireless technologies, allowing users to reach unprecedented data rates. To overcome the high path loss at mmWave frequencies, these systems make use of directional antennas able to focus the transmit power into narrow beams using BeamForming (BF) techniques, thus making the communication directional. This new paradigm opens up a set of challenges for the design of efficient wireless systems, in which antenna and BF components play an important role also at the higher layer of the protocol stack. For this reason, accurate modeling of these components in a full-stack simulation is of primary importance to understand the overall system behavior. This paper proposes a novel framework for the end-to-end simulation of 5G mmWave cellular networks, including a ray-tracing based channel model and accurate models for antenna arrays and BF schemes. We showcase this framework by evaluating the performance of different antenna and BF configurations considering both link-level and end-to-end metrics and present the obtained results.

The IEEE 802.11ad WiFi amendment enables short-range multi-gigabit communications in the unlicensed 60~GHz spectrum, unlocking new interesting applications such as wireless Augmented and Virtual Reality. The characteristics of the mmWave band and directional communications allow increasing the system throughput by scheduling pairs of nodes with low cross-interfering channels in the same time-frequency slot. On the other hand, this requires significantly more signaling overhead. Furthermore, IEEE 802.11ad introduces a hybrid MAC characterized by two different channel access mechanisms: contention-based and contention-free access periods. The coexistence of both access period types and the directionality typical of mmWave increase the channel access and scheduling complexity in IEEE 802.11ad compared to previous WiFi versions. Hence, to provide the Quality of Service (QoS) performance required by demanding applications, a proper resource scheduling mechanism that takes into account both directional communications and the newly added features of this WiFi amendment is needed. In this paper, we present a brief but comprehensive review of the open problems and challenges associated with channel access in IEEE 802.11ad and propose a workflow to tackle them via both heuristic and learning-based methods., Comment: 4 pages, 3 figures. Please cite it as: S. Mohebi, M. Lecci, A. Zanella, M. Zorzi, "The challenges of Scheduling and Resource Allocation in IEEE 802.11ad/ay," in 18th Mediterranean Communication and Computer Networking Conference (MedComNet), Arona, Italy, Jun. 2020

The millimeter wave (mmWave) band will provide multi-gigabits-per-second connectivity in the radio access of future wireless systems. The high propagation loss in this portion of the spectrum calls for the deployment of large antenna arrays to compensate for the loss through high directional gain, thus introducing a spatial dimension in the channel model to accurately represent the performance of a mmWave network. In this perspective, ray-tracing can characterize the channel in terms of Multi Path Components (MPCs) to provide a highly accurate model, at the price of extreme computational complexity (e.g., for processing detailed environment information about the propagation), which limits the scalability of the simulations. In this paper, we present possible simplifications to improve the trade-off between accuracy and complexity in ray-tracing simulations at mmWaves by reducing the total number of MPCs. The effect of such simplifications is evaluated from a full-stack perspective through end-to-end simulations, testing different configuration parameters, propagation scenarios, and higher-layer protocol implementations. We then provide guidelines on the optimal degree of simplification, for which it is possible to reduce the complexity of simulations with a minimal reduction in accuracy for different deployment scenarios., Comment: 31 pages, 14 figures, 1 table. This paper has been submitted to IEEE for publication. Copyright IEEE 2020. Please cite it as: Mattia Lecci, Paolo Testolina, Michele Polese, Marco Giordani, Michele Zorzi, "Accuracy vs. Complexity for mmWave Ray-Tracing: A Full Stack Perspective.''

5G and beyond networks will use, for the first time ever, the millimeter wave (mmWave) spectrum for mobile communications. Accurate performance evaluation is fundamental to the design of reliable mmWave networks, with accuracy rooted in the fidelity of the channel models. At mmWaves, the model must account for the spatial characteristics of propagation since networks will employ highly directional antennas to counter the much greater pathloss. In this regard, Quasi-Deterministic (QD) models are highly accurate channel models, which characterize the propagation in terms of clusters of multipath components, given by a reflected ray and multiple diffuse components of any given Computer Aided Design (CAD) scenario. This paper introduces a detailed mathematical formulation for QD models at mmWaves, that can be used as a reference for their implementation and development. Moreover, it compares channel instances obtained with an open source NIST QD model implementation against real measurements at 60 GHz, substantiating the accuracy of the model. Results show that, when comparing the proposed model and deterministic rays alone with a measurement campaign, the Kolmogorov-Smirnov (KS) test of the QD model improves by up to 0.537., Comment: 6 pages, 5 figures, 1 table, presented at IEEE GLOBECOM 2020. Please cite it as: M. Lecci, M. Polese, C. Lai, J. Wang, C. Gentile, N. Golmie, M. Zorzi, "Quasi-Deterministic Channel Model for mmWaves: Mathematical Formalization and Validation," IEEE Global Communications Conference (GLOBECOM), Dec. 2020, Taipei, Taiwan

Millimeter-wave (mmWave) communication is one of the cornerstone innovations of fifth-generation (5G) wireless networks, thanks to the massive bandwidth available in these frequency bands. To correctly assess the performance of such systems, however, it is essential to have reliable channel models, based on a deep understanding of the propagation characteristics of the mmWave signal. In this respect, ray tracers can provide high accuracy, at the expense of a significant computational complexity, which limits the scalability of simulations. To address this issue, in this paper we present possible simplifications that can reduce the complexity of ray tracing in the mmWave environment, without significantly affecting the accuracy of the model. We evaluate the effect of such simplifications on link-level metrics, testing different configuration parameters and propagation scenarios., Comment: 6 pages, 6 figures, 1 table. This paper has been accepted for presentation at ITA 2020. (c) 2020 IEEE. Please cite it as: M. Lecci, P. Testolina, M. Giordani, M. Polese, T. Ropitault, C. Gentile, N. Varshney, A. Bodi, M. Zorzi, "Simplified Ray Tracing for the Millimeter Wave Channel: A Performance Evaluation," Information Theory and Applications Workshop (ITA), San Diego, US, 2020

With the advent of millimeter wave (mmWave) communications, the combination of a detailed 5G network simulator with an accurate antenna radiation model is required to analyze the realistic performance of complex cellular scenarios. However, due to the complexity of both electromagnetic and network models, the design and optimization of antenna arrays is generally infeasible due to the required computational resources and simulation time. In this paper, we propose a Machine Learning framework that enables a simulation-based optimization of the antenna design. We show how learning methods are able to emulate a complex simulator with a modest dataset obtained from it, enabling a global numerical optimization over a vast multi-dimensional parameter space in a reasonable amount of time. Overall, our results show that the proposed methodology can be successfully applied to the optimization of thinned antenna arrays., Comment: 5 pages, 7 figures. This paper has been presented at EuCAP 2020. Copyright IEEE 2020. Please cite it as: M. Lecci, P. Testolina, M. Rebato, A. Testolin, and M. Zorzi, "Machine Learning-aided Design of Thinned Antenna Arrays for Optimized Network Level Performance," 14th European Conference on Antennas and Propagation (EuCAP 2020), Copenhagen, Mar. 2020

Communication at millimeter wave (mmWave) frequencies is one of the main novelties introduced in the 5th generation (5G) of cellular networks. The opportunities and challenges associated with such high frequencies have stimulated a number of studies that rely on simulation for the evaluation of the proposed solutions. The accuracy of simulations largely depends on that of the channel model, but popular channel models for mmWaves, such as the Spatial Channel Models (SCMs), have high computational complexity and limit the scalability of the scenarios. This paper profiles the implementation of a widely-used SCM model for mmWave frequencies, and proposes a simplified version of the 3GPP SCM that reduces the computation time by up to 12.5 times while providing essentially the same distributions of several metrics, such as the Signal-to-Interference-plus-Noise Ratio (SINR) in large scale scenarios. We also give insights on the use cases in which using a simplified model can still yield valid results., Comment: 6 pages, 7 figures. This paper has been accepted for presentation at IEEE ICNC 2020. Copyright IEEE 2020. Please cite it as Paolo Testolina, Mattia Lecci, Michele Polese, Marco Giordani, Michele Zorzi, Scalable and Accurate Modeling of the Millimeter Wave Channel, IEEE International Conference on Computing, Networking and Communications (ICNC), Big Island, HI, 2020

Complex phenomena are generally modeled with sophisticated simulators that, depending on their accuracy, can be very demanding in terms of computational resources and simulation time. Their time-consuming nature, together with a typically vast parameter space to be explored, make simulation-based optimization often infeasible. In this work, we present a method that enables the optimization of complex systems through Machine Learning (ML) techniques. We show how well-known learning algorithms are able to reliably emulate a complex simulator with a modest dataset obtained from it. The trained emulator is then able to yield values close to the simulated ones in virtually no time. Therefore, it is possible to perform a global numerical optimization over the vast multi-dimensional parameter space, in a fraction of the time that would be required by a simple brute-force search. As a testbed for the proposed methodology, we used a network simulator for next-generation mmWave cellular systems. After simulating several antenna configurations and collecting the resulting network-level statistics, we feed it into our framework. Results show that, even with few data points, extrapolating a continuous model makes it possible to estimate the global optimum configuration almost instantaneously. The very same tool can then be used to achieve any further optimization goal on the same input parameters in negligible time., Comment: 6 pages, 5 figures, 1 table. Please cite it as: P. Testolina, M. Lecci, M. Rebato, A. Testolin, J. Gambini, C. Mazzucco and M. Zorzi, "Enabling Simulation-Based Optimization Through Machine Learning: A Case Study on Antenna Design", in IEEE Global Communication Conference: Wireless Communication (GLOBECOM WC), Waikoloa, USA, Dec. 2019

We study regularized estimation in high-dimensional longitudinal classification problems, using the lasso and fused lasso regularizers. The constructed coefficient estimates are piecewise constant across the time dimension in the longitudinal problem, with adaptively selected change points (break points). We present an efficient algorithm for computing such estimates, based on proximal gradient descent. We apply our proposed technique to a longitudinal data set on Alzheimer's disease from the Cardiovascular Health Study Cognition Study, and use this data set to motivate and demonstrate several practical considerations such as the selection of tuning parameters, and the assessment of model stability.

Let P be a distribution with support S. The salient features of S can be quantified with persistent homology, which summarizes topological features of the sublevel sets of the distance function (the distance of any point x to S). Given a sample from P we can infer the persistent homology using an empirical version of the distance function. However, the empirical distance function is highly non-robust to noise and outliers. Even one outlier is deadly. The distance-to-a-measure (DTM), introduced by Chazal et al. (2011), and the kernel distance, introduced by Phillips et al. (2014), are smooth functions that provide useful topological information but are robust to noise and outliers. Chazal et al. (2014) derived concentration bounds for DTM. Building on these results, we derive limiting distributions and confidence sets, and we propose a method for choosing tuning parameters.

We present a short tutorial and introduction to using the R package TDA, which provides some tools for Topological Data Analysis. In particular, it includes implementations of functions that, given some data, provide topological information about the underlying space, such as the distance function, the distance to a measure, the kNN density estimator, the kernel density estimator, and the kernel distance. The salient topological features of the sublevel sets (or superlevel sets) of these functions can be quantified with persistent homology. We provide an R interface for the efficient algorithms of the C++ libraries GUDHI, Dionysus and PHAT, including a function for the persistent homology of the Rips filtration, and one for the persistent homology of sublevel sets (or superlevel sets) of arbitrary functions evaluated over a grid of points. The significance of the features in the resulting persistence diagrams can be analyzed with functions that implement recently developed statistical methods. The R package TDA also includes the implementation of an algorithm for density clustering, which allows us to identify the spatial organization of the probability mass associated to a density function and visualize it by means of a dendrogram, the cluster tree.

Persistent homology is a multiscale method for analyzing the shape of sets and functions from point cloud data arising from an unknown distribution supported on those sets. When the size of the sample is large, direct computation of the persistent homology is prohibitive due to the combinatorial nature of the existing algorithms. We propose to compute the persistent homology of several subsamples of the data and then combine the resulting estimates. We study the risk of two estimators and we prove that the subsampling approach carries stable topological information while achieving a great reduction in computational complexity.

Our recent paper on the "Search for Neutron Flux Generation in a Plasma Discharge Electrolytic Cell" [1] has as main goal the validation of the experiment in Ref.[2]. As a follow-up, Ref.[3] moves a set of objections on our procedure and presents argumentations on why the experiments should not yield the same results. We collect here additional material and calculations that contribute to understanding the observed discrepancies. Furthermore we prove that the absence of signals from Indium activation detectors reported also for the experiment of Ref.[2] is a clear indication that neutron production does not occur. [1] R.Faccini et al arXiv:1310.4749 [2] D.Cirillo et al, Key Engineering Materials 495, 104 (2012). [3] A.Widom et al. arXiv:1311.2447, Comment: 5 pages, 3 figures

Persistent homology is a widely used tool in Topological Data Analysis that encodes multiscale topological information as a multi-set of points in the plane called a persistence diagram. It is difficult to apply statistical theory directly to a random sample of diagrams. Instead, we can summarize the persistent homology with the persistence landscape, introduced by Bubenik, which converts a diagram into a well-behaved real-valued function. We investigate the statistical properties of landscapes, such as weak convergence of the average landscapes and convergence of the bootstrap. In addition, we introduce an alternate functional summary of persistent homology, which we call the silhouette, and derive an analogous statistical theory.

Persistent homology probes topological properties from point clouds and functions. By looking at multiple scales simultaneously, one can record the births and deaths of topological features as the scale varies. In this paper we use a statistical technique, the empirical bootstrap, to separate topological signal from topological noise. In particular, we derive confidence sets for persistence diagrams and confidence bands for persistence landscapes.

Following some recent unexpected hints of neutron production in setups like high-voltage atmospheric discharges and plasma discharges in electrolytic cells, we present a measurement of the neutron flux in a configuration similar to the latter. We use two different types of neutron detectors, poly-allyl-diglicol-carbonate (PADC, aka CR-39) tracers and Indium disks. At 95% C.L. we provide an upper limit of 1.5 neutrons cm^-2 s^-1 for the thermal neutron flux at ~5 cm from the center of the cell. Allowing for a higher energy neutron component the largest allowed flux is 64 neutrons cm^-2 s^-1. This upper limit is two orders of magnitude smaller than what previously claimed in an electrolytic cell plasma discharge experiment. Furthermore the behavior of the CR-39 is discussed to point our possible sources of spurious signals., Comment: 4 pages, 3 figures

A metric graph is a 1-dimensional stratified metric space consisting of vertices and edges or loops glued together. Metric graphs can be naturally used to represent and model data that take the form of noisy filamentary structures, such as street maps, neurons, networks of rivers and galaxies. We consider the statistical problem of reconstructing the topology of a metric graph embedded in R^D from a random sample. We derive lower and upper bounds on the minimax risk for the noiseless case and tubular noise case. The upper bound is based on the reconstruction algorithm given in Aanjaneya et al. (2012).

Persistent homology is a method for probing topological properties of point clouds and functions. The method involves tracking the birth and death of topological features (2000) as one varies a tuning parameter. Features with short lifetimes are informally considered to be "topological noise," and those with a long lifetime are considered to be "topological signal." In this paper, we bring some statistical ideas to persistent homology. In particular, we derive confidence sets that allow us to separate topological signal from topological noise., Comment: Published in at http://dx.doi.org/10.1214/14-AOS1252 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

We report on a search for pair production of first-generation scalar leptoquarks ($LQ$) in $p \bar{p}$ collisions at $\sqrt{s}$=1.96 TeV using an integrated luminosity of 203 $pb^{-1}$ collected at the Fermilab Tevatron collider by the CDF experiment. We observe no evidence for $LQ$ production in the topologies arising from $LQ \bar{LQ} \to eqeq$ and $LQ \bar{LQ} \to eq \nu q$, and derive 95% C.L. upper limits on the $LQ$ production cross section. %as a function of $\beta$, where $\beta$ is the branching fraction for $LQ \to eq$. The results are combined with those obtained from a separately reported CDF search in the topology arising from $LQ\bar{LQ} \to \nu q \nu q$ and 95% C.L. lower limits on the LQ mass as a function of $\beta = BR(LQ \to eq) $ are derived. The limits are 236, 205 and 145 GeV/c$^2$ for $\beta$ = 1, $\beta$ = 0.5 and $\beta$ = 0.1, respectively., Comment: submitted to PRL