J4 ›› 2010, Vol. 37 ›› Issue (1): 23-27+48.doi: 10.3969/j.issn.1001-2400.2010.01.005

• Original Articles • Previous Articles     Next Articles

Near-optimal power allocation scheme based on the competitive game in the interference channel

JING Zhen-hai;BAI Bao-ming   

  1. (1. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an  710071, China;
    2. The 36th Research Institute of CETC, Jiaxing  314000, China)
  • Received:2008-12-05 Online:2010-02-20 Published:2010-03-29
  • Contact: JING Zhen-hai E-mail:jzhlxl@163.com

Abstract:

This paper considers an optimization problem of sum-rate in the Gaussian frequency-selective channel. This problem can be modeled as a competitive game model with a compensation function. We find that the compensation function can also be modeled as a game among sub-channels (called sub-channel game in this paper). In an iterative fashion, the Nash equilibrium of the sub-channel game can be reached, which is the asymptotically optimal compensation term. Stackelberg equilibrium with multiple leaders is introduced to represent the equilibrium point of the competitive game model with a compensation function. At the equilibrium point, all users operate on the optimal rate region frontier. Then, an iterative multiple water-levels water filling algorithm is proposed to efficiently reach the Stackelberg equilibrium. Simulation results show that our proposed algorithm has a significant improvement on the sum-rate compared with IWFA and exhibits the quasi-to-optimal performance.

Key words: interference channel, iterative water filling, distributed power allocation, game theory


Baidu
map