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 linkremoval procedure based on the convex approximation to further improve the system performance.
|Number of pages||5|
|Journal||IEEE International Conference on Communications|
|State||Published - 2003|
|Event||2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States|
Duration: May 11 2003 → May 15 2003