Abstract-The broadcast nature of the wireless medium allows unintended users to eavesdrop the confidential information transmission. In this regard, we investigate the problem of secure communication between a source and a destination via a wireless energy harvesting untrusted node which acts as a helper to relay the information; however, the source and destination nodes wish to keep the information confidential from the relay node. To realize the positive secrecy rate, we use destination-assisted jamming. Being an energy-starved node, the untrusted relay harvests energy from the received radio frequency signals, which include the source's information signal and the destination's jamming signal. Thus, we utilize the jamming signal efficiently by leveraging it as a useful energy source. At the relay, to enable energy harvesting and information processing, we adopt power splitting (PS) and time switching (TS) policies. To evaluate the secrecy performance of this proposed scenario, we derive analytical expressions for two important metrics, viz., the secrecy outage probability and the ergodic secrecy rate. The numerical analysis reveals the design insights into the effects of different system parameters like power splitting ratio, energy harvesting time, target secrecy rate, transmit signal-to-noise ratio (SNR), relay location, and energy conversion efficiency factor, on the secrecy performance. Specifically, the PS policy achieves better optimal secrecy outage probability and optimal ergodic secrecy rate than that of the TS policy at higher target secrecy rate and transmit SNR, respectively. Index Terms-Destination-assisted jamming, ergodic secrecy rate, secrecy outage probability, untrusted relay, wireless energy harvesting.
Abstract-We integrate a wireless powered communication network with a cooperative cognitive radio network, where multiple secondary users (SUs) powered wirelessly by a hybrid access point (HAP) help a primary user relay the data. As a reward for the cooperation, the secondary network gains the spectrum access where SUs transmit to HAP using time division multiple access. To maximize the sum-throughput of SUs, we present a secondary sumthroughput optimal resource allocation (STORA) scheme. Under the constraint of meeting target primary rate, the STORA scheme chooses the optimal set of relaying SUs and jointly performs the time and energy allocation for SUs. Specifically, by exploiting the structure of the optimal solution, we find the order in which SUs are prioritized to relay primary data. Since the STORA scheme focuses on the sum-throughput, it becomes inconsiderate towards individual SU throughput, resulting in low fairness. To enhance fairness, we investigate three resource allocation schemes, which are (i) equal time allocation, (ii) minimum throughput maximization, and (iii) proportional time allocation. Simulation results reveal the trade-off between sum-throughput and fairness. The minimum throughput maximization scheme is the fairest one as each SU gets the same throughput, but yields the least SU sum-throughput.
Abstract-This letter analyzes the sensing-throughput tradeoff for a secondary user (SU) under random arrivals and departures of multiple primary users (PUs). We first study the case where PUs change their status only during SU's sensing period. We then generalize to a case where PUs change status anytime during SU frame, and compare the latter case with the former in terms of the optimal sensing time and SU throughput. We also investigate the effects of PU traffic parameters and the number of PUs on the sensing-throughput tradeoff for SU. Results show that, though the increase in the number of PUs reduces the optimal sensing time for SU, the opportunity to find a vacant PU channel reduces simultaneously, in turn, reducing SU throughput. Finally, we validate the analysis by Monte Carlo simulations.
Compared to the standard success (coverage) probability, the meta distribution of the signal-to-interference ratio (SIR) provides much more fine-grained information about the network performance. We consider general heterogeneous cellular networks (HCNs) with base station tiers modeled by arbitrary stationary and ergodic non-Poisson point processes. The exact analysis of non-Poisson network models is notoriously difficult, even in terms of the standard success probability, let alone the meta distribution. Hence we propose a simple approach to approximate the SIR meta distribution for non-Poisson networks based on the ASAPPP ("approximate SIR analysis based on the Poisson point process") method. We prove that the asymptotic horizontal gap G0 between its standard success probability and that for the Poisson point process exactly characterizes the gap between the bth moment of the conditional success probability, as the SIR threshold goes to 0. The gap G0 allows two simple approximations of the meta distribution for general HCNs: 1) the per-tier approximation by applying the shift G0 to each tier and 2) the effective gain approximation by directly shifting the meta distribution for the homogeneous independent Poisson network. Given the generality of the model considered and the finegrained nature of the meta distribution, these approximations work surprisingly well.Index Terms-Interference, heterogeneous cellular networks, meta distribution, Poisson point process, signal-to-interference ratio, stochastic geometry S. S. Kalamkar is with INRIA, Paris, France. M. Haenggi is with the
Abstract-We consider a spectrum sharing scenario where a secondary transmitter (ST) communicates with its destination via a decode-and-forward secondary relay (SR) in the presence of interference from multiple primary transmitters. The SR harvests energy from received radio-frequency signals that include primary interference and uses it to forward the information to the secondary destination. The relay adopts a time switching policy that switches between energy harvesting and information decoding over the time. Under the primary outage constraints and the peak power constraints at both ST and SR, to determine the average secondary throughput, we derive exact analytical expressions for the secondary outage probability and the ergodic capacity, which characterize the delay-limited and the delaytolerant transmissions, respectively. We also investigate the effects of the number of primary transceivers and the peak power constraints on the optimal energy harvesting time that maximizes the secondary throughput. By utilizing the primary interference as an energy source, the secondary network achieves a better throughput performance compared to the case where the primary interference is ignored for energy harvesting purpose. Finally, we consider a case where ST also harvests energy from primary transmissions and compare its throughput performance with that of the non-energy harvesting ST case.
We consider a spectrum sharing scenario, where a secondary network coexists with a primary network of multiple transceivers. The secondary network consists of an energyconstrained decode-and-forward secondary relay which assists the communication between a secondary transmitter and a destination in the presence of the interference from multiple primary transmitters. The secondary relay harvests energy from the received radiofrequency signals, which include the information signal from the secondary transmitter and the primary interference. The harvested energy is then used to decode the secondary information and forward it to the secondary destination. At the relay, we adopt a time switching policy due to its simplicity that switches between the energy harvesting and information decoding over time. Specifically, we derive a closed-form expression for the secondary outage probability under the primary outage constraint and the peak power constraint at both secondary transmitter and relay. In addition, we investigate the effect of the number of primary transceivers on the optimal energy harvesting duration that minimizes the secondary outage probability. By utilizing the primary interference as a useful energy source in the energy harvesting phase, the secondary network achieves a better outage performance.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.