An Adaptive Power Allocation Scheme for Performance Improvement of Cooperative SWIPT NOMA Wireless Networks

Future wireless networks demand high spectral efficiency, energy efficiency and reliability. Cooperative non-orthogonal multiple access (NOMA) with simultaneous wireless information and power transfer (SWIPT) is considered as one of the novel techniques to meet this demand. In this work, an adaptive power allocation scheme called SWIPT based adaptive power allocation (SWIPT-APA-NOMA) is proposed for a power domain NOMA network. The proposed scheme considers the receiver sensitivity of the end users while calculating the power allocation coefficients in order to prevent wastage of power allocated to user in outage and by offering priority to any one of the users to use maximum harvested power. A detailed analysis on the bit error rate (BER) performance of the proposed scheme is done and closed form expression is obtained. Simulations have been carried out with various parameters that influence the receiver sensitivity and the results show that the network achieves better outage and BER performance using the proposed scheme. It is found that the proposed scheme leads to a ten-fold decrease in transmit power for the same error performance of a fixed power allocation scheme. Further, it offers 96.06% improvement in the capacity for a cumulative noise figure and fading margin of 10 dB.     

Power control for interference mitigation by evolutionary game theory in uplink NOMA for 5G networks

The demand for mobile uplink traffic has increased significantly in the past few decades with the development of the Internet of Things (IoT) and mobile Internet. This has subsequently imposed challenges on 5G networks to provide high spectral efficiency and low-power massive connectivity. Non-orthogonal multiple access (NOMA) is a viable alternative to the current state-of-the-art orthogonal multiple access (OMA) techniques to address the challenges in 5G systems. In addition, a power control (PC) mechanism to mitigate the effect of interference between users can be accommodated to improve network performance. In this paper, we discuss the basic principles, key features, and strengths/weaknesses of the various power domain NOMA schemes. Moreover, we propose an uplink PC scheme for the users of a power domain NOMA network. The proposed PC method makes use of the evolutionary game theory (EGT) model to adaptively adjust the transmitted power level of the users which helps in mitigating user interference. A successive interference cancellation (SIC) receiver is applied at a base station (BS) in order to separate the users’ signals. By performing simulations, we show that the proposed EGT-based PC scheme achieves higher network efficiency, spectral efficiency, and energy efficiency.     

Sum Rate Maximization-based Fair Power Allocation in Downlink NOMA Networks

Non-orthogonal multiple access (NOMA) has been seen as a promising technology for 5G communication. The performance optimization of NOMA systems depends on both power allocation (PA) and user pairing (UP). Most existing researches provide sub-optimal solutions with high computational complexity for PA problem and mainly focuses on maximizing the sum rate (capacity) without considering the fairness performance. Also, the joint optimization of PA and UP needs an exhaustive search. The main contribution of this paper is the proposing of a novel capacity maximization-based fair power allocation (CMFPA) with low-complexity in downlink NOMA. Extensive investigation and analysis of the joint impact of signal to noise ratio (SNR) per subcarrier and the channel gains of the paired users on the performance of NOMA in terms of the capacity and the user fairness is presented. Next, a closed-form equation for the power allocation coefficient of CMFPA as a function of SNR, and the channel gains of the paired users is provided. In addition, to jointly optimize UP and PA in NOMA systems an efficient low-complexity UP (ELCUP) method is proposed to be incorporated with the proposed CMFPA to compromise the proposed joint resource allocation (JRA). Simulation results demonstrate that the proposed CMFPA can improve the capacity and fairness performance of existing UP methods, such as conventional UP, and random UP methods. Furthermore, the simulation results show that the proposed JRA significantly outperforms the existing schemes and gives a near-optimal performance.     

Resource Allocation for Throughput Maximization in Cognitive Radio Network with NOMA

Spectrum resources are the precious and limited natural resources. In order to improve the utilization of spectrum resources and maximize the network throughput, this paper studies the resource allocation of the downlink cognitive radio network with non-orthogonal multiple access (CRN-NOMA). NOMA, as the key technology of the fifth-generation communication (5G), can effectively increase the capacity of 5G networks. The optimization problem proposed in this paper aims to maximize the number of secondary users (SUs) accessing the system and the total throughput in the CRN-NOMA. Under the constraints of total power, minimum rate, interference and SINR, CRN-NOMA throughput is maximized by allocating optimal transmission power. First, for the situation of multiple sub-users, an adaptive optimization method is proposed to reduce the complexity of the optimization solution. Secondly, for the optimization problem of nonlinear programming, a maximization throughput optimization algorithm based on Chebyshev and convex (MTCC) for CRN-NOMA is proposed, which converts multi-objective optimization problem into single-objective optimization problem to solve. At the same time, the convergence and time complexity of the algorithm are verified. Theoretical analysis and simulation results show that the algorithm can effectively improve the system throughput. In terms of interference and throughput, the performance of the sub-optimal solution is better than that of orthogonal-frequency-division-multiple-access (OFDMA). This paper provides important insights for the research and application of NOMA in future communications.     

Fairness and throughput enhancement based resource allocation scheme for underlay cognitive radio networks

Acquiring good throughput and diminishing interference to primary users (PU) are the main objectives for secondary users in a cognitive radio (CR) network. This paper proposes a centralized subcarrier and power allocation scheme for underlay multi-user orthogonal frequency division multiplexing considering the rate loss and the interference those the PU can tolerate. The main purpose of the proposed scheme is to efficiently distribute the available subcarriers among cognitive users to enhance both the fairness and the throughput performance of the cognitive network while maintaining the QoS of primary users. Simulation results show that the proposed scheme achieves a significantly higher CR network throughput than that of the conventional interference power constraint (IPC) based schemes and provides a significantly enhanced fairness performance. Also, contrary to the conventional IPC based schemes, the proposed scheme is able to significantly increase the achieved throughput as the number of CR users increases.     

Outage Capacity Analysis for Cognitive Non-Orthogonal Multiple Access Downlink Transmissions Systems in the Presence of Channel Estimation Error

In this paper, we propose a downlink cognitive non-orthogonal multiple access (NOMA) network, where the secondary users (SUs) operate in underlay mode. In the network, secondary transmitter employs NOMA signaling for downlink transmission, and the primary user (PU) is interfered by the transmission from SU. The expressions for the outage probabilities are derived in closed-form for both primary and secondary users in the presence of channel estimation error. Numerical simulation results show that the channel estimation error and the inter-network interference cause degradation of the downlink outage performance. Also the power allocation and the location have a significant impact on the outage probability. The numerical experiments demonstrate that the analytic expressions of the outage probabilities match with the simulation results.     

A Joint Algorithm for Resource Allocation in D2D 5G Wireless Networks

With the rapid development of Internet technology, users have an increasing demand for data. The continuous popularization of traffic-intensive applications such as high-definition video, 3D visualization, and cloud computing has promoted the rapid evolution of the communications industry. In order to cope with the huge traffic demand of today’s users, 5G networks must be fast, flexible, reliable and sustainable. Based on these research backgrounds, the academic community has proposed D2D communication. The main feature of D2D communication is that it enables direct communication between devices, thereby effectively improve resource utilization and reduce the dependence on base stations, so it can effectively improve the throughput of multimedia data. One of the most considerable factor which affects the performance of D2D communication is the co-channel interference which results due to the multiplexing of multiple D2D user using the same channel resource of the cellular user. To solve this problem, this paper proposes a joint algorithm time scheduling and power control. The main idea is to effectively maximize the number of allocated resources in each scheduling period with satisfied quality of service requirements. The constraint problem is decomposed into time scheduling and power control subproblems. The power control subproblem has the characteristics of mixed-integer linear programming of NP-hard. Therefore, we proposed a gradual power control method. The time scheduling subproblem belongs to the NP-hard problem having convex-cordinality, therefore, we proposed a heuristic scheme to optimize resource allocation. Simulation results show that the proposed algorithm effectively improved the resource allocation and overcome the co-channel interference as compared with existing algorithms.     

Interference-limited resource allocation for cognitive radio in orthogonal frequency-division multiplexing networks

Efficient and fair resource allocation strategies are being extensively studied in current research in order to address the requirements of future wireless applications. A novel resource allocation scheme is developed for orthogonal frequency-division multiplexing (OFDM) networks designed to maximise performance while limiting the received interference at each user. This received interference is in essence used as a fairness metric; moreover, by defining different interference tolerances for different sets of users, the proposed allocation scheme can be exploited in various cognitive radio scenarios. As applied to the scheme, the authors investigate a scenario where two cellular OFDM-based networks operate as primary and secondary systems in the same band, and the secondary system benefits by accessing the unused resources of the primary system if additional capacity is required. The primary system benefits either by charging the secondary system for the use of its resources or by some form of reciprocal arrangement allowing it to use the secondary system's licenced bands in a similar manner, when needed. Numerical results show our interference-limited scheduling approach to achieve excellent levels of efficiency and fairness by allocating resources more intelligently than proportional fair scheduling. A further important contribution is the application of sequential quadratic programming to solve the non-convex optimisation problems which arise in such scenarios.     

OFDM水声通信下行非正交多址接入功率分配方法研究

针对基于功率域非正交多址接入（Power Domain Non-orthogonal Multiple Accesses,PD-NOMA）的正交频分复用（Orthogonal Frequency Division Multiplexing,OFDM）水声下行通信系统的功率分配问题,提出了一种基于中断概率的功率分配方法。用户节点在系统初始化阶段根据源节点广播的组网数据包获取水声信道的统计特征,源节点根据水下用户反馈的信道特征参数建立水下用户的中断概率模型,以最小化两用户的中断概率和为目标建立目标函数,在中断概率区域边界上遍历搜索最优的功率分配系数。仿真结果表明,该方法在保证公平性的条件下,有效降低了用户节点的中断概率,提高了系统的频谱利用率和误码性能。     

Regularised multi-stage parallel interference cancellation for downlink CDMA systems

A hybrid receiver scheme for downlink code division multiple access (CDMA) systems over frequency selective channels is proposed. The proposed receiver combines a linear regularised zero forcing (RZF) equaliser and a parallel interference cancellation scheme with a tanh decision function (TPIC). It is called the RZF-TPIC receiver. The RAKE receiver is used to reduce the channel effects and obtain an initial estimate of the data. Multi-stages of TPIC are then employed to mitigate the multiple access interference (MAI). At the final stage, the RZF equaliser is used to provide a better estimate of the desired user?s data. The effect of the decision function used for symbol estimation in the PIC stage is investigated. The performance of the proposed scheme is evaluated and compared with the traditional RAKE receiver by computer simulations. It is found that the proposed scheme offers significant gains, even with a large number of interfering users.     

Fair power control for wireless ad hoc networks using game theory with pricing scheme

Resource allocation in wireless ad hoc networks is usually modelled in a non-cooperative game theoretic framework with the objective of maximising individual utility. However, the selfishness of autonomous users under such framework may lead to throughput unfairness which only benefits certain users. To alleviate this unfairness problem, the authors propose a payment-based power control scheme using game theory where each user announces a set of price coefficients that reflects different compensations paid by other users for the interference they produce. Users who generate higher interference are required to pay more by transmitting at a lower power to give other users a fairer chance of sharing the throughput.Without any incentive to play fairly, users could misbehave by broadcasting high price coefficients to force other users to transmit at a lower power. The authors treat this problem casting it into a price game which resembles a Prisoner's Dilemma game. Users who play this game iteratively will behave cooperatively and broadcast the price coefficients truthfully. Together with analytical proof, the proposed approach is shown to converge to Nash equilibrium where at this point it is able to provide a fairer throughput share among users at the expense of a slight loss in total throughput.     

Distributed algorithm for optimal sequence and power allocation in uplink code division multiple access systems

An alternative approach is presented for centralised algorithms that design optimal sequences and powers under quality of service constraints in the uplink of a code division multiple access systems. The authors propose a distributed algorithm, where each user designs its optimal codeword in such a way to transmit minimum power, based on certain feedback information sent from the base station. The authors define the user cost function, which is the user power written as a convex function of user codewords for a defined signal-to-interference plus noise ratio target. For the constrained optimisation problem, optimal codewords are designed based on feasible direction method and the optimal user powers are the minimum values of the user cost functions. For the optimal configuration, the matched filter employed at receiver will have the same performance as the minimum mean squared error filter. Even if the optimal user powers are unique, the optimal codewords do not correspond to a unique allocation, but rather to an entire class of codewords that can be related by unitary transformations. The algorithm works properly in the presence of multiple access interference with white or coloured additive noise and requires no ordering. The proposed algorithm is analysed and illustrated with numerical examples obtained from simulations.     

Energy Efficient Resource Allocation Approach for Renewable Energy Powered Heterogeneous Cellular Networks

In this paper, maximizing energy efficiency (EE) through radio resource allocation for renewable energy powered heterogeneous cellular networks (HetNet) with energy sharing, is investigated. Our goal is to maximize the network EE, conquer the instability of renewable energy sources and guarantee the fairness of users during allocating resources. We define the objective function as a sum weighted EE of all links in the HetNet. We formulate the resource allocation problem in terms of subcarrier assignment, power allocation and energy sharing, as a mixed combinatorial and non-convex optimization problem. We propose an energy efficient resource allocation scheme, including a centralized resource allocation algorithm for iterative subcarrier allocation and power allocation in which the power allocation problem is solved by analytically solving the Karush-Kuhn-Tucker (KKT) conditions of the problem and a water-filling problem thereafter and a low-complexity distributed resource allocation algorithm based on reinforcement learning (RL). Our numerical results show that both centralized and distributed algorithms converge with a few times of iterations. The numerical results also show that our proposed centralized and distributed resource allocation algorithms outperform the existing reference algorithms in terms of the network EE.     

全复用多小区系统下行链路用户调度与功率分配

对全复用多小区系统下行链路用户调度与功率分配问题进行了研究,提出了一种半分布式的用户调度与功率分配方案.首先,各小区根据自身所辖用户的信道与干扰信息,采用最大信干噪比准则进行用户调度,然后各基站将所调度用户的信息上报给中央资源控制器,最后中央资源控制器基于最速下降法的思想,采用贪婪功率分配(GPA)算法为各用户分配相应的发射功率.所提方案利用小区之间的相互协作有效地弱化了小区间干扰,与现有方法相比获得了更好的吞吐量性能和更高的功率效率.     

Adaptive opportunistic fair scheduling in power-controlled code division multiple access systems

The authors treat the multiuser scheduling problem for practical power-controlled code division multiple access (CDMA) systems under the opportunistic fair scheduling (OFS) framework. OFS is an important technique in wireless networks to achieve fair and efficient resource allocation. Power control is an effective resource management technique in CDMA systems. Given a certain user subset, the optimal power control scheme can be derived. Then the multiuser scheduling problem refers to the optimal user subset selection at each scheduling interval to maximise certain metric subject to some specific physical-layer constraints. The authors propose discrete stochastic approximation algorithms to adaptively select the user subset to maximise the instantaneous total throughput or a general utility. Both uplink and downlink scenarios are considered. They also consider the time-varying channels where the algorithm can track the time-varying optimal user subset. Simulation results to show the performance of the proposed algorithms in terms of the throughput/ utility maximisation, the fairness, the fast convergence and the tracking capability in time-varying environments are presented.     

Spectrum etiquettes for terrestrial and high-altitude platform-based cognitive radio systems

Two spectrum etiquettes are developed for the use on the downlink of coexisting high-altitude platform (HAP) and terrestrial fixed broadband systems that are intended for future application with cognitive radio-based user terminals with directional antennas. The spectrum etiquettes are based on the interference to noise ratio and carrier to interference plus noise ratio levels at the receiver of an incumbent user. Antenna beamwidths and multiple modulation scheme levels determine the parameter settings for coexistence performance. It is shown that coexistence performance can be improved by exploiting the surplus transmitter power of the terrestrial system, thereby enabling the incumbent terrestrial system to accommodate additional interference arising from a newly activated HAP system.     

Outage-constrained capacity of spectrum-sharing channels in fading environments

Cognitive radio technology has been recently proposed for sharing and utilising the spectrum in order to satisfy the increasing demands for spectrum access. In this radio technology, secondary users may be granted access to the spectrum bands occupied by a primary user as long as the interference power, inflicted on the primary receiver as an effect of the transmission of the secondary user, is deemed unharmful. In this paper the authors assume that the successful operation of the primary user requires a minimum rate to be guaranteed by its channel for a certain percentage of time and obtain the interference-power constraint that is required to be fulfilled by the secondary user. Considering the input transmit-power constraint, on average or peak power, for the secondary user, the authors investigate the capacity gains offered by this spectrum-sharing approach when only partial channel information of the link between the secondary's transmitter and primary's receiver is available to the former. In particular, the lower bounds on the capacity of a Rayleigh flat-fading channel with two different transmission techniques, namely channel inversion and optimum rate allocation with constant power transmission, are derived. Closed-form expressions for these capacity metrics are provided, and numerical simulations are conducted to corroborate the theoretical results.     

A Capacity Improving Scheme in Multi-RSUs Deployed V2I

The communication reliability and system capacity are two of the key performance indicators for Internet of Vehicles (IoV). Existing studies have proposed a variety of technologies to improve reliability and other performance, such as channel selection and power allocation in Vehicle-to-Infrastructure (V2I). However, these researches are mostly applied in a single roadside unit (RSU) scenario without considering inter-cell interference (ICI) of multi-RSUs. In this paper, considering the distribution characteristics of multi-RSUs deployment and corresponding ICI, we propose a reliable uplink transmission scheme to maximize the total capacity and decrease the interference of multi-RSUs (mRSU-DI) in condition of the uplink interruption performance. In the proposed mRSU-DI scheme, ICI is depressed by dynamic channel and power allocation algorithm. A heuristic algorithm based on penalty function is proposed to obtain the optimal power allocation solution of the model. In addition, we realize the scheme in both given conditions of channel state information (CSI) and channel state distribution, respectively. The results show that the proposed scheme can both improve the system capacity and guarantee the reliable transmission in both premises.     

A Robust Resource Allocation Scheme for Device-to-Device Communications Based on Q-Learning

One of the most effective technology for the 5G mobile communications is Device-to-device (D2D) communication which is also called terminal pass-through technology. It can directly communicate between devices under the control of a base station and does not require a base station to forward it. The advantages of applying D2D communication technology to cellular networks are: It can increase the communication system capacity, improve the system spectrum efficiency, increase the data transmission rate, and reduce the base station load. Aiming at the problem of co-channel interference between the D2D and cellular users, this paper proposes an efficient algorithm for resource allocation based on the idea of Q-learning, which creates multi-agent learners from multiple D2D users, and the system throughput is determined from the corresponding state-learning of the Q value list and the maximum Q action is obtained through dynamic power for control for D2D users. The mutual interference between the D2D users and base stations and exact channel state information is not required during the Q-learning process and symmetric data transmission mechanism is adopted. The proposed algorithm maximizes the system throughput by controlling the power of D2D users while guaranteeing the quality-of-service of the cellular users. Simulation results show that the proposed algorithm effectively improves system performance as compared with existing algorithms.     

A cooperative turbo coding scheme for wireless fading channels

A coded cooperative transmission scheme based on turbo encoding/decoding, in which only newly generated parity bits of the partner are sent if the user successfully decodes its partner's information in order to improve bandwidth efficiency is proposed. The proposed encoding structure introduces correlation between users' data over multiple frames, which offers effectively longer codes and facilitates high-performance iterative multi-user decoding at the destination. Additionally, the iterative decoding over multiple frames can provide time diversity besides spatial diversity inherent in user cooperation even for flat block fading channels. Simulation results show that the proposed scheme significantly outperforms direct transmission for the same transmitted power and bandwidth efficiency.