Penn State College of Communications

About: Penn State College of Communications is a based out in . It is known for research contribution in the topics: Relay & Cognitive radio. The organization has 2106 authors who have published 2119 publications receiving 24693 citations.

Power Control in Relay-Assisted Anti-Jamming Systems: A Bayesian Three-Layer Stackelberg Game Approach

Abstract: This paper investigates the multi-user power control problem in relay-assisted anti-jamming systems. Because of the hierarchical confrontation characteristics between users and jammer, we take the incomplete information and observation error into consideration and formulate an anti-jamming Bayesian three-layer Stackelberg game, in which primary users act as leaders, relay users act as vice-leaders, and jammer acts as a follower. Both users and jammer have the ability to sense others' transmission power and choose optimal power to realize the maximum of utility. Based on the backward induction method, we propose a multi-user hierarchical iterative algorithm to obtain the Stackelberg equilibrium (SE) and prove the existence and uniqueness of SE. Finally, simulation results are compared with the Nash equilibrium to verify the effectiveness of the proposed game. Moreover, both the influence of incomplete information and the observation error on utility are analyzed.

A Joint Tensor Completion and Prediction Scheme for Multi-Dimensional Spectrum Map Construction

Abstract: Spectrum data, which are usually characterized by many dimensions, such as location, frequency, time, and signal strength, present formidable challenges in terms of acquisition, processing, and visualization. In practice, a portion of spectrum data entries may be unavailable due to the interference during the acquisition process or compression during the sensing process. Nevertheless, the completion work in multi-dimensional spectrum data has drawn few attention to the researchers working in the field. In this paper, we first put forward the concept of spectrum tensor to depict the multi-dimensional spectrum data. Then, we develop a joint tensor completion and prediction scheme, which combines an improved tensor completion algorithm with prediction models to retrieve the incomplete measurements. Moreover, we build an experimental platform using Universal Software Radio Peripheral to collect real-world spectrum tensor data. Experimental results demonstrate that the effectiveness of the proposed joint tensor processing scheme is superior than relying on the completion or prediction scheme only.

On–Off-Based Secure Transmission Design With Outdated Channel State Information

Abstract: We design new secure on–off transmission schemes in wiretap channels with outdated channel state information (CSI). In our design, we consider not only the outdated CSI from the legitimate receiver but two distinct scenarios as well, depending on whether the outdated CSI from the eavesdropper is known at the transmitter. Under this consideration, our schemes exploit useful knowledge contained in the available outdated CSI, and based on this, the transmitter decides on whether to transmit or not. We derive new closed-form expressions for the transmission probability, the connection outage probability, the secrecy outage probability, and the reliable and secure transmission probability to characterize the achievable performance. Based on these results, we present the optimal solutions that maximize the secrecy throughput under dual connection and secrecy outage constraints. Our analytical and numerical results offer detailed insights into the design of the wiretap coding parameters and the imposed outage constraints. We further show that allowing more freedom on the codeword transmission rate enables a larger feasible region of the dual outage constraints by exploiting the tradeoff between reliability and security.

Relay Selection and Discrete Power Control for Cognitive Relay Networks via Potential Game

Abstract: In this paper, we study the joint relay selection and discrete power control problem for cognitive relay networks via a game-theoretic approach subject to the interference power constraint at the primary receivers and the total available power constraint for the secondary relays. The problem is formulated as a noncooperative game where the achievable rate of the cognitive relay network is used to design a common utility. This game is shown to be a potential game which possesses at least one pure strategy Nash equilibrium (NE) and an optimal strategy profile that maximizes the rate of cognitive relay network constitutes a pure strategy NE of our proposed game. We prove that under some mild conditions, our proposed game can guarantee the feasibility of a pure strategy NE without advance knowledge of infeasible strategy profiles. Moreover, we find that the price of anarchy (PoA) of our proposed game is equal to 1 under some conditions. In order to achieve the pure strategy NE, we design a centralized iterative algorithm and a decentralized stochastic learning algorithm based on learning automata. The convergence and the complexity of our designed algorithms are discussed. It is shown that our designed algorithms can achieve optimal or near-optimal rate performance with low complexity.

Performance Analysis of NOMA-Based Cooperative Spectrum Sharing in Hybrid Satellite-Terrestrial Networks

Abstract: In this paper, the performance of non-orthogonal multiple access (NOMA) based cooperative spectrum sharing in hybrid satellite-terrestrial networks (HSTNs) is investigated, where the primary satellite network recruits the secondary terrestrial network as a cooperative relay. To improve the fairness and spectrum utilization under cooperative spectrum sharing (i.e. overlay paradigm of cognitive radio), the NOMA power allocation profile is determined by instantaneous channel conditioning at the second temporal phase. The closed-form outage probability and approximated ergodic capacity expressions for the primary user (PU) and the secondary user (SU) are derived by decode-and-forward (DF) relay protocols, where the generalized Shadowed-Rician fading and Nakagami-m fading are considered for satellite links and terrestrial links, respectively. Simulation results are conducted for validation of the theoretical derivation and analysis of the impact of key parameters, and prove the superiority of NOMA comparing to conventional orthogonal multiple access (OMA) schemes on cooperative spectrum sharing in HSTNs. Besides, the fairness analysis between the PU and the SU is introduced by Jain's fairness index (JFI).