It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
This paper investigates optimization of underlay multi-hop cognitive full-duplex relay (CogFDR) networks in independent non-identically distributed Rayleigh fading channels. First of all, analytical expressions for the outage probability experienced in the secondary network is formulated, taking into account (i) residual self-interference (RSI) arising due to full-duplex operation, (ii) inter-relay interference (IRI) arising due to frequency re-use, and (iii) interference generated by the primary transmitter on the secondary network. Optimal power allocation (OPA) that either minimizes the end-to-end outage probability or maximizes the end-to-end instantaneous rate is investigated with constraints on total available power in the secondary network and tolerable interference power at the primary receiver. The OPA vector for the outage minimization problem is obtained by solving an equivalent geometric programming problem (GPP) and that for the rate maximization problem is obtained by applying the rate balancing criterion for each hop. Extensive performance evaluations conducted with the help of Monte Carlo simulations show that transmit power optimization can improve the end-to-end rate and outage probability performance of multi-hop CogFDR network in comparison to equal power allocation on average (EPA).
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer