The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We study the energy-optimal subcarrier power allocation for OFDM-based cognitive radio (CR) networks. A CR transmitter communicates with CR receivers on a channel borrowed from licensed primary users (PUs) when PUs' transmission are detected absence on those channels. Due to non-orthogonality of the transmitted signals in the adjacent bands, both the PU and the secondary user (SU) cause mutual-interference...
In this paper, we apply the cross entropy optimization (CEO) to the problem of joint multiple relay assignment and source/relay power allocation (JMRAPA) in green cooperative cognitive radio (GCCR) networks. We use shared-band amplify and forward relaying for cooperative communication in the JMRAPA problem. The proposed JMRAPA maximizes the total rate and minimizes the greenhouse gas emissions in...
The power allocation in decode and forward (DF) relaying for cooperative cognitive radio network (CCRN) with an objective of maximizing energy efficiency (EE) is a constraint nonlinear non-convex fractional programming problem (CNNFPP). The optimization needs to satisfy the primary users interference constraints and secondary users outage constraints. We proposed the optimal power allocation in DF...
In this paper, we investigate the optimal allocation of the power in the downlink cooperative cognitive radio network using decode and forward (DF) relaying techniques. The power allocation in DF relaying for green cognitive radio with objective of maximizing energy efficiency is a constraint nonlinear non-convex fractional programming (CNNFP) problem. We present the optimal power allocation in DF...
In this paper, the problem of determining the power allocation that maximizes the energy-efficiency of cognitive radio network is investigated as a constrained fractional programming problem (CFPP). The fractional objective is defined in terms of bits per Joule per Hz. The proposed CFPP is a nonlinear non-convex optimization problem. We propose an iterative power algorithm (IPA) that guarantees ε-optimal...
In this paper we present a low-complexity Artificial Bee Colony (ABC) based interference aware relay assignment scheme with power control for a cognitive radio network comprises of one source, multiple relays and multiple destination nodes. The Exhaustive Search Algorithm (ESA) returns the optimal solution to the problem; yet it has a high computational complexity that grows exponentially with the...
In this paper, we present an interference and channel conditions aware multiple relay assignment and subcarrier allocation scheme for OFDMA based cognitive radio systems employing cooperative transmission using Decode and Forward (DF) technique. We focus on the problem of assigning the relays, the relay powers and allocating the subcarriers to the destination nodes using the sum capacity of the cognitive...
In this paper, we consider the uplink communication in a network of cognitive radio nodes. The transmitting nodes and the receiver are equipped with multiple antennas and MIMO processing abilities. For this network, we study the problem of interference-aware joint secondary user (SU) selection/scheduling and power control (JSUS-QPC). The main objective of the JSUS-QPC is to maximize the sum-rate capacity...
In this paper, we investigate interference-aware joint secondary user (SU) selection/scheduling and quantized power control (JSUS-QPC) schemes for the uplink communication in the cognitive MIMO system. The main objective of the JSUS-QPC is to maximize the sum-rate capacity of the cognitive MIMO uplink communication system under the constraint that the interference to the primary users (PU) is below...
In this paper, we present a binary particle swarm optimization (BPSO)-based low-complexity interference aware relay assignment scheme for multiple-user cognitive radio networks with discrete power control. We consider a network of cognitive radio nodes comprising single source, multiple relays and multiple destinations. For this system, we formulate an optimization problem to allocate power to source...
In this paper, we present a low-complexity power allocation scheme for non-regenerative (amplify and forward) relaying in cognitive radio systems. The main objective of the power allocation is to maximize the signal to noise ratio (SNR) at the destination under the constraint of acceptable interference to the primary users (PU). In this paper, we propose an iterative power allocation using SNR upper...
In this paper, we present two low-complexity interference aware multiple relay assignment schemes for cognitive radio systems. The main objective in assigning multiple relays is to maximize the sum capacity of the cognitive radio system under the constraint of acceptable interference to the primary users (PU). The computational complexity of finding an optimal assignment by exhaustive search grows...
In this paper, we present a low-complexity Interference Aware Multiple Relay Selection (IAMRS) scheme for cognitive radio system. The main objective in selecting multiple relays is to maximize the SNR at the destination under the constraint of acceptable interference to the primary users (PU). The computational complexity of finding an optimal IAMRS by exhaustive search grows exponentially with the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.