Efficient Algorithm for Power Allocation in Relay-based Cognitive Radio Network

This paper addresses a cognitive radio (CR) network scenario where a relay is assigned to mitigate interference to primary users (PUs). We develop an average probability of successful secondary transmission (PSST) to introduce relay in the CR network. The power allocation is done using dual domain concept to maximize the system throughput as well as maintaining interference to an acceptable level and this approach is implemented in our paper that has a higher convergence rate. Furthermore, we propose an alternative approach that maintains a high throughput and at the same time reduces the computational complexity significantly. A detailed analysis is done before simulation. The simulated results validate the theoretical analysis

Power Management in MIMO Ad Hoc Networks: A Game-Theoretic Approach

Abstract-This paper considers interference characterization and management in wireless ad hoc networks using MIMO techniques. The power allocation in each link is built into a non-cooperative game where a utility function is identified and maximized. Due to poor channel conditions, some links have very low data transmission rates even though their transmit powers are high. Therefore, a mechanism for shutting down links is proposed in order to reduce cochannel interference and improve energy efficiency. The multiuser water-filling and the gradient projection methods are compared with the proposed game theoretic approach in terms of system capacity and energy efficiency. It is shown that using the proposed method with the link shut-down mechanism allows the MIMO ad hoc network to achieve the highest energy efficiency and the highest system capacity

A game-theoretic approach to power management in MIMO-OFDM ad hoc networks

With the increasing demand for wireless services, the efficient use of spectral resources is of great importance. MIMO-OFDM communication systems hold great promise in using radio spectrum efficiently while power control will improve energy efficiency. Existing approaches such as multiuser water-filling and gradient projection assign a fixed transmit power to each link and each transmitter node allocates power among different antennas in order to optimize the link capacity or sum data rate. If bad channel conditions exist in some communicating links, these methods are not energy efficient.We propose a new technique for power management and interference reduction based upon a game theoretic approach. Utility functions are designed and power allocation in each link is built into a non-cooperative game. To avoid unnecessary power transmission under poor channel conditions, a mechanism of shutting down inefficient links is integrated into the game theoretic approach. Two kinds of link shut-down mechanism are presented in this dissertation. The first one is called hard shut-down, because once the transmit node decides to shut down, the node will not resume transmission no matter how the interfering channels change. The other mechanism is called soft shut-down, in which the transmit power is related to the pricing factor of that link and the interference it is exposed to. With this mechanism, the transmit power can change adaptively in response to the condition of interference.We also investigate the problem of subcarrier assignment and power distribution among multiple antennas for point-to-point links in a network without base stations. A subcarrier assignment scheme is proposed which selects a set of subcarriers for each link so that high data rate can be achieved and co-channel interference can be mitigated. The power management in a MIMO-OFDM ad hoc network is also built into a non-cooperative game in which each link calculates its optimal power allocation vector in order to maximize the net utility. The designed utility function facilitates subcarrier assignment schemes by using a tunable pricing factor, which helps a link to admit or drop subcarriers in a soft and adaptive fashion.Ph.D., Electrical Engineering -- Drexel University, 200