Khoa Tran Phan

Spectrum Sharing in Wireless Networks via QoS-Aware Secondary Multicast Beamforming

Secondary spectrum usage has the potential to considerably increase spectrum utilization. In this paper, quality-of-service (QoS)-aware spectrum underlay of a secondary multicast network is considered. A multiantenna secondary access point (AP) is used for multicast (common information) transmission to a number of secondary single-antenna receivers. The idea is that beamforming can be used to steer power towards the secondary receivers while limiting sidelobes that cause interference to primary receivers. Various optimal formulations of beamforming are proposed, motivated by different ldquocohabitationrdquo scenarios, including robust designs that are applicable with inaccurate or limited channel state information at the secondary AP. These formulations are NP-hard computational problems; yet it is shown how convex approximation-based multicast beamforming tools (originally developed without regard to primary interference constraints) can be adapted to work in a spectrum underlay context. Extensive simulation results demonstrate the effectiveness of the proposed approaches and provide insights on the tradeoffs between different design criteria.

Power allocation in wireless multi-user relay networks

In this paper, we consider an amplify-and-forward wireless relay system where multiple source nodes communicate with their corresponding destination nodes with the help of relay nodes. Conventionally, each relay equally distributes the available resources to its relayed sources. This approach is clearly sub-optimal since each user experiences dissimilar channel conditions, and thus, demands different amount of allocated resources to meet its quality-of-service (QoS) request. Therefore, this paper presents novel power allocation schemes to i) maximize the minimum signal-to-noise ratio among all users; ii) minimize the maximum transmit power over all sources; iii) maximize the network throughput. Moreover, due to limited power, it may be impossible to satisfy the QoS requirement for every user. Consequently, an admission control algorithm should first be carried out to maximize the number of users possibly served. Then, optimal power allocation is performed. Although the joint optimal admission control and power allocation problem is combinatorially hard, we develop an effective heuristic algorithm with significantly reduced complexity. Even though theoretically sub-optimal, it performs remarkably well. The proposed power allocation problems are formulated using geometric programming (GP), a well-studied class of nonlinear and nonconvex optimization. Since a GP problem is readily transformed into an equivalent convex optimization problem, optimal solution can be obtained efficiently. Numerical results demonstrate the effectiveness of our proposed approach.

On the capacity of Rayleigh fading cooperative systems under adaptive transmission

In this letter, the use of adaptive source transmission with amplify-and-forward relaying is proposed. Three different adaptive techniques are considered: (i) optimal simultaneous power and rate adaptation; (ii) constant power with optimal rate adaptation; (iii) channel inversion with fixed rate. The capacity upper bounds of these adaptive protocols are derived for the amplify-and-forward cooperative system over both independent and identically distributed (i.i.d.) Rayleigh fading and non-i.i.d. Rayleigh fading environments. The capacity analysis is based on an upper bound on the effective received signal-to-noise ratio (SNR). The tightness of the upper bound is validated by the use of a lower bound and by Monte Carlo simulation. It is shown that at high SNR the optimal simultaneous power and rate adaptation and the optimal rate adaptation with constant power provide roughly the same capacity. Channel inversion is shown to suffer from a deterioration in capacity relative to the other adaptive techniques.

Performance Analysis of Adaptive M-QAM for Rayleigh Fading Cooperative Systems

The use of constant-power, rate-adaptive M-QAM transmission with an amplify-and-forward cooperative system is proposed. The upper bound expressions are derived for the outage probability, achievable spectral efficiency, and error rate performance for the amplify-and-forward cooperative system over both independent and identically distributed (i.i.d.) and non-i.i.d. Rayleigh fading environments. The analysis is based on an accurate upper bound on the total effective signal-to- noise ratio SNR at the destination. Adaptive continuous rate M-QAM achieves a capacity that comes within a constant gap of the Shannon capacity of the channel, but adaptive discrete rate M-QAM suffers additional performance penalties.

Joint Power Allocation and Relay Selection in Cooperative Networks

In this paper, we study the joint power allocation and relay selection problem for multi-user amplify-and-forward (AF) cooperative networks. To increase the systems spectral efficiency under the orthogonal transmission assumption, each source-destination pair is constrained to be assisted by a small subset of a set of available relays. The aim of this work is to establish a framework that determines which relays to help which users and with how much power. In particular, we propose the joint schemes under two design criteria: i) maximization of user rates, and ii) minimization of the total transmit power at the relays. As the original problem formulations are shown to be nonconvex integer optimization problems, and thus, are combinatorially hard, we also propose an efficient convex relaxation approach to solve the problems with low complexity. Numerical results demonstrate the effectiveness of the proposed approaches.

Capacity Analysis for Transmit Antenna Selection Using Orthogonal Space-Time Block Codes

Antenna selection for multiple-input multiple-output (MIMO) where only a subset of antennas at the transmitter and/or receiver are activated for signal transmission is a practical technique for the realization of full diversity. Despite extensive research, closed-form capacity expressions for MIMO systems employing transmit antenna selection (TAS) and orthogonal space-time block codes (OSTBCs) are not available. We thus derive the exact closed-form capacity expressions when an OSTBC is employed and N transmit antennas out of total Lt antennas are selected for transmission. The expressions are valid for a frequency-flat Rayleigh fading MIMO channel and avoid numerical integration methods

Centralized and Distributed Power Allocation in Multi-User Wireless Relay Networks

Optimal power allocation for multi-user amplify-and-forward wireless relay networks in which multiple source-destination pairs are assisted by a set of relays is investigated. Two relay power allocation strategies based on maximization of either i) the minimum rate among all users or ii) the weighted sum of rates are developed. A distributed implementation of the maximum weighted-sum-rate power allocation strategy is also studied. Numerical results demonstrate the efficiency of the proposed strategies and reveal their interesting throughput-fairness tradeoff in resource allocation.

Power allocation and admission control in multiuser relay networks via convex programming: centralized and distributed schemes

The power allocation problem for multiuser wireless networks is considered under the assumption of amplify-and-forward cooperative diversity. Specifically, optimal centralized and distributed power allocation strategies with and without minimum rate requirements are proposed. We make the following contributions. First, power allocation strategies are developed to maximize either (i) the minimum rate among all users or (ii) the weighted-sum of rates. These two strategies achieve different throughput and fairness tradeoffs which can be chosen by network operators depending on their offering services. Second, the distributed implementation of the weighted-sum of rates maximization-based power allocation is proposed. Third, we consider the case when the requesting users have minimum rate requirements, which may not be all satisfied due to the limited-power relays. Consequently, admission control is needed to select the number of users for further optimal power allocation. As such a joint optimal admission control and power allocation problem is combinatorially hard, a heuristic-based suboptimal algorithm with significantly reduced complexity and remarkably good performance is developed. Numerical results demonstrate the effectiveness of the proposed approaches and reveal interesting throughput-fairness tradeoff in resource allocation.

Network Lifetime Maximization With Node Admission in Wireless Multimedia Sensor Networks

Wireless multimedia sensor networks (WMSNs) are expected to support multimedia services such as delivery of video and audio streams. However, due to the relatively stringent quality-of-service (QoS) requirements of multimedia services (e.g., high transmission rates and timely delivery) and the limited wireless resources, it is possible that not all the potential sensor nodes can be admitted into the network. Thus, node admission is essential for WMSNs, which is the target of this paper. Specifically, we aim at the node admission and its interaction with power allocation and link scheduling. A cross-layer design is presented as a two-stage optimization problem, where at the first stage the number of admitted sensor nodes is maximized, and at the second stage the network lifetime is maximized. Interestingly, it is proved that the two-stage optimization problem can be converted to a one-stage optimization problem with a more compact and concise mathematical form. Numerical results demonstrate the effectiveness of the two-stage and one-stage optimization frameworks.

Precoder Design for Space-Time Coded Systems Over Correlated Rayleigh Fading Channels Using Convex Optimization

A class of computationally efficient linear precoders for space-time block coded multiple-input multiple-output wireless systems is derived based on the minimization of the exact symbol error rate (SER) and its upper bound. Both correlations at the transmitter and receiver are assumed to be present, and only statistical channel state information in the form of the transmit and receive correlation matrices is assumed to be available at the transmitter. The convexity of the design based on SER minimization is established and exploited. The advantage of the developed technique is its low complexity. We also find various relationships of the proposed designs to the existing precoding techniques, and derive very simple closed-form precoders for special cases such as two or three receive antennas and constant receive correlation. The numerical simulations illustrate the excellent SER performance of the proposed precoders.