By Topic

Simultaneous routing and power allocation in CDMA wireless data networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. Johansson ; Dept. of Signals, Sensors & Syst., R. Inst. of Technol., Stockholm, Sweden ; Lin Xiao ; S. Boyd

The optimal routing of data in a wireless network depends on the link capacities, which, in turn, are determined by the allocation of transmit powers across the network. Thus, the optimal network performance can only be achieved by simultaneous optimization of routing and power allocation. In this paper, we study this joint optimization problem in CDMA data networks using convex optimization techniques. Although link capacity constraints of CDMA systems are not jointly convex in rates and powers, we show that coordinate projections or transformations allow the simultaneous routing and power allocation problem to be formulated as (in systems with interference cancellation) or approximated by (in systems without interference cancellation) a convex optimization problem which can be solved very efficiently. We also propose a heuristic link-removal procedure based on the convex approximation to further improve the system performance.

Published in:

Communications, 2003. ICC '03. IEEE International Conference on  (Volume:1 )

Date of Conference:

11-15 May 2003