An important feature of the traffic in mobile networks is burstiness. Drawbacks of conventional power control algorithms for time division duplex （TDD）-code division multiple access （CDMA） systems are analyzed. A ...An important feature of the traffic in mobile networks is burstiness. Drawbacks of conventional power control algorithms for time division duplex （TDD）-code division multiple access （CDMA） systems are analyzed. A joint power control algorithm based on service factor is presented to address the TDD-CDMA mobile services in the burst mode according to the Markov modulated Bernoulli process. The joint power control equation is derived. A function model is developed to verify the new algorithm and evaluate its performance. Simulation results show that the new power control algorithm can estimate interference strength more precisely, speed up convergence of power control, and enhance power efficiency and system capacity. It is shown that the proposed algorithm is more robust against link gain changes, and outperforms the reference algorithms.展开更多
基金Project supported by the National Science Foundation for Creative Research Groups （Grant No.60521002）, and the National Key Technologies R＆D Program （Grant No.2005BA908B02）
文摘An important feature of the traffic in mobile networks is burstiness. Drawbacks of conventional power control algorithms for time division duplex （TDD）-code division multiple access （CDMA） systems are analyzed. A joint power control algorithm based on service factor is presented to address the TDD-CDMA mobile services in the burst mode according to the Markov modulated Bernoulli process. The joint power control equation is derived. A function model is developed to verify the new algorithm and evaluate its performance. Simulation results show that the new power control algorithm can estimate interference strength more precisely, speed up convergence of power control, and enhance power efficiency and system capacity. It is shown that the proposed algorithm is more robust against link gain changes, and outperforms the reference algorithms.
