Search

5G mobile networks are vulnerable to jamming attacks that may jeopardize valuable applications such as industry automation. In this paper, we propose to analyze radio signals with a dedicated device to detect jamming attacks. We pursue a learning approach, with the detector being a CNN implementing a GLRT. To this end, the CNN is trained as a two-class classifier using two datasets: one of real legitimate signals and another generated artificially so that the resulting classifier implements the GLRT. The artificial dataset is generated mimicking different types of jamming signals. We evaluate the performance of this detector using experimental data obtained from a private 5G network and several jamming signals, showing the technique's effectiveness in detecting the attacks.

5G cellular networks are particularly vulnerable against narrowband jammers that target specific control sub-channels in the radio signal. One mitigation approach is to detect such jamming attacks with an online observation system, based on machine learning. We propose to detect jamming at the physical layer with a pre-trained machine learning model that performs binary classification. Based on data from an experimental 5G network, we study the performance of different classification models. A convolutional neural network will be compared to support vector machines and k-nearest neighbors, where the last two methods are combined with principal component analysis. The obtained results show substantial differences in terms of classification accuracy and computation time.

Cellular networks are potential targets of jamming attacks to disrupt wireless communications. Since the fifth generation (5G) of cellular networks enables mission-critical applications, such as autonomous driving or smart manufacturing, the resulting malfunctions can cause serious damage. This paper proposes to detect broadband jammers by an online classification of spectrograms. These spectrograms are computed from a stream of in-phase and quadrature (IQ) samples of 5G radio signals. We obtain these signals experimentally and describe how to design a suitable dataset for training. Based on this data, we compare two classification methods: a supervised learning model built on a basic convolutional neural network (CNN) and an unsupervised learning model based on a convolutional autoencoder (CAE). After comparing the structure of these models, their performance is assessed in terms of accuracy and computational complexity.

Accurate cross-layer information is very useful to optimize mobile networks for specific applications. However, providing application-layer information to lower protocol layers has become very difficult due to the wide adoption of end-to-end encryption and due to the absence of cross-layer signaling standards. As an alternative, this paper presents a traffic profiling solution to passively estimate parameters of HTTP Adaptive Streaming (HAS) applications at the lower layers. By observing IP packet arrivals, our machine learning system identifies video flows and detects the state of an HAS client's play-back buffer in real time. Our experiments with YouTube's mobile client show that Random Forests achieve very high accuracy even with a strong variation of link quality. Since this high performance is achieved at IP level with a small, generic feature set, our approach requires no Deep Packet Inspection (DPI), comes at low complexity, and does not interfere with end-to-end encryption. Traffic profiling is, thus, a powerful new tool for monitoring and managing even encrypted HAS traffic in mobile networks., Comment: 13 pages, 12 figures. Accepted for publication in the proceedings of ACM Multimedia Systems Conference (MMSys) 2018

In mobile networks, users may lose coverage when entering a building due to the high signal attenuation at windows and walls. Under such conditions, services with minimum bit-rate requirements, such as video streaming, often show poor Quality-of-Experience (QoE). We will present a Bayesian detector that combines measurements from two Smartphone sensors to decide if a user is inside a building or not. Based on this coverage classification, we will propose an HTTP adaptive streaming (HAS) algorithm to increase playback stability at a high average bitrate. Measurements in a typical office building show high accuracy for the presented detector and superior QoE for the proposed HAS algorithm., Comment: 6 pages, 6 figures. Accepted at CNTCV: Communication and Networking Techniqes for Contemporary Video Workshop of INFOCOM'17

This paper describes a novel system that provides key parameters of HTTP Adaptive Streaming (HAS) sessions to the lower layers of the protocol stack. A non-intrusive traffic profiling solution is proposed that observes packet flows at the transmit queue of base stations, edge-routers, or gateways. By analyzing IP flows in real time, the presented scheme identifies different phases of an HAS session and estimates important application-layer parameters, such as play-back buffer state and video encoding rate. The introduced estimators only use IP-layer information, do not require standardization and work even with traffic that is encrypted via Transport Layer Security (TLS). Experimental results for a popular video streaming service clearly verify the high accuracy of the proposed solution. Traffic profiling, thus, provides a valuable alternative to cross-layer signaling and Deep Packet Inspection (DPI) in order to perform efficient network optimization for video streaming., Comment: 7 pages, 11 figures. Accepted for publication in the proceedings of IEEE ICC'17

HTTP Adaptive Streaming (HAS) techniques are now the dominant solution for video delivery in mobile networks. Over the past few years, several HAS algorithms have been introduced in order to improve user quality-of-experience (QoE) by bit-rate adaptation. Their difference is mainly the required input information, ranging from network characteristics to application-layer parameters such as the playback buffer. Interestingly, despite the recent outburst in scientific papers on the topic, a comprehensive comparative study of the main algorithm classes is still missing. In this paper we provide such comparison by evaluating the performance of the state-of-the-art HAS algorithms per class, based on data from field measurements. We provide a systematic study of the main QoE factors and the impact of the target buffer level. We conclude that this target buffer level is a critical classifier for the studied HAS algorithms. While buffer-based algorithms show superior QoE in most of the cases, their performance may differ at the low target buffer levels of live streaming services. Overall, we believe that our findings provide valuable insight for the design and choice of HAS algorithms according to networks conditions and service requirements., Comment: 6 pages

With the advent of 5G, standardization and research are currently defining the next generation of the radio access. Considering the high constraints imposed by the future standards, disruptive technologies such as Massive MIMO and mmWave are being proposed. At the heart of this process are wireless channel models that now need to cover a massive increase in design parameters, a large variety of frequency bands, and heterogeneous deployments. This tutorial describes how channel models address this new level of complexity and which tools the community prepares to efficiently but accurately capture the upcoming changes in radio access design. We analyze the main drivers behind these new modeling tools, the challenges they pose, and survey the current approaches to overcome them., Comment: 5 figures. To appear in IEEE Communication Magazine

Although HTTP-based video streaming can easily penetrate firewalls and profit from Web caches, the underlying TCP may introduce large delays in case of a sudden capacity loss. To avoid an interruption of the video stream in such cases we propose the Backward-Shifted Coding (BSC). Based on Scalable Video Coding (SVC), BSC adds a time-shifted layer of redundancy to the video stream such that future frames are downloaded at any instant. This pre-fetched content maintains a fluent video stream even under highly variant network conditions and leads to high Quality of Experience (QoE). We characterize this QoE gain by analyzing initial buffering time, re-buffering time and content resolution using the Ballot theorem. The probability generating functions of the playback interruption and of the initial buffering latency are provided in closed form. We further compute the quasi-stationary distribution of the video quality, in order to compute the average quality, as well as temporal variability in video quality. Employing these analytic results to optimize QoE shows interesting trade-offs and video streaming at outstanding fluency., Comment: 9 pages

In anticipatory networking, channel prediction is used to improve communication performance. This paper describes a new approach for allocating resources to video streaming traffic while accounting for quality of service. The proposed method is based on integrating a model of the user's local play-out buffer into the radio access network. The linearity of this model allows to formulate a Linear Programming problem that optimizes the trade-off between the allocated resources and the stalling time of the media stream. Our simulation results demonstrate the full power of anticipatory optimization in a simple, yet representative, scenario. Compared to instantaneous adaptation, our anticipatory solution shows impressive gains in spectral efficiency and stalling duration at feasible computation time while being robust against prediction errors., Comment: 6 pages, 5 figures, ICC2016

We propose a coordination scheme to minimize the interference between users in a cellular network with full-duplex base stations and half-duplex user devices. Our scheme exploits signal attenuation from obstacles between the users by (i) extracting spatially isolated regions from a radio map and (ii) assigning simultaneous co-channel uplink and downlink transmissions to users in these regions such that inter-user interference is minimized. While adding low computational complexity and insignificant signaling overhead to existing deployments, evaluating our solution with real coverage data shows impressive gains compared to conventional half-duplex and full-duplex operation., Comment: ICC2016

Small cell networks are seen as a promising technology for boosting the performance of future wireless networks. In this paper, we propose a novel context-aware user-cell association approach for small cell networks that exploits the information about the velocity and trajectory of the users while also taking into account their quality of service (QoS) requirements. We formulate the problem in the framework of matching theory with externalities in which the agents, namely users and small cell base stations (SCBSs), have strict interdependent preferences over the members of the opposite set. To solve the problem, we propose a novel algorithm that leads to a stable matching among the users and SCBSs. We show that the proposed approach can better balance the traffic among the cells while also satisfying the QoS of the users. Simulation results show that the proposed matching algorithm yields significant performance advantages relative to traditional context-unaware approaches., Comment: 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), vol., no., pp.439-443, 4-9 May 2014

Minimizing the cost of deploying and operating a Wireless Sensor Network (WSN) involves deciding how to partition a budget between competing expenses such as node hardware, energy, and labor. Most commercial network operators account for interest rates in their budgeting exercises, providing a financial incentive to defer some costs until a later time. In this paper, we propose a net present cost (NPC) model for WSN capital and operating expenses that accounts for interest rates. Our model optimizes the number, size, and spacing between expenditures in order to minimize the NPC required for the network to achieve a desired operational lifetime. In general this optimization problem is non-convex, but if the spacing between expenditures is linearly proportional to the size of the expenditures, and the number of maintenance cycles is known in advance, the problem becomes convex and can be solved to global optimality. If non-deferrable recurring costs are low, then evenly spacing the expenditures can provide near-optimal results. With the provided models and methods, network operators can now derive a payment schedule to minimize NPC while accounting for various operational parameters. The numerical examples show substantial cost benefits under practical assumptions., Comment: 14 pages, 9 figures, 2 algorithms. Accepted by IEEE Transactions on Network and Service Management

In this paper, a novel approach for optimizing and managing resource allocation in wireless small cell networks (SCNs) with device-to-device (D2D) communication is proposed. The proposed approach allows to jointly exploit both the wireless and social context of wireless users for optimizing the overall allocation of resources and improving traffic offload in SCNs. This context-aware resource allocation problem is formulated as a matching game in which user equipments (UEs) and resource blocks (RBs) rank one another, based on utility functions that capture both wireless and social metrics. Due to social interrelations, this game is shown to belong to a class of matching games with peer effects. To solve this game, a novel, selforganizing algorithm is proposed, using which UEs and RBs can interact to decide on their desired allocation. The proposed algorithm is then proven to converge to a two-sided stable matching between UEs and RBs. The properties of the resulting stable outcome are then studied and assessed. Simulation results using real social data show that clustering of socially connected users allows to offload a substantially larger amount of traffic than the conventional context-unaware approach. These results show that exploiting social context has high practical relevance in saving resources on the wireless links and on the backhaul., Comment: Submitted to the IEEE Transaction on Wireless Communications

In current cellular networks, schedulers allocate wireless channel resources to users based on instantaneous channel gains and short-term moving averages of user rates and queue lengths. By using only such short-term information, schedulers ignore the users' service history in previous cells and, thus, cannot guarantee long-term Quality of Service (QoS) when users traverse multiple cells with varying load and capacity. In this paper, we propose a new Long-term Lookback Scheduling (LLS) framework, which extends conventional short-term scheduling with long-term QoS information from previously traversed cells. We demonstrate the application of LLS for common channel-aware, as well as channel and queue-aware schedulers. The developed long-term schedulers also provide a controllable trade-off between emphasizing the immediate user QoS or the long-term measures. Our simulation results show high gains in long-term QoS without sacrificing short-term user requirements. Therefore, the proposed scheduling approach improves subscriber satisfaction and increases operational efficiency.

In this paper, we address the problem of reconstructing coverage maps from path-loss measurements in cellular networks. We propose and evaluate two kernel-based adaptive online algorithms as an alternative to typical offline methods. The proposed algorithms are application-tailored extensions of powerful iterative methods such as the adaptive projected subgradient method and a state-of-the-art adaptive multikernel method. Assuming that the moving trajectories of users are available, it is shown how side information can be incorporated in the algorithms to improve their convergence performance and the quality of the estimation. The complexity is significantly reduced by imposing sparsity-awareness in the sense that the algorithms exploit the compressibility of the measurement data to reduce the amount of data which is saved and processed. Finally, we present extensive simulations based on realistic data to show that our algorithms provide fast, robust estimates of coverage maps in real-world scenarios. Envisioned applications include path-loss prediction along trajectories of mobile users as a building block for anticipatory buffering or traffic offloading., Comment: IEEE Transactions on Vehicular Technology; revised and extended version with new simulation scenario

The unprecedented growth of mobile video traffic is adding significant pressure to the energy drain at both the network and the end user. Energy efficient video transmission techniques are thus imperative to cope with the challenge of satisfying user demand at sustainable costs. In this paper, we investigate how predicted user rates can be exploited for energy efficient video streaming with the popular HTTP-based Adaptive Streaming (AS) protocols (e.g. DASH). To this end, we develop an energy-efficient Predictive Green Streaming (PGS) optimization framework that leverages predictions of wireless data rates to achieve the following objectives 1) minimize the required transmission airtime without causing streaming interruptions, 2) minimize total downlink Base Station (BS) power consumption for cases where BSs can be switched off in deep sleep, and 3) enable a trade-off between AS quality and energy consumption. Our framework is first formulated as a Mixed Integer Linear Program (MILP) where decisions on multi-user rate allocation, video segment quality, and BS transmit power are jointly optimized. Then, to provide an online solution, we present a polynomial-time heuristic algorithm that decouples the PGS problem into multiple stages. We provide a performance analysis of the proposed methods by simulations, and numerical results demonstrate that the PGS framework yields significant energy savings., Comment: 14 pages, 14 figures, accepted for publication in IEEE Transactions on Vehicular Technology

The deployment of small cells, overlaid on existing cellular infrastructure, is seen as a key feature in next-generation cellular systems. In this paper, the problem of user association in the downlink of small cell networks (SCNs) is considered. The problem is formulated as a many-to-one matching game in which the users and SCBSs rank one another based on utility functions that account for both the achievable performance, in terms of rate and fairness to cell edge users, as captured by newly proposed priorities. To solve this game, a novel distributed algorithm that can reach a stable matching is proposed. Simulation results show that the proposed approach yields an average utility gain of up to 65% compared to a common association algorithm that is based on received signal strength. Compared to the classical deferred acceptance algorithm, the results also show a 40% utility gain and a more fair utility distribution among the users., Comment: 5 pages

Video streaming is in high demand by mobile users, as recent studies indicate. In cellular networks, however, the unreliable wireless channel leads to two major problems. Poor channel states degrade video quality and interrupt the playback when a user cannot sufficiently fill its local playout buffer: buffer underruns occur. In contrast to that, good channel conditions cause common greedy buffering schemes to pile up very long buffers. Such over-buffering wastes expensive wireless channel capacity. To keep buffering in balance, we employ a novel approach. Assuming that we can predict data rates, we plan the quality and download time of the video segments ahead. This anticipatory scheduling avoids buffer underruns by downloading a large number of segments before a channel outage occurs, without wasting wireless capacity by excessive buffering. We formalize this approach as an optimization problem and derive practical heuristics for segmented video streaming protocols (e.g., HLS or MPEG DASH). Simulation results and testbed measurements show that our solution essentially eliminates playback interruptions without significantly decreasing video quality.

In this paper, we propose a novel user-cell association approach for wireless small cell networks that exploits previously unexplored context information extracted from users' devices, i.e., user equipments (UEs). Beyond characterizing precise quality of service (QoS) requirements that accurately reflect the UEs' application usage, our proposed cell association approach accounts for the devices' hardware type (e.g., smartphone, tablet, laptop). This approach has the practical benefit of enabling the small cells to make better informed cell association decisions that handle practical device-specific QoS characteristics. We formulate the problem as a matching game between small cell base stations (SBSs) and UEs. In this game, the SBSs and UEs rank one another based on well-designed utility functions that capture composite QoS requirements, extracted from the context features (i.e., application in use, hardware type). We show that the preferences used by the nodes to rank one another are interdependent and influenced by the existing network-wide matching. Due to this unique feature of the preferences, we show that the proposed game can be classified as a many-to-one matching game with externalities. To solve this game, we propose a distributed algorithm that enables the players (i.e., UEs and SBSs) to self-organize into a stable matching that guarantees the required applications' QoS. Simulation results show that the proposed context-aware cell association scheme yields significant gains, reaching up to 52% improvement compared to baseline context-unaware approaches., Comment: 6 pages, 3 figures, conference

Knowing a user's next cell allows more efficient resource allocation and enables new location-aware services. To anticipate the cell a user will hand-over to, we introduce a new machine learning based prediction system. Therein, we formulate the prediction as a classification problem based on information that is readily available in cellular networks. Using only Channel State Information (CSI) and handover history, we perform classification by embedding Support Vector Machines (SVMs) into an efficient pre-processing structure. Simulation results from a Manhattan Grid scenario and from a realistic radio map of downtown Frankfurt show that our system provides timely prediction at high accuracy., Comment: The 14th IEEE International Workshop on Signal Processing Advances for Wireless Communications (SPAWC), Darmstadt : Germany (2013)

This paper describes a new approach for allocating resources to video streaming traffic. Assuming that the future channel state can be predicted for a certain time, we minimize the fraction of the bandwidth consumed for smooth streaming by jointly allocating wireless channel resources and play-out buffer size. To formalize this idea, we introduce a new model to capture the dynamic of a video streaming buffer and the allocated spectrum in an optimization problem. The result is a Linear Program that allows to trade off buffer size and allocated bandwidth. Based on this tractable model, our simulation results show that anticipating poor channel states and pre-loading the buffer accordingly allows to serve more users at perfect video quality., Comment: 5 pages, submitted to IEEE Globecom 2013

The deployment of small cell base stations(SCBSs) overlaid on existing macro-cellular systems is seen as a key solution for offloading traffic, optimizing coverage, and boosting the capacity of future cellular wireless systems. The next-generation of SCBSs is envisioned to be multi-mode, i.e., capable of transmitting simultaneously on both licensed and unlicensed bands. This constitutes a cost-effective integration of both WiFi and cellular radio access technologies (RATs) that can efficiently cope with peak wireless data traffic and heterogeneous quality-of-service requirements. To leverage the advantage of such multi-mode SCBSs, we discuss the novel proposed paradigm of cross-system learning by means of which SCBSs self-organize and autonomously steer their traffic flows across different RATs. Cross-system learning allows the SCBSs to leverage the advantage of both the WiFi and cellular worlds. For example, the SCBSs can offload delay-tolerant data traffic to WiFi, while simultaneously learning the probability distribution function of their transmission strategy over the licensed cellular band. This article will first introduce the basic building blocks of cross-system learning and then provide preliminary performance evaluation in a Long-Term Evolution (LTE) simulator overlaid with WiFi hotspots. Remarkably, it is shown that the proposed cross-system learning approach significantly outperforms a number of benchmark traffic steering policies.