Search

In recent years, the multiple-input multiple-output (MIMO) non-orthogonal multiple-access (NOMA) systems have attracted a significant interest in the relevant research communities. As a potential precoding scheme, the generalized singular value decomposition (GSVD) can be adopted in MIMO-NOMA systems and has been proved to have high spectral efficiency. In this paper, the performance of the GSVD-based MIMO-NOMA communications with Rician fading is studied. In particular, the distribution characteristics of generalized singular values (GSVs) of channel matrices are analyzed. Two novel mathematical tools, the linearization trick and the deterministic equivalent method, which are based on operator-valued free probability theory, are exploited to derive the Cauchy transform of GSVs. An iterative process is proposed to obtain the numerical values of the Cauchy transform of GSVs, which can be exploited to derive the average data rates of the communication system. In addition, the special case when the channel is modeled as Rayleigh fading, i.e., the line-of-sight propagation is trivial, is analyzed. In this case, the closed-form expressions of average rates are derived from the proposed iterative process. Simulation results are provided to validate the derived analytical results., Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible

This paper investigates a machine learning-based power allocation design for secure transmission in a cognitive radio (CR) network. In particular, a neural network (NN)-based approach is proposed to maximize the secrecy rate of the secondary receiver under the constraints of total transmit power of secondary transmitter, and the interference leakage to the primary receiver, within which three different regularization schemes are developed. The key advantage of the proposed algorithm over conventional approaches is the capability to solve the power allocation problem with both perfect and imperfect channel state information. In a conventional setting, two completely different optimization frameworks have to be designed, namely the robust and non-robust designs. Furthermore, conventional algorithms are often based on iterative techniques, and hence, they require a considerable number of iterations, rendering them less suitable in future wireless networks where there are very stringent delay constraints. To meet the unprecedented requirements of future ultra-reliable low-latency networks, we propose an NN-based approach that can determine the power allocation in a CR network with significantly reduced computational time and complexity. As this trained NN only requires a small number of linear operations to yield the required power allocations, the approach can also be extended to different delay sensitive applications and services in future wireless networks. When evaluate the proposed method versus conventional approaches, using a suitable test set, the proposed approach can achieve more than 94% of the secrecy rate performance with less than 1% computation time and more than 93% satisfaction of interference leakage constraints. These results are obtained with significant reduction in computational time, which we believe that it is suitable for future real-time wireless applications.

Energy efficiency (EE) and spectral efficiency (SE) are two of the key performance metrics in future wireless networks, covering both design and operational requirements. For previous conventional resource allocation techniques, these two performance metrics have been considered in isolation, resulting in severe performance degradation in either of these metrics. Motivated by this problem, in this paper, we propose a novel beamforming design that jointly considers the trade-off between the two performance metrics in a multiple-input single-output non-orthogonal multiple access system. In particular, we formulate a joint SE-EE based design as a multi-objective optimization (MOO) problem to achieve a good tradeoff between the two performance metrics. However, this MOO problem is not mathematically tractable and, thus, it is difficult to determine a feasible solution due to the conflicting objectives, where both need to be simultaneously optimized. To overcome this issue, we exploit a priori articulation scheme combined with the weighted sum approach. Using this, we reformulate the original MOO problem as a conventional single objective optimization (SOO) problem. In doing so, we develop an iterative algorithm to solve this non-convex SOO problem using the sequential convex approximation technique. Simulation results are provided to demonstrate the advantages and effectiveness of the proposed approach over the available beamforming designs., Comment: Accepted in IEEE TWC, June 2020

In this paper, we develop a resource allocation technique for a hybrid time division multiple access (TDMA) - non-orthogonal multiple access (NOMA) system with opportunistic time assignment. In particular, the available transmission time is divided into several time-slots, through which multiple users are served by exploiting power-domain NOMA. To fully exploit underlying benefits of this hybrid TDMA-NOMA system, we utilize the available resources efficiently by jointly allocating transmit power and time-slots to several groups of users in the system. Furthermore, these resources are allocated to maximize minimum rate of the users in the system. However, this max-min resource allocation problem is non-convex due to coupled design parameters of time and power allocations. Hence, we exploit a novel second-order cone formulation to overcome this non-convexity issue and develop an iterative algorithm to realize a solution to the original max-min problem. Simulation results show that this joint resource allocation technique has a considerable performance enhancement in terms of both minimum achieved rate and overall system throughput compared to that of the conventional resource allocation technique where equal time-slots are assigned to the groups of users., Comment: 6 pages, 4 figures, this paper will be presented in part at the IEEE International Conference on Communications (ICC) Workshop, Dublin, Ireland, June 2020

In this paper, we investigate different secrecy energy efficiency (SEE) optimization problems in a multiple-input single-output underlay cognitive radio (CR) network in the presence of an energy harvesting receiver. In particular, these energy efficient designs are developed with different assumptions of channels state information (CSI) at the transmitter, namely perfect CSI, statistical CSI and imperfect CSI with bounded channel uncertainties. In particular, the overarching objective here is to design a beamforming technique maximizing the SEE while satisfying all relevant constraints linked to interference and harvested energy between transmitters and receivers. We show that the original problems are non-convex and their solutions are intractable. By using a number of techniques, such as non-linear fractional programming and difference of concave (DC) functions, we reformulate the original problems so as to render them tractable. We then combine these techniques with the Dinkelbach's algorithm to derive iterative algorithms to determine relevant beamforming vectors which lead to the SEE maximization. In doing this, we investigate the robust design with ellipsoidal bounded channel uncertainties, by mapping the original problem into a sequence of semidefinite programs by employing the semidefinite relaxation, non-linear fractional programming and S-procedure. Furthermore, we show that the maximum SEE can be achieved through a search algorithm in the single dimensional space. Numerical results, when compared with those obtained with existing techniques in the literature, show the effectiveness of the proposed designs for SEE maximization.

In this paper, we investigate energy harvesting capabilities of non-orthogonal multiple access (NOMA) scheme integrated with the conventional time division multiple access (TDMA) scheme, which is referred to as hybrid TDMA-NOMA system. In a such hybrid scheme, users are divided into a number of groups, with the total time allocated for transmission is shared between these groups through multiple time slots. In particular, a time slot is assigned to serve each group, whereas the users in the corresponding group are served based on power-domain NOMA technique. Furthermore, simultaneous wireless power and information transfer technique is utilized to simultaneously harvest energy and decode information at each user. Therefore, each user splits the received signal into two parts, namely, energy harvesting part and information decoding part. In particular, we jointly determine the power allocation and power splitting ratios for all users to minimize the transmit power under minimum rate and minimum energy harvesting requirements at each user. Furthermore, this joint design is a non-convex problem in nature. Hence, we employ successive interference cancellation to overcome these non-convexity issues and determine the design parameters (i.e., the power allocations and the power splitting ratios). In simulation results, we demonstrate the performance of the proposed hybrid TDMA-NOMA design and show that it outperforms the conventional TDMA scheme in terms of transmit power consumption.

Cell-free Massive multiple-input multiple-output (MIMO) is considered, where distributed access points (APs) multiply the received signal by the conjugate of the estimated channel, and send back a quantized version of this weighted signal to a central processing unit (CPU). For the first time, we present a performance comparison between the case of perfect fronthaul links, the case when the quantized version of the estimated channel and the quantized signal are available at the CPU, and the case when only the quantized weighted signal is available at the CPU. The Bussgang decomposition is used to model the effect of quantization. The max-min problem is studied, where the minimum rate is maximized with the power and fronthaul capacity constraints. To deal with the non-convex problem, the original problem is decomposed into two sub-problems (referred to as receiver filter design and power allocation). Geometric programming (GP) is exploited to solve the power allocation problem whereas a generalized eigenvalue problem is solved to design the receiver filter. An iterative scheme is developed and the optimality of the proposed algorithm is proved through uplink-downlink duality. A user assignment algorithm is proposed which significantly improves the performance. Numerical results demonstrate the superiority of the proposed schemes., Comment: 9 figures

A low complexity massive multiple-input multiple-output (MIMO) technique is studied with a geometry-based stochastic channel model, called COST 2100 model. We propose to exploit the discrete-time Fourier transform of the antenna correlation function to perform user scheduling. The proposed algorithm relies on a trade off between the number of occupied bins of the eigenvalue spectrum of the channel covariance matrix for each user and spectral overlap among the selected users. We next show that linear precoding design can be performed based only on the channel correlation matrix. The proposed scheme exploits the angular bins of the eigenvalue spectrum of the channel covariance matrix to build up an "approximate eigenchannels" for the users. We investigate the reduction of average system throughput with no channel state information at the transmitter (CSIT). Analysis and numerical results show that while the throughput slightly decreases due to the absence of CSIT, the complexity of the system is reduced significantly., Comment: IEEE TVT 2019, 7 pages, 4 figures

We investigate the energy efficiency performance of cell-free Massive multiple-input multiple-output (MIMO), where the access points (APs) are connected to a central processing unit (CPU) via limited-capacity links. Thanks to the distributed maximum ratio combining (MRC) weighting at the APs, we propose that only the quantized version of the weighted signals are sent back to the CPU. Considering the effects of channel estimation errors and using the Bussgang theorem to model the quantization errors, an energy efficiency maximization problem is formulated with per-user power and backhaul capacity constraints as well as with throughput requirement constraints. To handle this non-convex optimization problem, we decompose the original problem into two sub-problems and exploit a successive convex approximation (SCA) to solve original energy efficiency maximization problem. Numerical results confirm the superiority of the proposed optimization scheme., Comment: 8 pages, 4 figures, IEEE ICC 2019. arXiv admin note: text overlap with arXiv:1801.10190

In this paper, we propose a beamforming design that jointly considers two conflicting performance metrics, namely the sum rate and fairness, for a multiple-input single-output non-orthogonal multiple access system. Unlike the conventional rate-aware beamforming designs, the proposed approach has the flexibility to assign different weights to the objectives (i.e., sum rate and fairness) according to the network requirements and the channel conditions. In particular, the proposed design is first formulated as a multi-objective optimization problem, and subsequently mapped to a single objective optimization (SOO) problem by exploiting the weighted sum approach combined with a prior articulation method. As the resulting SOO problem is non-convex, we use the sequential convex approximation technique, which introduces multiple slack variables, to solve the overall problem. Simulation results are provided to demonstrate the performance and the effectiveness of the proposed approach along with detailed comparisons with conventional rate-aware-based beamforming designs., Comment: IEEE WCNC 2019

In this paper, we propose two beamforming designs for a multiple-input single-output non-orthogonal multiple access system considering the energy efficiency (EE) fairness between users. In particular, two quantitative fairness-based designs are developed to maintain fairness between the users in terms of achieved EE: max-min energy efficiency (MMEE) and proportional fairness (PF) designs. While the MMEE-based design aims to maximize the minimum EE of the users in the system, the PF-based design aims to seek a good balance between the global energy efficiency of the system and the EE fairness between the users. Detailed simulation results indicate that our proposed designs offer many-fold EE improvements over the existing energy-efficient beamforming designs., Comment: IEEE WCNC 2019

When considering the future generation wireless networks, non-orthogonal multiple access (NOMA) represents a viable multiple access technique for improving the spectral efficiency. The basic performance of NOMA is often enhanced using downlink beamforming and power allocation techniques. Although downlink beamforming has been previously studied with different performance criteria, such as sum-rate and max-min rate, it has not been studied in the multiuser, multiple-input single-output (MISO) case, particularly with the energy efficiency criteria. In this paper, we investigate the design of an energy efficient beamforming technique for downlink transmission in the context of a multiuser MISO-NOMA system. In particular, this beamforming design is formulated as a global energy efficiency (GEE) maximization problem with minimum user rate requirements and transmit power constraints. By using the sequential convex approximation (SCA) technique and the Dinkelbach's algorithm to handle the non-convex nature of the GEE-Max problem, we propose two novel algorithms for solving the downlink beamforming problem for the MISO-NOMA system. Our evaluation of the proposed algorithms shows that they offer similar optimal designs and are effective in offering substantial energy efficiencies compared to the designs based on conventional methods., Comment: Accepted at IEEE Transaction on Communication

Limited-backhaul cell-free Massive multiple-input multiple-output (MIMO), in which the fog radio access network (F-RAN) is implemented to exchange the information between access points (APs) and the central processing unit (CPU), is investigated. We introduce a novel approach where the APs estimate the channel and send back the quantized version of the estimated channel and the quantized version of the received signal to the central processing unit. The Max algorithm and the Bussgang theorem are exploited to model the optimum uniform quantization. The ergodic achievable rates are derived. We show that exploiting microwave wireless backhaul links and using a small number of bits to quantize the estimated channel and the received signal, the performance of limited-backhaul cell-free Massive MIMO closely approaches the performance of cell-free Massive MIMO with perfect backhaul links., Comment: Asilomar 2018, 5 pages, 4 figures

This work studies a beamforming design for downlink transmission of a multi-user multiple-input single-output (MISO) system where each legitimate user employs a power splitting (PS) based simultaneous wireless information and power transfer (SWIPT) technique. The transmitter intends to send confidential information to its legitimate users in the presence of purely unknown eavesdroppers. Since the transmitter does not have any knowledge of the eavesdroppers' channel state information (CSI), we consider an artificial noise (AN) approach to establishing secure communication. This beamforming design is developed by maximizing the AN power to interfere with the eavesdropper as much as possible. Based on the assumption of imperfect CSI of legitimate users at the transmitter, two robust design approaches for the joint beamforming and PS ratio have been studied to maximize the AN power under both energy harvesting (EH) and signal-to-interference-plus-noise ratio (SINR) requirements at each legitimate user. In the first robust design, we consider the bounded channel uncertainties, and employ semidefinite relaxation (SDR) and a linear matrix inequality (LMI) representation to transform the original problem into a semidefinite program (SDP). In the second robust design, we consider the statistical channel uncertainties, and show that the proposed problem can be reformulated into another form of SDP through both SDR and Bernstein-type inequality. In addition, the non-linear energy harvesting (EH) model is incorporated in this work as it could reflect the characteristics of practical radio frequency(RF)-EH conversion circuit. Simulation results have been provided to demonstrate the performance of our proposed robust designs.

The available geometry-based stochastic channel models (GSCMs) at millimetre-wave (mmWave) frequencies do not necessarily retain spatial consistency for simulated channels, which is essential for small cells with ultra-dense users. In this paper, we work on cluster parameterization for the COST 2100 channel model using mobile channel simulations at 61 GHz in Helsinki Airport. The paper considers a ray-tracer which has been optimized to match measurements, to obtain double-directional channels at mmWave frequencies. A joint clustering-tracking framework is used to determine cluster parameters for the COST 2100 channel model. The KPowerMeans algorithm and the Kalman filter are exploited to identify the cluster positions and to predict and track cluster positions respectively. The results confirm that the joint clustering-and-tracking is a suitable tool for cluster identification and tracking for our ray-tracer results. The movement of cluster centroids, cluster lifetime and number of clusters per snapshot are investigated for this set of ray-tracer results. Simulation results show that the multipath components (MPCs) are grouped into clusters at mmWave frequencies., Comment: 7 pages, 12 figures, The IEEE GLOBECOM 2018 Workshops: Channel models and measurements for mmWave bands

In this paper, we develop various beamforming techniques for downlink transmission for multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) systems. First, a beamforming approach with perfect channel state information (CSI) is investigated to provide the required quality of service (QoS) for all users. Taylor series approximation and semidefinite relaxation (SDR) techniques are employed to reformulate the original non-convex power minimization problem to a tractable one. Further, a fairness-based beamforming approach is proposed through a max-min formulation to maintain fairness between users. Next, we consider a robust scheme by incorporating channel uncertainties, where the transmit power is minimized while satisfying the outage probability requirement at each user. Through exploiting the SDR approach, the original non-convex problem is reformulated in a linear matrix inequality (LMI) form to obtain the optimal solution. Numerical results demonstrate that the robust scheme can achieve better performance compared to the non-robust scheme in terms of the rate satisfaction ratio. Further, simulation results confirm that NOMA consumes a little over half transmit power needed by OMA for the same data rate requirements. Hence, NOMA has the potential to significantly improve the system performance in terms of transmit power consumption in future 5G networks and beyond., Comment: accepted to publish in IEEE Transactions on Vehicular Technology

Physical layer security (PLS) has been shown to hold promise as a new paradigm for securing wireless links. In contrast with the conventional cryptographic techniques, PLS methods exploit the random fading in wireless channels to provide link security. As the channel dynamics prevent a constant rate of secure communications between the legitimate terminals, the outage probability of the achievable secrecy rate is used as a measure of the secrecy performance. This work investigates the secrecy outage probability of a simultaneous wireless information and power transfer (SWIPT) system, which operates in the presence of multiple eavesdroppers that also have the energy harvesting capability. The loss in secrecy performance due to eavesdropper collusion, i.e., information sharing between the eavesdroppers to decode the secret message, is also analyzed. We derive closed-form expressions for the secrecy outage probability for Nakagami-$m$ fading on the links and imperfect channel estimation at the receivers. Our analysis considers different combinations of the separated and the integrated SWIPT receiver architectures at the receivers. Numerical results are provided to validate our analysis., Comment: 15 pages, 7 figures, journal paper

Cell-free massive multiple-input multiple-output (MIMO) is a potential key technology for fifth generation wireless communication networks. A mixed quality-of-service (QoS) problem is investigated in the uplink of a cell-free massive MIMO system where the minimum rate of non-real time users is maximized with per user power constraints whilst the rate of the real-time users (RTUs) meet their target rates. First an approximated uplink user rate is derived based on available channel statistics. Next, the original mixed QoS problem is formulated in terms of receiver filter coefficients and user power allocations which can iteratively be solved through two sub-problems, namely, receiver filter coefficient design and power allocation, which are dealt with using a generalized eigenvalue problem and geometric programming, respectively. Numerical results show that with the proposed scheme, while the rates of RTUs meet the QoS constraints, the $90\%$-likely throughput improves significantly, compared to a simple benchmark scheme., Comment: 2 figures. arXiv admin note: text overlap with arXiv:1801.10188, arXiv:1801.10190

We consider a cell-free Massive multiple-input multiple-output (MIMO) system and investigate the system performance for the case when the quantized version of the estimated channel and the quantized received signal are available at the central processing unit (CPU), and the case when only the quantized version of the combined signal with maximum ratio combining (MRC) detector is available at the CPU. Next, we study the max-min optimization problem, where the minimum user uplink rate is maximized with backhaul capacity constraints. To deal with the max-min non-convex problem, we propose to decompose the original problem into two sub-problems. Based on these sub-problems, we develop an iterative scheme which solves the original max-min user uplink rate. Moreover, we present a user assignment algorithm to further improve the performance of cell-free Massive MIMO with limited backhaul links., Comment: arXiv admin note: text overlap with arXiv:1801.10188

In this paper, we consider the max-min signal-to-interference plus noise ratio (SINR) problem for the uplink transmission of a cell-free Massive multiple-input multiple-output (MIMO) system. Assuming that the central processing unit (CPU) and the users exploit only the knowledge of the channel statistics, we first derive a closed-form expression for uplink rate. In particular, we enhance (or maximize) user fairness by solving the max-min optimization problem for user rate, by power allocation and choice of receiver coefficients, where the minimum uplink rate of the users is maximized with available transmit power at the particular user. Based on the derived closed-form expression for the uplink rate, we formulate the original user max-min problem to design the optimal receiver coefficients and user power allocations. However, this max-min SINR problem is not jointly convex in terms of design variables and therefore we decompose this original problem into two sub-problems, namely, receiver coefficient design and user power allocation. By iteratively solving these sub-problems, we develop an iterative algorithm to obtain the optimal receiver coefficient and user power allocations. In particular, the receiver coefficients design for a fixed user power allocation is formulated as generalized eigenvalue problem whereas a geometric programming (GP) approach is utilized to solve the power allocation problem for a given set of receiver coefficients. Numerical results confirm a three-fold increase in system rate over existing schemes in the literature.

This paper investigates a secure energy efficiency (SEE) optimization problem in a multiple-input single-output (MISO) underlay cognitive radio (CR) network. In particular, a multi-antenna secondary transmitter (SU-Tx) simultaneously sends secured information and energy to a secondary receiver (SU-Rx) and an energy receiver (ER), respectively, in the presence of a primary receiver (PU-Rx). It is assumed that the SU-Rx, ER and PU-Rx are each equipped with a single antenna. In addition, the SU-Tx should satisfy constraints on maximum interference leakage to the PU-Rx and minimum harvested energy at the ER. In this CR network, we consider the transmit covariance matrix design with the assumption of perfect channel state information (CSI) at the SU-Tx. In addition, it is assumed that the ER is a potential passive eavesdropper due to broadcast nature of wireless transmission. On the other hand, we consider the worst-case scenario that ER's energy harvesting requirement is only satisfied when it performs only energy harvesting without intercepting or eavesdropping information intended for the SU-Rx. We formulate this transmit covariance matrix design as a SEE maximization problem which is a non-convex problem due the non-linear fractional objective function. To realize the solution for this non-convex problem, we utilize the non-linear fractional programming and difference of concave (DC) functions approaches to reformulate into a tractable form. Based on these techniques and the Dinkelbach's method, we propose iterative algorithms to determine the solution for the original SEE maximization problem. Numerical simulation results are provided to demonstrate the performance of the proposed transmit covariance matrix design and convergence of the proposed algorithms.

In this paper, we propose a device to device (D2D) communication scenario underlaying a cellular network where both D2D and cellular users (CUs) are discrete power-rate systems with limited feedback from the receivers. It is assumed that there exists an adversary which wants to eavesdrop on the information transmission from the base station (BS) to CUs. Since D2D communication shares the same spectrum with cellular network, cross interference must be considered. However, when secrecy capacity is considered, the interference caused by D2D communication can help to improve the secrecy communications by confusing the eavesdroppers. Since both systems share the same spectrum, cross interference must be considered. We formulate the proposed resource allocation into an optimization problem whose objective is to maximize the average transmission rate of D2D pair in the presence of the cellular communications under average transmission power constraint. For the cellular network, we require a minimum average achievable secrecy rate in the absence of D2D communication as well as a maximum secrecy outage probability in the presence of D2D communication which should be satisfied. Due to high complexity convex optimization methods, to solve the proposed optimization problem, we apply Particle Swarm Optimization (PSO) which is an evolutionary approach. Moreover, we model and study the error in the feedback channel and the imperfectness of channel distribution information (CDI) using parametric and nonparametric methods. Finally, the impact of different system parameters on the performance of the proposed scheme is investigated through simulations. The performance of the proposed scheme is evaluated using numerical results for different scenarios., Comment: IEEE Transactions on Vehicular Technology, 2017

In this letter, we propose a robust beamforming design for non-orthogonal multiple access (NOMA) based multiple-input single-output (MISO) downlink systems. In particular, the robust power minimization problem is studied with imperfect channel state information (CSI), where the beamformers are designed by incorporating norm-bounded channel uncertainties to provide the required quality of service at each user. This robust scheme is developed based on the worst-case performance optimization framework. In terms of beamforming vectors, the original robust design is not convex and therefore, the robust beamformers cannot be obtained directly. To circumvent this non-convex issue, the original intractable problem is reformulated into a convex problem, where the non-convex constraint is converted into a linear matrix inequality (LMI) by exploiting S-Procedure. Finally, simulation results are provided to demonstrate the effectiveness of the proposed robust design.

This paper investigates the optimal power allocation scheme for sum throughput maximization of non-orthogonal multiple access (NOMA) system with $\alpha$-fairness. In contrast to the existing fairness NOMA models, $\alpha$-fairness can only utilize a single scalar to achieve different user fairness levels. Two different channel state information at the transmitter (CSIT) assumptions are considered, namely, statistical and perfect CSIT. For statistical CSIT, fixed target data rates are predefined, and the power allocation problem is solved for sum throughput maximization with $\alpha$-fairness, through characterizing several properties of the optimal power allocation solution. For perfect CSIT, the optimal power allocation is determined to maximize the instantaneous sum rate with $\alpha$-fairness, where user rates are adapted according to the instantaneous channel state information (CSI). In particular, a simple alternate optimization (AO) algorithm is proposed, which is demonstrated to yield the optimal solution. Numerical results reveal that, at the same fairness level, NOMA significantly outperforms the conventional orthogonal multiple access (MA) for both the scenarios with statistical and perfect CSIT.

The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive multiple-input multiple-output (MIMO) systems has been considered. A geometry-based stochastic channel model (GSCM), called the COST 2100 channel model has been used for realistic analysis of channels. In this paper, we propose a new user selection algorithm based on knowledge of the geometry of the service area and location of clusters, without having full channel state information (CSI) at the base station (BS). The multi-user link correlation in the GSCMs arises from the common clusters in the area. The throughput depends on the position of clusters in the GSCMs and users in the system. Simulation results show that although the BS does not require the channel information of all users, by the proposed geometry-based user scheduling algorithm the sum-rate of the system is only slightly less than the well-known greedy weight clique scheme. Finally, the robustness of the proposed algorithm to the inaccuracy of cluster localization is verified by the simulation results., Comment: 4 figures

Physical layer security has been recently recognized as a promising new design paradigm to provide security in wireless networks. In addition to the existing conventional cryptographic methods, physical layer security exploits the dynamics of fading channels to enhance secured wireless links. In this approach, jamming plays a key role by generating noise signals to confuse the potential eavesdroppers, and significantly improves quality and reliability of secure communications between legitimate terminals. This article presents theoretical limits and practical designs of jamming approaches for physical layer security. In particular, the theoretical limits explore the achievable secrecy rates of user cooperation based jamming whilst the centralized, and game theoretic based precoding techniques are reviewed for practical implementations. In addition, the emerging wireless energy harvesting techniques are exploited to harvest the required energy to transmit jamming signals. Future directions of these approaches, and the associated research challenges are also briefly outlined.

This paper studies the secrecy rate maximization problem of a secure wireless communication system, in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming, with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this non-convexity, the achievable secrecy rate is approximated for a given power allocation at the jammers and the approximated problem is formulated into a geometric programming one. Based on this approximation, an iterative algorithm has been developed to obtain the optimal power allocation at the jammers. Next, we provide a bisection approach, based on one-dimensional search, to validate the optimality of the proposed algorithm. In addition, by assuming Rayleigh fading, the secrecy outage probability (SOP) of the proposed cooperative jamming scheme is analyzed. More specifically, a single-integral form expression for SOP is derived for the most general case as well as a closed-form expression for the special case of two cooperative jammers and one eavesdropper. Simulation results have been provided to validate the convergence and the optimality of the proposed algorithm as well as the theoretical derivations of the presented SOP analysis.

This paper investigates secrecy rate optimization for a multicasting network, in which a transmitter broadcasts the same information to multiple legitimate users in the presence of multiple eavesdroppers. In order to improve the achievable secrecy rates, private jammers are employed to generate interference to confuse the eavesdroppers. These private jammers charge the legitimate transmitter for their jamming services based on the amount of interference received at the eavesdroppers. Therefore, this secrecy rate maximization problem is formulated as a Stackelberg game, in which the private jammers and the transmitter are the leaders and the follower of the game, respectively. A fixed interference price scenario is considered first, in which a closed-form solution is derived for the optimal amount of interference generated by the jammers to maximize the revenue of the legitimate transmitter. Based on this solution, the Stackelberg equilibrium of the proposed game, at which both legitimate transmitter and the private jammers achieve their maximum revenues, is then derived. Simulation results are also provided to validate these theoretical derivations., Comment: SPAWC 2016

This paper considers transmit covariance matrix design for secrecy rate maximization problem in a multiple-input single-output (MISO) multicasting simultaneous wireless information and power transfer (SWIPT) system. In order to enhance the performance of the system, artificial noise (AN) is added to the transmit signal in the design for the following purposes: to reduce the received signal-to-noise ratio (SNR) at the eavesdroppers and increase the harvested energy. We assume that all the channel-state-information (CSI) is perfectly known at the transmitter and all legitimate users are capable of simultaneously receiving information and harvesting energy. In addition, all the eavesdroppers are passive and they can harvest energy only when they are not intercepting or eavesdropping the messages intended for the legitimate users. The original secrecy rate maximization problem is not convex in terms of transmit and artificial covariance matrices as well as the power splitting (PS) ratio. In order to circumvent this non-convexity issue, we exploit the \emph{Charnes-Cooper} Transformation and semidefinite relaxation (SDR) to convert this original problem into a convex one. However, this convex problem does not always yield the rank-one transmit and AN covariance matrices to obtain the solution of the original problem. Therefore, we analyze the optimal conditions and utilize a Gaussian randomization (GR) method to construct the rank-one solutions from the non-rank one results. Simulation results have been provided to demonstrate the performance of the proposed transmit covariance matrices design for MISO multicasting SWIPT system., Comment: SPAWC 2016