19 December 2018 in IEEE Transactions on Information Theory
6 January 2020 in IEEE Transactions on Wireless Communications
A multi-antenna broadcast channel scenario is considered where a base station delivers contents to cache-enabled user terminals. A joint design of coded caching (CC) and multigroup multicast beamforming is proposed to benefit from spatial multiplexing gain, improved interference management and the global CC gain, simultaneously. The developed general content delivery strategies utilize the multiantenna multicasting opportunities provided by the CC technique while optimally balancing the detrimental impact of both noise and inter-stream interference from coded messages transmitted in parallel. Flexible resource allocation schemes for CC are introduced where the multicast beamformer design and the receiver complexity are controlled by varying the size of the subset of users served during a given time interval, and the overlap among the multicast messages transmitted in parallel, indicated by parameters α and β, respectively. Degrees of freedom (DoF) analysis is provided showing that the DoF only depends on α while it is independent of β. The proposed schemes are shown to provide the same degrees-of-freedom at high signal-to-noise ratio (SNR) as the state-of-art methods and, in general, to perform significantly better, especially in the finite SNR regime, than several baseline schemes.
31 January 2022 in IEEE Wireless Communications Letters
In this letter, we examine the PHY layer secret key generation (PHY-SKG) scheme in the presence of man-in-the-middle (MiM) adversary, while legitimate parties suffer from hardware impairments (HIs). Different from previous works on PHY-SKG that consider adversaries who simply try to make an interference in the communication link, the MiM aims to deceive legitimate entities about the source of common randomness. To conquer the MiM attack, legitimate parties utilize randomized pilots (RPs) in our proposed scheme. We analyze the effect of HIs on the performance of system by deriving the achievable secret key rate (SKR). Our results highlight a fundamental limit, as a ceiling phenomena, on the SKR when having practical imperfections. Top-level guidelines for selecting impairment levels along the transceiver chains is also provided to maximize the performance of the PHY-SKG protocol. Our numerical results verify the analytic expressions derived, while providing insights on system design. We show that by properly considering the HIs, about 25% improvement in the SKR is achievable.
16 November 2021 in IEEE Transactions on Communications
In this paper, a learning-aided content-based image transmission scheme is proposed, where a multi-antenna source wishes to securely deliver an image to a legitimate destination in the presence of randomly-distributed passive eavesdroppers (Eves). We take into account the fact that not all regions of an image have the same importance from the security perspective. Hence, we employ a hybrid method to realize both the error-free data delivery of public regions—containing less-important pixels; and an artificial noise (AN)-aided transmission scheme for securing the confidential packets. To reinforce system’s security, fountain-based packet delivery is also adopted, where the source node encodes images into fountain-like packets prior to sending them over the air. The secrecy is achieved when the legitimate destination correctly receives the entire source packets before Eves obtain the important regions, while conforming to the latency limits of the system. Accordingly, the secrecy performance of our scheme is characterized by deriving a closed-form expression for the quality-of-security (QoSec) violation probability. Moreover, our proposed image delivery scheme leverages a deep neural network (DNN) and learns to maintain optimized transmission parameters, while achieving a low QoSec violation probability. Simulation results are provided to illustrate that our proposed learning-assisted scheme outperforms the state-of-the-arts by achieving considerable gains in terms of security and delay requirement.
23 February 2017 in BMC Bioinformatics
Current development of sequencing technologies is towards generating longer and noisier reads. Evidently, accurate alignment of these reads play an important role in any downstream analysis. Similarly, reducing the overall cost of sequencing is related to the time consumption of the aligner. The tradeoff between accuracy and speed is the main challenge in designing long read aligners. We propose Meta-aligner which aligns long and very long reads to the reference genome very efficiently and accurately. Meta-aligner incorporates available short/long aligners as subcomponents and uses statistics from the reference genome to increase the performance. Meta-aligner estimates statistics from reads and the reference genome automatically. Meta-aligner is implemented in C++ and runs in popular POSIX-like operating systems such as Linux. Meta-aligner achieves high recall rates and precisions especially for long reads and high error rates. Also, it improves performance of alignment in the case of PacBio long-reads in comparison with traditional schemes.