Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2010, Vol. 33 ›› Issue (3): 67-70.doi: 10.13190/jbupt.201003.67.tangl

• Papers • Previous Articles     Next Articles

Power Allocation with Max-Min and Min-Max Fairness for Relay Networks

TANG Lun1,2; CHEN Qian-bin1; YE Jian-xiong1; ZENG Xiao-ping2   

  1.    

     

    (1. Key Laboratory of Mobile Communication Technology, Chongqing University of 

    Posts and Telecommunications, Chongqing 400065, China; 

    2. College of Communication Engineering, Chongqing University, Chongqing 400044

    , China)

  • Received:2009-10-14 Revised:2010-01-18 Online:2010-06-28 Published:2010-05-14

Abstract:

To guarantee the fairness requirements of each user, we study the power allocation strategies 

based on multi-user quality of service (QoS) constraints in amplify-and-forward wireless 

relay networks, a new power allocation schemes is proposed to i) minimize the maximum 

outage probability over all users, and ii) to maximize the minimum rate under the outage 

probability and total power constraints. The power allocation schemes are formulated using 

geometric programming (GP). Since GP problem is readily transformed into an equivalent 

convex optimization problem, optimal solution can be obtained efficiently. Simulation show 

that proposed schemes can efficiently guarantee the QoS requirement.

Key words: non-regenerative relaying, power allocation, geometric programming, fairness