This thesis consists of two studies on joint bandwidth and power allocation strategy for wireless communication networks. In the first study, joint bandwidth and power allocation strategy is proposed for wireless multi-user networks without relaying and with decode-and-forward relaying. It is shown that the formulated resource allocation problems are convex and, thus, can be solved efficiently. Admission control problem based on the joint bandwidth and power allocation strategy is further considered, and a greedy search algorithm is developed for solving it efficiently. In the second study, joint bandwidth and power allocation strategy is presented for maximizing the sum ergodic capacity of secondary users under fading channels in cognitive radio networks. Optimal bandwidth allocation is derived in closed-form for any given power allocation. Then the structures of optimal power allocations are derived. Using these structures, efficient algorithms are developed for finding the optimal power allocations. / Communications

This thesis studies the subcarrier power allocation for the relayed signal in Orthogonal Frequency-Division Multiplexing (OFDM) based dual-hop system where the relay node operated in amplify-and-forward (AF) scheme. The investigated system assumes that each subcarrier at the source node transmits the signal with uniform power distribution. Considering the separated sum power constraints which the power constraint at source and relay node are uncorrelated, the conventional iterative water-filling algorithm can maximize the system capacity. However, it requires high computational complexity and the performance improvement is limited when the source node transmits the signal with uniform power distribution, subcarrier power allocation at relay node for capacity maximization is impractical. To further enhance the system performance, a novel subcarrier power allocation method is derived into a closed-form for the relayed signal to minimize the summation of equivalent noise power of the destination node. Comparing with the existing schemes, simulation results demonstrate that the proposed power scaling scheme significantly improves system average bit error rate (ABER).

ITC/USA 2014 Conference Proceedings / The Fiftieth Annual International Telemetering Conference and Technical Exhibition / October 20-23, 2014 / Town and Country Resort & Convention Center, San Diego, CA / In this work we evaluated the performance of different water filling algorithms. We have selected four power allocation algorithms: Conventional water-filling (CWF), Constant power water-filling, Inverse Water-filling (IWF), and Adaptive Iterative Water-Filling (AIWF) algorithms. Capacity is the performance metric we used to compare the above algorithms by taking the optimality of transmission power allocation to each sub-channel into account. The power allocation can be calculated with a reference of the water level value that has different approaches for different algorithms. The water level can either be fixed once it is found, or it may be adaptive or different for different sub-channels. Hence, the results show that the adaptive iterative water filling (AIWF) algorithm has a better effect on the performance of MIMO-OFDM system by allocating power adaptively.

No description available.

Recent research results have shown that the MIMO wireless communication architecture is a promising approach to achieve high bandwidth efficiencies. MIMO wireless channels can be simply defined as a link for which both the transmitting and receiving ends are equipped with multiple antenna elements. Adaptive modulation and power allocation could be used to further improve the performance of MIMO systems. This thesis focuses on developing a fast and high performance power allocation algorithm. Three power allocation algorithms are proposed in this thesis and their performances are compared in various system sizes and transceiver architectures. Among the three algorithms proposed in this thesis, the fast algorithm may be considered as the best power allocation algorithm since the performance of the fast algorithm is almost as good as the fullsearch (optimal)algorithm and the mean processing time is considerably less than the fullsearch algorithm. The fast algorithm achieves about 97.6% agreement with the optimal throughput on average. In addition, the time taken to find the power scaling factors using the fullsearch algorithm is about 2300 times longer than the processing time of the fast algorithm in a 6 x 6 system when the SNR is 20dB. As an extension to the power allocation process, excess power allocation methods are introduced. Excess power is the unused power during the power allocation process. The power allocation algorithm allocates power to each received SNR to maximize the throughput of the system whereas the excesspower allocation distributes the excess power to each SNR to improve both the instantaneous and temporal behavior of the system. Five different excess power allocation methods are proposed in this thesis. These methods were simulated in the Rayleigh fading channel with different Doppler frequencies, fD = 10Hz,50Hz and 100Hz, where the ACF of the channel coefficients are given by the Jakes' model. The equal BER improvement method showed a slightly better performance than the other methods. The equal BER improvement method enables the system to maintain the power scaling factors without sacrificing QoS for 19.6 ms on average when the maximum Doppler shift is 10Hz.

<p>In order to be competitive with emerging mobile systems and to satisfy the ever growing request for higher data rates, the 3G consortium, 3rd Generation Partnership Project (3GPP), is currently developing concepts for a long term evolution (LTE) of the 3G standard. The LTE-concept at Ericsson is based on Orthogonal Frequency Division Multiplexing (OFDM) as downlink air interface. OFDM enables the use of frequency domain link adaptation to select the most appropriate transmission parameters according to current channel conditions, in order to maximize the throughput and maintain the delay at a desired level. The purpose of this thesis work is to study, implement and evaluate different link adaptation algorithms. The main focus is on modulation adaptation, where the differences in performance between time domain and frequency domain adaptation are investigated. The simulations made in this thesis are made with a simulator developed at Ericsson. Simulations show in general that the cell throughput is enhanced by an average of 3% when using frequency domain modulation adaptation. When using the implemented frequency domain power allocation algorithm, a gain of 23-36% in average is seen in the users 5th percentile throughput. It should be noted that the simulations use a realistic web traffic model, which makes the channel quality estimation (CQE) difficult. The CQE has great impact on the performance of frequency domain adaptation. Throughput improvements are expected when using an improved CQE or interference avoidance schemes. The gains with frequency domain adaptation shown in this thesis work may be too small to motivate the extra signalling overhead required. The complexity of the implemented frequency domain power allocation algorithm is also very high compared to the performance enhancement seen.</p>

Cognitive radio (CR) is a novel wireless communication approach that may alleviate the looming spectrum-shortage crisis. Orthogonal frequency division multiplexing (OFDM) is an attractive modulation candidate for CR systems. In this thesis, we study resource allocation (RA) for OFDM-based CR systems using both aggressive and protective sharing. In aggressive sharing, cognitive radio users (CRUs) can share both non-active and active primary user (PU) bands. We develop a model that describes aggressive sharing, and formulate a corresponding multidimensional knapsack problem (MDKP). Low-complexity suboptimal RA algorithms are proposed for both single and multiple CRU systems. A simplified model is proposed which provides a faster suboptimal solution. Simulation results show that the proposed suboptimal solutions are close to optimal, and that aggressive sharing of the whole band can provide a substantial performance improvement over protective sharing, which makes use of only the non-active PU bands. Although aggressive sharing generally yields a higher spectrum-utilization efficiency than protective sharing, aggressive sharing may not be feasible in some situations. In such cases, sharing only non-active PU bands is more appropriate. When there are no fairness or quality of service (QoS) considerations among CRUs, both theoretical analysis and simulation results show that plain equal power allocation (PEPA) yields similar performance as optimal power allocation in a multiuser OFDM-based CR system. We propose a low-complexity discrete bit PEPA algorithm. To improve spectrum-utilization efficiency, while considering the time-varying nature of the available spectrum as well as the fading characteristics of wireless communication channels and providing QoS provisioning and fairness among users, this thesis introduces the following novel algorithms: (1) a distributed RA algorithm that provides both fairness and efficient spectrum usage for ad hoc systems; (2) a RA algorithm for non-real-time (NRT) services that maintains average user rates proportionally on the downlink of multiuser OFDM-based CR systems; and (3) cross-layer RA algorithms for the downlink of multiuser OFDM-based CR systems for both real-time (RT) services and mixed (RT and NRT) services. Simulation results show that the proposed algorithms provide satisfactory QoS to all supported services and perform better than existing algorithms designed for multiuser OFDM systems.

We study a wireless full-duplex network with imperfect interference cancellation and solve the routing and power allocation problem in this network. We use a model that focuses on the effects of full-duplex by including residual self-interference and one hop interference while other interfering signals are considered negligible in comparison. We first solve the optimal power allocation for a fixed route. We then propose a priority-first search algorithm to find the joint route and power allocation to maximize throughput. The algorithm proposed has a non decomposable priority metric, but is efficiently evaluated by our solution for a fixed route. We analyze the performance of our solution in a more realistic model by deriving bounds between optimal solutions in both models. Through simulations we show that, even with imperfect interference cancellation, full-duplex achieves a higher throughput than half-duplex or direct transmission for moderate transmission power.

Cooperative communication is a new class of wireless communication techniques in which wireless nodes help each other relay information and realize spatial diversity advantages in a distributed manner. This new transmission technique promises significant performance gains in terms of link reliability, spectral efficiency, system capacity, and transmission range. Analysis and design of cooperative communication wireless systems have been extensively studied over the last few years. The introduction and integration of cooperative communication in next generation wireless standards will lead to the design of an efficient and reliable fully-distributed wireless network. However, there are various technical challenges and open issues to be resolved before this promising concept becomes an integral part of the modern wireless communication devices. A common assumption in the literature on cooperative communications is the equal distribution of power among the cooperating nodes. Optimum power allocation is a key technique to realize the full potentials of relay-assisted transmission promised by the recent information-theoretic results. In this dissertation, we present a comprehensive framework for power allocation problem. We investigate the error rate performance of cooperative communication systems and further devise open-loop optimum power allocation schemes to optimize the performance. By exploiting the information about the location of cooperating nodes, we are able to demonstrate significant improvements in the system performance. In the first part of this dissertation, we consider single-relay systems with amplify-and-forward relaying. We derive upper bounds for bit error rate performance assuming various cooperation protocols and minimize them under total power constraint. In the second part, we consider a multi-relay network with decode-and-forward relaying. We propose a simple relay selection scheme for this multi-relay system to improve the throughput of the system, further optimize its performance through power allocation. Finally, we consider a multi-source multi-relay broadband cooperative network. We derive and optimize approximate symbol error rate of this OFDMA (orthogonal frequency division multiple access) system.

In order to be competitive with emerging mobile systems and to satisfy the ever growing request for higher data rates, the 3G consortium, 3rd Generation Partnership Project (3GPP), is currently developing concepts for a long term evolution (LTE) of the 3G standard. The LTE-concept at Ericsson is based on Orthogonal Frequency Division Multiplexing (OFDM) as downlink air interface. OFDM enables the use of frequency domain link adaptation to select the most appropriate transmission parameters according to current channel conditions, in order to maximize the throughput and maintain the delay at a desired level. The purpose of this thesis work is to study, implement and evaluate different link adaptation algorithms. The main focus is on modulation adaptation, where the differences in performance between time domain and frequency domain adaptation are investigated. The simulations made in this thesis are made with a simulator developed at Ericsson. Simulations show in general that the cell throughput is enhanced by an average of 3% when using frequency domain modulation adaptation. When using the implemented frequency domain power allocation algorithm, a gain of 23-36% in average is seen in the users 5th percentile throughput. It should be noted that the simulations use a realistic web traffic model, which makes the channel quality estimation (CQE) difficult. The CQE has great impact on the performance of frequency domain adaptation. Throughput improvements are expected when using an improved CQE or interference avoidance schemes. The gains with frequency domain adaptation shown in this thesis work may be too small to motivate the extra signalling overhead required. The complexity of the implemented frequency domain power allocation algorithm is also very high compared to the performance enhancement seen.