Search

Existing communication systems exhibit inherent limitations in translating theory to practice when handling the complexity of optimization for emerging wireless applications with high degrees of freedom. Deep learning has a strong potential to overcome this challenge via data-driven solutions and improve the performance of wireless systems in utilizing limited spectrum resources. In this chapter, we first describe how deep learning is used to design an end-to-end communication system using autoencoders. This flexible design effectively captures channel impairments and optimizes transmitter and receiver operations jointly in single-antenna, multiple-antenna, and multiuser communications. Next, we present the benefits of deep learning in spectrum situation awareness ranging from channel modeling and estimation to signal detection and classification tasks. Deep learning improves the performance when the model-based methods fail. Finally, we discuss how deep learning applies to wireless communication security. In this context, adversarial machine learning provides novel means to launch and defend against wireless attacks. These applications demonstrate the power of deep learning in providing novel means to design, optimize, adapt, and secure wireless communications.

This paper addresses a fundamental question of multi-agent knowledge distribution: what information should be sent to whom and when, with the limited resources available to each agent? Communication requirements for multi-agent systems can be rather high when an accurate picture of the environment and the state of other agents must be maintained. To reduce the impact of multi-agent coordination on networked systems, e.g., power and bandwidth, this paper introduces two concepts for partially observable Markov decision processes (POMDPs): 1) action-based constraints which yield constrained-action POMDPs (CA-POMDPs); and 2) soft probabilistic constraint satisfaction for the resulting infinite-horizon controllers. To enable constraint analysis over an infinite horizon, an unconstrained policy is first represented as a Finite State Controller (FSC) and optimized with policy iteration. The FSC representation then allows for a combination of Markov chain Monte Carlo and discrete optimization to improve the probabilistic constraint satisfaction of the controller while minimizing the impact to the value function. Within the CA-POMDP framework we then propose Intelligent Knowledge Distribution (IKD) which yields per-agent policies for distributing knowledge between agents subject to interaction constraints. Finally, the CA-POMDP and IKD concepts are validated using an asset tracking problem where multiple unmanned aerial vehicles (UAVs) with heterogeneous sensors collaborate to localize a ground asset to assist in avoiding unseen obstacles in a disaster area. The IKD model was able to maintain asset tracking through multi-agent communications while only violating soft power and bandwidth constraints 3% of the time, while greedy and naive approaches violated constraints more than 60% of the time.

We conduct an in depth study on the performance of deep learning based radio signal classification for radio communications signals. We consider a rigorous baseline method using higher order moments and strong boosted gradient tree classification and compare performance between the two approaches across a range of configurations and channel impairments. We consider the effects of carrier frequency offset, symbol rate, and multi-path fading in simulation and conduct over-the-air measurement of radio classification performance in the lab using software radios and compare performance and training strategies for both. Finally we conclude with a discussion of remaining problems, and design considerations for using such techniques., Comment: 13 pages, 22 figures

We introduce a novel physical layer scheme for single user Multiple-Input Multiple-Output (MIMO) communications based on unsupervised deep learning using an autoencoder. This method extends prior work on the joint optimization of physical layer representation and encoding and decoding processes as a single end-to-end task by expanding transmitter and receivers to the multi-antenna case. We introduce a widely used domain appropriate wireless channel impairment model (Rayleigh fading channel), into the autoencoder optimization problem in order to directly learn a system which optimizes for it. We considered both spatial diversity and spatial multiplexing techniques in our implementation. Our deep learning-based approach demonstrates significant potential for learning schemes which approach and exceed the performance of the methods which are widely used in existing wireless MIMO systems. We discuss how the proposed scheme can be easily adapted for open-loop and closed-loop operation in spatial diversity and multiplexing modes and extended use with only compact binary channel state information (CSI) as feedback., Comment: under journal submission

Estimation is a critical component of synchronization in wireless and signal processing systems. There is a rich body of work on estimator derivation, optimization, and statistical characterization from analytic system models which are used pervasively today. We explore an alternative approach to building estimators which relies principally on approximate regression using large datasets and large computationally efficient artificial neural network models capable of learning non-linear function mappings which provide compact and accurate estimates. For single carrier PSK modulation, we explore the accuracy and computational complexity of such estimators compared with the current gold-standard analytically derived alternatives. We compare performance in various wireless operating conditions and consider the trade offs between the two different classes of systems. Our results show the learned estimators can provide improvements in areas such as short-time estimation and estimation under non-trivial real world channel conditions such as fading or other non-linear hardware or propagation effects., Comment: Under conference submission as of June 2017

In this paper, we present the results of using bags of system calls for learning the behavior of Linux containers for use in anomaly-detection based intrusion detection system. By using system calls of the containers monitored from the host kernel for anomaly detection, the system does not require any prior knowledge of the container nature, neither does it require altering the container or the host kernel., Comment: Published version available on IEEE Xplore (http://ieeexplore.ieee.org/document/7414047/) arXiv admin note: substantial text overlap with arXiv:1611.03056

Radio emitter recognition in dense multi-user environments is an important tool for optimizing spectrum utilization, identifying and minimizing interference, and enforcing spectrum policy. Radio data is readily available and easy to obtain from an antenna, but labeled and curated data is often scarce making supervised learning strategies difficult and time consuming in practice. We demonstrate that semi-supervised learning techniques can be used to scale learning beyond supervised datasets, allowing for discerning and recalling new radio signals by using sparse signal representations based on both unsupervised and supervised methods for nonlinear feature learning and clustering methods.

We introduce a powerful recurrent neural network based method for novelty detection to the application of detecting radio anomalies. This approach holds promise in significantly increasing the ability of naive anomaly detection to detect small anomalies in highly complex complexity multi-user radio bands. We demonstrate the efficacy of this approach on a number of common real over the air radio communications bands of interest and quantify detection performance in terms of probability of detection an false alarm rates across a range of interference to band power ratios and compare to baseline methods.

We address the problem of learning efficient and adaptive ways to communicate binary information over an impaired channel. We treat the problem as reconstruction optimization through impairment layers in a channel autoencoder and introduce several new domain-specific regularizing layers to emulate common channel impairments. We also apply a radio transformer network based attention model on the input of the decoder to help recover canonical signal representations. We demonstrate some promising initial capacity results from this architecture and address several remaining challenges before such a system could become practical.

This paper presents research in progress investigating the viability and adaptation of reinforcement learning using deep neural network based function approximation for the task of radio control and signal detection in the wireless domain. We demonstrate a successful initial method for radio control which allows naive learning of search without the need for expert features, heuristics, or search strategies. We also introduce Kerlym, an open Keras based reinforcement learning agent collection for OpenAI's Gym., Comment: 7 pages, 4 figures

We introduce learned attention models into the radio machine learning domain for the task of modulation recognition by leveraging spatial transformer networks and introducing new radio domain appropriate transformations. This attention model allows the network to learn a localization network capable of synchronizing and normalizing a radio signal blindly with zero knowledge of the signals structure based on optimization of the network for classification accuracy, sparse representation, and regularization. Using this architecture we are able to outperform our prior results in accuracy vs signal to noise ratio against an identical system without attention, however we believe such an attention model has implication far beyond the task of modulation recognition., Comment: 5 pages, 8 figures

We introduce a model for a market based economic system of cyber-risk valuation to correct fundamental problems of incentives within the information technology and information processing industries. We assess the makeup of the current day marketplace, identify incentives, identify economic reasons for current failings, and explain how a market based risk valuation system could improve these incentives to form a secure and robust information marketplace for all consumers by providing visibility into open, consensus based risk pricing and allowing all parties to make well informed decisions.

We explore unsupervised representation learning of radio communication signals in raw sampled time series representation. We demonstrate that we can learn modulation basis functions using convolutional autoencoders and visually recognize their relationship to the analytic bases used in digital communications. We also propose and evaluate quantitative met- rics for quality of encoding using domain relevant performance metrics., Comment: 4 pages, 9 figures, currently under conference submission

We study the adaptation of convolutional neural networks to the complex temporal radio signal domain. We compare the efficacy of radio modulation classification using naively learned features against using expert features which are widely used in the field today and we show significant performance improvements. We show that blind temporal learning on large and densely encoded time series using deep convolutional neural networks is viable and a strong candidate approach for this task especially at low signal to noise ratio.

We present a low complexity experimental RF-based indoor localization system based on the collection and processing of WiFi RSSI signals and processing using a RSS-based multi-lateration algorithm to determine a robotic mobile node's location. We use a real indoor wireless testbed called w-iLab.t that is deployed in Zwijnaarde, Ghent, Belgium. One of the unique attributes of this testbed is that it provides tools and interfaces using Global Environment for Network Innovations (GENI) project to easily create reproducible wireless network experiments in a controlled environment. We provide a low complexity algorithm to estimate the location of the mobile robots in the indoor environment. In addition, we provide a comparison between some of our collected measurements with their corresponding location estimation and the actual robot location. The comparison shows an accuracy between 0.65 and 5 meters., Comment: (c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works

In this paper, we implement an application-aware scheduler that differentiates users running real-time applications and delay-tolerant applications while allocating resources. This approach ensures that the priority is given to real-time applications over delay-tolerant applications. In our system model, we include realistic channel effects of Long Term Evolution (LTE) system. Our application-aware scheduler runs in two stages, the first stage is resource block allocation and the second stage is power allocation. In the optimal solution of resource block allocation problem, each user is inherently guaranteed a minimum Quality of Experience (QoE) while ensuring priority given to users with real-time applications. In the power allocation problem, a new power allocation method is proposed which utilizes the optimal solution of the application-aware resource block scheduling problem. As a proof of concept, we run a simulation comparison between a conventional proportional fairness scheduler and the application-aware scheduler. The simulation results show better QoE with the application-aware scheduler., Comment: 5 pages, 2 figures

In this paper, we introduce an application-aware approach for resource block scheduling with carrier aggregation in Long Term Evolution Advanced (LTE-Advanced) cellular networks. In our approach, users are partitioned in different groups based on the carriers coverage area. In each group of users, users equipments (UE)s are assigned resource blocks (RB)s from all in band carriers. We use a utility proportional fairness (PF) approach in the utility percentage of the application running on the UE. Each user is guaranteed a minimum quality of service (QoS) with a priority criterion that is based on the type of application running on the UE. We prove that our scheduling policy exists and therefore the optimal solution is tractable. Simulation results are provided to compare the performance of the proposed RB scheduling approach with other scheduling policies., Comment: Submitted to IEEE

To meet the growing spectrum demands, future cellular systems are expected to share the spectrum of other services such as radar. In this paper, we consider a network multiple-input multiple-output (MIMO) with partial cooperation model where radar stations cooperate with cellular base stations (BS)s to deliver messages to intended mobile users. So the radar stations act as BSs in the cellular system. However, due to the high power transmitted by radar stations for detection of far targets, the cellular receivers could burnout when receiving these high radar powers. Therefore, we propose a new projection method called small singular values space projection (SSVSP) to mitigate these harmful high power and enable radar stations to collaborate with cellular base stations. In addition, we formulate the problem into a MIMO interference channel with general constraints (MIMO-IFC-GC). Finally, we provide a solution to minimize the weighted sum mean square error minimization problem (WSMMSE) with enforcing power constraints on both radar and cellular stations., Comment: (c) 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works

In this paper, we introduce a novel approach for optimal resource allocation with frequency reuse for users with elastic and inelastic traffic in cellular networks. In our model, we represent users' applications running on different user equipments (UE)s by logarithmic and sigmoid utility functions. We applied utility proportional fairness allocation policy, i.e. the resources are allocated among users with fairness in utility percentage of the application running on each mobile station. Our objective is to allocate the cellular system resources to mobile users optimally from a multi-cell network. In our model, a minimum quality-of-service (QoS) is guaranteed to every user subscribing for the mobile service with priority given to users with real-time applications. We show that the novel resource allocation optimization problem with frequency reuse is convex and therefore the optimal solution is tractable. We present a distributed algorithm to allocate the resources optimally from Mobility Management Entity (MME) to base stations (BS)s sectors. Finally, we present the simulation results for the performance of our rate allocation algorithm., Comment: (c) 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works

Sharing spectrum with incumbents such as radar systems is an attractive solution for cellular operators in order to meet the ever growing bandwidth requirements and ease the spectrum crunch problem. In order to realize efficient spectrum sharing, interference mitigation techniques are required. In this letter we address techniques to mitigate MIMO radar interference at MIMO cellular base stations (BSs). We specifically look at the amount of power received at BSs when radar uses null space projection (NSP)-based interference mitigation method. NSP reduces the amount of projected power at targets that are in-close vicinity to BSs. We study this issue and show that this can be avoided if radar employs a larger transmit array. In addition, we compute the coherence time of channel between radar and BSs and show that the coherence time of channel is much larger than the pulse repetition interval of radars. Therefore, NSP-based interference mitigation techniques which depends on accurate channel state information (CSI) can be effective as the problem of CSI being outdated does not occur for most practical scenarios., Comment: Corrected some typos and references

Sharing radar spectrum with communication systems is an emerging area of research. Deploying commercial wireless communication services in radar bands give wireless operators the much needed additional spectrum to meet the growing bandwidth demands. However, to enable spectrum sharing between these two fundamentally different systems interference concerns must be addressed. In order to assess interference concerns we design a three-dimensional (3D) channel model between radar and cellular base stations (BSs) in which the radar uses a two-dimensional (2D) antenna array and the BS uses a one-dimensional (1D) antenna array. We formulate a line-of-sight (LoS) channel and then propose an algorithm that mitigates radar interference to BSs. We extend the previously proposed null space projection algorithm for 2D channels to 3D channels and show that effective nulls can be placed by utilizing both the azimuth and elevation angle information of BSs. This results in effective interference mitigation. In addition we show that the 3D channel model allows us to accurately classify the size of radar's search space when null space projection algorithm is used for interference mitigation., Comment: submitted to IEEE Letters

Spectrum sharing between radars and cellular systems is an emerging area of research. In this paper, we model channel between a seaborne MIMO radar and MIMO cellular system. We model a 2D channel to capture the azimuth aspect of the spectrum sharing scenario. Our channel modeling methodology allows MIMO radar to place accurate nulls in the azimuth location of base stations (BS), thus, protecting them from harmful radar interference. We use a projection based approach, where radar waveform is projected onto null space of channel, for mitigating radar interference to BSs. This is also known as an approach based on eigen-nulling which is different from spatial-nulling commonly employed by radars. We show through simulations that the proposed spatial channel model allows eigen-nulling which performs superior to traditional spatial-nulling for interference mitigation. The proposed channel model can be leveraged to use eigen-nulling that enhances target detection and beampattern resolution of MIMO radar while mitigating interference to BSs., Comment: submitted to IEEE Letters

In this paper, we present a novel approach for robust optimal resource allocation with joint carrier aggregation to allocate multiple carriers resources optimally among users with elastic and inelastic traffic in cellular networks. We use utility proportional fairness allocation policy, where the fairness among users is in utility percentage of the application running on the user equipment (UE). Each UE is assigned an application utility function based on the type of its application. Our objective is to allocate multiple carriers resources optimally among users subscribing for mobile services. In addition, each user is guaranteed a minimum quality of service (QoS) that varies based on the user's application type. We present a robust algorithm that solves the drawback in the algorithm presented in [1] by preventing the fluctuations in the resource allocation process, in the case of scarce resources, and allocates optimal rates for both high-traffic and low-traffic situations. Our distributed resource allocation algorithm allocates an optimal rate to each user from all carriers in its range while providing the minimum price for the allocated rate. In addition, we analyze the convergence of the algorithm with different network traffic densities and show that our algorithm provides traffic dependent pricing for network providers. Finally, we present simulation results for the performance of our resource allocation algorithm., Comment: Submitted to IEEE. Part of this work has been uploaded to arXiv:1405.6448

This paper details the design of precoders for a MIMO radar spectrally coexistent with a MIMO cellular network. We focus on a coordinated multi-point (CoMP) system where a cluster of base stations (BSs) coordinate their transmissions to the intended user. The radar operates in two modes, interference-mitigation mode when it avoids interference with the CoMP system and cooperation mode when it exchanges information with it. Using either the conventional Switched Null Space Projection (SNSP) or the newly proposed Switched Small Singular Value Space Projection (SSSVSP), the radar beam sweeps across the BS clusters focusing on the optimal ones, optimal in either nullity or difference between the precoded and original radar signal. Taking the channel estimation error into account, the design of precoder is pivoted on the minimal radar interference at the BS clusters during interference-mitigation mode and minimal bit-error-rate at the BSs during cooperation mode while interfering minimally with the radar target detection capability. Our investigation shows that loss in radar performance can be compensated using SSSVSP instead of SNSP to some extent but increasing the number of radar antenna elements goes a long way to serve the purpose. Simulations verify our theoretical predictions about the proposed SSSVSP.

This paper explores an overlapped-multiple-input multiple-output (MIMO) antenna architecture and a spectrum sharing algorithm via null space projection (NSP) for radar-communications coexistence. In the overlapped-MIMO architecture, the transmit array of a collocated MIMO radar is partitioned into a number of subarrays that are allowed to overlap. Each of the antenna elements in these subarrays have signals orthogonal to each other and to the elements of the other subarrays. The proposed architecture not only improves sidelobe suppression to reduce interference to communications system, but also enjoys the advantages of MIMO radar without sacrificing the main desirable characteristics. The radar-centric spectrum sharing algorithm then projects the radar signal onto the null space of the communications system's interference channel, which helps to avoid interference from the radar. Numerical results are presented which show the performance of the proposed waveform design algorithm in terms of overall beampattern and sidelobe levels of the radar waveform and finally shows a comparison of the proposed system with existing collocated MIMO radar architectures., Comment: accepted at IEEE WCNC

Future wireless communication systems are envisioned to share radio frequency (RF) spectrum, with other services such as radars, in order to meet the growing spectrum demands. In this paper, we consider co-channel spectrum sharing between cellular systems and radars. We address the problem of target detection by radars that are subject to shape its waveform in a way that it does not cause interference to cellular systems. We consider a multiple-input multiple-output (MIMO) radar and a MIMO cellular communication system with $\mc K$ base stations (BS). We propose a spectrum sharing algorithm which steers radar nulls, by projecting radar waveform onto the null space of interference channel, towards a `selected' BS, thus, protecting it from radar interference. This BS is selected, among $\mc K$ BSs, on the basis of guaranteeing minimum waveform degradation. We study target detection capabilities of this null-space projected (NSP) waveform and compare it with the orthogonal waveform. We derive the generalized likelihood ratio test (GLRT) for target detection and derive detector statistic for NSP and orthogonal waveform. The target detection performance for NSP and orthogonal waveform is studied theoretically and via Monte Carlo simulations., Comment: submitted to IEEE transactions. Distribution Statement A: Approved for public release; distribution is unlimited

Multiple-input multiple-output (MIMO) radar is a relatively new concept in the field of radar signal processing. Many novel MIMO radar waveforms have been developed by considering various performance metrics and constraints. In this paper, we show that finite alphabet constant-envelope (FACE) quadrature-pulse shift keying (QPSK) waveforms can be designed to realize a given covariance matrix by transforming a constrained nonlinear optimization problem into an unconstrained nonlinear optimization problem. In addition, we design QPSK waveforms in a way that they don't cause interference to a cellular system, by steering nulls towards a selected base station (BS). The BS is selected according to our algorithm which guarantees minimum degradation in radar performance due to null space projection (NSP) of radar waveforms. We design QPSK waveforms with spectrum sharing constraints for a stationary and moving radar platform. We show that the waveform designed for stationary MIMO radar matches the desired beampattern closely, when the number of BS antennas $N^{\text{BS}}$ is considerably less than the number of radar antennas $M$, due to quasi-static interference channel. However, for moving radar the difference between designed and desired waveforms is larger than stationary radar, due to rapidly changing channel., Comment: submitted to IEEE Transactions. Distribution Statement A: Approved for public release; distribution is unlimited

Spectrum sharing is a new approach to solve the congestion problem in the RF spectrum. A spatial approach for spectrum sharing between a radar and a communication system was proposed, which mitigates the radar interference to communication by projecting the radar waveform onto the null space of the interference channel, between radar and communication system [1]. In this work, we extend this approach to a maritime MIMO radar which experiences a time varying interference channel due to the oscillatory motion of a ship, because of the breaking of sea/ocean waves. We model this variation by using the matrix perturbation theory and the statistical distribution of the breaking waves. This model is then used to study the impact of perturbed interference channel on the spatial approach of spectrum sharing. We use the maximum likelihood (ML) estimate of a target's angle of arrival to study the radar's performance when its waveform is projected onto the null space of the perturbed interference channel. Through our analytical and simulation results, we study the loss in the radar's performance due to the null space projection (NSP) of its waveform on the perturbed interference channel., Comment: Accepted version: IEEE Military Communications Conference (MILCOM) 2014

In this paper, we introduce an approach for application-aware resource block scheduling of elastic and inelastic adaptive real-time traffic in fourth generation Long Term Evolution (LTE) systems. The users are assigned to resource blocks. A transmission may use multiple resource blocks scheduled over frequency and time. In our model, we use logarithmic and sigmoidal-like utility functions to represent the users applications running on different user equipments (UE)s. We present an optimal problem with utility proportional fairness policy, where the fairness among users is in utility percentage (i.e user satisfaction with the service) of the corresponding applications. Our objective is to allocate the resources to the users with priority given to the adaptive real-time application users. In addition, a minimum resource allocation for users with elastic and inelastic traffic should be guaranteed. Every user subscribing for the mobile service should have a minimum quality-of-service (QoS) with a priority criterion. We prove that our scheduling policy exists and achieves the maximum. Therefore the optimal solution is tractable. We present a centralized scheduling algorithm to allocate evolved NodeB (eNodeB) resources optimally with a priority criterion. Finally, we present simulation results for the performance of our scheduling algorithm and compare our results with conventional proportional fairness approaches. The results show that the user satisfaction is higher with our proposed method., Comment: 5 pages

In this paper, we introduce a novel approach for optimal resource allocation from multiple carriers for users with elastic and inelastic traffic in fourth generation long term evolution (4G-LTE) system. In our model, we use logarithmic and sigmoidal-like utility functions to represent the user applications running on different user equipments (UE)s. We use utility proportional fairness policy, where the fairness among users is in utility percentage of the application running on the mobile station. Our objective is to allocate the resources to the users optimally from multiple carriers. In addition, every user subscribing for the mobile service is guaranteed to have a minimum quality-of-service (QoS) with a priority criterion. Our rate allocation algorithm selects the carrier or multiple carriers that provide the minimum price for the needed resources. We prove that the novel resource allocation optimization problem with joint carrier aggregation is convex and therefore the optimal solution is tractable. We present a distributed algorithm to allocate the resources optimally from multiple evolved NodeBs (eNodeB)s. Finally, we present simulation results for the performance of our rate allocation algorithm., Comment: Computing, Networking and Communications (ICNC), 2015 International Conference on

In this paper, we introduce a novel approach for power allocation in cellular networks. In our model, we use sigmoidal-like utility functions to represent different users' modulation schemes. Each utility function is a representation of the probability of successfully transmitted packets per unit of power consumed by a user, when using a certain modulation scheme. We consider power allocation with utility proportional fairness policy, where the fairness among users is in utility percentage i.e. percentage of successfully transmitted packets of the corresponding modulation scheme. We formulate our network utility maximization problem as a product of utilities of all users and prove that our power allocation optimization problem is convex and therefore the optimal solution is tractable. We present a distributed algorithm to allocate base station (BS) powers optimally with priority given to users running lower modulation schemes while ensuring non-zero power allocation to users running higher modulation schemes. Our algorithm prevents fluctuation in the power allocation process and is capable of traffic and modulation dependent pricing i.e. charges different price per unit power from different users depending in part on their modulation scheme and total power available at the BS. This is used to flatten traffic and decrease the service price for users., Comment: ELSEVIER Physical Communication July 2015

The increase in data storage and power consumption at data-centers has made it imperative to design energy efficient Distributed Storage Systems (DSS). The energy efficiency of DSS is strongly influenced not only by the volume of data, frequency of data access and redundancy in data storage, but also by the heterogeneity exhibited by the DSS in these dimensions. To this end, we propose and analyze the energy efficiency of a heterogeneous distributed storage system in which $n$ storage servers (disks) store the data of $R$ distinct classes. Data of class $i$ is encoded using a $(n,k_{i})$ erasure code and the (random) data retrieval requests can also vary across classes. We show that the energy efficiency of such systems is closely related to the average latency and hence motivates us to study the energy efficiency via the lens of average latency. Through this connection, we show that erasure coding serves the dual purpose of reducing latency and increasing energy efficiency. We present a queuing theoretic analysis of the proposed model and establish upper and lower bounds on the average latency for each data class under various scheduling policies. Through extensive simulations, we present qualitative insights which reveal the impact of coding rate, number of servers, service distribution and number of redundant requests on the average latency and energy efficiency of the DSS., Comment: Submitted to IEEE Transactions on Cloud Computing. Contains 24 pages, 13 figures

Caching is emerging as a vital tool for alleviating the severe capacity crunch in modern content-centric wireless networks. The main idea behind caching is to store parts of popular content in end-users' memory and leverage the locally stored content to reduce peak data rates. By jointly designing content placement and delivery mechanisms, recent works have shown order-wise reduction in transmission rates in contrast to traditional methods. In this work, we consider the secure caching problem with the additional goal of minimizing information leakage to an external wiretapper. The fundamental cache memory vs. transmission rate trade-off for the secure caching problem is characterized. Rather surprisingly, these results show that security can be introduced at a negligible cost, particularly for large number of files and users. It is also shown that the rate achieved by the proposed caching scheme with secure delivery is within a constant multiplicative factor from the information-theoretic optimal rate for almost all parameter values of practical interest.

LTE is well on its way to becoming the primary cellular standard, due to its performance and low cost. Over the next decade we will become dependent on LTE, which is why we must ensure it is secure and available when we need it. Unfortunately, like any wireless technology, disruption through radio jamming is possible. This paper investigates the extent to which LTE is vulnerable to intentional jamming, by analyzing the components of the LTE downlink and uplink signals. The LTE physical layer consists of several physical channels and signals, most of which are vital to the operation of the link. By taking into account the density of these physical channels and signals with respect to the entire frame, as well as the modulation and coding schemes involved, we come up with a series of vulnerability metrics in the form of jammer to signal ratios. The ``weakest links'' of the LTE signals are then identified, and used to establish the overall vulnerability of LTE to hostile interference., Comment: 4 pages, see below for citation. M. Lichtman, J. Reed, M. Norton, T. Clancy, "Vulnerability of LTE to Hostile Interference'', IEEE Global Conference on Signal and Information Processing (GlobalSIP), Dec 2013

A significant limitation of current cyber security research and techniques is its reactive and applied nature. This leads to a continuous 'cyber cycle' of attackers scanning networks, developing exploits and attacking systems, with defenders detecting attacks, analyzing exploits and patching systems. This reactive nature leaves sensitive systems highly vulnerable to attack due to un-patched systems and undetected exploits. Some current research attempts to address this major limitation by introducing systems that implement moving target defense. However, these ideas are typically based on the intuition that a moving target defense will make it much harder for attackers to find and scan vulnerable systems, and not on theoretical mathematical foundations. The continuing lack of fundamental science and principles for developing more secure systems has drawn increased interest into establishing a 'science of cyber security'. This paper introduces the concept of using cybernetics, an interdisciplinary approach of control theory, systems theory, information theory and game theory applied to regulatory systems, as a foundational approach for developing cyber security principles. It explores potential applications of cybernetics to cyber security from a defensive perspective, while suggesting the potential use for offensive applications. Additionally, this paper introduces the fundamental principles for building non-stationary systems, which is a more general solution than moving target defenses. Lastly, the paper discusses related works concerning the limitations of moving target defense and one implementation based on non-stationary principles., Comment: 12 pages, 7 figures

Distributed storage systems in the presence of a wiretapper are considered. A distributed storage system (DSS) is parameterized by three parameters (n, k,d), in which a file stored across n distributed nodes, can be recovered from any k out of n nodes. If a node fails, any d out of (n-1) nodes help in the repair of the failed node. For such a (n,k,d)-DSS, two types of wiretapping scenarios are investigated: (a) Type-I (node) adversary which can wiretap the data stored on any l4, we present extensions of these results to a (n, n-1,n-1)-DSS, in presence of a Type-II adversary that can observe the repair data of any l=(n-2) nodes. The key technical contribution of this work is in developing novel information theoretic converse proofs for the Type-II adversarial scenario. From our results, we show that in the presence of Type-II attacks, the only efficient point in the storage-vs-exact-repair-bandwidth tradeoff is the MBR (minimum bandwidth regenerating) point. This is in sharp contrast to the case of a Type-I attack in which the storage-vs-exact-repair-bandwidth tradeoff allows a spectrum of operating points beyond the MBR point., Comment: submitted to IEEE Transactions on Information Theory