Searcharxiv⌕ Search

arXiv subjects

Danijela Cabric

Publications and source records attributed to Danijela Cabric.

At least 55 records · Page 3Linked to original sources

Deep Learning Approaches for Open Set Wireless Transmitter Authorization

Wireless signals contain transmitter specific features, which can be used to verify the identity of transmitters and assist in implementing an authentication and authorization system. Most recently, there has been wide interest in using deep learning for transmitter identification. However, the existing deep learning work has posed the problem as closed set classification, where a neural network classifies among a finite set of known transmitters. No matter how large this set is, it will not include all transmitters that exist. Malicious transmitters outside this closed set, once within communications range, can jeopardize the system security. In this paper, we propose a deep learning approach for transmitter authorization based on open set recognition. Our proposed approach identifies a set of authorized transmitters, while rejecting any other unseen transmitters by recognizing their signals as outliers. We propose three approaches for this problem and show their ability to reject signals from unauthorized transmitters on a dataset of WiFi captures. We consider the structure of training data needed, and we show that the accuracy improves by having signals from known unauthorized transmitters in the training set.

eess.SP↗

Energy-Efficient Massive IoT Shared Spectrum Access over UAV-enabled Cellular Networks

Data aggregation has become an emerging paradigm to support massive Internet-of-things (IoT), a new and critical use case for fifth-generation new radio (5G-NR). Indeed, data aggregators can complement cellular base stations and process IoT traffic to reduce network congestion. In this paper, we consider using mobile data aggregators, e.g., drones, that collect IoT traffic and aggregate them to the network. Specifically, we first discuss how the spectrum can be shared between cellular users (UEs) and IoT devices in the presence of drones, proposing a time-division duplexing protocol. We use stochastic geometry to analyze this protocol, comparing it to the standard spectrum sharing and orthogonal allocation protocols. We then formulate a stochastic optimization problem to optimize the nominal IoT transmit power, maximizing the average energy-efficiency (EE) of the IoT device subject to interference constraints to protect UEs. Simulations are presented to validate the theoretical insights and the effectiveness of the proposed protocol. It is shown that using drones, to aggregate IoT traffic, improves the EE of IoT devices, yet the EE degrades as their altitudes increases. Equally important, optimizing the transmit power is critical to further improve the EE, while ensuring fair coexistence with UEs.

cs.IT↗

Design of Millimeter-Wave Single-Shot Beam Training for True-Time-Delay Array

Beam training is one of the most important and challenging tasks in millimeter-wave and sub-terahertz communications. Novel transceiver architectures and signal processing techniques are required to avoid prohibitive training overhead when large antenna arrays with narrow beams are used. In this work, we leverage recent developments in wide range true-time-delay (TTD) analog arrays and frequency dependent probing beams to accelerate beam training. We propose an algorithm that achieves high-accuracy angle of arrival estimation with a single training symbol. Further, the impact of TTD front-end impairments on beam training accuracy is investigated, including the impact of gain, phase, and delay errors. Lastly, the study on impairments and required specifications of resolution and range of analog delay taps are used to provide a design insight of energy efficient TTD array, which employs a novel architecture with discrete-time sampling based TTD elements.

eess.SP↗

Open Set Wireless Transmitter Authorization: Deep Learning Approaches and Dataset Considerations

Due to imperfections in transmitters' hardware, wireless signals can be used to verify their identity in an authorization system. While deep learning was proposed for transmitter identification, the majority of the work has focused on classification among a closed set of transmitters. Malicious transmitters outside this closed set will be misclassified, jeopardizing the authorization system. In this paper, we consider the problem of recognizing authorized transmitters and rejecting new transmitters. To address this problem, we adapt the most prominent approaches from the open set recognition and anomaly detection literature to the problem. We study how these approaches scale with the required number of authorized transmitters. We propose using a known set of unauthorized transmitters to assist the training and study its impact. The evaluation procedure takes into consideration that some transmitters might be more similar than others and nuances these effects. The robustness of the RF authorization with respect to temporal changes in fingerprints is also considered in the evaluation. When using 10 authorized and 50 known unauthorized WiFi transmitters from a publicly accessible testbed, we were able to achieve an outlier detection accuracy of 98% on the same day test set and 80% on the different day test set.

eess.SP↗

Wideband Millimeter-Wave Beam Training with True-Time-Delay Array Architecture

Millimeter-wave communications rely on beamforming gain from both transmitters and receivers to compensate for severe propagation loss. To achieve adequate gain, beam training is required to identify propagation directions. The main challenge in beam training arises from maintaining low overhead with increased array size. This paper presents a novel one-shot beam training technique that utilizes the emerging architecture of true-time-delay (TTD) arrays. We first show that TTD arrays facilitate frequency dependent beam steering. The proposed training procedure with TTD arrays then exploits this fact by using a single radio-frequency-chain to multiplex different subcarriers into different sounding directions. We derive conditions on the parameters of TTD array configuration and physical layer to achieve scanning of the entire angular domain with a single orthogonal frequency-division multiplexing (OFDM) training symbol. The estimation of propagation directions with high resolution is achieved via low-complexity digital signal processing of spatially coded subcarriers. Simulation results show that this TTD array based approach requires an order-of-magnitude fewer training symbols than those of phased arrays.

eess.SP↗

UAV Access Point Placement for Connectivity to a User with Unknown Location Using Deep RL

In recent years, unmanned aerial vehicles (UAVs) have been considered for telecommunications purposes as relays, caches, or IoT data collectors. In addition to being easy to deploy, their maneuverability allows them to adjust their location to optimize the capacity of the link to the user equipment on the ground or of the link to the basestation. The majority of the previous work that analyzes the optimal placement of such a UAV makes at least one of two assumptions: the channel can be predicted using a simple model or the locations of the users on the ground are known. In this paper, we use deep reinforcement learning (deep RL) to optimally place a UAV serving a ground user in an urban environment, without the previous knowledge of the channel or user location. Our algorithm relies on signal-to-interference-plus-noise ratio (SINR) measurements and a 3D map of the topology to account for blockage and scatterers. Furthermore, it is designed to operate in any urban environment. Results in conditions simulated by a ray tracing software show that with the constraint on the maximum number of iterations our algorithm has a 90% success rate in converging to a target SINR.

eess.SP↗

UAV Swarms as Amplify-and-Forward MIMO Relays

Unmanned aerial vehicles provide new opportunities for performance improvements in future wireless communications systems. For example, they can act as relays that extend the range of a communication link and improve the capacity. Unlike conventional relays that are deployed at fixed locations, UAVs can change their positions to optimize the capacity or range on demand. In this paper, we consider using a swarm of UAVs as amplify-and-forward MIMO relays to provide connectivity between an obstructed multi-antenna equipped source and destination. We start by optimizing UAV placement for the single antenna case, and analyze its dependence on the noise introduced by the relay, its gain, and transmit power constraint. We extend our analysis for an arbitrary UAV swarm and show how the MIMO link capacity can be optimized by changing the distance of the swarm to the source and the destination. Then, we consider the effect of optimizing the positions of the UAVs within the swarm and derive an upper bound for the capacity at any given placement of the swarm. We also propose a simple near optimal approach to find the positions that optimize the capacity for the end-to-end link given that the source and the destination have uniform rectangular arrays.

eess.SP↗

DSP Linearization for Millimeter-Wave All-Digital Receiver Array with Low-Resolution ADCs

Millimeter-wave (mmWave) communications and cell densification are the key techniques for the future evolution of cellular systems beyond 5G. Although the current mmWave radio designs are focused on hybrid digital and analog receiver array architectures, the fully digital architecture is an appealing option due to its flexibility and support for multi-user multiple-input multiple-output (MIMO). In order to achieve reasonable power consumption and hardware cost, the specifications of analog circuits are expected to be compromised, including the resolution of analog-to-digital converter (ADC) and the linearity of radio-frequency (RF) front end. Although the state-of-the-art studies focus on the ADC, the nonlinearity can also lead to severe system performance degradation when strong input signals introduce inter-modulation distortion (IMD). The impact of RF nonlinearity becomes more severe with densely deployed mmWave cells since signal sources closer to the receiver array are more likely to occur. In this work, we design and analyze the digital IMD compensation algorithm, and study the relaxation of the required linearity in the RF-chain. We propose novel algorithms that jointly process digitized samples to recover amplifier saturation, and relies on beam space operation which reduces the computational complexity as compared to per-antenna IMD compensation.

eess.SP↗

User Association in Dense mmWave Networks based on Rate Requirements

Commonly considered user association frameworks in millimeter-wave communications are based on the sum rate maximization, and they essentially neglect user specific rate and service requirements. Furthermore, new features of millimeter-wave communications including spatial multiplexing, connectivity to multiple coordinated base stations and dense base station deployment are not considered. In this work, we propose a two-step optimization framework for single-shot user association in dense millimeter-wave networks which takes into account users' rate requirements, multi-connectivity, and hybrid transceiver architecture for spatial multiplexing. The proposed framework considers multiple RF chains at each base station and assigns them to different users that also have multiple RF chains for connectivity with more than one base station. In the first step, the objective of the user association is to maximize the number of users with satisfied rate requirements while minimizing network underutilization. In the second step, remaining RF chains are assigned to users, whose rate requirement has not been met, such that network sum rate is maximized. This is a novel problem formulation for user associate in millimeter-wave networks. We propose low complexity sub-optimal user association algorithms based on this formulation, numerically evaluate the optimal and sub-optimal solutions, and compare them to the conventional association approaches in terms of the number of associated users and network sum rate.

cs.IT↗

Joint Precoder and Combiner Design for MMSE Distributed Beamforming with Per-Antenna Power Constraints

We consider minimum mean square error (MMSE) joint precoder and combiner design for single and multi carrier distributed beamforming systems with nonuniform per-antenna transmit power constraints. We show that, similar to the maximum-gain problem, an iterative Gauss-Seidel algorithm can be used for minimizing MSE which alternately optimizes the transmitter and receiver coefficients. In a single carrier system the optimum transmit coefficients are obtained by a simple projection of the effective MISO channel. In the multicarrier case with a sum-MSE objective, the Gauss-Seidel approach is once again applicable, but the transmit coefficients must be found by solving a quadratically constrained quadratic problem for which we apply a dual gradient algorithm. A numerical example is presented which shows improvement of 0.7 dB in carrier signal-to-noise ratio (SNR) relative to a projected eigenvector method for a multicarrier DBF system with Rayleigh-faded multipath channels.

eess.SP↗

Cyclic Weighted Centroid Algorithm for Transmitter Localization in the Presence of Interference

This paper addresses the problem of localizing a non-cooperative transmitter in the presence of a spectrally overlapped interferer in a cognitive receiver (CR) network. It has been observed that the performance of non-cooperative weighted centroid localization (WCL) algorithm degrades in the presence of a spectrally overlapped interferer. We propose cyclic WCL algorithm that uses cyclic autocorrelation (CAC) of received signals at CRs in the network to estimate the location coordinates of the target transmitter. Performance of the proposed algorithm is further improved by eliminating CRs in the vicinity of the interferer from the localization process. In order to identify and eliminate CRs in the vicinity of the interferer, the ratio of the variance and the mean of the square of absolute value of the CAC, referred to as feature variation coefficient, is used. Theoretical analysis of the cyclic WCL algorithm is presented in order to compute the root mean square error in the location estimates. We further study the impacts of the interferer's power and location, CR density, and fading environment on the performance of cyclic WCL. The comparison between cyclic WCL and traditional WCL is also presented.

eess.SP↗

Cyclic weighted centroid localization for spectrally overlapped sources in cognitive radio networks

We consider the problem of localizing spectrally overlapped sources in cognitive radio networks. A new weighted centroid localization algorithm (WCL) called Cyclic WCL is proposed, which exploits the cyclostationary feature of the target signal to estimate its location coordinates. In order to analyze the algorithm in terms of root-mean-square error (RMSE), we model the location estimates as the ratios of quadratic forms in a Gaussian random vector. With analysis and simulation, we show the impact of the interferer location and its modulation scheme on the RMSE. We also study the RMSE performance of the algorithm for different power levels of the target and the interference. Further, the comparison between Cyclic WCL and WCL w/o cyclostationarity is presented. It is observed that the Cyclic WCL provides significant performance gain over WCL.

eess.SP↗

Unsupervised frequency clustering algorithm for null space estimation in wideband spectrum sharing networks

In spectrum sharing networks, a base station (BS) needs to mitigate the interference to users associated with other coexisting network in the same band. The BS can achieve this by transmitting its downlink signal in the null space of channels to such users. However, under a wideband scenario, the BS needs to estimate null space matrices using the received signal from such non-cooperative users in each frequency bin where the users are active. To reduce the computational complexity of this operation, we propose a frequency clustering algorithm that exploits the channel correlations among adjacent frequency bins. The proposed algorithm forms clusters of frequency bins with correlated channel vectors without prior knowledge of the channels and obtains a single null space matrix for each cluster. We show that the number of matrices and the number of eigenvalue decompositions required to obtain the null space significantly reduce using the proposed clustering algorithm.

eess.SP↗

Kuiper test based modulation level classification under unknown frequency selective channels

In this paper, we address the problem of Identifying the modulation level of the received signal under an unknown frequency selective channel. The modulation level classification is performed using reduced-complexity Kuiper (rcK) test which utilizes the distribution of signal features such as magnitude of the received samples or phase difference in consecutive received samples. However, in frequency selective channels, these features are severely distorted resulting in a poor classification performance. We propose to use constant modulus algorithm (CMA) to mitigate the impact of the frequency selective channel on the signal feature. Simulation and analytical results show that the proposed CMA-rcK technique outperforms state-of-the-art cumulant-based technique as well as blind equalizer-based technique that uses Alphabet Matched Algorithm.

eess.SP↗

Feasibility of Serving K Secondary Users in Underlay Cognitive Radio Networks using Massive MIMO

In this paper, we analyze the feasibility of serving K secondary users (SUs) on the downlink using a secondary base station (SBS), equipped with a large antenna array, in an underlay cognitive radio (CR) network. First, we formulate a feasibility problem in order to compute beamforming vectors and power allocations for K SUs with constraints on the maximum allowable interference to primary users (PUs), required minimum rate at SUs, and maximum transmit power from SBS. The problem formulation takes into account the imperfect channel state information between SUs and PUs. We propose a two step approach to solve the non-convex problem. In the first step, beamforming vectors are computed using one of the two alternative schemes: maximum eigenmode beamforming (MEB) or zero forcing beamforming (ZFB). We show that the power allocations can be computed by solving a linear programming feasibility problem. Further, we provide theoretical feasibility analysis of serving K SUs with equal power allocation by deriving the distributions of SINR at SUs and interference to PUs, thereby computing the probability of serving K SUs as a function of the constraints. The analytical and simulation results are presented to demonstrate the impact of constraints on the feasibility of serving K SUs in the CR network.

cs.IT↗

Downlink transceiver beamforming and admission control for massive MIMO cognitive radio networks

In this paper, an optimization framework is proposed for joint transceiver beamforming and admission control in massive MIMO cognitive radio networks. The objective of the optimization problem is to support maximum number of secondary users in downlink transmission with constraints on the total power allocated to users, the rate achieved at secondary users and the interference at the primary nodes. The proposed framework takes into account the imperfect knowledge of the channels between the secondary and the primary nodes and also mitigates the interference caused by the primary users at secondary receivers. In order to solve the underlying NP-hard problem, we propose a three-step algorithm with two alternative schemes for power allocation, namely: equal power and equal rate. In addition, we provide a solution by reducing the problem to an Integer Linear Program (ILP). The performances of equal rate, equal power, and ILP methods are studied in under different constraints.

cs.IT↗

Power Control and Frequency Band Selection Policies for Underlay MIMO Cognitive Radio

We study power control and frequency band selection policies for multi-band underlay MIMO cognitive radio with the objective of maximizing the rate of a secondary user (SU) link while limiting the interference leakage towards primary users (PUs) below a threshold. The goal of the SU in each policy is to select one frequency band in each time slot and determine the transmit power. To limit the interference towards PU in time-varying channels, we propose fixed and dynamic transmit power control schemes which depend on PU traffic and the temporal correlation of channels between the SU and the PU. We study the performance of frequency band selection policies that use fixed or dynamic power control. We show that dynamic frequency band selection policies, e.g., policies based on multi-armed bandit framework, wherein SU selects a different frequency band in each slot, result in higher interference towards PU as compared to the fixed band policy wherein SU stays on one band. We also provide an expression for the gap between the rate achieved by SU under a clairvoyant policy and the fixed band policy. It is observed that this gap reduces with increased temporal correlation and with increased number of SU antennas.

eess.SP↗

QoS Aware Power Allocation and User Selection in Massive MIMO Underlay Cognitive Radio Networks

We address the problem of power allocation and secondary user (SU) selection in the downlink from a secondary base station (SBS) equipped with a large number of antennas in an underlay cognitive radio network. A new optimization framework is proposed in order to select the maximum number of SUs and compute power allocations in order to satisfy instantaneous rate or QoS requirements of SUs. The optimization framework also aims to restrict the interference to primary users (PUs) below a predefined threshold using available imperfect CSI at the SBS. In order to obtain a feasible solution for power allocation and user selection, we propose a low-complexity algorithm called DeleteSU-with-Maximum-Power-allocation (DMP). Theoretical analysis is provided to compute the interference to PUs and the number of SUs exceeding the required rate. The analysis and simulations show that the proposed DMP algorithm outperforms the stateof-the art selection algorithm in terms of serving more users with minimum rate constraints, and it approaches the optimal solution if the number of antennas is an order of magnitude greater than the number of users.

eess.SP↗