No Arabic abstract
To increase the spectral efficiency of wireless networks without requiring full-duplex capability of user devices, a potential solution is the recently proposed three-node full-duplex mode. To realize this potential, networks employing three-node full-duplex transmissions must deal with self-interference and user-to-user interference, which can be managed by frequency channel and power allocation techniques. Whereas previous works investigated either spectral efficient or fair mechanisms, a scheme that balances these two metrics among users is investigated in this paper. This balancing scheme is based on a new solution method of the multi-objective optimization problem to maximize the weighted sum of the per-user spectral efficiency and the minimum spectral efficiency among users. The mixed integer non-linear nature of this problem is dealt by Lagrangian duality. Based on the proposed solution approach, a low-complexity centralized algorithm is developed, which relies on large scale fading measurements that can be advantageously implemented at the base station. Numerical results indicate that the proposed algorithm increases the spectral efficiency and fairness among users without the need of weighting the spectral efficiency. An important conclusion is that managing user-to-user interference by resource assignment and power control is crucial for ensuring spectral efficient and fair operation of full-duplex networks.
This letter proposes a new full-duplex (FD) secrecy communication scheme for the unmanned aerial vehicle (UAV) and investigates its optimal design to achieve the maximum energy efficiency (EE) of the UAV. Specifically, the UAV receives the confidential information from a ground source and meanwhile sends jamming signals to interfere with a potential ground eavesdropper. As the UAV has limited on-board energy in practice, we aim to maximize the EE for its secrecy communication, by jointly optimizing the UAV trajectory and the source/UAV transmit/jamming powers over a finite flight period with given initial and final locations. Although the problem is difficult to solve, we propose an efficient iterative algorithm to obtain its suboptimal solution. Simulation results show that the proposed joint design can significantly improve the EE of UAV secrecy communication, as compared to various benchmark schemes.
In this paper the advantages provided by multicell processing of signals transmitted by mobile terminals (MTs) which are received via dedicated relay terminals (RTs) are studied. It is assumed that each RT is capable of full-duplex operation and receives the transmission of adjacent relay terminals. Focusing on intra-cell TDMA and non-fading channels, a simplified relay-aided uplink cellular model based on a model introduced by Wyner is considered. Assuming a nomadic application in which the RTs are oblivious to the MTs codebooks, a form of distributed compress-and-forward (CF) scheme with decoder side information is employed. The per-cell sum-rate of the CF scheme is derived and is given as a solution of a simple fixed point equation. This achievable rate reveals that the CF scheme is able to completely eliminate the inter-relay interference, and it approaches a ``cut-set-like upper bound for strong RTs transmission power. The CF rate is also shown to surpass the rate of an amplify-and-forward scheme via numerical calculations for a wide range of the system parameters.
In this paper the benefits provided by multi-cell processing of signals transmitted by mobile terminals which are received via dedicated relay terminals (RTs) are assessed. Unlike previous works, each RT is assumed here to be capable of full-duplex operation and receives the transmission of adjacent relay terminals. Focusing on intra-cell TDMA and non-fading channels, a simplified uplink cellular model introduced by Wyner is considered. This framework facilitates analytical derivation of the per-cell sum-rate of multi-cell and conventional single-cell receivers. In particular, the analysis is based on the observation that the signal received at the base stations can be interpreted as the outcome of a two-dimensional linear time invariant system. Numerical results are provided as well in order to provide further insight into the performance benefits of multi-cell processing with relaying.
Cell biasing and downlink transmit power are two controls that may be used to improve the spectral efficiency of cellular networks. With cell biasing, each mobile user associates with the base station offering, say, the highest biased signal to interference plus noise ratio. Biasing affects the cell association decisions of mobile users, but not the received instantaneous downlink transmission rates. Adjusting the collection of downlink transmission powers can likewise affect the cell associations, but in contrast with biasing, it also directly affects the instantaneous rates. This paper investigates the joint use of both cell biasing and transmission power control and their (individual and joint) effects on the statistical properties of the collection of per-user spectral efficiencies. Our analytical results and numerical investigations demonstrate in some cases a significant performance improvement in the Pareto efficient frontiers of both a mean-variance and throughput-fairness tradeoff from using both bias and power controls over using either control alone.
We consider a broadcast channel, in which a multi-antenna transmitter (Alice) sends $K$ confidential information signals to $K$ legitimate users (Bobs) in the presence of $L$ eavesdroppers (Eves). Alice uses MIMO precoding to generate the information signals along with her own (Tx-based) friendly jamming. Interference at each Bob is removed by MIMO zero-forcing. This, however, leaves a vulnerability region around each Bob, which can be exploited by a nearby Eve. We address this problem by augmenting Tx-based friendly jamming (TxFJ) with Rx-based friendly jamming (RxFJ), generated by each Bob. Specifically, each Bob uses self-interference suppression (SIS) to transmit a friendly jamming signal while simultaneously receiving an information signal over the same channel. We minimize the powers allocated to the information, TxFJ, and RxFJ signals under given guarantees on the individual secrecy rate for each Bob. The problem is solved for the cases when the eavesdroppers channel state information is known/unknown. Simulations show the effectiveness of the proposed solution. Furthermore, we discuss how to schedule transmissions when the rate requirements need to be satisfied on average rather than instantaneously. Under special cases, a scheduling algorithm that serves only the strongest receivers is shown to outperform the one that schedules all receivers.