JOINT TRANSCEIVER DESIGN FOR SECURE DOWNLINK COMMUNICATIONS

OVER AN AMPLIFY-AND-FORWARD MIMO RELAY

ABSTRACT

Joint transceiver design for secure downlink communications over a multiple-input multiple
output (MIMO) relay system in the presence of multiple legitimate users and malicious
eavesdroppers. Specifically, we jointly optimize the base station (BS) beam forming matrix, the
relay station (RS) amplify-and-forward (AF) transformation matrix and the covariance matrix of
artificial noise (AN), so as to maximize the system worst-case secrecy rate in the presence of the
colluding eavesdroppers under power constraints at the BS and the RS, as well as quality of
service (QoS) constraints for the legitimate users. This problem is very challenging due to the
highly coupled design variables in the objective function and constraints. By adopting a series of
transformation, we first derive an equivalent problem that is more tractable than the original one.
Then we propose and fully develop a novel algorithm based on the penalty concave-convex
procedure (penalty-CCCP) to solve the equivalent problem, where the difficult coupled
constraint is penalized into the objective and the resulting nonconvex problem is solved at each
iteration by resorting to the CCCP method. It is shown that the proposed joint transceiver design
algorithm converges to a stationary solution of the original problem. Finally, our simulation
results reveal that the proposed algorithm achieves better performance than other recently
proposed transceiver designs.
INTRODUCTION

Due to the openness and the broadcast property of wireless communication, the network
security becomes a challenging issue. The physical layer security technique becomes appealing,
because it guarantees the information being only accessed by the legitimate users rather than
eavesdroppers. It makes use of the physical characteristics of wireless channels and is free of
security key, so that the information is transmitted securely in the sense that it cannot be decoded
by eavesdroppers but the legitimate users.
Physical layer security is widely studied from both information theory aspect and signal
processing aspect for wiretap channels, like broadcast wiretap channels and MIMO wiretap
channels. The secure communication is managed through multiple-antenna system or node
cooperation. Researches on node cooperation are well explored. It is suitable for low-complex
networks which cannot afford multiple antennas. Cooperative relay networks with amplify-and-
forward (AF) or decode-and-forward (DF) protocols are mostly investigated. For one-way relay
Networks, the authors in designs the relay beam forming weights to maximize the secrecy rate
and to minimize the relay transmit power; the secrecy outage probability is analyzed for both
half-duplex and full-duplex relay networks in the optimal relay selection schemes are considered,
for both AF and DF protocols; the secure energy efficiency maximization model is proposed in;
the asymptotic secrecy performance for the large-scale MIMO relaying scenario is analyzed in
which concludes that AF protocol is a better choice compared to DF under large transmit powers.
Compared to one-way relay, two-way relay networks are more efficient for communications
between user pairs. In the minimum per-user secrecy rate is maximized and the source power
allocation is analyzed, where the relay bream forming vector lies in the null space of the
equivalent channel of relay link from user nodes to the eavesdropper.
All the aforementioned references suppose that the CSI from users and from relays to
eavesdroppers are perfectly known. In fact, it is very difficult to obtain the perfect CSI of the
eavesdroppers. Assuming that no CSI of eavesdroppers is known, artificial noise is introduced in
the literatures, and enhances security: proposes a cooperative artificial noise transmission based
secrecy strategy, and summarizes the relay beam forming design and power allocation problems
as second order cone programming and linear programming problems, respectively; sends the
artificial noise in the null space of the legitimate channel, and compares the cases that all relays
are working and that only the best relay is used. In no CSI of eavesdroppers and imperfect CSI
between users and jammers are assumed and the secrecy performance is analyzed for the
cooperative jamming (CJ) technique. Networks with imperfect CSI are often considered, too.
The multi-user downlink channel is considered in where the lower bound of the sum secrecy rate
is maximized and semi-definite relaxation and first order Tailor extension techniques are applied.
In considers a multiple-antenna AF relay network with partial CSI and bounded error region, and
maximizes the worst case secrecy rate, where a rank 2 relay beam former is constructed via
singular value decomposition (SVD). The secure communication switches between the DF relay
protocol and the CJ technique in and the authors provide robust designs for the secrecy rate
maximization and secrecy outage probability minimization problems. In both the source and the
relay have multiple antennas, where it jointly designs source and relay beam forming matrices, to
minimize the relay power with quality of service (QoS) constraints.
The worst case Signal-to-Noise-Ratio (SNR) at the eavesdropper is considered, which is
approximated by its upper bound. As listed above, models to design relay beam forming weights
with imperfect CSI are usually formulated as semi-infinite programming optimization problems.
That is, some constraints should be satisfied with infinite choices of parameters. Almost all the
references in the wireless communication literatures deal with such problems by relaxing or
tightening the corresponding constraints, so as to eliminate the semi-infinite parts and to solve
the approximated problem with classical optimization techniques. This makes the optimization
problem much easier. However, the approximation cuts off parts of the feasible region of the
original problem, and consequently loses optimality property or even feasibility. This paper also
builds up a model with imperfect CSI and formulates a semi-infinite programming problem. But
the idea of the propose algorithm is quite different from the usual way, which will be introduced
in detail.
MIMO COMMUNICATIONS
MIMO (multiple input, multiple output) is an antenna technology for wireless
communications in which multiple antennas are used at both the source (transmitter) and the
destination (receiver). The antennas at each end of the communications circuit are combined to
minimize errors and optimize data speed. MIMO is one of several forms of smart antenna
technology, the others being MISO (multiple inputs, single output) and SIMO (single input,
multiple outputs).
 As a result of the use of multiple antennas, MIMO wireless technology is able to
considerably increase the capacity of a given channel. By increasing the number of receive and
transmit antennas it is possible to linearly increase the throughput of the channel with every pair
of antennas added to the system. This makes MIMO wireless technology one of the most
important wireless techniques to be employed in recent years. As spectral bandwidth is becoming
an ever more valuable commodity for radio communications systems, techniques are needed to
use the available bandwidth more effectively. MIMO wireless technology is one of these
techniques.

PROCESS
MIMO is effectively a radio antenna technology as it uses multiple antennas at the
transmitter and receiver to enable a variety of signal paths to carry the data, choosing separate
paths for each antenna to enable multiple signal paths to be used. One of the core ideas behind
MIMO wireless systems space-time signal processing in which time is complemented with the
spatial dimension inherent in the use of multiple spatially distributed antennas, i.e. the use of
multiple antennas located at different points. Accordingly MIMO wireless systems can be
viewed as a logical extension to the smart antennas that have been used for many years to
improve wireless. It is found between a transmitter and a receiver; the signal can take many
paths. Additionally by moving the antennas even a small distance the paths used will change.
The variety of paths available occurs as a result of the number of objects that appear to the side
or even in the direct path between the transmitter and receiver. Previously these multiple paths
only served to introduce interference. By using MIMO, these additional paths can be used to
advantage. They can be used to provide additional robustness to the radio link by improving the
signal to noise ratio, or by increasing the link data capacity
A channel may be affected by fading and this will impact the signal to noise ratio. In turn this
will impact the error rate, assuming digital data is being transmitted. The principle of diversity is
to provide the receiver with multiple versions of the same signal. If these can be made to be
affected in different ways by the signal path, the probability that they will all be affected at the
same time is considerably reduced. Accordingly, diversity helps to stabilize a link and improves
performance, reducing error rate.

Several different diversity modes are available and provide a number of advantages:

 Time diversity: Using time diversity, a message may be transmitted at different times,
e.g. using different timeslots and channel coding.

 Frequency diversity: This form of diversity uses different frequencies. It may be in the
form of using different channels, or technologies such as spread spectrum / OFDM.

 Space diversity: Space diversity used in the broadest sense of the definition is used as
the basis for MIMO. It uses antennas located in different positions to take advantage of
the different radio paths that exist in a typical terrestrial environment.
LITERATUE SURVEY

[1] Secure Transmission with Multiple Antennas I: The MISOME Wiretap Channel,
Ashish Khisti, and Gregory W. Wornell-2010

The role of multiple antennas for secure communication is investigated within the framework of
Wyner’s wiretap channel. We characterize the secrecy capacity in terms of generalized
eigenvalues when the sender and eavesdropper have multiple antennas, the intended receiver has
a single antenna, and the channel matrices are fixed and known to all the terminals, and show
that a beam forming strategy is capacity-achieving. In addition, we study a masked beam
forming scheme that radiates power isotropic ally in all directions and show that it attains near-
optimal performance in the high SNR regime. Insights into the scaling behavior of the capacity
in the large antenna regime as well as extensions to ergodic fading channels are also provided. In
this paper, we investigate practical characterizations for the specific scenario in which the sender
and eavesdropper have multiple antennas, but the intended receiver has a single antenna. We
refer to this configuration as the multi-input, single output, multi-eavesdropper (MISOME) case.
It is worth emphasizing that the multiple eavesdropper antennas can correspond to a physical
multiple-element antenna array at a single eavesdropper, a collection of geographically dispersed
but perfectly colluding single-antenna eavesdroppers, or related variations. We note that the case
where there are multiple non-colluding eavesdroppers has been recently been studied as a
compound wire-tap channel problem

TECHNIQUE

 Masked beam forming scheme

DRAWBACK

 Fewer throughputs
 Difficult to explicitly evaluate
[2] Secure Transmission with Multiple Antennas—Part II: The MIMOME Wiretap
Channel, Ashish Khisti, and Gregory W. Wornell-2010

The capacity of the Gaussian wiretap channel model is analyzed when there are multiple
antennas at the sender, intended receiver and eavesdropper. The associated channel matrices are
fixed and known to all the terminals. A computable characterization of the secrecy capacity is
established as the saddle point solution to a minimax problem. The converse is based on a Sato-
type argument used in other broadcast settings, and the coding theorem is based on Gaussian
wiretap codebooks. At high signal-to-noise ratio (SNR), the secrecy capacity is shown to be
attained by simultaneously diagonalizing the channel matrices via the generalized singular value
decomposition, and independently coding across the resulting parallel channels. The associated
capacity is expressed in terms of the corresponding generalized singular values. It is shown that a
semi-blind “masked” multi-input multi-output (MIMO) transmission strategy that sends
information along directions in which there is gain to the intended receiver, and synthetic noise
along directions in which there is not, can be arbitrarily far from capacity in this regime.
Necessary and sufficient conditions for the secrecy capacity to be zero are provided, which
simplify in the limit of many antennas when the entries of the channel matrices are independent
and identically distributed. The resulting scaling laws establish that to prevent secure
communication, the eavesdropper needs three times as many antennas as the sender and intended
receiver have jointly, and that the optimum division of antennas between sender and intended
receiver is in the ratio of 2:1.

TECHNIQUE

 Multi-input multi-output (MIMO) transmission strategy

DRAWBACK

 Limits the secure transmission

 Difficult process
[3] Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior,
J. Nicholas Laneman, David N. C. Tse, and Gregory W. Wornell-2004

To develop and analyze low-complexity cooperative diversity protocols that combat fading
induced by multipath propagation in wireless networks. The underlying techniques exploit space
diversity available through cooperating terminals’ relaying signals for one another. We outline
several strategies employed by the cooperating radios, including fixed relaying schemes such as
amplify-and-forward and decode-and-forward, selection relaying schemes that adapt based upon
channel measurements between the cooperating terminals, and incremental relaying schemes that
adapt based upon limited feedback from the destination terminal. We develop performance
characterizations in terms of outage events and associated outage probabilities, which measure
robustness of the transmissions to fading, focusing on the high signal-to-noise ratio (SNR)
regime. Except for fixed decode-and-forward, all of our cooperative diversity protocols are
efficient in the sense that they achieve full diversity (i.e., second-order diversity in the case of
two terminals), and, moreover, are close to optimum (within 1.5 dB) in certain regimes. Thus,
using distributed antennas; we can provide the powerful benefits of space diversity without need
for physical arrays, though at a loss of spectral efficiency due to half-duplex operation and
possibly at the cost of additional receive hardware. Applicable to any wireless setting, including
cellular or ad hoc networks wherever space constraints preclude the use of physical arrays—the
performance characterizations reveal that large power or energy savings result from the use of
these protocols.

TECHNIQUE

 Cooperative Diversity Protocols

DRAWBACK

 Problem of creating space diversity

 Large interference occur
[4] Joint Secure Beam forming Design at the Source and the Relay for an Amplify-and-
Forward MIMO Untrusted Relay System, Cheol Jeong, Il-Min Kim, and Dong In Kim-
2012

An amplify-and-forward (AF) multiple-input multiple- output (MIMO) relay network composed

of a source, a relay, and a destination is considered, where transmit beam forming is employed
both at the source and at the relay. The relay is a user who is willing to help the communication
from the source to the destination. In our paper, however, the relay is untrusted in the sense that
it may make a passive security attack; that is, it may decode messages of the source. We consider
two ways to transmit confidential information of the source to the destination: noncooperative
secure beam forming and cooperative secure beam forming. In the noncooperative scheme, the
relay is simply treated as an eavesdropper, and does not participate in communication. In the
cooperative scheme, the relay is asked to relay signals from the source to the destination. In this
paper, the source and relay beam forming is jointly designed to maximize the secrecy rate in the
cooperative scheme. The conditions under which the cooperative scheme achieves a higher
secrecy rate than the noncooperative scheme are derived in the low and high signal-to-noise ratio
(SNR) regimes of the source-relay and relay-destination links. The performance of the secure
beam forming schemes is compared through extensive numerical simulations. An achievable
secrecy rate is defined as a transmission rate at which the confidential message is secretly
transmitted from the source to the destination, while keeping the eavesdropper from getting the
information of the confidential message. The maximum of the achievable secrecy rates is defined
as the secrecy capacity

TECHNIQUE

 Noncooperative secure beam forming

DRAWBACK

 Dynamic process
 High cost process
[5] Secure Beam forming for MIMO Two-Way Communications With an Untrusted Relay,
Jianhua Mo, Meixia Tao, Yuan Liu, and RuiWang-2014

The secure beam forming design in a multiple-antenna three-node system where two source
nodes exchange messages with the help of an untrusted relay node. The relay acts as both an
essential signal forwarder and a potential eavesdropper. Both two-phase and three-phase two-
way relay strategies are considered. Our goal is to jointly optimize the source and relay beam
formers for maximizing the secrecy sum rate of the two-way communications. We first derive
the optimal relay beam former structures. Then, iterative algorithms are proposed to find source
and relay beam formers jointly based on alternating optimization. Furthermore, we conduct
asymptotic analysis on the maximum secrecy sum-rate. Our analysis shows that when all
transmit powers approach infinity, the two-phase two-way relay scheme achieves the maximum
secrecy sum rate if the source beam formers are designed such that the received signals at the
relay align in the same direction. This reveals an important advantage of signal alignment
technique in against eavesdropping. It is also shown that if the source powers approach zero, the
three-phase scheme performs the best while the two-phase scheme is even worse than direct
transmission. Simulation results have verified the efficiency of the proposed secure beam
forming algorithms as well as the analytical findings.

TECHNIQUE

 Iterative algorithms
DRAWBACK

 Non-convex problem
 Difficult process
[6] Physical-Layer Secret Key Generation with Colluding Untrusted Relays, Chan Dai
Truyen Thai, Jemin Lee, Tony Q. S. Quek-2015

A physical-layer secret key generation scheme for multi-antenna legitimate nodes with the help
of multiple untrusted relays, equipped with multiple antennas. The untrusted relays conform to
the relaying transmission protocol of legitimate nodes, but they also eavesdrop the confidential
information of a legitimate transmitter. The key generation scheme is designed with zero forcing
(ZF) and minimum mean square error (MMSE) channel estimators for non-, partially, and fully
colluding modes of untrusted relays. Furthermore, we propose a scheme adaptive to channel
coherence time. Specifically, to achieve a higher secret key rate (SKR) within the channel
coherence time, the number of relay and legitimate nodes’ antennas are optimally determined
and the most suitable antennas are selected for the key generation. Our results show that the
proposed scheme achieves a higher SKR than a prior work, and non- and partially colluding
modes provide a higher SKR than the fully colluding mode through the proposed scheme. We
also verify that exploiting more antennas of untrusted relays does not always enhance the SKR
by showing the existence of the optimal number of antennas of the relays participating in the
scheme. In fact, most prior works of key generation with relaying channels considered only
trusted relays. However, nodes even in the same network may have different levels of security
clearance. For instance, they can have different levels of access to certain information although
they are operating with agreed protocols and serving as relays

TECHNIQUE

 Minimum mean square error (MMSE) channel estimators

DRAWBACK

 Less security process

 Inefficient process
[7] A General Relaying Transmission Protocol for MIMO Secrecy Communications,
Zhiguo Ding, Mugen Peng, and Hsiao-Hwa Chen-2012

A secrecy relaying communication scenario where all nodes are equipped with multiple
antennas. An eavesdropper has the access to the global channel state information (CSI), and all
the other nodes only know the CSI not associated with the eavesdropper. A new secrecy
transmission protocol is proposed, where the concept of interference alignment is combined with
cooperative jamming to ensure that artificial noise from transmitters can be aligned at the
destination, but not at the eavesdropper due to the randomness of wireless channels. Analytical
results, such as ergodic secrecy rate and outage probability, are developed, from which more
insightful understanding of the proposed protocol, such as multiplexing and diversity gains, can
be obtained. A few special cases, where outage probability cannot be decreased to zero
regardless of SNR, are also discussed. Simulation results are provided to demonstrate the
performance of the proposed secrecy transmission protocol. First, the destination is typically
located far away from the source, where Multihop transmission has been shown more preferable
than direct transmission in terms of power consumption and interference management. Second,
in the context of secrecy communications, the use of cooperative relays is particularly beneficial,
where cooperative jamming and relay chatting can be applied to significantly improve the
achievable secrecy rates. Take cooperative jamming as an example. When the source transmits
its message, the destination will broadcast artificial noise to confuse the eavesdropper. When the
relay forwards the mixture of signals and artificial noise to the destination, such noise can be
viewed as self-interference and hence can be easily cancelled off at the destination.

TECHNIQUE

 Secrecy transmission protocol

DRAWBACK

 High power consumption

 Large interference
[8] Cooperative Jamming for Secure Communications in MIMO Relay Networks, Jing
Huang, and A. Lee Swindlehurst-2011

Secure communications can be impeded by eavesdroppers in conventional relay systems. This

paper proposes cooperative jamming strategies for two-hop relay networks where the
eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally
inactive nodes in the relay network can be used as cooperative jamming sources to confuse the
eavesdropper. Linear Precoding schemes are investigated for two scenarios where single or
multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption
that global channel state information (CSI) is available. For the case of single data stream
transmission, we derive closed-form jamming beam formers and the corresponding optimal
power allocation. Generalized singular value decomposition (GSVD)-based secure relaying
schemes are proposed for the transmission of multiple data streams. The optimal power
allocation is found for the GSVD relaying scheme via geometric programming. Based on this
result, a GSVD-based cooperative jamming scheme is proposed that shows significant
improvement in terms of secrecy rate compared to the approach without jamming. Furthermore,
the case involving an eavesdropper with unknown CSI is also investigated in this paper.
Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the
relay network participate in cooperative jamming. Based on these results, we find the optimal
solution for the power allocation by utilizing the method of geometric programming (GP). Then
we expand the scope to study the scenario where all nodes have multiple antennas, and multiple
data streams are transmitted via the relay. Generalized singular value decomposition (GSVD)-
based cooperative jamming scheme is proposed and the corresponding power allocation strategy
is discussed.

TECHNIQUE

 Generalized singular value decomposition (GSVD)-based secure relaying schemes

DRAWBACK

 Degrade the channel condition

 Less maintenance process
[9] Secure Relay Beam forming for Simultaneous Wireless Information and Power
Transfer in Nonregenerative Relay Networks, Quanzhong Li, Qi Zhang, and Jiayin Qin-
2014

For simultaneous wireless information and power transfer (SWIPT), secure communication is an
important issue. In this correspondence, we study the secure relay beam forming (SRB) scheme
for SWIPT in a Nonregenerative Multiantenna relay network. We propose a constrained concave
convex procedure (CCCP)-based iterative algorithm that is able to achieve a local optimum,
where the secrecy rate is maximized, and the relay transmit power and energy harvesting
constraints are satisfied. Simulation results have shown that our proposed CCCP-based iterative
algorithm achieves a larger secrecy rate and lower computational complexity than the
convectional SRB schemes. Since the CCCP-based iterative algorithm is still complex, we
propose a semi definite programming (SDP)-based noniterative suboptimal algorithm and a
closed-form suboptimal algorithm. It is shown that when the maximum transmit power of the
relay to noise power ratio is high, the SDP-based noniterative suboptimal algorithm performs
close to the CCCP-based iterative algorithm. Because of the openness of the wireless
transmission medium, wireless information is susceptible to eavesdropping. Thus, secure
communication is a critical issue for SWIPT. The secure beam forming schemes for SWIPT in a
MISO broadcast channel were studied. However, to the best of our knowledge, there has been no
research on the secure relay beam forming (SRB) scheme for SWIPT in Nonregenerative relay
networks.

TECHNIQUE

 Concave convex procedure (CCCP)-based iterative algorithm

DRAWBACK

 Less secure process

 SRP Problem
[10] Joint Beam forming and Power Allocation for Secrecy in Peer-to-Peer Relay
Networks, Chao Wang, Hui-Ming Wang, Derrick Wing Kwan Ng, Xiang-Gen Xia-2015

The physical-layer security of a multiuser peer-to-peer (MUP2P) relay network for amplify and-
forward (AF) protocol, where a secure user and other unclassified users coexist with a multi-
antenna eavesdropper and the eavesdropper can wiretap the confidential information in both two
cooperative phases. Our goal is to optimize the transmit power of the source and the beam
forming weights of the relays jointly for secrecy rate maximization subject to the minimum
signal-to-interference-noise-ratio (SINR) constraint at each user, and the individual and total
power constraints. Mathematically, the optimization problem is non-linear and non-convex,
which does not facilitate an efficient resource allocation algorithm design. As an alternative, a
null space beam forming scheme is adopted at the relays for simplifying the joint optimization
and eliminating the confidential information leakage in the second cooperative phase, where the
relay beam forming vector lies in the null space of the equivalent channel of the relay to
eavesdropper links. Although the null space beam forming scheme simplifies the design of
resource allocation algorithm, the considered problem is still non-convex and obtaining the
global optimum is very difficult, if not impossible. Employing a sequential parametric convex
approximation (SPCA) method, we propose an iterative algorithm to obtain an efficient solution
of the non-convex problem. Besides, the proposed joint design algorithm requires a feasible
starting point, we also propose a low complexity feasible initial points searching algorithm.
Simulations demonstrate the validity of the proposed strategy.

TECHNIQUE

 Multiuser peer-to-peer (MUP2P) relay network

DRAWBACK

 Less security
 High computational complexity
EXISTING SYSTEM

PHYSICAL LAYER SECURITY

A complement to traditional encryption, physical layer security (PLS) aims to exploit

wireless channel characteristics through signal processing techniques in order to improve the
security of wireless transmission. It has become a very active research area lately and is called
upon to play a key role in future 5G networks

MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO) RELAYS

Multiple-input multiple-output (MIMO) relays in multiuser multi-antenna cellular

systems can further increase the link quality, reliability, and data rate. Among the different
available relaying strategies, the amplify-and-forward (AF) scheme is often considered to be the
most practical approach due to its low-complexity of operation at the relay station (RS).
However, with the introduction of one or more relay nodes in the transmission, the
confidentiality of the transmitted information may be more easily compromised. To address this
issue, a number of schemes have been proposed for MIMO relay systems that offer improved
security against eavesdropper. In particular, as in secrecy beam forming and precoding schemes
can be divided into two categories, depending on whether the relay is trusted or untrusted.

EAVESDROPPER IN MIMO SUBNETWORK

A cooperative jamming (CJ) scheme for secure communications with MIMO relays.
Besides, secure relay beam forming for simultaneous wireless information and power transfer
has been investigated. The above works in consider one eavesdropper in the MIMO relay sub-
network. When there are multiple eavesdroppers, the studies in have developed null-space beam
forming and jamming techniques to maximize the secrecy capacity of each user. In addition, the
investigations have proposed robust beam forming algorithms to improve the secrecy
performance in the presence of imperfect eavesdroppers’ channel state information (CSI).
However, there is only limited work on the joint optimization of the base station (BS) beam
forming matrix and the RS transformation matrix for secrecy sum-rate maximization in secure
multiuser MIMO relay systems, which could potentially further improve the performance metrics
for secure communications
PENALTY-CCCP ALGORITHM

The optimized variables are highly coupled in both the objective function and constraints;
it is difficult to globally solve the resulting optimization problem. By applying a series of
suitable transformations, we first recast this problem into an equivalent but more tractable form.
Then, for the resultant problem we propose a new algorithm based on the penalty concave-
convex procedure (penalty-CCCP) to handle the highly coupled terms and jointly optimize the
transceiver parameters. With the aid of the penalty-CCCP algorithm, the problematic coupled
constraints are incorporated into the objective function as a penalty component. The penalized
objective is then optimized via the proposed two-tier iterative algorithm. In the inner loop, we
resort to the CCCP method to update the optimization variables; while in the outer loop, we
adjust the penalty parameter of the penalized cost function

DISADVANTAGES

 It needs to High level security

 Limited work in joint level optimization
 PLS Problem
PROPOSED SYSTEM

A new optimization problem, aiming to maximize the system worst-case secrecy rate
with respect to the BS beam forming matrix, the RS AF transformation matrix and the AN
covariance matrix, subject to transmit power and legitimate users’ QoS constraints.

The eavesdroppers’ CSI errors are also considered in this problem formulation via the
NBE model.

This algorithm ensures convergence to a stationary solution of the optimization problem,

thereby leading to a robust joint transceiver design for the MIMO relay system in the presence of
colluding eavesdroppers.

A detailed computational complexity analysis of the newly proposed algorithm along

with exhaustive simulation results that demonstrate its advantages over other recently proposed
transceiver designs
PROPOSED ALGORITTHM

 Pattern matching algorithm

ADVANTAGES

 High level security process

 Better performance
 Reduce the optimization problem
BLOCK DIAGRAM

Input data MIMO Relay Beam forming

system matrix process

Relay selection Amplify and Iteration

matrix forward matrix process

Maximize the Multilevel

Improve the pattern matching
system secrecy rate
performance algorithm
and energy
efficiency

Output data
WIRELESS RELAY NETWORK

A simple MIMO wireless relay network can consist of a single multi-antenna source
destination pair and one multi-antenna relay, called a general (or nondistributed) MIMO wireless
relay network. The relays are allowed to have different complexity than sources and destinations.
For example, the number of relay antennas can be different from the number of source and
destination antennas. Since the MIMO wireless relay system can simultaneously transmit
multiple independent data over the same physical channel, spatial multiplexing can be
accomplished. Unlike the MIMO wireless relay network with a multi-antenna source-destination
pair and a multi-antenna relay, data transmission between multiple source-destination pairs with
only a single antenna through multiple relays with only a single antenna per relay is defined as a
distributed MIMO wireless relay network.

COOPERATIVE WIRELESS RELAY NETWORK

The definition of a cooperative MIMO wireless relay network can largely be categorized
in two ways. The general MIMO wireless relay network is cooperative if the channel state
information (CSI) is available at the relays while the distributed MIMO wirelesses relay network
is either cooperative or noncooperative, depending on either the role of relays or the relative
distances among relays. A fundamental way of cooperation in distributed MIMO wireless
networks is that one or more nodes act as relays to increase the coverage range of the transmitter
by increasing the receiver signal-to-noise ratio (SNR). Hence, for a cooperative distributed
MIMO wireless relay network, it is assumed that arbitrarily distributed relays are in close
proximity to high SNR links so that received signals from sources and channel coefficients can
be exchanged among them with negligible errors. Hence, it is also assumed that they have
perfect CSI of the forward channels through feedback from destinations. A similar approach for
cooperation of the base station (BS) in MIMO wireless networks has been studied whereby
signals are transferred among BSs. In this dissertation, a wireless relay network is called a
cooperative MIMO relay network if all global channel coefficients are available at a central node

NONCOOPERATIVE WIRELESS RELAY NETWORK

The distributed MIMO wireless relay network is a more practical wireless relay system
because all communication nodes, such as sources, relays, and destinations, can be arbitrarily
distributed with long-range links among them. However, if relays in the MIMO wireless relay
network are distributed with long-range links, then it is not easy for them to cooperate with each
3 other for the sake of sharing channel coefficients. Hence, it can be assumed that relays cannot
cooperate with each other during data transmission. This distributed MIMO wireless relay
network is well suited for relay noncooperation. And the wireless relay network is called a
noncooperative MIMO relay network when only the local channel coefficients connected to a
relay node are available at the relay node.

BEAMFORMING

Beam forming or spatial filtering is a signal processing technique used in sensor

arrays for directional signal transmission or reception. This is achieved by combining elements in
an antenna array in such a way that signals at particular angles experience
constructive interference while others experience destructive interference. Beam forming can be
used at both the transmitting and receiving ends in order to achieve spatial selectivity. The
improvement compared with omnidirectional reception/transmission is known as
the directivity of the array. Beam forming can be used for radio or sound waves. It has found
numerous applications in radar, sonar, seismology, wireless communications, radio astronomy,
acoustics and biomedicine. Adaptive beam forming is used to detect and estimate the signal-of-
interest at the output of a sensor array by means of optimal spatial filtering and interference
rejection.

Beam forming is a kind of radio frequency (RF) management in which an access point
makes use of various antennas to transmit the exact same signal. Beam forming is considered a
subset of smart antennas or Advanced Antenna Systems (AAS).

By broadcasting various signals and examining client feedback, the wireless LAN
infrastructure could very well modify the signals it transmits. This way, it can identify the ideal
path the signal must follow to get to a client device. Beam forming efficiently enhances the
uplink and downlink SNR performances as well as the overall network capacity.

Beam forming entails an advanced algorithm that keeps track of several parameters, such
as terminal location, speed, distance, the level of QoS required, signal/noise level and traffic
type. This gives beam forming a greater advantage when it comes to signal improvement.
Beam forming functions by shaping the beam in the direction of the receiver. A number of
antennas broadcast exactly the same signal; however, each one is specifically distorted in the
phase. An algorithm applies a signature to every transmission. The various transmitted shapes
merge in the air by normal coherence of the electromagnetic waves, thereby forming a virtual
"beam", which is a signal that is targeted toward the destination. If the beam travels to undesired
locations (locations other than the destined receiver), the phases will collide and be destroyed.

BEAM FORMING IN SINGLE USER COMMUNICATIONS

In this section, various works are presented that study MIMO BF techniques in cases
where a single user is present in the network. Following, and for each scenario, an analytical
description is performed evaluating the BF scheme.

BEAM FORMING WITH SINGLE RELAY

A network where a single relay is used to establish communication between a source and
one user is depicted. Under the single-relay consideration and when capacity and power
optimization arises, the authors in provide the three basic modes for the three-terminal MIMO
relay network, namely, the direct link (mode A), the relay without direct link (mode B), and the
relay with direct link (mode C). A weighting matrix at the relay is designed in such a way as to
minimize capacity loss. This is achieved by transforming the MIMO relay channel in parallel
SISO relay sub channels and then, through water filling, power allocation is performed.

Fig Beam forming with single relay

 The Grassmannian codebooks are proved appropriate for the design of the source and
relay BF based on the distributions of the optimal source and relay BF vectors. The authors aim
at SNR maximization through BF at the source and the relay. The explored scenarios include an
SRD topology with and without the presence of the SD link. Moreover, when perfect CSI is
available at the source and the relay, a mapping of the source and relay signals to the dominant
right singular vectors of the SR and RD channel should be performed. On the other hand, when
limited feedback is available, Grassmannian BF codebooks at the source and the relay should be
adopted which quantize the optimal BF vectors. In order to reduce the complexity, a modified
quantized scheme can be employed for the case where SD connectivity is feasible. Through this
scheme, only one singular vector needs to be quantized resulting in significant reduction of
feedback from the destination to the relay.

The optimization (minimization) of the MSE in a single-user single-relay scenario is

considered in where the authors consider the optimal BF in three stages. First, the MIMO relay
performs receive BF by using the Hermitian transpose of the left singular matrix of the SR
channel. Then, linear Precoding takes place at the relay and, finally, transmit BF is performed
through the use of the right singular matrix of the RD channel. The work in extends the previous
one by performing joint source-relay Precoding design. As the derivation of the optimal relay
amplification and source Precoding matrices in closed form is intractable, an iterative algorithm
is provided. The algorithm optimizes for a given under a relay power constraint. Also, is
optimized for a fixed under power constraints at the source and the relay. Following the
Precoding technique, the authors propose a non-linear Precoding scheme, which adopts a
Tomlinson-Harashima Precoder (THP) at the source, while the relay uses a linear Precoder.
Moreover, a direct SD link exists and the destination uses an MMSE receiver.

The proposed scheme performs a joint source-relay Precoder design and to make the
solution tractable it decomposes the problem into one sub problem and a master problem, which
provide the precoders of the source and the relay correspondingly. Comparison with the schemes
of shows improved MSE performance from the proposed Precoding method. Finally, the work in
studies the degrading effect of self-interference and provides Precoding designs to mitigate it.
More specifically, transmit and receive beams at the relay are formed in such a way to minimize
the self-interference signal experienced at the receive antennas of the relay. This is achieved by
pointing these beams to the minimum eigenmodes of the channel between transmit and receive
relay antennas. Also, the authors provide the condition, which corresponds to the null-space
projection scheme of the optimal eigen-BF, thus providing orthogonal subspaces to relay
reception and transmission. The main contribution of this work is the formulation of Precoding
designs that allow the minimization of the degrading effects of self-interference.

BEAMFORMING WITH MULTIPLE RELAYS

The scenario where multiple relays are allocated for the communication between a source
and one user. Moving forward and considering single-user BF for multiple-relay nodes, in the
authors compare signaling and routing techniques for various relaying protocols, namely,
amplify-and-forward (AF), decode-and-forward (DF), and hybrid relaying, where the relay
decodes only the necessary information to obtain CSI for the SR or RD channels. Several MIMO
spatial multiplexing (SM) techniques are presented, which take advantage of CSI knowledge at
the relay by coordinating the SR and RD channels eigenmodes. The authors compare SM to
single signal BF (SSB), which exploits the spatial diversity of MIMO channels. If CSI is
available at the transmitter, then SSB can be performed. In continuity, two cases of SSB are
given for both DF and hybrid relaying. It is shown that, in the low SNR regime, SSB is
preferable compared to spatial multiplexing due to its increased diversity. The main contribution
of this article is the consideration of three types of relaying and the comparison of SM and SSB
for various SNR regimes.

Figure 3: Multiple-relay communication.

 When a MIMO equalizer is introduced for implementing the BF matrix at the receiver,
the authors in study the SNR and MMSE designs under a global power constraint at the relays
and at the receiver, in a network with MIMO source, multiple MIMO relays, and MIMO
destination. For the MMSE approach, they provide two alternatives to formulate the relay matrix
and the MIMO equalizer at the receiver. Firstly, they perform a two-step design where is priorly
formed and then is derived. Secondly, they proceed in a joint formulation of and. On the other
hand, for the SNR approach, they include two optimization cases, with a zero-forcing constraint
and with the global power constraint. Furthermore, they form the BF matrices aiming to
maximize the transmission rate. The simulations show that both approaches achieve similar BER
performance when there is no power constraint at the relays. By targeting SNR maximization at
the destination under different power constraints, the authors in study a network where a MIMO
source communicates with a single-antenna destination through multiple MIMO AF relays.
Three different power constraints are derived for the optimal BF-AF weights and for a given BF
vector at the source. Firstly, for the individual and joint relay power constraints, closed-form
solutions are given. Secondly, for the joint source-relay power constraint, a numerical method is
presented which offers optimal power allocation for the source and the relays. In order to
decrease implementation complexity, suboptimal methods for the joint relay and joint source-
relay power constraints are presented.

These methods are based on the transformation of the optimization problem into a
nonconvex polynomial programming problem. Numerical results illustrate that the performance
of the suboptimal methods follows closely that of the optimal one. By targeting minimization of
the MSE or equivalently the maximization of the SINR under a sum power constraint, the study
in considers BF that is coupled with single-carrier frequency domain equalization in a three-node
network. From the proposed algorithm, the optimal frequency-domain linear equalization (LE)
and decision-feedback equalization (DFE) to the receivers is derived. The optimal relay BF
matrices are formed under a sum power constraint. Moreover, complexity issues are considered
by providing suboptimal power allocation algorithms without significant performance
degradation.
RELAY SELECTION

In order to reduce synchronization requirements among the multiple transmitting relays,

relay selection has been proposed. In addition, the selection of one relay or a subset of the
available relays improves the spectral efficiency of the transmission as the amount of orthogonal
channels is less than the number of the relays in the network for the same diversity gain. In the
authors illustrate the efficiency of relay selection through comparisons with BF schemes based
on limited and unlimited CSI. They develop the outage probability of the optimal AF BF with
unlimited feedback noting that due to its impractical assumptions it serves only as a performance
bound to other more practical schemes. Moreover, the selection scheme is proven to be the
unique optimal for AF BF as it minimizes noise amplification. Also, numerical comparisons are
given for the cases of optimal codebook design and random BF with limited feedback. The
compared schemes include relay selection, optimal BF, and BF with various amounts of
feedback. It is concluded that the selection scheme outperforms the other BF schemes in limited
feedback scenarios while alleviating synchronization concerns.

Fig Communication with relay selection

Partial relay selection (PRS) is employed in where suboptimal relay selection is

presented, as the only CSI considered in the selection algorithm is the quality of the SR links.
Furthermore, transmit and receive BF is implemented at the source and the destination, while for
the selected AF MIMO relay the linear Precoder is optimized. Additionally, the outage
probability of the proposed scheme is given in closed form and for the asymptotically high SNR
the diversity gain is extracted. As a result, PRS and OR achieve the same diversity gain.

Another technique is the opportunistic selection of a semi orthogonal subset of relays.

The proposed scheme takes place in two steps. First, spatial eigen-mode combining between the
forward and backward channels is performed. Then, for the selected subset, the algorithm
proceeds in antenna pair selection for reception in the first hop and transmission in the second
hop.

The best relay selection is studied in where a single-user network is examined with the
consideration of multiple MIMO relays. The proposed scheme selects the best relay that
successively combines maximal ratio receiver combining in the first hop and BF in the second.
In order for this process to take place, the authors consider that in two sequential time slots the
channel coefficients remain constant. Simulations include comparisons with various relay
numbers and antenna numbers on each relay, illustrating the reduction of the outage probability
as these values increase. Along with the best relay selection, there are other selection techniques
that incorporate, for example, max-rate selection with interference mitigation issues. The work in
considers a multihop backbone network where MIMO relays are employed. In each phase, a
relay is selected based on maximum rate path routing and performs transmit BF. Additionally,
mitigation of the multiple access interference that degrades the performance of the network is
achieved through cancellation. The effects of interference mitigation transmit BF and spatial
reuse on the performance of the proposed scheme is studied in a game theoretic approach, aiming
at the optimal combination of these techniques.

Finally, the multi-relay network of selects in each time slots two relays in order to
achieve full-duplex operation through successive relaying. To this end, buffer-aided relay
selection is combined with beam forming and two schemes are proposed. The first scheme is
inspired by the case of no IRI between the relays and adopts MRC at the receiving relay and
MRT BF at the transmitting relay. As IRI is considered, this scheme utilizes an SINR criterion
for the SR link and the relay-pair that maximizes the instantaneous end-to-end rate is chosen.
The second scheme is based on ZF-BF to cancel the IRI at the receiving relay and to maximize
the effective channel power gain of the RD link. Results illustrate that the SINR-based approach
improves the rate performance of the network in the low SNR region while the ZF scheme has
the best performance and approaches the upper bound of the IRI-free case.

BEAM FORMING IN MULTI USER COMMUNICATION

An alternative approach for transmitting the signal through the relays is to serve multiple
users simultaneously. A relay broadcast channel (RBC) can be considered, which is a typical
case for the so-called nondedicated relay system. A nondedicated relay system is when the
mobile users can help each other by relaying information for their peers besides receiving their
own data. An RBC is based on a broadcast channel (BC) where a BS transmits to multiple users
simultaneously. Relay mechanism is presented into the BC in such a way that the users can
benefit from each other by performing cooperative procedures. In addition, another case
considered is that of two-way relaying as a multiuser scenario, where the two sources
exchanging information could be single or multiple pairs of users that communicate and not
necessarily a BS and a user.

There are several ways of exploiting this operation by employing MIMO techniques, as
depicted. Several scenarios can exist, such as multiuser communication through a single relay,
multiuser communication through multiple relays, two-way single pair communication, and two-
way multi-pair communication.

Fig Multi user communication through single relay

 Fig Multi user communication through multiple relay

PHYSICAL LAYER SECURITY

The fundamental concept of physical layer security is to use the physical layer
characteristics to provide secure communication by preventing the eavesdroppers intercepting
the information. This idea was first introduced by Wyner in the mid 70’s, where he introduced
the wire-tap channel, and showed that legitimate users exchanged perfectly secure information at
a non-zero rate in the presence of an eavesdropper. The maximum achievable perfectly secure
message rate was referred to as secrecy capacity. In general, the user channel condition should be
better than user-eavesdropper channel to have non-zero secrecy rate. Some recent research
studies were carried out to enable this by proposing multiple antennas or generating artificial
noise at the users, so that the received signal at the eavesdropper was not decodable. Cooperative
relays to assist legitimate users were also proposed to improve the secrecy rates. The authors in
considered various cooperative relay networks in unsecure environments. In AF relaying was
used. Many other relaying protocols were considered in where different scenarios were
investigated to maximize the achievable secrecy rate subject to a transmit power constraint, and
minimize the total transmit power subject to a secrecy rate constraint. Moreover, the authors in
studied bi-directional communication options with eavesdroppers and proposed a secrecy
transmission protocol.

The optimization techniques were also used to further enhance physical layer security.
The authors in considered multiple users communicating with a common receiver in the presence
of an eavesdropper. They provided an optimal transmit power allocation policy to maximize the
secrecy sum-rate. Quality of- service (QoS) oriented optimal secure beam forming schemes were
considered in for one-way transmission. Many studies were based on the knowledge of the
eavesdropper’s information at the transmitter side. In particular, the CSI of an eavesdropper’s
channel should be available at the legitimate users to provide secrecy of the transmission. Since
the legitimate users do not receive any feedback from eavesdropping nodes, in many situations
the CSI available at the legitimate users is imperfect.

RELAY NODE (RN)

The Relay Node (RN) and sometimes called Relay Station (RS) is a fixed small cell
usually deployed in dead and crowded regions. These areas might not necessarily be on the cell
edge but in highly shadow-faded areas like behind large obstacles or inside or behind buildings.
RN can also be deployed to enhance the existing capacity of certain areas, such as a busy street
in a city center or an indoor office. RNs are connected to the power supply unit, thus allowing
them to have high access to processing capabilities and possibly higher transmission powers than
regular UE, which can ease the process in finding the capacity enhancement in relaying.

Fig Relay node

WIRELESS RELAY STRATEGIES

The relays in wireless networks are generally categorized as either half-duplex (HD) or
full-duplex (FD), according to their roles. For a HD wireless relay system, one data transmission
cycle is divided into time slots. In the first time slot, HD relays receive signals from sources, and
in the second time slot, relays retransmit a processed version of those signals received from
sources. For an FD wireless relay system, FD relays transmit and receive simultaneously using
different frequency channels, which is called frequency division duplexing, whereas HD relays
cannot do this. The literature shows that relay strategies have their own variants but can be
classified into three categories: (1) amplify-and-forward (AF) (2) decode-and forward (DF) and
(3) compress-and-forward

Decode-and-Forward (DF)

In this relaying scheme, the relay decodes the source message in one block and transmits
the re-encoded message in the following block.

DF relay channels in a Rayleigh fading environment for the upper bounds and lower
bounds on the outage capacity. The scheme showed the comparison between the direct
transmission and traditional multihop protocols for a variety of wireless relay channel models.
The results showed that optimal relay channel signaling can significantly outperform multihop
protocols, and power allocation can yield a significant gain in wireless relay channels. Although
the study addressed important issues for the optimum DF relay channel, the work is a theoretical
study for DF relay channel performance apart from the interference and resources allocation if
used with cellular networks

Fig Decode and forward

Compress-and-Forward (CF)

In this relaying scheme, the relay quantizes the received signal in one block and transmits
the encoded version of the quantized received signal in the following block.
 Compress-and-forward relays do not decode received signals from the sources. They use
their observations in a different way. The received signals are compressed and then forwarded to
the destinations. Destinations can recover all transmitted data if sufficiently large number of
linear equations is received. Compress-and-forward relays are most efficient in cases where the
source-relay and source-destination channels are of comparable quality, and the relay destination
link is good. In this situation, the relay may not be able to decode the source signal but
nevertheless has an independent signal observation that can be used to assist with decoding at the
destination. Kramer et al investigated compress-and-forward wireless relay strategies by
applying an FD system. They developed capacity theorems and provided ARs and rate regions
for a number of wireless channel models. Nazer and Gastpar also proposed a compress-and
forward relay network that exploits interference in order to obtain significantly higher rates
between users in a network.

Amplify-and-Forward (AF)

In this relaying scheme, the relay sends an amplified version of the received signal in the
last time-slot. Comparing with DF and CF, AF requires much less delay as the relay node
operates time-slot by time-slot. Also, AF requires much less computing power as no decoding or
quantizing operation is performed at the relay side but it also amplifies noise which the serious
problem at the receiving side.

DF relay decodes the received signal before forwarding. So it can completely eliminate
the noise and improve the transmission rate.

Fig Single-user relay channel model

 The basic function of the AF relay is the amplification of the received signal from the
source and a retransmission of the same signal to the destination without processing. The AF
relay not only amplifies the desired signal but also amplifies interference and noise which
deteriorates the overall SINR level as well as limits the system throughput. The AF relay
introduces low delay due to filtering, processing, and feeder links used in its application which
deteriorate the signal coming to the user terminal. However, there are weak points with this type
such as an increase in the noise and interference level in the system and an accumulation of
erroneous data over multiple links

Fig. 2.6 Amplify and foreword relay

COOPERATIVE RELAY

Cooperative relay communications has attracted much attention, due to its capabilities to
establishing reliable links and increasing capacity. Therefore, several recent works have
considered physical layer security in cooperative communications. In cooperative decode-and-
forward (DF) relays were deployed to perform distributed beam forming, and the secrecy
diversity-multiplexing tradeoff was analyzed. In several opportunistic relay selection schemes
were proposed to achieve secrecy. In based on the DF, amplify-and-forward (AF) and
cooperative jamming (CJ) relay protocols, relay cooperation was investigated to increase the
secrecy rate. In optimal CJ using multiple relays for security enhancement was studied and the
condition for positive secrecy rate was derived. In CJ and relay chatting schemes for secrecy
were proposed in opportunistic relay systems, which showed that the proposed relay chatting
scheme can perform better than CJ. Joint relay and jammer selection for security enhancement
was examined in one-way DF relay networks and two-way AF relay networks
PERFORMANCE METRICS

CAPACITY OR ACHIEVABLE RATE

Channel capacity is defined as the highest achievable rate that can be reliably decoded at
the receiver over the channel. According to Shannon’s Coding Theorem if the information’s
transmission rate, denoted as R, is equal to or lower than the channel capacity C, then there exists
scheme that can decode without any error the information. Conversely, if the information’s
transmission rate, R, is higher than the channel capacity C, the probability of decoding the
information in error is close to 1.

For additive white Gaussian noise (AWGN) channels, channel capacity can be expressed as

where P is the transmission power of the signal from the sender, σ 2 is the noise power
and the channel fading coefficient h is considered fixed during the entire Gaussian noise process

SNR

The received SNR, denoted as γ, is a useful metric that quantified the quality of the
received signal. In (2.1), the SNR is simply given as

Sometimes, it is measured in decibels, or dB. That is,

More precisely, γ is regarded as the instantaneous SNR which depends on the channel
realization h and varies if the channel changes. Therefore, it is also useful to define the average
SNR, γ¯, which is averaged over the fading channels, i.e.,
SIGNAL-TO-INTERFERENCE PLUS NOISE RATIO (SINR)

In wireless communication systems, co-channel interferences generally exist. For

example, in a wireless ad-hop network, a node can receive signals simultaneously from its
neighbors. Therefore, besides the desired signal, there are interference signals as well. Consider
the received signal at a node as

in which x1 is the desired signal, x2 is the interference signal and η is the noise. Then the
SINR, denoted as β, can be defined as

Where P1 is the transmission power of the desired signal, P2 is the transmission power of
the interference signal, and σ 2 is the noise power at the receiver side. Similar to SNR, SINR can
be averaged over the channel fading coefficients, h and g, to provide more meaningful reference
in practical systems.

OUTAGE PROBABILITY

Maintaining a high level of quality-of-service (QoS) is always the aim of wireless

network. One useful metric, which is increasingly popular due to its accurate reflection to user
experience, is outage probability. Within this, various outage events can be defined appropriately
and popular examples include rate outage, SNR outage and so on. As an example, let us consider
the outage rate probability. All other outage probability of other metrics can be defined similarly

Given a threshold value for the transmission rate, r0, the outage probability can be found by

Outage Probability = Prob (Achievable Rate < r0).

MEAN-SQUARE-ERROR OR MSE

MSE is another important metric which directly gives a measure for the accuracy of
estimation. For instance, if we denote s1 as the message sending out by the source node, and sˆ1
is the estimated message derived from the destination node. Then the MSE is obtained as

Where E [·] returns the expectation of an input random entity. Minimizing the MSE,
widely known as MMSE, is one of the most sought criteria for designing communications
systems

ITERATION PROCEDURE

An iterative method is a mathematical procedure that generates a sequence of improving

approximate solutions for a class of problems, in which the n-th approximation is derived from
the previous ones. A specific implementation of an iterative method, including
the termination criteria, is an algorithm of the iterative method. An iterative method is
called convergent if the corresponding sequence converges for given initial approximations. A
mathematically rigorous convergence analysis of an iterative method is usually performed;
however, heuristic-based iterative methods are also common. In the problems of finding the
root of an equation (or a solution of a system of equations), an iterative method uses an initial
guess to generate successive approximations to a solution.

In contrast, direct methods attempt to solve the problem by a finite sequence of

operations. In the absence of rounding errors, direct methods would deliver an exact solution
(like solving a linear system of equations {\display style A\mathbf {x} =\mathbf {b} } A\mathbf
{x} =\mathbf {b} by Gaussian elimination). Iterative methods are often the only choice for
nonlinear equations. However, iterative methods are often useful even for linear problems
involving a large number of variables (sometimes of the order of millions), where direct methods
would be prohibitively expensive (and in some cases impossible) even with the best available
computing power.

MULTI LEVEL PATTERN MATCHING ALGORITHM (MLPMA)

The multilevel pattern matching algorithm has many applications. It is used in data
filtering to find selected patterns, for example, from a stream of news feed is an application for
this process. In this application MIMO process is in high level data applications. To detect
certain deduplication from the application like suspicious keywords, several form such as dates
and also to carry Boolean queries by search for all terms. At the same time and then intersect the
results and it is used in online social network searching by translate an approximate search to a
search for a large number of exact patterns.

MULTI LEVEL PATTERN MATCHING

In the Multilevel pattern matching is proposed in this implementation. The
implementation of multilevel pattern is providing the appropriate matching files. The multiple
pattern algorithms can be used in many applications that require such type of search and
matching. Multilevel pattern matching to avoid repeated data’s. The repeated distance metric this
does require tuning through total clustered training data. The training data similar record can be
match by using duplicate distance metric and a multilevel appropriate matching threshold. Here
each record is considered as original or duplicate files calculated on multilevel pattern matching
process. The duplicate data are measured, using the number of replication for each field, and then
the weighted distance between the records calculated on process.
 In the above section discuss the category based clustering. The concept of category based
clustering is categorized the files based on clustering. The User can input/queries for search the
files from the base station, for the user there is multiple files can be displayed. In that a file
there’s is repeated files can be occurred. So in order to identify the repeated file from the
multiple files a new algorithm to search for multiple patterns simultaneously is proposed from
that the duplication files can be identified.
The following process to eliminate the duplicate files
 The User input queries compare with the original files
 Checking the repeated files whether the repeated data occurred or not
 If the repeated is occurred means removed that data from the server.
One real time process denotes, takes the Health care (Hospital).In that the patient Id can
be differ but the name of the patient repeated. Some user can search based on patient id some
may search based on name of the patient. While search process can be done in the way of patient
name duplicates data can be identified. In many Locations searching can be done based on the
common attributes from that identified the duplicated data. Each and Every real application user
considered the common attributes may be differ sometimes it may not differ, from this identified
the duplicate data. So in order to identified the duplicate data in an effective way implement the
Multi Level Pattern Matching Algorithm
In MLPM algorithm used for generation of fixed pattern for duplicate matching of valid
class, the stored pattern of MLPM provide the feature selection process and found the feature
dissimilar in record data process recall stored pattern in classification. The process of MLPM
proceeds with pattern matching technique in follower of category cluster and inline-pre-
processing. In the process of MLPM the number of duplicate pattern point selection executed by
pattern matching process. The process of MLPM algorithm with duplicate file elimination
describe here.
Here show a multilevel pattern matching deduplication strategy to improve the
performance of server. To identify the suitable file to deduplication data and to decide the
respective number of deduplication, we calculate reputation level and replica factor. We use the
multilevel pattern matching system to identify the deduplication data and we remove the
duplicate files use the bloom filter.
Multilevel Pattern Matching Algorithm:

1: t GET-TIME ()
2: APROC-HIST (H) //(Digitalize inline pre-processing)
3: for tier Client Tier -1 down to RootTier+1 do
4: A AGGREGATE (A) //Check deduplication process
5: for all record r Є A do
6: if r, num of files≥ thresholds [tier] then //
7: if EXIST-IN (r.fileID, r.nodeID) then
8: UPDATE-CTIME(r. fileID, r.nodeID,t)
9: Category Clustered (A, r)
10: else if AVAILABLE-Files (r.fileID,t) ≥SIZE(r.fileID)then
11. GET Duplicate files (r.fileID, r.nodeID, t)
12: REMOVE (A, r)
13: end if
14: end if
15: end for
16: end for
In MLPMA algorithm line 4 the access records in inline pre-processing to the current tier.
The details of function Aggregate will be analyzed Deduplication files on server dataset level.
After the aggregation, all records’ nodeIDs are in the current inline pre-processing verifying the
deduplication cluster. For every record r in A, if the r.number of deduplication files calculated
with help of multilevel pattern matching algorithm on threshold for the current tier, it will be
process further (line 6). If the duplicate of file r.fileID exist in the node of r.nodeID, then its
creation time is updated to the current deduplication session time and r is removed from A (lines
7–12). Or else, if node r.nodeID has sufficient space for file r.f ileID, deduplicate the file to the
node and eliminate record r from A (lines 10–12). After the inner for loop is done, the remaining
records in A will be aggregated to the next higher tier in line 4, and the updated array A will be
process again as stated above.
SOFTWARE EXPLANATION

MATLAB

MATLAB (matrix laboratory) is a multi-paradigm numerical computing environment

and fourth-generation programming language. Developed by Math Works, MATLAB
allows matrix manipulations, plotting of functions and data, implementation of algorithms,
creation of user interfaces, and interfacing with programs written in other languages,
including C, C++, Java, Fortran and Python. Although MATLAB is intended primarily for
numerical computing, an optional toolbox uses the MuPAD symbolic engine, allowing access
to symbolic computing capabilities. An additional package, Simulink, adds graphical multi-
domain simulation and Model-Based Design for dynamic and embedded systems. MATLAB is
a wonderful environment for serious numerical computations as well as for graphics. It is
replacing FORTRAN and other languages that have often been used for numerical scientific
computations.

GETTING HELP

MATLAB has several options for on-line assistance. MATLAB offers a tutorial, which
can be accessed from the Help menu or by typing ‘demo’ at the command prompt. It would be a
good idea to run through some of these demos to get an idea of how MATLAB does “stuff”!
The index of MATLAB help information can be accessed from Help -> MATLAB Help. Here
you can find information on getting started, using MATLAB, and implementing built-in
functions. Information on the built-in functions may also be obtained by using the commands
‘help’ and ‘look for’ in the command window. ‘Help function name’ provides help on the
function if you know its exact name. If you don’t know the exact name of the function, use ‘look
for keyword’ to get a list of functions with string keyword in their description.

MATLAB PROGRAMS

A MATLAB program, called an M-file, is just a list of MATLAB commands, the same
commands that you can use interactively in the command window. You can write that list of
commands in a text file and then execute the program from the command window. To create an
M-file, start MATLAB and under the File menu select New and M-file. Type your commands in
the M-file window. Store the M-file with the same name as the function, and with the suffix
".M" such as "Prog.M". The file can be stored and run from a floppy or the hard disk. After
you have changed an M-file, remember to save it before using the function or script. MATLAB
uses the saved version of the program, and not the version displayed in the window.

MATLAB programs in M-files can be classified into two groups: script files and
function files. They differ in two things: (i) the way you execute them, and (ii) the type of
variables they involve.

SCRIPT FILES

Script files are M-files that can be executed by typing their names in the command
window, or calling them from other M-files. The variables they contain or define are global
variables. That is, after you execute a script file all variables involved would be in memory and
usable from the command window.

Using MATLAB
The best way to learn to use MATLAB is to sit down and try to use it. In this handout are
a few examples of basic MATLAB operations, but after you’ve gone through this tutorial you
will probably want to learn more. Check out the “Other Resources” listed at the end of this
handout.

The Beginning When you start MATLAB, the command prompt “>>” appears. You will
tell MATLAB what to do by typing commands at the prompt.

CREATING MATRICES
The basic data element in MATLAB is a matrix. A scalar in MATLAB is a 1x1 matrix,
and a vector is a 1xn (or nx1) matrix.

ADVANCED OPERATIONS
There’s a lot more that you can do with MATLAB than is listed in this handout. Check
out the MATLAB help or one of the “Other Resources” if you want to learn more about the
following more advanced tools:
• Numerical integration (quad)
• Discrete Fourier transforms (fft, ifft)
• Statistics (mean, median, std, var)
• Curve fitting (cftool)
• Signal processing (sptool)
• Numerical integration of systems of ODEs (ode45)

M-FILES AND FUNCTIONS

If you are doing a computation of any significant length in MATLAB, you will probably
want to make an m-file. Anything that you would type at the command prompt you can put in the
m-file (for example, “script.m”) and then run it all at once (by typing the name of the m-file, e.g.
“script”, at the command prompt). You can even add comments to your m-file, by putting a “%”
at the beginning of a comment line.
File I/O
MATLAB allows you to save matrices and read them in later. The simplest way to do
this is using the commands “save” and “load”. Typing in “save A” saves matrix A to a file called
A.mat. If you want to read in matrix A later, just type “load A”. You can also use the load
command to read in ASCII files, as long as they are formatted correctly. Formatted correctly
means that the number of columns in each line is the same and the columns are delimited with a
space.

The MATLAB System:

• Development Environment
• Mathematical Function Library
• MATLAB language
• Application Programming Language.

CREATING MATRICES:
• zeros(m, n): matrix with all zeros
• Ones (m, n): matrix with all ones.
• eye(m, n): the identity matrix
• rand(m, n): uniformly distributed random
 • randn(m, n): normally distributed random
• magic(m): square matrix whose elements have the same sum, along the row, column and
diagonal.

THE MATLAB LANGUAGE

• A high-level matrix/array language with control flow statements, functions, data
structures, input/output, and object-oriented programming features.

THE MATLAB WORKING ENVIRONMENT

• the set of tools and facilities that you work with as the MATLAB user or programmer,
including tools for developing, managing, debugging, and profiling

HANDLE GRAPHICS
• The MATLAB graphics system. It includes high-level commands for two-dimensional
and three-dimensional data visualization, image processing, animation, and presentation
graphics.

THE MATLAB FUNCTION LIBRARY.

• A vast collection of computational algorithms ranging from elementary functions like
sum, sine, cosine, and complex arithmetic, to more sophisticated functions like matrix
inverse, matrix Eigen values, Bessel functions, and fast Fourier transforms as well a
special image processing related functions

THE MATLAB APPLICATION PROGRAM INTERFACE (API)

• A library that allows you to write C and Fortran programs that interact with MATLAB. It
include facilities for calling routines from MATLAB (dynamic linking), calling
MATLAB as a computational engine, and for reading and writing MAT-files.

STARTING AND QUITTING MATLAB

To start MATLAB click on the MATLAB icon or type in MATLAB, followed by pressing the
enter or return key at the system prompt. The screen will produce the MATLAB prompt >> (or
EDU >>), which indicates that MATLAB is waiting for a command to be entered.
• In order to quit MATLAB, type quit or exit after the prompt, followed by pressing the
enter or return key.

DISPLAY WINDOWS
MATLAB has three display windows. They are
1. A Command Window which is used to enter commands and data to display plots and graphs.
2. A Graphics Window which is used to display plots and graphs.
3. An Edit Window which is used to create and modify M-files. M-files are files that contain a
program or script of MATLAB commands.

ENTERING COMMANDS

Every command has to be followed by a carriage return <cr> (enter key) in order that the
command can be executed. MATLAB commands are case sensitive and lower case letters are
used throughout. To execute an M-file (such as Project_1.m), simply enter the name of the file
without its extension (as in Project_1).

MATLAB EXPO
In order to see some of the MATLAB capabilities, enter the demo command. This will initiate
the MATLAB EXPO. MATLAB EXPO is a graphical demonstration environment that shows
some of the different types of operations which can be conducted with MATLAB.

ABORT
In order to abort a command in MATLAB, hold down the control key and press c to generate a
local abort with MATLAB.

THE SEMICOLON (;)

If a semicolon (;) is typed at the end of a command, the output of the command is not displayed.
CREATING AND SAVING A SCRIPT FILE
Any text editor can be used to create script files. In MATLAB, script files are created and
edited in the Editor/ Debugger Window. This window can be opened from the Command
Window. From the Command Window, select File, New and then M-file. Once the window is
open, the commands of the script file are typed line by line. The commands can also be typed in
any text editor or word processor program and then copied and pasted in the Editor/Debugger
Window. The second type of M-files is the function file. Function file enables the user to extend
the basic library functions by adding one’s own computational procedures. Function M-files are
expected to return one or more results. Script files and function files may include reference to
other MATLAB toolbox routines.

MATLAB function file begins with a header statement of the form:

• function (name of result or results) = name (argument list)

RUNNING A SCRIPT FILE

A script file can be executed either by typing its name in the Command Window and then
pressing the Enter key, directly from the Editor Window by clicking on the Run icon. The file is
assumed to be in the current directory, or in the search path

INPUT TO A SCRIPT FILE

There are three ways of assigning a value to a variable in a script file.
1. The variable is defined and assigned value in the script file.
2. The variable is defined and assigned value in the Command Window.
3. The variable is defined in the script file, but a specified value is entered in the Command
Window when the script file is executed.

OVERLAY PLOTS
There are three ways of generating overlay plots in MATLAB. They are:
(a) Plot command.
(b) Hold command.
(c) Line command.

(A) PLOT COMMAND

Example shows the use of plot command used with matrix argument, each column of the
second argument matrix plotted against the corresponding column of the first argument matrix.

(B) HOLD COMMAND

Invoking hold on at any point during a session freezes the current plot in the graphics
window. All the next plots generated by the plot command are added to the exiting plot.

(C) LINE COMMAND

The line command takes a pair of vectors (or a triplet in 3-D) followed by a parameter
name/parameter value pairs as argument. For instance, the command: line (x data, y data,
parameter name, parameter value) add lines to the existing axes

MATLAB Expo
In order to see some of the MATLAB capabilities, enter the demo command. This will
initiate the MATLAB EXPO. MATLAB EXPO is a graphical demonstration environment that
shows some of the different types of operations which can be conducted with MATLAB.
ABORT
In order to abort a command in MATLAB, hold down the control key and press c to
generate a local abort with MATLAB.
THE SEMICOLON (;)
If a semicolon (;) is typed at the end of a command, the output of the command is not
displayed.

TYPING %
When per cent symbol (%) is typed in the beginning of a line, the line is designated as a
comment. When the enter key is pressed, the line is not executed.
THE CLC COMMAND
Typing clc command and pressing enter cleans the command window. Once the clc
command is executed, a clear window is displayed.

CREATING AND SAVING A SCRIPT FILE

Any text editor can be used to create script files. In MATLAB, script files are created and
edited in the Editor/ Debugger Window. This window can be opened from the Command
Window. From the Command Window, select File, New and then M-file. Once the window is
open, the commands of the script file are typed line by line. The commands can also be typed in
any text editor or word processor program and then copied and pasted in the Editor/Debugger
Window. The second type of M-files is the function file. Function file enables the user to extend
the basic library functions by adding ones own computational procedures. Function M-files are
expected to return one or more results. Script files and function files may include reference to
other MATLAB toolbox routines.

MATLAB function file begins with a header statement of the form:

• function (name of result or results) = name (argument list)

RUNNING A SCRIPT FILE

A script file can be executed either by typing its name in the Command Window and then
pressing the Enter key, directly from the Editor Window by clicking on the Run icon. The file is
assumed to be in the current directory, or in the search path.

INPUT TO A SCRIPT FILE

There are three ways of assigning a value to a variable in a script file.
1. The variable is defined and assigned value in the script file.
2. The variable is defined and assigned value in the Command Window.
3. The variable is defined in the script file, but a specified value is entered in the Command
Window
• When the script file is executed.
Overlay plots
There are three ways of generating overlay plots in MATLAB. They are:
(a) Plot command.
(b) Hold command.
(c) Line command.
(a) Plot command
Example shows the use of plot command used with matrix argument, each column of the
second argument matrix plotted against the corresponding column of the first argument matrix.

(b) Hold command

Invoking hold on at any point during a session freezes the current plot in the graphics
window. All the next plots generated by the plot command are added to the exiting plot.

(c) Line command

The line command takes a pair of vectors (or a triplet in 3-D) followed by a parameter
name/parameter value pairs as argument. For instance, the command: line (x data, y data,
parameter name, parameter value) add lines to the existing axes

(iii) % using the line command

t = linspace(0, 2*pi, 100);
y1 = sin(t);
y2 = t;
y3 = t–(t.^3)/6 + (t.^5)/120 – (t.^7)/5040;
plot(t, y1)
line(t, y2, ‘linestyle’, ‘–’)
line(t, y3, ‘marker’, ‘o’)
axis([0 5 –1 5])
xlabel(‘t’)
ylabel(‘sin(t) approximation’)
title(‘sin(t) function’)
• legend(‘sin(t)’, ‘linear approx’, ‘7th order approx’)
TEST RESULT AND ANALYSIS

TESTING

A program represents the logical elements of a system. For a program to run

satisfactorily, it must compile and test data correctly and tie in properly with other programs.
Achieving an error-free program is the responsibility of the programmer. Program testing checks
for two types of errors: syntax and logic.

When a program is tested, the actual output with the expected output is going to compare.
When there is discrepancy, the sequence of instructions must be traced to determine the problem.
Breaking the program down into self-contained portions, each of which can be checked at certain
key points, facilitates the process. The idea is to compare program values against desk-calculated
values to isolate the problem.

Testing is an important stage in the system development life cycle (SDLC). The test case
is a set of data that a system will process as normal input. As its philosophy behind testing is to
find errors the data are created with the express intent of determining whether the system will
process them correctly.

Software testing is an important element of software quality assurance and represents the
ultimate review of specification, design and loading. The increasing visibility of software AR a
system element and the costs associated with a software failure are motivating for well planned
through testing.

TEST OBJECTIVES

These are several rules that can save as testing objectives they are: Testing is a process of
executing program with the intent of finding an error. A good test case is one that has a high
probability of finding an undiscovered error. If testing is conducted successfully according to the
objectives as stated above it would in cover errors in the software also testing demonstrator that
software functions appear to the working according to specification that performance
requirements appear to have been met.

PROGRAM TESTING
 There are three ways to test a program

1. for correctness
2. For implementation, efficiency and
3. For Computations complex city.

Test for correctness is supposed to verify that a program does actually what it is designed
to do. This is much more difficult than it May appear at first, especially for large programs. Test
for implementation efficiency attempt to find ways to make a correct program faster or use less
storage.

TESTING AND CORRECTNESS

The following ideas should be a fact of any testing plan.

Preventive measures

Spot-checks

Testing all parts of the program

Test data

Looking for trouble

Time for testing

The entire testing process can be divided into three phases.

Unit Testing

Integrated Testing

Final/System Testing

TEST CASES

SYSTEM TESTING
 System testing is testing conducted on a complete, integrated system to evaluate the
system's compliance with its specified requirements. System testing falls within the scope of
black box testing, and as such, should require no knowledge of the inner design of the code or
logic.

UNIT TESTING

In unit testing, the entire program that makes the system tested. Unit testing first focuses
on the modules, independent of one another to locate errors. This enables to detect errors in
coding and the logic within the module alone. In the unit testing control path are tested to remove
errors within the boundary of the module.

INTEGRATION TESTING

Integration testing can proceed in a number of different ways, which can be broadly
characterized as top down or bottom up. On top down integration testing the high level control
routines are tested first, possibly with the middle level control structures present only as stubs.

FUNCTIONAL TESTING

Functional testing is a type of black box testing that bases its test cases on the specifications of
the software component under test. Functions are tested by feeding them input and examining the
output, and internal program structure is rarely considered (Not like in white-box testing).

WHITE BOX TESTING

This is a test case design method that uses the control structure of the procedural design
to derive test cases. Using it, the software engineer can derive test cases that, Guarantee that all
independent paths within a module have been exercised once.

BLACK BOX TESTING

This focuses on the functional requirements of the software. It enables the software
engineer to derive sets of input conditions that will fully exercise all functional requirements for
a program. It attempts to find errors such as:

 Incorrect or missing functions

  Interface errors
 Errors in data structures or external database access

ANALYSIS

Test analysis is the process of looking at something that can be used to derive test
information. This basis for the tests is called the test basis.

The test basis is the information we need in order to start the test analysis and create our
own test cases. Basically it’s a documentation on which test cases are based, such as
requirements, design specifications, product risk analysis, architecture and interfaces.

We can use the test basis documents to understand what the system should do once
built. The test basis includes whatever the tests are based on. Sometimes tests can be based on
experienced user’s knowledge of the system which may not be documented.

From testing perspective we look at the test basis in order to see what could be tested.
These are the test conditions. A test condition is simply something that we could test.

While identifying the test conditions we want to identify as many conditions as we can
and then we select about which one to take forward and combine into test cases. We could call
them test possibilities.

As we know that testing everything is an impractical goal, which is known as exhaustive

testing. We cannot test everything we have to select a subset of all possible tests. In practice the
subset we select may be a very small subset and yet it has to have a high probability of finding
most of the defects in a system. Hence we need some intelligent thought process to guide our
selection called test techniques. The test conditions that are chosen will depend on the test
strategy or detailed test approach. For example, they might be based on risk, models of the
system, etc
CONCLUSION

The joint transceiver design problem for secure communications over a MIMO relay with
multiple legitimate users and colluding eavesdroppers. To tackle the highly coupled
corresponding optimization problem, a novel penalty-CCCP algorithm has been proposed to
jointly optimize the BS beam forming matrix, the RS AF transformation matrix and the AN
covariance matrix. The eavesdroppers’ CSI errors have also been considered in the design. We
have analyzed the convergence of the proposed joint transceiver design algorithm and proved
that the proposed penalty-CCCP algorithm converges to a stationary solution of the original
problem. Our simulation results have shown that the proposed algorithm achieves better
performance than the existing transceiver design algorithms. In general, the proposed algorithmic
framework, especially the penalty-CCCP concept, can be also applied to solve other highly
coupled optimization problems appearing in the design of wireless communication systems and
other applications in science and engineering.
REFERENCE

[1] Y. Liang, H. V. Poor, and S. Shamai, “Information theoretical security,” Found. Trends
Commun. Inf. Theory, vol. 5, no. 4-5, pp. 355-580, 2008.

[2] A. D. Wyner, “The wire-tap channel,” Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355-1387, Jan.
1975.

[3] R. Liu and W. Trappe, Securing Wireless Communications at the Physical Layer. Springer,
Norwell, MA, USA, 2009.

[4] A. Khisti and G. Wornell, “Secure transmission with multiple antennas— I: The MISOME
wiretap channel,” IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3088- 3104, July. 2010.

[5] A. Khisti and G. Wornell, “Secure transmission with multiple antennas— II: The MIMOME
wiretap channel,” IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5515-5532, Nov. 2010.

[6] M. Bloch and J. Barros, Physical-Layer Security: From Information Theory to Security
Engineering. Cambridge University Press, 2011.

[7] N. Yang, L. Wang, G. Geraci, M. Elkashlan, J. Yuan, and M. D. Renzo, “Safeguarding 5G

wireless communication networks using physical layer security,” IEEE Commun. Mag., vol. 53,
no. 4, pp. 20-27, Apr. 2015.

[8] T. Lv, H. Gao and S. Yang, “Secrecy transmit beamforming for heterogeneous networks,”
IEEE J. Sel. Areas Commun., vol. 33, no. 6, pp. 1154-1170, Jun. 2015.

[9] J. N. Laneman and G. W. Wornell, “Cooperative diversity in wireless network: Efficient

protocols and outage behaviour,” IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3062-3080, Dec.
2004.

[10] Y.-W. Hong, P. Lan, P.-C. Kuo, and C.-C. Jay, “Enhancing physicallayer secrecy in
multiantenna wireless systems: An overview of signal processing approaches,” IEEE Signal
Process. Mag., vol. 30, no. 5, pp. 29-40, 2013.

[11] X. Chen, C. Zhong, C. Yuen, and H.-H. Chen, “Multi-antenna relay aided wireless physical
layer security” IEEE Commun. Mag., vol. 53, no. 12, pp. 40-46, Dec. 2015.
[12] A. Mukherjee, S. A. A. Fakoorian, J. Huang, and A. L. Swindlehurst, “Principles of physical
layer security in multiuser wireless networks: A survey,” IEEE Commun. Surv. Tut., vol. 16, no.
3, pp.1550-1573, 2014.

[13] C. Jeong, I.-M. Kim, and D. Kim, “Joint secure beamforming design at the source and the
relay for an amplify-and-forward MIMO untrusted relay system,” IEEE Trans. Signal Process.,
vol. 60, no. 1, pp. 310-325, Jan. 2012.

[14] J. Mo, M. Tao, Y. Liu, and R. Wang, “Secure beamforming for MIMO two-way
communications with an untrusted relay,” IEEE Trans. Signal Process., vol. 62, no. 9, pp. 2185-
2199, May 1, 2014.

[15] C. Thai, J. Lee, and T. Q. S. Quek, “Physical-layer secret key generation with colluding
untrusted relays,” IEEE Trans. Wireless Commun., vol. 15, no. 2, pp. 1517-1530, Feb. 2016.

[16] Z. Ding, M. Peng, and H.-H. Chen, “A general relaying transmission protocol for MIMO
secrecy communications,” IEEE Trans. Commun., vol. 60, no. 11, pp. 3461-3471, Nov. 2012.

[17] J. Huang and A. L. Swindlehurst, “Cooperative jamming for secure communications in

MIMO relay networks,” IEEE Trans. Signal Process., vol. 59, no. 10, pp. 4871-4884, Oct. 2011.

[18] Q. Li, Q. Zhang, and J. Qin, “Secure relay beamforming for simultaneous wireless
information and power transfer in nonregenerative relay networks,” IEEE Trans. Vehi. Technol.,
vol. 63, no. 5, pp. 2462-2467, Jun. 2014.

[19] C. Wang, H. Wang, D. W. K. Ng, X.-G. Xia, and C. Liu, “Joint beamforming and power
allocation for secrecy in peer-to-peer relay networks,” IEEE Trans. Wireless Commun., vol. 14,
no. 6, pp. 3280-3293, Jun. 2015.

[20] H. Wang, F. Liu, and X.-G. Xia, “Joint source-relay precoding and power allocation for
secure amplify-and-forward MIMO relay networks,” IEEE Trans. Inf. Forensics Security, vol. 9,
no. 8, pp. 1240-1250, Aug. 2014.