Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEnhancing Physical Layer Security of Random Caching in Large-Scale Multi-Antenna Heterogeneous Wireless Networks
117
0
0.0
(
0
)
Added by
Wanli Wen Dr.
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, we propose a novel secure random caching scheme for large-scale multi-antenna heterogeneous wireless networks, where the base stations (BSs) deliver randomly cached confidential contents to the legitimate users in the presence of passive eavesdroppers as well as active jammers. In order to safeguard the content delivery, we consider that the BSs transmits the artificial noise together with the useful signals. By using tools from stochastic geometry, we first analyze the average reliable transmission probability (RTP) and the average confidential transmission probability (CTP), which take both the impact of the eavesdroppers and the impact of the jammers into consideration. We further provide tight upper and lower bounds on the average RTP. These analytical results enable us to obtain rich insights into the behaviors of the average RTP and the average CTP with respect to key system parameters. Moreover, we optimize the caching distribution of the files to maximize the average RTP of the system, while satisfying the constraints on the caching size and the average CTP. Through numerical results, we show that our proposed secure random caching scheme can effectively boost the secrecy performance of the system compared to the existing solutions.
rate research
Read More
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.
Caching and multicasting are two promising methods to support massive content delivery in multi-tier wireless networks. In this paper, we consider a random caching and multicasting scheme with caching distributions in the two tiers as design parameters, to achieve efficient content dissemination in a two-tier large-scale cache-enabled wireless multicasting network. First, we derive tractable expressions for the successful transmission probabilities in the general region as well as the high SNR and high user density region, respectively, utilizing tools from stochastic geometry. Then, for the case of a single operator for the two tiers, we formulate the optimal joint caching design problem to maximize the successful transmission probability in the asymptotic region, which is nonconvex in general. By using the block successive approximate optimization technique, we develop an iterative algorithm, which is shown to converge to a stationary point. Next, for the case of two different operators, one for each tier, we formulate the competitive caching design game where each tier maximizes its successful transmission probability in the asymptotic region. We show that the game has a unique Nash equilibrium (NE) and develop an iterative algorithm, which is shown to converge to the NE under a mild condition. Finally, by numerical simulations, we show that the proposed designs achieve significant gains over existing schemes.
This paper develops a tractable framework for exploiting the potential benefits of physical layer security in three-tier wireless sensor networks using stochastic geometry. In such networks, the sensing data from the remote sensors are collected by sinks with the help of access points, and the external eavesdroppers intercept the data transmissions.We focus on the secure transmission in two scenarios: i) the active sensors transmit their sensing data to the access points, and ii) the active access points forward the data to the sinks. We derive new compact expressions for the average secrecy rate in these two scenarios. We also derive a new compact expression for the overall average secrecy rate. Numerical results corroborate our analysis and show that multiple antennas at the access points can enhance the security of three-tier wireless sensor networks. Our results show that increasing the number of access points decreases the average secrecy rate between the access point and its associated sink. However, we find that increasing the number of access points first increases the overall average secrecy rate, with a critical value beyond which the overall average secrecy rate then decreases. When increasing the number of active sensors, both the average secrecy rate between the sensor and its associated access point and the overall average secrecy rate decrease. In contrast, increasing the number of sinks improves both the average secrecy rate between the access point and its associated sink, as well as the overall average secrecy rate.
Physical layer security which safeguards data confidentiality based on the information-theoretic approaches has received significant research interest recently. The key idea behind physical layer security is to utilize the intrinsic randomness of the transmission channel to guarantee the security in physical layer. The evolution towards 5G wireless communications poses new challenges for physical layer security research. This paper provides a latest survey of the physical layer security research on various promising 5G technologies, including physical layer security coding, massive multiple-input multiple-output, millimeter wave communications, heterogeneous networks, non-orthogonal multiple access, full duplex technology, etc. Technical challenges which remain unresolved at the time of writing are summarized and the future trends of physical layer security in 5G and beyond are discussed.
This paper considers a scenario in which a source-destination pair needs to establish a confidential connection against an external eavesdropper, aided by the interference generated by another source-destination pair that exchanges public messages. The goal is to compute the maximum achievable secrecy degrees of freedom (S.D.o.F) region of a MIMO two-user wiretap network. First, a cooperative secrecy transmission scheme is proposed, whose feasible set is shown to achieve all S.D.o.F. pairs on the S.D.o.F. region boundary. In this way, the determination of the S.D.o.F. region is reduced to a problem of maximizing the S.D.o.F. pair over the proposed transmission scheme. The maximum achievable S.D.o.F. region boundary points are obtained in closed form, and the construction of the precoding matrices achieving the maximum S.D.o.F. region boundary is provided. The obtained analytical expressions clearly show the relation between the maximum achievable S.D.o.F. region and the number of antennas at each terminal.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
