207 research outputs found
Enhancing Physical Layer Security in AF Relay Assisted Multi-Carrier Wireless Transmission
In this paper, we study the physical layer security (PLS) problem in the dual
hop orthogonal frequency division multiplexing (OFDM) based wireless
communication system. First, we consider a single user single relay system and
study a joint power optimization problem at the source and relay subject to
individual power constraint at the two nodes. The aim is to maximize the end to
end secrecy rate with optimal power allocation over different sub-carriers.
Later, we consider a more general multi-user multi-relay scenario. Under high
SNR approximation for end to end secrecy rate, an optimization problem is
formulated to jointly optimize power allocation at the BS, the relay selection,
sub-carrier assignment to users and the power loading at each of the relaying
node. The target is to maximize the overall security of the system subject to
independent power budget limits at each transmitting node and the OFDMA based
exclusive sub-carrier allocation constraints. A joint optimization solution is
obtained through duality theory. Dual decomposition allows to exploit convex
optimization techniques to find the power loading at the source and relay
nodes. Further, an optimization for power loading at relaying nodes along with
relay selection and sub carrier assignment for the fixed power allocation at
the BS is also studied. Lastly, a sub-optimal scheme that explores joint power
allocation at all transmitting nodes for the fixed subcarrier allocation and
relay assignment is investigated. Finally, simulation results are presented to
validate the performance of the proposed schemes.Comment: 10 pages, 7 figures, accepted in Transactions on Emerging
Telecommunications Technologies (ETT), formerly known as European
Transactions on Telecommunications (ETT
Subcarrier Pairing as Channel Gain Tailoring: Joint Resource Allocation for Relay-Assisted Secure OFDMA with Untrusted Users
Joint resource allocation involving optimization of subcarrier allocation,
subcarrier pairing (SCP), and power allocation in a cooperative secure
orthogonal frequency division multiple access (OFDMA) communication system with
untrusted users is considered. Both amplify and forward (AF), and decode and
forward (DF) modes of operations are considered with individual power budget
constraints for source and relay. After finding optimal subcarrier allocation
for an AF relayed system, we prove the joint power allocation as a generalized
convex problem, and solve it optimally. Compared to the conventional channel
gain matching view, the optimal SCP is emphasized as a novel concept of channel
gain tailoring. We prove that the optimal SCP pairs subcarriers such that the
variance among the effective channel gains is minimized. For a DF relayed
system, we show that depending on the power budgets of source and relay, SCP
can either be in a subordinate role where it improves the energy efficiency, or
in a main role where it improves the spectral efficiency of the system. In an
AF relayed system we confirm that SCP plays a crucial role, and improves the
spectral efficiency of the system. The channel gain tailoring property of SCP,
various roles of SCP in improving the spectral and the energy efficiency of a
cooperative communication system are validated with the help of simulation
results
Energy Harvesting for Secure OFDMA Systems
Energy harvesting and physical-layer security in wireless networks are of
great significance. In this paper, we study the simultaneous wireless
information and power transfer (SWIPT) in downlink orthogonal
frequency-division multiple access (OFDMA) systems, where each user applies
power splitting to coordinate the energy harvesting and information decoding
processes while secrecy information requirement is guaranteed. The problem is
formulated to maximize the aggregate harvested power at the users while
satisfying secrecy rate requirements of all users by subcarrier allocation and
the optimal power splitting ratio selection. Due to the NP-hardness of the
problem, we propose an efficient iterative algorithm. The numerical results
show that the proposed method outperforms conventional methods.Comment: Accepted by WCSP 201
- …