Search

Air ground integrated mobile cloud computing (MCC) provides unmanned aerial vehicles (UAVs) the capability to act as an aerial relay with more flexibility and resilience. In the cloud computing architecture, the data generated by ground users (GUs) can be offloaded to the remote server for fast processing. However, the heterogeneity of mobile tasks makes the data size distributed among GUs unbalanced. Besides, the energy efficiency of UAVs movement should be carefully considered for sustainable flight and obstacle avoidance. In general, such a joint trajectory issue can hardly be formulated as a convex optimization in unpredictable and dynamic environments. This paper proposes a potential game combined multi-agent deep deterministic policy gradient (MADDPG) approach to optimize multiple UAVs' trajectory with the consideration of GUs' offloading delay, energy efficiency as well as obstacle avoidance system. In specific, we first model the issue as a mixed integer non-linear problem (MINP), in which the service assignment between multi-user and multi-UAV is solved by potential game. The convergence to a Nash Equilibrium (NE) can be achieved by distributive service assignment update with infinite iteration. Then, we optimize the trajectory with obstacle avoidance at each UAV by MADDPG approach, which has a great advantage of centralized-training and decentralized-execution to reduce the global synchronized communication overhead. UAVs movement can be optimized in continuity rather than other deep reinforcement learning (DRL) approaches generating discrete simple actions. Experiments demonstrate the proposed game-combined learning algorithm can minimize the offloading delay, enhance UAVs’ energy efficiency and avoid the obstacles at the same time. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) is considered as a potential multiple access technique for supporting massive number of devices with high spectral efficiency for the 5 G and beyond networks. Simultaneous wireless information and power transfer (SWIPT) is considered as an efficient solution for fully autonomous and sustainable communication networks. In this paper, application of SWIPT in heterogeneous networks (HetNets) employing cooperative NOMA (CNOMA) is investigated. The HetNets consists of macro-base stations (MBS) under-laid by small-base stations (SBS). The distribution of MBSs follow Poisson point process model, while the SBS tier supports NOMA and carrier sensing for its transmission. Carrier sensing helps in reducing interference by blocking the base stations within a specific range from transmitting. In this work, the analysis at SBS tier is carried out in two phases. In the direct phase transmission, the SBS transmits the superimposed signal to a user pair, comprising of a cell-centre user (CCU) and a cell-edge user (CEU), using NOMA principle. The CCU acts as a cooperative relay to forward information to the CEU in the cooperative phase. Unlike existing literature, instead of using only the superimposed signal for energy harvesting (EH), in this work, the cooperating user (i.e. CCU) employs EH using interference from the adjacent base stations along with the EH from the superimposed signal. Expressions for outage probability and throughput are derived at the user pair served using NOMA. Comparison of the proposed EH system with existing solutions are highlighted and useful insights are drawn. Monte Carlo simulations are carried out to validate the analytical results. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) is an important technology for the forthcoming 5 G and beyond. However, its privacy often suffers from adversarial eavesdropping, especially for the users with higher transmit power. In this paper, we propose a jamming-aided secure transmission scheme for cooperative NOMA networks with a full-duplex (FD) relay. In this scheme, two pairs of users perform secure transmission with the help of a decode-forward (DF) relay, which forwards information and generates artificial jamming to counteract eavesdropping. The precoding vectors are designed to zero-force the artificial jamming at legal receivers. Then, the channel statistics are calculated, based on which the secrecy rates of legitimate signals are analyzed and the expressions of secrecy outage probability (SOP) are derived. Furthermore, three benchmark schemes are also presented with their performance analyzed to verify the advantage of the proposed scheme. Simulation results show the accuracy of our analysis, and demonstrate that the proposed scheme can effectively reduce the SOP and improve the effective secrecy throughput via artificial jamming and FD relaying. [ABSTRACT FROM AUTHOR]

The cooperative non-orthogonal multiple access (NOMA) networks with one pair primary user and one pair cognitive user share the same spectrum resource via a common relay is considered in this paper. We propose a dynamic power transmission scheme for both uplink and downlink NOMA transmission in cognitive relay networks, which preserves the quality of service for the primary user. The closed-form expressions of overall outage probability and average sum rate for the proposed dynamic power transmission scheme of cognitive relay NOMA networks are derived. Both developed analytical results and Monte Carlo simulations show that the proposed dynamic power control scheme can dramatically enhance performance gain for the proposed networks, compared to other existing NOMA power allocation schemes. [ABSTRACT FROM AUTHOR]

This paper studies the performance of unmanned aerial vehicle (UAV)-enabled NOMA networks with selective incremental relaying and imperfect channel state information (CSI). In particular, an access point transmits a superposed signal based on NOMA principle to an UAV terminal (UT) which can act as a relay to assist the information transmission for a ground terminal (GT). Different from the conventional relaying protocol requiring UT to relay the message all the time no matter how the received signal quality of two terminals are, we propose a novel NOMA-based selective incremental relaying protocol that allows relay to forward messages on the condition of the received signal with satisfied quality at UT and the unsatisfied quality signal at GT. The closed-form solutions of outage probabilities for the two terminals are characterized with the elevation angle-based path loss exponent and small-scale fading. Moreover, the benchmark schemes are provided to exhibit the superiority of the proposed protocol. Finally, simulation and theoretical results validate the correctness of the outage analysis, demonstrate the advantage of the proposed relaying protocol over its counterparts, and show that the stronger impact of channel estimation error on GT than UT in terms of outage probability. [ABSTRACT FROM AUTHOR]

This paper proposes a novel probabilistic buffer-aided (BA) relay selection (RS) scheme for cooperative relay networks. Different from most existing BA RS schemes that are determined by the wireless channel condition and the buffer state, the proposed scheme also utilizes additional randomness to decide the link selection outcome. In particular, we first select the strongest available source-to-relay and relay-to-destination links, respectively, and then probabilistically select one from these two links. Some previously proposed BA RS schemes can be viewed as special cases of the proposed scheme, such as the max-link scheme and the scheme with reduced packet delay. Then, the outage probability and average packet delay are analyzed. Both the analytical and simulation results show that different tradeoffs between the outage probability and average packet delay can be easily achieved by adjusting a single corresponding parameter. [ABSTRACT FROM AUTHOR]

In this paper, secure primary transmission is proposed by using a multi-antenna secondary full-duplex non-orthogonal multiple access (NOMA) relay in cognitive radio (CR) networks. First, the primary signal is transmitted from the primary transmitter to the relay. Artificial noise is generated by using part of the antennas at the relay to disrupt eavesdropping, without affecting the primary transmission. Then, superimposed signals are transmitted from the relay to the primary receiver and secondary receivers via NOMA. The primary security is guaranteed by the modified decoding order and beamforming optimization, which is converted to convex and solved by an iterative algorithm. Simulation results are presented to show the effectiveness of the proposed scheme in guaranteeing the primary security in CR networks. [ABSTRACT FROM AUTHOR]

This paper investigates an integrated wireless communication system including non-orthogonal multiple access, full-duplex relaying, and energy harvesting techniques (named as EH-FD-NOMA). In this scheme, an energy-limited full-duplex relay harvests energy from a source at the first stage. Then, the relay detects the superimposed signal from the source and transmits the decoded signal to destination. Closed-form outage probabilities and ergodic rates at the relay and destination are derived. Numerical results verify the analytical results and show the superior performance of the EH-FD-NOMA if compared to its counterparts. [ABSTRACT FROM AUTHOR]

This paper investigates the effect of imperfect channel state information on the performance of the cooperative non-orthogonal multiple access (NOMA) transmission scheme, in which the cell-center user acts as a decode-and-forward relay to assist the information transmission. The cell-center user adopts a simultaneous wireless information and power transfer (SWIPT) technique to harvest energy for information forwarding. Based on two channel error models, a maximization problem is formulated to jointly design the robust beamforming and the power splitting ratio while satisfying the minimum data rate for the far user and the successfully decoding requirement for the information of the far user at the near user. For the worst case design under the deterministic error model, the successive convex approximation and the semidefinite relaxation technique are utilized to approximate the non-convex problem to an iterative convex problem. For the outage-constrained design under the stochastic error model, Bernstein-type inequality-based and large deviation inequality-based approaches are used to safely approximate the probabilistic constraints of the inner-level problem to the deterministic constraints, and a golden section search algorithm is employed to find out the optimal single variable of the outer-level problem. Furthermore, the rank proof is provided to prove that the relaxation is tight. [ABSTRACT FROM AUTHOR]

To improve the secrecy performance of the untrusted relay system with a multiple-antenna destination, a novel full-duplex destination jamming scheme with optimal antenna selection (FDJ-OAS) is proposed in this paper. The approximate closed-form expressions of the average achievable secrecy rate are derived for the proposed scheme. To attain more insightful results, the approximated closed-form expressions for the average achievable secrecy rate and the optimal power allocation factor for FDJ-OAS are derived in the case with a large-scale antenna array, and simple power allocation solutions are also provided in the high and low SNR regimes, respectively. Furthermore, we derive the asymptotic expressions for the secrecy outage probability under different asymptotic conditions for the proposed scheme, and the analysis results indicate that the secrecy diversity order of FDJ-OAS is significantly superior to that of the comparable schemes. Simulation results show that the analytical curves match well with the simulation results, and the advantage of FDJ-OAS is also clearly demonstrated through performance comparison. [ABSTRACT FROM AUTHOR]

In this correspondence paper, we investigate the problem of user scheduling in a cooperative non-orthogonal multiple access (NOMA) system consisting of a base station, a weak user, and $K$ intermediate users. During each transmission, an intermediate user is scheduled to receive its own message and forward the message destined for the weak user. For this type of cooperative NOMA system, a novel scheduling scheme is proposed to achieve full diversity and scheduling fairness simultaneously. With the consideration that all channels experience independent but non-identically distributed Rayleigh fading, outage probabilities of the weak user and the scheduled intermediate user are derived in closed-form expressions. It is theoretically shown that the proposed scheme provides full diversity for both the weak user and the scheduled intermediate user. Furthermore, theoretical results also demonstrate that the proposed scheme schedules each intermediate user with the same probability 1/ $K$ , demonstrating that scheduling fairness is also guaranteed. [ABSTRACT FROM AUTHOR]

This correspondence paper investigates relay selection (RS) schemes for cooperative downlink nonorthogonal multiple access (NOMA) networks with multiple relays. Two optimal RS schemes, termed as the two-stage weighted-max-min (WMM) and max-weighted-harmonic-mean (MWHM) schemes, are proposed for cooperative NOMA with fixed and adaptive power allocations (PAs) at the relays, respectively. Then, the outage probabilities of the two proposed RS schemes are analyzed, and their diversity gains are also determined. The provided simulation results show that the proposed optimal two-stage WMM and MWHM schemes outperform the existing suboptimal RS schemes for cooperative NOMA networks with fixed and adaptive PAs at the relays, respectively. [ABSTRACT FROM AUTHOR]

In this paper, an efficient transmission scheme, termed the joint antenna selection and data exchange (AS-DE) scheme, is proposed for a two-way amplify-and-forward relaying network, where two single-antenna source terminals exchange information via a multiantenna relay station. For the proposed scheme, the best antenna at the relay for each source terminal is first selected separately, following the max–max scheme. Then, from the set of the previously selected antennas, either one antenna is selected, in a similar fashion as well-known max–min and max–sum schemes, or two antennas exchange their respective received signals, which are then coded, amplified, and broadcasted to the source and destination terminals. Tight lower and upper bounds on the outage probability (OP) for the proposed scheme have been derived assuming independent and identically distributed Rayleigh fading channels. Furthermore, our analysis reveals that the proposed joint AS-DE scheme can achieve full diversity. Finally, it is shown that under the same resource constraints, i.e., in terms of the number of the utilized time slots and transmit power, the proposed joint AS-DE scheme outperforms the max–min, the max–sum, and the max–max schemes. Extensive numerical results accompanied with computer simulations, are further provided to validate the developed analytical results. [ABSTRACT FROM PUBLISHER]

Interrelay interference (IRI) is known to degrade the performance of virtual full-duplex (FD) relaying schemes. Although interference avoidance and cancelation strategies have been proposed in the existing literature, most studies reflect the traditional information theoretical viewpoint of interference as a degrading factor on information decoding (ID). However, from energy harvesting (EH) perspective, the IRI could be beneficial. This motivates the study of simultaneous wireless information and power transfer in decode-and-forward multiple input multiple output virtual FD relaying system, where the IRI serves as an additional source of energy to the relay. To manage the degrading effect of the IRI on the ID receiver, transmit antenna selection is proposed at the relay. In addition, precoding matrices that optimize the ID and EH receivers are jointly designed. The simulated results show that although IRI could be a degrading factor from the information viewpoint, it can be properly managed and exploited for EH at the relay while maintaining the end-to-end data rate. In addition, the results show that the end-to-end information rate and harvested energy can be simultaneously achieved using the proposed precoders. [ABSTRACT FROM AUTHOR]

In this paper, we consider non-orthogonal multiple access (NOMA) relaying networks, where one base station communicates with two mobile users with the aid of multiple relays. We propose a two-stage relay selection strategy for NOMA networks with decode-and-forward (DF) and amplify-and-forward (AF) relaying protocols with different quality of service requirements at the users, respectively. Then, the outage probabilities of the NOMA two-stage DF and AF schemes are obtained in closed-form expressions, and the diversity order is determined based on their asymptotic expressions at high signal-to-noise ratio. Both of the developed analytical results and carried out computer simulations show that NOMA two-stage DF (AF) relaying is superior to existing relay selection strategies developed for cooperative NOMA and orthogonal multiple access networks. [ABSTRACT FROM PUBLISHER]

This paper studies the secrecy rate maximization problem of a secure wireless communication system in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this nonconvexity, the achievable secrecy rate is approximated for a given power allocation at the jammers, and the approximated problem is formulated into a geometric programming one. Based on this approximation, an iterative algorithm has been developed to obtain the optimal power allocation at the jammers. Next, we provide a bisection approach, based on 1-D search, to validate the optimality of the proposed algorithm. In addition, by assuming Rayleigh fading, the secrecy outage probability (SOP) of the proposed cooperative jamming scheme is analyzed. More specifically, a single-integral form expression for the SOP is derived for the most general case, as well as a closed-form expression for the special case of two cooperative jammers and one eavesdropper. Simulation results have been provided to validate the convergence and the optimality of the proposed algorithm, as well as the theoretical derivations of the presented SOP analysis. [ABSTRACT FROM AUTHOR]

This paper proposes a novel non-orthogonal multiple access (NOMA)-based cooperative transmission scheme for a spectrum-sharing cognitive radio network (CRN), whereby a secondary transmitter (ST) serves as a relay and helps transmit the primary and secondary messages simultaneously by employing NOMA signaling. This cooperation is particularly useful when the ST has good channel conditions to a primary receiver but lacks the radio spectrum. To evaluate the performance of the proposed scheme, the outage probability and system throughput for the primary and secondary networks are derived in closed forms. Simulation results demonstrate the superior performance gains for both networks thanks to the use of the proposed NOMA-based cooperative transmission scheme. It is also revealed that NOMA outperforms conventional orthogonal multiple access (OMA) and achieves better spectrum utilization. [ABSTRACT FROM AUTHOR]

In this paper, we consider a cooperative simultaneous wireless information and power transfer (SWIPT) network with one source–destination pair and multiple energy harvesting relays. How to efficiently use these relays has been addressed in conventional cooperative networks, and this paper investigates the impact of SWIPT on the performance of such multirelay cooperative networks. In particular, the main contribution of this paper is that a closed-form expression of the outage probability achieved by the multirelay cooperative protocol is obtained, as well as its approximation at high SNR. In addition, the performance of the cooperative network with the SWIPT relays is compared with that in conventional systems with self-powered relays. [ABSTRACT FROM PUBLISHER]

In this paper, we consider underlay cognitive radio (CR) networks with one primary receiver, one cognitive transmitter–receiver pair, and one energy harvesting relay. The transmission power of the secondary source is opportunistically determined by its interference to the primary receiver, and the relay transmission is powered by the energy harvested from the radio-frequency observations at the relay. For the considered CR networks with simultaneous wireless information and power transfer (SWIPT), we derive analytical expressions for the outage probability, as well as their high signal-to-noise ratio (SNR) approximations in closed form. The developed analytical results demonstrate that the use of SWIPT will not cause any loss in diversity gain, but the outage probability achieved by the SWIPT-CR scheme asymptotically decays as \log \mboxSNR/\mboxSNR, whereas a decaying rate of \mbox1/\mboxSNR is achieved by a conventional CR network. Computer simulation results are also provided to demonstrate the accuracy of the presented analysis. [ABSTRACT FROM AUTHOR]

In this paper, a cognitive-radio-inspired asymmetric network coding (CR-AsNC) scheme is proposed for multiple-input–multiple-output (MIMO) cellular transmissions, where information exchange among users and base-station (BS) broadcasting can be accomplished simultaneously. The key idea is to apply the concept of cognitive radio (CR) in network coding transmissions, where the BS tries sending new information while helping users' transmissions as a relay. In particular, we design an asymmetric network coding method for information exchange between the BS and the users, although many existing works consider the design of network coding in symmetric scenarios. To approach the optimal performance, an iterative precoding design for CR-AsNC is first developed. Then, a channel-diagonalization-based precoding design with low complexity is proposed, to which power allocation can be optimized with a closed-form solution. The simulation results show that the proposed CR-AsNC scheme with precoding optimization can significantly improve system transmission performance. [ABSTRACT FROM PUBLISHER]

In delay-tolerant networks (DTNs), stable end-to-end connections do not always exist. Messages are forwarded, assisted by the mobility of nodes, in a store–carry–forward paradigm. The mobility of nodes in most DTNs has a certain statistical regularity; thus, using historical information in DTNs to compute the delivery quality of nodes can help to select good forwarding nodes. This paper aims to establish a routing scheme based on multihop delivery quality, which is designed to reduce the energy consumption of message forwarding while maintaining a high delivery rate. We characterized the multihop delivery quality of each node with an expected delay and an expected probability, parameterized by the remaining hop count. Based on these two quality metrics, we developed two algorithms, namely, the delay-inferred forwarding (DIF) algorithm and the probability-inferred forwarding (PIF) algorithm. The basic idea of DIF and PIF is to find the optimal forwarding path by minimizing the expected delay and by maximizing the expected probability, respectively, in the hop graph that is defined in this paper. We performed extensive trace-driven simulations to compare our algorithm to other representative routing algorithms using several real traces. We observed the following: 1) Compared with the delegation algorithm, which uses one-hop delivery quality, both DIF and PIF significantly improve the message delivery rate, and they yield more improvements as the mobility of nodes becomes more regular; and 2) compared with the state-of-the-art optimal opportunistic forwarding (OOF) algorithm, which also uses a multihop delivery quality, DIF and PIF have significantly smaller forwarding overhead (with the maximum reduction in the number of forwarding being over 40%), whereas they are quite close to OOF in terms of both delivery rate and average delay. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a denoise-and-forward network coding (DNF-NC) transmission scheme for its applications in two-way relay multiple-input and multiple-output (MIMO) systems. We first consider a scenario with a single pair of source nodes, and minimum mean square error (MMSE) receiver is applied at each node. The global optimal precoding design based on the mean square error (MSE) criterion can be achieved by solving two independent convex optimization problems. To achieve a better tradeoff between performance and complexity, an alternative power optimization approach is proposed using a channel diagonalization technique. Then, we proceed to considering a more challenging bidirectional communication scenario with multiple pairs of source nodes. With intrapair coordination at the sources, we modify DNF-NC by employing a signal alignment technique to combat interpair interference. The numerical results demonstrate that the proposed DNF-NC schemes can significantly improve bit error rate (BER) performance in both two scenarios, and such performance gains can be achieved with relatively low computational complexity. [ABSTRACT FROM PUBLISHER]

In this paper, we first propose a new cooperative multiple-access transmission protocol by utilizing the cooperation among the sources and external relays. The impact of linear detection methods on the reception reliability is then investigated, whereas many existing works rely on the ideal theoretic criterion, i.e., the capacity region of the multiple-access channel. Analytical results are developed to show that, for a scenario with K users and K relays, the proposed scheme can ensure a minimal diversity gain of (K + \1) achievable for all users, whereas conventional approaches can only achieve a diversity gain of 1. Numerical results are also provided to demonstrate the performance of the proposed protocol. [ABSTRACT FROM PUBLISHER]

In this paper, we study how to improve wireless security for bidirectional communications. For the scenario with single-antenna nodes, effective criteria for relay and jamming node selection are developed to ensure that the probability to have nonzero secrecy rates is approaching one, given sufficient relays. For the scenario with multiple-antenna nodes, effective precoding is proposed to ensure that the mutual information obtained at the eavesdropper decreases to zero when there is a sufficient number of relays. [ABSTRACT FROM PUBLISHER]

In this correspondence, we investigate a two-phase two-way relay protocol for a scenario without channel coding or channel estimation. The considered configuration represents practical sensor networks, where the nodes wish to exchange some low-rate messages (e.g., 1 bit) via a shared relay under strict complexity or latency constraint (corresponding to our assumptions of no-coding and no-channel estimation). A new scheme that incorporates single-threshold noncoherent energy detection and a digital network coding process at the relay node is proposed. Energy detection is optimized for both phases of the protocol, and a threshold that exhibits no error floors is derived in closed form. Numerical results validate the efficiency of the proposed scheme and introduce the two-way relay channel as an efficient structure for noncoherent and uncoded systems as well. [ABSTRACT FROM PUBLISHER]

We consider multiple-input–multiple-output (MIMO) two-way relaying channels where a pair of multiantenna users wishes to exchange information with the help of a nonregenerative multiantenna relay. A low-complexity joint beamforming and power management scheme is proposed. The proposed beamformers first align the channel matrices of the user pair and then decompose the aligned channel into parallel subchannels. Two power management issues, i.e., power allocation and power control, are addressed in this paper. First, sum-rate optimizing power allocation is proposed to allocate power between all subchannels and nodes. Second, quality of service (QoS) satisfying power control is proposed to minimize the total transmission power in the network. Simulation results justify that the proposed joint beamforming and power management scheme delivers better sum-rate performance or consumes lower transmission power when compared with existing schemes. [ABSTRACT FROM PUBLISHER]

In this paper, we first study the design of network coding for the generalized multiple-input–multiple-output (MIMO) Y channels, where K users wish to exchange information with each other within two time slots. Precoding at each user and the relay is carefully constructed to ensure that the signals from the same user pair are grouped together and that cross-pair interference can be canceled. In addition, a simple mapping function is proposed to ensure low-complexity detection at the relay. Exact expressions of symbol error rate (SER) are then developed to establish the explicit relationship between the diversity gain and the number of node antennas. Monte Carlo simulation is also provided to demonstrate the performance of the proposed scheme. [ABSTRACT FROM PUBLISHER]

In multiple-input–single-output (MISO) broadcast channels, the achievable diversity gain is limited by the number of source transmitter antennas. Cooperative transmission is able to provide another dimension of diversity gain improvement. In this paper, we introduce a spectrally efficient cooperative transmission protocol in MISO broadcast channels using linear precoding and nonorthogonal relaying. The proposed protocol can achieve maximum diversity gain expressed as the sum of the number of source transmitter antennas and the number of available relays. The diversity and multiplexing tradeoff of the proposed protocol outperforms the noncooperative scheme, even when only a single relay is used. For a large number of relay candidates, the diversity and multiplexing tradeoff of the proposed protocol completely surpasses the existing noncooperative scheme. [ABSTRACT FROM PUBLISHER]

Cooperative diversity has been recognized as an effective and low-cost technique to combat multipath fading and enhance transmission reliability. Motivated by the fact that many existing cooperative protocols suffer some loss of ergodic capacity, network coding, which is a technique that is well known for its capability to increase system throughput, is proposed in this paper to be combined with cooperative diversity for uplink transmissions. Two kinds of information-theoretic metrics, i.e., outage and ergodic capacities, are developed for the proposed transmission scheme to assist with performance evaluation. The developed analytic results, which are shown to fit well with Monte Carlo simulation, demonstrate that the proposed protocol can achieve better system robustness and larger system throughput simultaneously than comparable schemes. The application of the proposed transmission protocol to scheduling is also studied to achieve better fairness–throughput tradeoff. [ABSTRACT FROM PUBLISHER]