You are on page 1of 3

ECE647 – PERFORMANCE MODELLING OF COMPUTER COMMUNICATION NETWORKS 

PROJECT PROPOSAL 

Joint Optimization of Power Allocation and Cooperation Strategy in


Wireless Cooperative Networks
Phuong Thanh Tran
ptran@purdue.edu

Abstract

In wireless communication networks, to enhance the quality of transmission, we use more than one
antenna to achieve the transmit diversity. However, wireless devices such as mobile phones cannot
have more than one antennas due to the limitation of size and complexity. Recently, cooperative
communication has been proposed to create the so-called virtual antenna systems for circumventing
this problem. This technique achieves a diversity gain by using a combination of the relayed signal
and the direct signal. There have been several researches about optimizing the power allocation at
PHY layer and scheduling at MAC layer in cooperative networks, but most of them consider these two
problems separately. In this project, I want to combine theses two problems by investigating
algorithms that jointly optimize the power allocation and the scheduling. We will use the convex
optimization theory to find the optimal solution to this problem, and confirm our analysis by some
simulation results.

I. Introduction
Perhaps one of the most important contributions to the evolution of wireless networks in recent years has been
the advent of MIMO technologies, which create the transmission diversity created by using multiple receive and
transmit antennas. It’s has been standardized in IEEE 802.16-2004 air interface [1] and IEEE 802.16e mobile
amendment [2]. Unfortunately, it’s not convenient when implementing it on the uplink mobile channel due to
the limitation of hardware size and complexity.
Idea about cooperative communications started from the work of Cover and El Gamal in 1979 [3], and then it is
described more rigorously in some papers starting from 2003 ([4] – [6]). A concise tutorial about cooperative
communications can be found in [7]. More theoretical analysis on this technique is introduced in [8]. Briefly
speaking, in cooperative communication systems, each wireless user is assumed to transmit data as well as act as
a cooperative agent for another user. The data from each user can reach the base station (BS) by at least two
ways: direct transmission to BS and relayed transmission via another user [7].
Recent researches on cooperative communications focus on the following issues: on one hand, scientists are
trying to optimize the performance of these systems subject to some constraints on the wireless resource
available, such as optimizing the power allocation at PHY layer, optimizing the scheduling mechanism at MAC
layer or optimizing the routing protocol at network layer, and so on ([9], [10], [11]); on the other hand, they are
finding some coding schemes to improve the diversity, and hence, the performance of this systems [12]. But the
research on joint optimization or cross-layer optimization is still at the beginning.
The goal of this project is investigating carefully this problem and finding the optimal solution for that, using the
tools of convex optimization theory. The work on this project follows the similar work on the MIMO-based
WiMAX network [13].
ECE647 – PERFORMANCE MODELLING OF COMPUTER COMMUNICATION NETWORKS 
II. Approach

The project will be composed of four major parts: Control Channel


system modeling, problem formulation, analysis using
convex optimization theory, and simulation.
User 1

A. System Model

Channel State
Information
We consider the uplink of a wireless CDMA network
with two mobile users (MS) for simplicity. Each user Scheduling

has a maximum transmission power limit Pmax. Base Power User 2


station (BS) transmit a pilot signal with constant Allocation
power, MS measure the channel gain based on this BASE STATION
signal and report to BS. Assume the power control is Feedback Channel
carried out perfectly. This model is similar to the
model in [9]. Fig 1. System model
The system will distributed a time interval to each user
2
for transmitting signals. Let τi be the fraction of time corresponding to user i, then ∑τ
i =1
i ≤ 1 (1)

User 1 User 2
User 1 data Idle Idle
data
User 2 User 2
Idle User 1 data Idle
data
τ1 τ2
Fig 2. Time allocation for two users
For the time interval of user i, it’s divided into 2 equal-length time slots. So there are 4 time slots in total. In the
first time slot, user 1 transmit its data, user 2 listens. In the second time slot, user 2 acts as a relay for user 1, and
user 1 is idle. In the third and fourth time slot, the role of them is reversed.
The power allocation for user i can be represented by the matrix [13]:
Pi = E[ xi .xi* ] (2)

where xi is a complex vector representing the transmitted signal of user i. The symbol (*) denotes the conjugate
transpose operation. The received signal of user i over subcarrier n is represented by the vector yi :

yi = γ i H i xi + n (3)

where n is the AWGN noise vector with zero mean and variance 1, Hi is the channel gain matrix for user i; γ i is
the SNR of user i.
B. Problem Formulation
Our purpose is maximizing the weighted sum rate of 2 users (defined in [12]), subject to the constraints of time
and power resource.
2 2
max WSR = ∑ wi Ci = ∑ wi E ⎡⎣τ i log 2 I + γ i H i PH
i
*

i ⎦ (4)
Pi ,τ
i =1 i =1
subject to: - time constraint (1)
ECE647 – PERFORMANCE MODELLING OF COMPUTER COMMUNICATION NETWORKS 

⎡ 2

- power constraint: E ⎢

∑τ Tr ( P )⎥⎦ ≤ 1
i =1
i i (5)

- rate constraint (for fairness): E ⎡τ i log 2 I + γ i H i PH *


⎤ ≥ Ri (6)
⎣ i i⎦
C. Analysis
We will show this problem is a convex optimization problem. For solving this problem, we can use the
Lagrangian dual method [14]. For simplicity, assume that the channel state information (CSI) can be estimated
perfectly and sent back to BS with no error.
D. Numerical results
For the purpose of verifying and illustrating the mathematical analysis, this project will provide some simulation
results by running MATLAB program to execute the algorithm that is found from analysis. The channel gain
matrices, which are Gaussian i.i.d complex random variables will be created and some plots about the
convergence rate of the algorithms in some different condition will be provided.
III. Expected Outcomes
The first and most significant deliverable of this project will be a procedure to determine the jointly optimal
solution for the power allocation and scheduling problem, together with the detailed proof based on theory of
convex optimization. In addition, to visually illustrate this result, some numerical results getting by running the
algorithm on computer will also be delivered (II.D).
References
[1] IEEE Standard 802.16-2004: IEEE Standard for Local and Metropolitan Area Networks – Part 16: Air
Interface for Fixed Broadband Wireless Access Systems”, Oct. 2004.
[2] IEEE Standard 802.16e-2005: IEEE Standard for Local and Metropolitan Area Networks – Part 16: Air
Interface for Fixed and Mobile Broadband Wireless Access Systems - Amendment 2: Physical and Medium
Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands”, Feb. 2006.
[3] T. M. Cover and A. A. E. Gamal, “Capacity Theorems for the Relay Channel,” IEEE Trans. Info. Theory,
vol. 25, no. 5, Sept. 1979, pp. 572–84.
[4] A. Sendonaris, E. Erkip, and B. Aazhang, “User Cooperation Diversity Part I and Part II,” IEEE Trans.
Commun., vol. 51, no. 11, Nov. 2003, pp. 1927–48.
[5] J. N. Laneman, G. W. Wornell, and D. N. C. Tse, “An Efficient Protocol for Realizing Cooperative Diversity
in Wireless Networks,” Proc. IEEE ISIT, Washington, DC, June 2001, p. 294.
[6] T. E. Hunter and A. Nosratinia, “Diversity through Coded Cooperation,” submitted to IEEE Trans. Wireless
Commun., 2004.
[7] Aria Nosratinia, Ahmadreza Hedayat, “Cooperative communications in Wireless Networks”, IEEE Comm.
Mag., Oct 2004.
[8] K.J. Ray Liu, Ahmed K. Sadek, Weifeng Su, Andres Kwasinski, “Cooperative Communications and
Networking”, Cambridge University Press, 2009.
[9] Bin Wang, Dongmei Zhao, “Optimum Power Distribution for Uplink Channel in a Cooperative Wireless
CDMA Network”, ICC2008 Proceedings.
[10] Somsak Kittipiyakul, Tara Javidi, “Relay Scheduling and Cooperative Diversity for Delay-Sensitive and
Bursty Traffic”.
[11] Zhengguo Sheng, Zhiguo Ding, Kin K Leung, D. L. Goeckel, and D. Towsley, “Error Performance Bounds
for Routing Algorithms in Wireless Cooperative Networks”, ACITA 2008.
[12] Xiaoyong Guo, Xiang-Gen Xia, “Distributed Linear Convolutive Space-Time Codes for Asynchronous
Cooperative Communication Networks”, IEEE Trans. Wireless Comm., Vol. 7, No. 5, May 2008.
[13] Jia Liu, Y. Thomas Hou, “Optimal Downlink Power Allocation and Scheduling for MIMO-based WiMAX
Access Network”, submitted to IEEE Journal on Selected Area of Communications.
[14] Stephen Boyd, Lieven Vandenberghe, “Convex Optimization”, Cambridge University Press, 2004.

You might also like