Relay selection and nonlinear energy harvesting in full-duplex multi-relay cooperative network

Energy harvesting (EH) is a promising technique to extend the lifetime energy-constrained devices in wireless networks. This paper analyses the significance of relay selection and non-linear EH in evaluating the performance of Full-duplex (FD) decode-and-forward (DF) multi-relay cooperative network. The relay selection is considered under three scenarios based on channel state information (CSI) availability. We compare the EH performance of a hybrid power-time-splitting (PTS)-based non-linear energy harvester with time-spitting (TS) and power-splitting (PS) EH at the relay node. We derive the expression of outage probability (OP) of FD DF multi-relay cooperative network over independent and identically distributed Rayleigh fading channels. Numerical results show that the outage performance of the system is significantly enhanced by deploying an ideal relay selection scheme. This paper also gives insights about the combined effect of saturation threshold of non-linear EH and residual self-interference (RSI) on the system performance. Unlike linear EH systems, the non-linear EH causes the outage floor even when the RSI is significantly small. The response of the system is also analysed for the impact of TS and PS ratios. Furthermore, we also investigate the system’s performance in terms of other system parameters like the number of relays and data transfer rate. Monte Carlo simulations are used to verify the analytical expressions.     

Deep reinforcement learning based relaying for buffer-aided cooperative communications

The advances in deep reinforcement learning (DRL) have shown a great potential in solving physical layer-related communication problems. This paper investigates DRL for the relay selection in buffer-aided (BA) cooperative networks. The capability of DRL in handling highly-dimensional problems with large state and action spaces paves the way for exploring additional degrees-of-freedom by relaxing the restrictive assumptions around which conventional cooperative networks are usually designed. This direction is examined in our work by advising and analyzing advanced DRL-based BA relaying strategies that can cope with a variety of setups in multifaceted cooperative networks. In particular, we advise novel BA relaying strategies for both parallel-relaying and serial-relaying systems. For parallel-relaying systems, we investigate the added value of merging packets at the relays and of activating the inter-relay links. For serial-relaying (multi-hop) systems, we explore the improvements that can be reaped by merging packets and by allowing for the simultaneous activation of sufficiently-spaced hops. Simulation results demonstrate the capability of DRL-based BA relaying in achieving substantial improvements in the network throughput while the adequate design of the reward/punishment in the learning process ensures fast convergence speeds.     

Performance of two-hop infrastructure based multi-antenna regenerative relaying in Rayleigh fading channel

Cooperative relaying is considered as an effective technique to enlarge the coverage area and enhance the system capacity for the future wireless systems. In this paper, an infrastructure based multi-antenna cooperative relay network has been investigated. Closed form expressions of outage probability and average error rate have been derived, when the relay and the destination perform selection combining of the signals. The relay is assumed to operate in the adaptive decode and forward mode. The effect of number of antennas installed on the relay and their placement has also been studied.     

Performance Analysis and Optimization of a Cooperative Transmission Protocol in NOMA-Assisted Cognitive Radio Networks with Discrete Energy Harvesting

In this paper, we propose a spectrum-sharing protocol for a cooperative cognitive radio network based on non-orthogonal multiple access technology, where the base station (BS) transmits the superimposed signal to the primary user and secondary user with/without the assistance of a relay station (RS) by adopting the decode-and-forward technique. RS performs discrete-time energy harvesting for opportunistically cooperative transmission. If the RS harvests sufficient energy, the system performs cooperative transmission; otherwise, the system performs direct transmission. Moreover, the outage probabilities and outage capacities of both primary and secondary systems are analyzed, and the corresponding closed-form expressions are derived. In addition, one optimization problem is formulated, where our objective is to maximize the energy efficiency of the secondary system while ensuring that of the primary system exceeds or equals a threshold value. A joint optimization algorithm of power allocation at BS and RS is considered to solve the optimization problem and to realize a mutual improvement in the performance of energy efficiency for both the primary and secondary systems. The simulation results demonstrate the validity of the analysis results and prove that the proposed transmission scheme has a higher energy efficiency than the direct transmission scheme and the transmission scheme with simultaneous wireless information and power transfer technology.     

CEAR: A cooperation based energy aware reward scheme for next generation green cognitive radio networks

Cognitive Radio (CR) networks are envisioned as a key empowering technology of the fifth-generation (5G) wireless communication networks, which solves the major issues of 5G, like high-speed data transmission, seamless connectivity, and increased demand for mobile data. Another significant characteristic of the 5G network is green communications, as energy consumption from the communication field is predicted to rise remarkably by the year 2030. In this work, we are concerned about energy-related issues and propose a cooperation-based energy-aware reward scheme (CEAR) for next-generation green CR networks. The proposed CEAR scheme is based on the antenna and temporal diversity of the primary users (PUs). For providing the service to the PUs, the users of another network called cognitive users (CUs) work as a cooperative relay node, and, in return, they get more spectrum access opportunities as a reward from the primary network. The CUs with delay-tolerant data packets take a cooperative decision by recognizing the availability and traffic load of PUs, channel state information, and data transmission requirements. We utilize the optimal stopping protocol for solving the decision-making problem and use the backward induction method to obtain the optimal cooperative solution. The simulation results reveal notable enhancements in energy efficiency (EE) of CUs compared with other cooperative schemes. The proposed CEAR scheme is more energy-efficient for ultra-dense network deployment because results show that the CU’s EE, spectral efficiency (SE), and throughput improved with the increase of PUs.     

Ergodic mutual information of OFDMA-based Selection-Decode-and-Forward cooperative relay networks with imperfect CSI

This paper presents a novel approach to investigate ergodic mutual information of OFDMA Selection-Decode-and-Forward (SDF) cooperative relay networks with imperfect channel state information (CSI). Relay stations are either dedicated or non-dedicated (i.e., subscriber stations assisting other subscriber stations). The CSI imperfection is modeled as an additive random variable with known statistics. Numerical evaluations and simulations demonstrate that by considering the CSI imperfection based on a priori knowledge of the estimation error statistics, a substantial gain can be achieved in terms of ergodic mutual information which makes channel adaptive schemes closer to practical implementations.     

Power allocation for cognitive underlay networks with spectrum band selection

In this paper, we study the cooperative communication of a cognitive underlay network by utilizing the diversity of multiple spectrum bands. In particular, we assume that the transmission power of the secondary user (SU) is subject to different joint constraints, such as peak interference power of the multiple primary users (PUs), peak transmission power of the SU, outage tolerate interference, and outage probability threshold. Accordingly, two power allocation schemes are considered on the basis of the minimum interference channel from the SU to the PU and the channel state information of the primary user link. Furthermore, the SU can select one of the three transmission modes following the channel state conditions, namely as cellular, device-to-device, or switching mode, to transmit the signal to the secondary user receiver. Given this setting, two power allocation schemes over a spectrum band selection strategy are derived. In addition, closed-form expressions for the outage probability of three modes are also obtained to evaluate the performance of the secondary network. Most importantly, a closed-form expression for the peak interference power level of the PU, which is considered as one of the most important parameters to control the SU’s transmission power, is derived by investigating the relation of two considered power allocation schemes in the practise. Finally, numerical examples show that the outage performance of secondary network in the switching mode outperforms the one of the cellular and device-to-device (D2D) mode for all considered power allocation schemes.     

Outage probability and ergodic capacity analysis of satellite–terrestrial NOMA system with mixed RF/mmWave relaying

This paper investigates the performance of hybrid radio frequency/millimeter wave (RF/mmWave) satellite–terrestrial relay network with non-orthogonal multiple access (NOMA) scheme. In particular, the satellite network operates at the Ka-band while the mmWave band is adopted at decode-and-forward (DF) relay–destination link. The blockage effect in mmWave communication is considered to deduce the ordered probability density function (PDF) of the user equipment (UE) distance. However, the randomness of the UEs’ location and the random beamforming design cause the difficulty of the performance analysis. Herein, we provide a closed-form approximation for the outage probability. Moreover, the system diversity order is derived from the asymptotic expressions of the outage probability at high signal-to-noise ratio (SNR) slopes. Besides, approximate ergodic capacity performances of the multi-UEs are evaluated with numerical integration. Simulations are applied to demonstrate the accuracy of the theoretical analysis and show that the performance of the ordered selection NOMA scheme outperforms the orthogonal multiple access scheme and random selection scheme.     

Outage Performance Analysis of NOMA in Wireless Powered Cognitive Radio Networks with AF and DF Relaying Techniques

Improving spectral efficiency under a certain energy limitation is an important design metric for future wireless communications as a response to the growing transmission demand of wireless devices. In order to improve spectral efficiency for communication systems without increasing energy consumption, this paper considers a non-orthogonal multiple access (NOMA)–based cognitive radio network, with the assistance of a wireless-powered relay station (RS), and then analyzes the system outage performance under amplified-and-forward (AF) and decoded-and-forward (DF) cooperative transmission modes. Specifically, the base station (BS) has the opportunity to cooperate by transmitting information through the RS, depending on whether the RS can harvest sufficient RF energy for cooperative transmission. That is to say, when the energy stored by the RS is sufficient for cooperative transmission, the RS will assist the BS to forward information; otherwise, the BS will send information through direct links, while the RS converts the radio frequency (RF) signals sent by the BS into energy for future transmission. Moreover, the transmission power required by the RS for cooperative transmission is usually relatively large, while the amount of harvested energy by the RS in a transmission slot is usually low, so it takes several consecutive time slots to accumulate enough transmission energy. To this end, we utilize a discrete-time Markov chain to describe the processes of charging and discharging of the RS. Subsequently, we derive the closed-form outage probabilities of both the primary and secondary systems for the considered system in AF and DF modes through mathematical analysis, and verify the accuracy of the analyses through Monte Carlo simulation. The simulation results show that the two proposed cooperative transmission schemes with AF and DF relaying techniques outperform both direct transmission and other similar schemes in both the primary and secondary system, while the DF scheme can provide better performance than the AF scheme within the range of setting values.     

Cooperative diversity performance of selection relaying over correlated shadowing

The study of relaying systems has found renewed interest in the context of cooperative diversity for communication channels suffering from fading. In particular, dual-hop relaying with diversity combining of the relayed and direct path at the receiver has practical importance and can be considered as a building block for forming larger communication systems. This paper presents novel analytical expressions and numerical results on cooperative diversity performance using selection relaying over correlated lognormal channels for both SC and MRC techniques at the receiver. In addition, an exact framework for comparing the performance and efficiency of the medium access protocol and relay capabilities (TDMA/half-duplex, SDMA/full-duplex) is proposed. Finally, based on the analysis and novel mathematical expressions for the outage probability, we investigate the impact of the lognormal parameters (including correlation) on the cooperative system performance and its efficiency.     

Social-aware relay selection and energy-efficient resource allocation for relay-aided D2D communication

How to improve the flexibility of limited communication resources to meet the increasing requirements of data services has become one of the research hotspots of the modern wireless communication network. In this paper, a novel social-aware motivated relay selection method is put forward to allocate the energy efficiency (EE) resources for the device-to-device (D2D) communication. To improve system flexibility, a D2D user is selected to act as a relay named D2D-relay instead of the traditional cellular relay. The optimal relay selection strategy is formulated by searching the maximum trust value that is obtained by assessing the link stability and social connections between two users. Then, the resource allocation problem, which turns out to be a mixed-integer nonlinear fractional programming (MINLFP) problem, is solved by maximizing the total EE under physical constraint and social constraint synthetically. To improve the solution efficiency, a novel iterative algorithm is proposed by integrating the Dinkelbach theory and Lagrange dual decomposition method. Simulation results demonstrate the effectiveness of the proposed scheme. Compared with the existing social-blind and social-aware schemes, it significantly improves the probability of successful relay selection and total EE of the D2D pairs.     

Joint MMSE designs for analog network coding and different MIMO relaying schemes: A unified approach and performance benchmarks

To gain understanding of the analog network coding and different MIMO relaying schemes and to facilitate the scheme selection, there is a need for a unified approach and performance benchmarks. In this paper, analog network coding, direct transmission, Two-Hop relaying, and cooperative relaying schemes are analyzed and compared. A unified approach, the novel generalized iterative approach, is proposed for jointly designing the MMSE MIMO processors (including precoders, relay processors and decoders) for these schemes. Numerical results show that for each scheme, there exist system and channel parameter regime(s) where it is the most desirable among the four schemes. Performance benchmarks, physical insights and some guidelines for MIMO relaying scheme selection are presented.     

Analysis and performance of network decoding strategies for cooperative network coding

In this work, we present two new low-complexity network decoding strategies for cooperative network coding in a multiple-access relay channel scenario. For these two strategies, Selection and Soft Combining and Majority Vote Network Decoding, along with the optimal joint network decoding, we derive expressions for bit error probability performance as a function of the signal-to-noise ratio (SNR) of the different Rayleigh fading links, and show the tightness of the derived bounds through simulation results. The two proposed schemes provide a similar bit error probability (BEP) performance compared to the optimal scheme, while having significantly lower complexity. Further, we study the effect of user pairing on the error performance by considering different SNRs on the user and relay links towards the destination. It is also shown that the error performance of the different schemes follows the same trend for a given user pairing strategy.     

Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks

A cooperative protocol for wireless mesh networks is proposed in this paper. The protocol implements both on-demand relaying and a selection of the best relay terminal so only one terminal is relaying the source message when cooperation is needed. Two additional features are also proposed. The best relay is selected with a splitting algorithm. This approach allows fast relay selection within less than three time-slots, on average. Moreover, a pre-selection of relay candidates is performed prior to the splitting algorithm. Only terminals that are able to improve the direct path are pre-selected. So efficient cooperation is now guaranteed. We prove that this approach is optimal in terms of diversity-multiplexing trade-off. The protocol has been designed in the context of Nakagami-m fading channels. Simulation results show that the performance of the splitting algorithm does not depend on channel statistics.     

Network selection algorithm based on link quality parameters for heterogeneous wireless networks

Next generation wireless networks consist of heterogeneous access technologies. In order to provide global ubiquitous communication, it is required to provide a framework in which user can move across multiple access interfaces while maintaining its ongoing communication at perceived quality of service. Given the scenario of multiple access networks, it is further required to select the optimum network out of multiple candidate networks to meet the requirements of the ongoing session. The selection of optimum network in such heterogeneous environment is generally based on network conditions and user preference. In this paper, we propose an algorithm for network selection based on averaged received signal strength, outage probability and distance. The proposed algorithm comprises of two stages. Assuming that network conditions are dominant in network selection, in first stage, overlapping region is identified through distance estimation. Network selection algorithm based on averaged received signal strength plus outage is invoked in second stage to select the optimum network. Numerical results are obtained through a simulation model of two disparate networks – GSM and UMTS. It has been shown that the proposed algorithm offers 68% improved performance in terms of network selection rate.     

Outage performance of CoMP-CNOMA networks with duplex mode selection

This paper investigates the outage performance of a downlink coordinated multipoint cooperative non-orthogonal multiple access (CoMP-CNOMA) network, where two near users cooperatively relay the information to a far user. It is assumed that the near users support both the half-duplex relaying mode and the full-duplex relaying mode. Since the full-duplex mode may be inferior to the half-duplex mode due to the residual self-interference under the full-duplex mode, we propose a duplex mode selection strategy for the near users to dynamically choose the duplex mode for relaying. Under the proposed duplex mode selection strategy, the closed form expressions for the outage probabilities of all the users are derived. The theoretical results match well with the Monte Carlo simulations. It is shown that the proposed duplex mode selection strategy can provide low outage probabilities of all the users simultaneously, while the existing duplex mode selection strategies either achieve higher outage probabilities of all the users or achieve slightly better outage performance of the far user at the sacrifice of much worse outage performance of the near users.     

无线传感器网络的分布式竞争路由算法

在WSNs体系结构中,路由算法是网络层的关键,分簇技术在路由算法中可提高WSNs的扩展性。提出一种竞争簇头,非均匀分簇和多跳路由相结合的WSNs 分布式竞争路由算法(DSA)．它的核心是构建一个高效的非均匀分簇算法,通过竞争的方式候选簇头,靠近基站的簇头为簇间的数据转发预留能量,根据节点的剩余能量、簇内和簇间通信代价,每个簇头在邻居簇头集中用贪心法确定中继节点,仿真表明,DSA算法能有效平衡了簇头的能耗、均衡了网络能耗、显著延长网络生存周期。     

Chance-constrained resource allocation for cognitive wireless-powered backscatter communication networks

With the rapid development of the Internet of Things (IoT) and the increasing number of wireless nodes, the problems of scare spectrum and energy supply of nodes have become main issues. To achieve green IoT techniques and resolve the challenge of wireless power supply, wireless-powered backscatter communication as a promising transmission paradigm has been concerned by many scholars. In wireless-powered backscatter communication networks, the passive backscatter nodes can harvest the ambient radio frequency signals for the devices’ wireless charging and also reflect some information signals to the information receiver in a low-power-consumption way. To balance the relationship between the amount of energy harvesting and the amount of information rate, resource allocation is a key technique in wireless-powered backscatter communication networks. However, most of the current resource allocation algorithms assume available perfect channel state information and limited spectrum resource, it is impractical for actual backscatter systems due to the impact of channel delays, the nonlinearity of hardware circuits and quantization errors that may increase the possibility of outage probability. To this end, we investigate a robust resource allocation problem to improve system robustness and spectrum efficiency in a cognitive wireless-powered backscatter communication network, where secondary transmitters can work at the backscattering transmission mode and the harvest-then-transmit mode by a time division multiple access manner. The total throughput of the secondary users is maximized by jointly optimizing the transmission time, the transmit power, and the reflection coefficients of secondary transmitters under the constraints on the throughput outage probability of the users. To tackle the non-convex problem, we design a robust resource allocation algorithm to obtain the optimal solution by using the proper variable substitution method and Lagrange dual theory. Simulation results verify the effectiveness of the proposed algorithm in terms of lower outage probabilities.     

URLLC-oriented secure communication for UAV relay-assisted network

In this paper, we investigate the unmanned aerial vehicle (UAV) relay-assisted secure short packet communication. The UAV acts as a decode-and-forward relay to transmit control signals from the source to the actuators in the presence of a ground eavesdropper (EV) whose imperfect channel state information is available at the UAV. Specially, non-orthogonal multiple access is adopted in our work to achieve more connections and improve the fairness of communication and the short packets are employed for data transmission to reduce the latency. Explicitly, we maximize the minimum average secrecy throughput among all actuators by jointly optimizing the UAV trajectory, transmit power and blocklength allocation, which generates a challenging optimization problem. Therefore, we propose an iterative algorithm based on block coordinate descent method and successive convex approximation technique to handle the non-convex problem. Numerical results show that the proposed scheme has better performance compared to the benchmark schemes.     

Wireless transmission using cooperation on demand

Mobile users with single antennas can still take advantage of spatial diversity through repetition based cooperative transmission. In this paper, we consider a scheme in which the cooperation is triggered only if the source–destination channel is of an unacceptable quality. Therefore, the destination selects one relay out of a decoding set of relays for cooperation. We analyze the end-to-end outage probability in slow and fast fading environments and we evaluate the usefulness of relaying when the source acts blindly and ignores the decision of the selected relay whether it may cooperate or not. The performance in both environments are evaluated through analysis and simulations in terms of end-to-end outage probability and the number of active relays. Some selected performance results show that some selected computer simulation based results coincide with our analytical results.