第三代無線通訊系統之整合式網路規劃、資源管理、與效能最佳化

CDMA-based 3G networks, especially in DS-CDMA
(direct sequence CDMA), provide more capacity
than FDMA/TDMA ones. However, 3G network planning is
also far more complex than before. Besides, to provisioning
a certain level of QoS, survivability is an important issue for
ever-growing user demands. In this report, we jointly
investigate the problems of both planning and survivability
on the design of DS-CDMA networks. The problem is
modeled as mathematical optimization formulation in terms
of deploying cost minimization. We apply Lagrangean
relaxation as a solution approach. Several algorithms are
proposed to solve the complicated problem. Based on
computational experiments, proposed algorithms are
calculated with much more improvements than other primal
heuristics. This report concludes that survivability is time-consuming
as well as expensive factor. It is suggested
separating survivability from planning problem is
appropriate, and developing another survivable only model while it is needed.