Newton iteration acceleration of the Nash game algorithm for power control in 3G wireless CDMA networks

Zoran Gajic, Sarah Koskie

Research output: Contribution to journalConference articlepeer-review

10 Scopus citations


In wireless communication systems, each user's signal contributes to the interference seen by the other users. Given limited available battery power, this creates a need for effective and efficient power control strategies. These strategies may be designed to achieve quality of service (QoS) or system capacity objectives, or both. We show how the power control problem is naturally suited to formulation as a noncooperative game in which users choose to trade off between signal-to-interference ratio (SIR) error and power usage. Koskie (2003) studied the static Nash game formulation of this problem. The solution obtained led to a system of nonlinear algebraic equations. In this paper we present a novel distributed power control strategy based on the Newton iteration used to solve the corresponding algebraic equations. That method accelerates the convergence of the Nash game algorithm owing to the quadratic convergence of the Newton iterations. A numerical example demonstrates the efficiency of the new algorithm.

Original languageEnglish (US)
Pages (from-to)115-121
Number of pages7
JournalProceedings of SPIE - The International Society for Optical Engineering
StatePublished - 2003
EventPerformance and Control of Next-Generation Communications Networks - Orlando, FL, United States
Duration: Sep 9 2003Sep 10 2003

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering


  • Nash equilibrium
  • Newton iterations
  • Power control
  • Wireless networks


Dive into the research topics of 'Newton iteration acceleration of the Nash game algorithm for power control in 3G wireless CDMA networks'. Together they form a unique fingerprint.

Cite this