In this paper, the secure transmission of information over an ergodic fading channel is investigated in the presence of statistical quality of service (QoS) constraints. We employ effective capacity, which provides the maximum constant arrival rate that a given process can support while satisfying statistical delay constraints, to measure the secure throughput of the system, i.e., effective secure throughput. We assume that the channel side information (CSI) of the main channel is available at the transmitter side. Depending on the availability of the CSI of the eavesdropper channel, we obtain the corresponding optimal power control policies that maximize the effective secure throughput. In particular, when the CSI of the eavesdropper channel is available at the transmitter, the transmitter can no longer wait for transmission when the main channel is much better than the eavesdropper channel due to the introduction of QoS constraints. Moreover, the CSI of the eavesdropper channel becomes useless as QoS constraints become stringent.
In this paper, the fading broadcast channel with confidential messages is studied in the presence of statistical quality of service (QoS) constraints in the form of limitations on the buffer length. We employ the effective capacity formulation to measure the throughput of the confidential and common messages. We assume that the channel side information (CSI) is available at both the transmitter and the receivers. Assuming average power constraints at the transmitter side, we first define the effective secure throughput region, and prove that the throughput region is convex. Then, we obtain the…
This paper evaluates the performance of reliability and latency in machine type communication networks, which composed of single transmitter and receiver in the presence of Rayleigh fading channel. The source's traffic arrivals are modeled as Markovian processes namely Discrete-Time Markov process, Fluid Markov process, and Markov Modulated Poisson process, and delay/buffer overflow constraints are imposed. Our approach is based on the reliability and latency outage probability, where transmitter not knowing the channel condition, therefore the transmitter would be transmitting information ove…
Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, we study the achievable effective capacity region of the users in multiaccess fading channels (MAC) in the presence of quality of service (QoS) constraints. We assume that channel side information (CSI) is available at both the transmitters and the receiver, and superposition coding technique with successive decoding is used. When the power is fixed at the transmitters, we show that vary…
Energy efficiency in fading channels in the presence of Quality of Service (QoS) constraints is studied. Effective capacity, which provides the maximum arrival rate that a wireless channel can sustain while satisfying statistical QoS constraints, is considered. Spectral efficiency--bit energy tradeoff is analyzed in the low-power and wideband regimes by employing the effective capacity formulation, rather than the Shannon capacity. Through this analysis, energy requirements under QoS constraints are identified. The analysis is conducted under two assumptions: perfect channel side information (…
Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, the effective capacity region of fading multiple access channels (MAC) in the presence of quality of service (QoS) constraints is studied. Perfect channel side information (CSI) is assumed to be available at both the transmitters and the receiver. It is initially assumed the transmitters send the information at a fixed power level and hence do not employ power control policies. Under thi…
This paper presents the optimal power control policies maximizing the effective capacity achieved with arbitrary input distributions subject to an average power constraint and quality of service (QoS) requirements. The analysis leads to simplified expressions for the optimal power control strategies in the low power regime and two limiting cases, i.e., extremely stringent QoS constraints and vanishing QoS constraints. In the low power regime, the energy efficiency (EE) performance with the constant-power scheme is also determined by characterizing both the minimum energy per bit and wideband s…
We consider the joint scheduling-and-power-allocation problem of a downlink cellular system. The system consists of two groups of users: real-time (RT) and non-real-time (NRT) users. Given some average power constraint on the base station, the problem is to find an algorithm that satisfies the RT and NRT quality-of-service (QoS) constraints. The RT QoS constraints guarantee the portion of RT packets that miss their deadline are no more than a pre-specified threshold. On the other hand, the NRT QoS is only to guarantee the stability of their queues. We propose a sum-rate-maximizing algorithm th…
In this paper, the performance of cognitive transmission under quality of service (QoS)constraints and interference limitations is studied. Cognitive secondary users are assumed to initially perform sensing over multiple frequency bands (or equivalently channels) to detect the activities of primary users. Subsequently, they perform transmission in a single channel at variable power and rates depending on the channel sensing decisions and the fading environment. A state transition model is constructed to model this cognitive operation. Statistical limitations on the buffer lengths are imposed t…
In this paper, we propose a polar coding scheme for secure communication over the multiple-input, single-output, single-antenna eavesdropper (MISOSE) fading channel. We consider the case of block fading channels with known eavesdropper channel state information (CSI) and the case of fading channels with known eavesdropper channel distribution information (CDI). We use the artificial noise assisted secure precoding method to maximize the secrecy capacity in the first case, and to overcome the unawareness of the eavesdropper CSI in the second case. We show that our proposed scheme can provide bo…
Energy efficiency and quality of service (QoS) guarantees are the key design goals for the 5G wireless communication systems. In this context, we discuss a multiuser scheduling scheme over fading channels for loss tolerant applications. The loss tolerance of the application is characterized in terms of different parameters that contribute to quality of experience for the application. The mobile users are scheduled opportunistically such that a minimum QoS is guaranteed. We propose an opportunistic scheduling scheme and address the cross layer design framework when channel state information is …
In this letter, we study relay-aided networks with presence of single eavesdropper. We provide joint beamforming design of the source and relay that can minimize the overall power consumption while satisfying our predefined quality-of-service (QoS) requirements. Additionally, we investigate the case that the channel between relay and eavesdropper suffers from channel uncertainty. Finally, simulation results are provided to verify the effectiveness of our algorithm.
In this paper, performance of cognitive transmission over time-selective flat fading channels is studied under quality of service (QoS) constraints and channel uncertainty. Cognitive secondary users (SUs) are assumed to initially perform channel sensing to detect the activities of the primary users, and then attempt to estimate the channel fading coefficients through training. Energy detection is employed for channel sensing, and different minimum mean-square-error (MMSE) estimation methods are considered for channel estimation. In both channel sensing and estimation, erroneous decisions can b…
We assume a full-duplex (FD) cooperative network subject to hostile attacks and undergoing composite fading channels. We focus on two scenarios: \textit{a)} the transmitter has full CSI, for which we derive closed-form expressions for the \textit{average secrecy rate}; and \textit{b)} the transmitter only knows the CSI of the legitimate nodes, for which we obtain closed-form expressions for the \textit{secrecy outage probability}. We show that secure FD relaying is feasible, even under strong self-interference and in the presence of sophisticated multiple antenna eavesdropper.
The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information is assumed to be known at both the transmitter and the receiver. The parallel wire-tap channel with independent subchannels is first studied, which serves as an information-theoretic model for the fading wire-tap channel. The secrecy capacity of the parallel wire-tap channel is established. This result is then specialized to give the secrecy …
The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransmission request (HARQ) protocol is revisited for a block-fading wire-tap channel, in which two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-free public channel. Both reliability and con…
In this paper, we investigate the design of artificial-noise-aided secure multi-antenna transmission in slow fading channels. The primary design concerns include the transmit power allocation and the rate parameters of the wiretap code. We consider two scenarios with different complexity levels: i) the design parameters are chosen to be fixed for all transmissions, ii) they are adaptively adjusted based on the instantaneous channel feedback from the intended receiver. In both scenarios, we provide explicit design solutions for achieving the maximal throughput subject to a secrecy constraint, g…
In this letter, the performance analysis of physical layer security over Fisher-Snedecor $\mathcal{F}$ fading channels is investigated. In particular, the average secrecy capacity (ASC), the secure outage probability (SOP), the lower bound of the SOP (SOP$^L$), and the strictly positive secure capacity (SPSC) are derived in exact closed-from expressions. The Fisher-Snedecor $\mathcal{F}$ fading channel is a composite of multipath/shadowed fading that are represented by the Nakagami-$m$ distribution. Moreover, it provides close results to the practical measurements than the generalised $K$ ($K_…
In this paper, cognitive transmission under quality of service (QoS) constraints is studied. In the cognitive radio channel model, it is assumed that both the secondary receiver and the secondary transmitter know the channel fading coefficients perfectly and optimize the power adaptation policy under given constraints, depending on the channel activity of the primary users, which is determined by channel sensing performed by the secondary users. The transmission rates are equal to the instantaneous channel capacity values. A state transition model with four states is constructed to model this …
In this paper, throughput and energy efficiency of secure wireless transmission of delay sensitive data generated by random sources is studied. A fading broadcast model in which the transmitter sends confidential and common messages to two receivers is considered. It is assumed that the common and confidential data, generated from Markovian sources, is stored in buffers prior to transmission, and the transmitter operates under constraints on buffer/delay violation probability. Under such statistical quality of service (QoS) constraints, effective capacity of time-varying wireless transmissions…
We consider the problem of secure communication with multi-antenna transmission in fading channels. The transmitter simultaneously transmits an information bearing signal to the intended receiver and artificial noise to the eavesdroppers. We obtain an analytical closed-form expression of an achievable secrecy rate, and use it as the objective function to optimize the transmit power allocation between the information signal and the artificial noise. Our analytical and numerical results show that equal power allocation is a simple yet near optimal strategy for the case of non-colluding eavesdrop…
Energy efficiency of three common hybrid automatic repeat request (HARQ) schemes including Type I HARQ, HARQ with chase combining (HARQ-CC) and HARQ with incremental redundancy (HARQ-IR), is analyzed and joint power allocation and rate selection to maximize the energy efficiency is investigated in this paper. Unlike prior literature, time-correlated fading channels is considered and two widely concerned quality of service (QoS) constraints, i.e., outage and goodput constraints, are also considered in the optimization, which further differentiates this work from prior ones. Using a unified expr…
In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input signals. We assume that the receiver performs successive decoding with a certain order. Then, we establish the effective capacity region that provides the maximum allowable sustainable arrival rate region at the transmitters' buffers under QoS guarantees. Assuming limited transmission power budgets at the transmitters, we attain the power allocation policies…
Theoretical studies on physical layer security often adopt the secrecy outage probability as the performance metric for wireless communications over quasi-static fading channels. The secrecy outage probability has two limitations from a practical point of view: a) it does not give any insight into the eavesdropper's decodability of confidential messages; b) it cannot characterize the amount of information leakage to the eavesdropper when an outage occurs. Motivated by the limitations of the secrecy outage probability, we propose three new secrecy metrics for secure transmissions over quasi-sta…
Semantic Noise Aided Secure Image Transmission over MIMO Fading Channels
School of Integrated Circuits (School of Information Science and Electronic Engineering), Shanghai Jiao Tong University（上海交通大学集成电路学院（信息科学与电子工程学院））；School of Microelectronics, Shanghai University（上海大学微电子学院）；Shanghai Frontier Innovation Research Institute（上海前沿创新研究院）；Faculty of Applied Sciences, Macao Polytechnic University（澳门理工学院应用科学系）；School of Electronic Engineering and Computer Science, Queen Mary University of London（伦敦大学玛丽女王学院电子工程与计算机科学学院）；Department of Electronic Engineering, Kyung Hee University（庆熙大学电子工程系）；Department of Electrical and Computer Engineering, University of Delaware（特拉华大学电气与计算机工程系）
Massive multiple-input multiple-output communications can achieve high-level security by concentrating radio frequency signals towards the legitimate users. However, this system is vulnerable in a Rician fading environment if the eavesdropper positions itself such that its channel is highly "similar" to the channel of a legitimate user. To address this problem, this paper proposes an angle aware user cooperation (AAUC) scheme, which avoids direct transmission to the attacked user and relies on other users for cooperative relaying. The proposed scheme only requires the eavesdropper's angle info…
Smart grid is an emerging technology which is able to control the power load via price signaling. The communication between the power supplier and power customers is a key issue in smart grid. Performance degradation like delay or outage may cause significant impact on the stability of the pricing based control and thus the reward of smart grid. Therefore, a QoS mechanism is proposed for the communication system in smart grid, which incorporates the derivation of QoS requirement and applies QoS routing in the communication network. For deriving the QoS requirement, the dynamics of power load a…
Throughput and energy efficiency in fading channels are studied in the presence of randomly arriving data and statistical queueing constraints. In particular, Markovian arrival models including discrete-time Markov, Markov fluid, and Markov-modulated Poisson sources are considered. Employing the effective bandwidth of time-varying sources and effective capacity of time-varying wireless transmissions, maximum average arrival rates in the presence of statistical queueing constraints are characterized. For the two-state (ON/OFF) source models, throughput is determined in closed-form as a function…
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with i…
Transmission over wireless fading channels under quality of service (QoS) constraints is studied when only the receiver has channel side information. Being unaware of the channel conditions, transmitter is assumed to send the information at a fixed rate. Under these assumptions, a two-state (ON-OFF) transmission model is adopted, where information is transmitted reliably at a fixed rate in the ON state while no reliable transmission occurs in the OFF state. QoS limitations are imposed as constraints on buffer violation probabilities, and effective capacity formulation is used to identify the m…
In this paper, we investigate dynamic resource scheduling (i.e., joint user, subchannel, and power scheduling) for downlink multi-channel non-orthogonal multiple access (MC-NOMA) systems over time-varying fading channels. Specifically, we address the weighted average sum rate maximization problem with quality-of-service (QoS) constraints. In particular, to facilitate fast resource scheduling, we focus on developing a very low-complexity algorithm. To this end, by leveraging Lagrangian duality and the stochastic optimization theory, we first develop an opportunistic MC-NOMA scheduling algorithm…
Wyner's wiretap channel is extended to parallel broadcast channels and fading channels with multiple receivers. In the first part of the paper, we consider the setup of parallel broadcast channels with one sender, multiple intended receivers, and one eavesdropper. We study the situations where the sender broadcasts either a common message or independent messages to the intended receivers. We derive upper and lower bounds on the common-message-secrecy capacity, which coincide when the users are reversely degraded. For the case of independent messages we establish the secrecy sum-capacity when t…
We investigate a relay network where the source can potentially utilize an untrusted non-regenerative relay to augment its direct transmission of a confidential message to the destination. Since the relay is untrusted, it is desirable to protect the confidential data from it while simultaneously making use of it to increase the reliability of the transmission. We first examine the secrecy outage probability (SOP) of the network assuming a single antenna relay, and calculate the exact SOP for three different schemes: direct transmission without using the relay, conventional non-regenerative rel…
In this work, we consider a typical three-node, two-way relaying network (TWRN) over fading channels. The aim is to minimize the entire system energy usage for a TWRN in the long run, while satisfying the required average symmetric exchange rate between the two source nodes. To this end, the energy usage of the physical-layer network coding (PNC) or the superposition coding based digital network coding (SPC-DNC) is analyzed. The rule on selection of both strategies is then derived by comparison. Based on the observed rule, we then design a scheme by switching between PNC and SPC-DNC for each c…
Through ordinary transmissions over wireless multicast networks are greatly hampered due to the simultaneous presence of fading and shadowing of wireless channels, secure transmissions can be enhanced by properly exploiting random attributes of the propagation medium. This study focuses on the utilization of those attributes to enhance the physical layer security (PLS) performance of a dual-hop wireless multicast network over kappa-mu shadow-fading channel under the wiretapping attempts of multiple eavesdroppers. In order to improve the secrecy level, the best relay selection strategy among mu…
We consider a small cell network (SCN) consisting of N cells, with the small cell base stations (SCBSs) equipped with Nt \geq 1 antennas each, serving K single antenna user terminals (UTs) per cell. Under this set up, we address the following question: given certain time average quality of service (QoS) targets for the UTs, what is the minimum transmit power expenditure with which they can be met? Our motivation to consider time average QoS constraint comes from the fact that modern wireless applications such as file sharing, multi-media etc. allow some flexibility in terms of their delay tole…
The amount of sensitive data, which is transmitted wirelessly will increase with future technologies. This raises many questions about secure data transmission. Besides cryptography, information-theoretic security gained increasing attention over the recent years. Among others, it deals with the problem of secure data transmission on the physical layer to a legitimate receiver (Bob) in the presence of an eavesdropper (Eve). In this work, we investigate upper and lower bounds on the secrecy outage probability for slowly-fading wiretap channels with an arbitrary dependency structure between the …
We furnish a procedure based on universal hash families (UHFs) that can convert an error correcting coding scheme (ECC) of rate $R$ into a semantically secure wiretap coding scheme of rate $R - ξ$ where $ξ$ is a parameter derived from the eavesdropper's point-to-point channel. This conversion is shown to be polynomial time efficient with block length and is applicable to any channel. When an ECC is chosen, our procedure induces a wiretap coding scheme that is concrete and efficient as long as the ECC is also such. To prove this induced wiretap coding scheme is semantically secure, we have cons…
Reconfigurable Intelligent Surface (RIS) is one of the promising techniques for 6G wireless communications, and recently has also been shown to be able to improve secure communications. However, there is a "double fading" effect in the reflection link between base station and user, thus passive RIS only achieves a negligible secrecy gain in typical communications scenarios.In this letter, we propose an active RIS-aided multi-antenna physical layer secrecy transmission scheme, where the active RIS can amplify the signal actively. Our aim is to minimize the transmit power subject to the constrai…
We investigate the secure communications over correlated wiretap Rayleigh fading channels assuming the full channel state information (CSI) available. Based on the information theoretic formulation, we derive closed-form expressions for the average secrecy capacity and the outage probability. Simulation results confirm our analytical expressions.
Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived. Transmission strategies required to achieve these derivatives are identified. In particular, it is shown that it is optimal in the low-SNR regime to transmit in the maximal-eigenvalue eigenspace of Phi = H_m* H_m - N_m/N_e H_e* H_e where H_m and H_e denote the channel matrices associated with the legitimate receiver and eavesdropper, respectively, and N_m and N_e are …
We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full Channel State Information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only …
In this paper, the physical layer security aspects of a wireless framework over α-\k{appa}-μ shadowed (AKMS) fading channel are examined by acquiring closed-form novel expressions of average secrecy capacity, secure outage probability (SOP), and strictly positive secrecy capacity. The lower bound of SOP is derived along with the asymptotic expression of SOP at the high signal-to-noise ratio regime in order to achieve secrecy diversity gain. Capitalizing on these expressions, the consequences due to the simultaneous occurrence of fading and shadowing are quantified. Finally, Monte-Carlo simulat…
In this paper, we study the frequency-selective broadcast channel with confidential messages (BCC) in which the transmitter sends a confidential message to receiver 1 and a common message to receivers 1 and 2. In the case of a block transmission of N symbols followed by a guard interval of L symbols, the frequency-selective channel can be modeled as a N * (N+L) Toeplitz matrix. For this special type of multiple-input multiple-output (MIMO) channels, we propose a practical Vandermonde precoding that consists of projecting the confidential messages in the null space of the channel seen by receiv…
It is well-known that wireless channel reciprocity together with fading can be exploited to generate a common secret key between two legitimate communication partners. This can be achieved by exchanging known deterministic pilot signals between both partners from which the random fading gains can be estimated and processed. However, the entropy and thus quality of the generated key depends on the channel coherence time. This can result in poor key generation rates in a low mobility environment, where the fading gains are nearly constant. Therefore, wide-spread deployment of wireless channel-ba…
In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performance metric to identify the secure throughput of the system, i.e., effective secure throughput. It is assumed that perfect channel side information (CSI) is available at both the transmitter and the receivers. Initially, the scenario in which the transmitter sends common messages to two receivers and confidential messages to one receiver is considered. For this case, effective secure throughput region, which …
This paper considers point to point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under two different assumptions on the transmitter CSI (Channel state information). First, we find the outage secrecy capacity assuming that the transmitter has perfect knowledge of the legitimate and eavesdropper channel gains. In this scenario, the capacity achieving scheme relies on opportunistically exchangi…
In this paper, we consider the transmission of confidential information over a $κ$-$μ$ fading channel in the presence of an eavesdropper, who also observes $κ$-$μ$ fading. In particular, we obtain novel analytical solutions for the probability of strictly positive secrecy capacity (SPSC) and the lower bound of secure outage probability (SOP$^L$) for channel coefficients that are positive, real, independent and non-identically distributed ($i.n.i.d.$). We also provide a closed-form expression for the probability of SPSC when the $μ$ parameter is assumed to only take positive integer values. We …
This paper presents a number of fundamental properties of full-duplex radio for secure wireless communication under some simple and practical conditions. In particular, we consider the fields of secrecy capacity of a wireless channel between two single-antenna radios (Alice and Bob) against an unknown number of single-antenna eavesdroppers (Eves) from unknown locations, where Alice and Bob have zero knowledge (except a model) of the large-scale-fading channel-state-information of Eves. These properties show how the secrecy capacity is distributed in terms of the location of any Eve, how the op…
Quality of service (QoS) for a network is characterized in terms of various parameters specifying packet delay and loss tolerance requirements for the application. The unpredictable nature of the wireless channel demands for application of certain mechanisms to meet the QoS requirements. Traditionally, medium access control (MAC) and network layers perform these tasks. However, these mechanisms do not take (fading) channel conditions into account. In this paper, we investigate the problem using cross layer techniques where information flow and joint optimization of higher and physical layer is…
Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and lower bounds on the minimum density of the legitimate nodes (as a function of the density of the eavesdropper nodes) required for non-zero probability of having an unbounded cluster are derived. The lower bound is universal in nature, i.e. the constant does not depend on the density of the eavesdropper nodes.
In this article, the design of secure lattice coset codes for general wireless channels with fading and Gaussian noise is studied. Recalling the eavesdropper's probability and information bounds, a variant of the latter is given from which it is explicitly seen that both quantities are upper bounded by (increasing functions of) the expected flatness factor of the faded lattice related to the eavesdropper. By making use of a recently developed approximation of the theta series of a lattice, it is further shown how the average flatness factor can be approximated numerically. In particular, based…
In this paper, the secrecy analysis of physical layer when both the main and wiretap channels undergo $κ-μ$ shadowed fading channel is investigated. In particular, the average secrecy capacity (ASC), secure outage probability (SOP), the lower bound of SOP (SOP$^L$), and the probability of strictly positive secrecy capacity (SPSC) are derived by using the classic Wyner's wiretap model. Two different scenarios for the fading parameters, i.e., $μ$ and $m$ which represents the shadowing impact have been studied. These parameters are chosen first as arbitrary numbers, thus the performance metrics a…
This paper addresses the cell association problem in the downlink of a multi-tier heterogeneous network (HetNet), where base stations (BSs) have finite number of resource blocks (RBs) available to distribute among their associated users. Two problems are defined and treated in this paper: sum utility of long term rate maximization with long term rate quality of service (QoS) constraints, and global outage probability minimization with outage QoS constraints. The first problem is well-suited for low mobility environments, while the second problem provides a framework to deal with environments w…
