Distributed Optimal Cell Provisioning in Heterogeneous Wireless Mobile Networks
Young Ha Hwang, Sungkee Noh, Byung Ho Chung, Sang‐Ha Kim · 2006
Guaranteeing a handoff dropping probability below a predetermined threshold is essential for wireless mobile networks. In wireless mobile networks, previous researches for admission control policies and resource allocation algorithm have considered QoS (quality of service) only in terms of CDP (call dropping probability). Some recent researches have proposed admission control policies considering resource utilization and CBP (call blocking probability), However, since QoS has been considered only within predetermined cell capacity, the result has been a serious overload problem of system not guaranteeing both CDP and CBP constraints, especially, in the hot-spot cell. That is why there is a close interrelationship among CDP, CBP and cell capacity. In this paper, we suggest a distributed optimal cell provisioning scheme guaranteeing both CDP and CBP in long-term perspective. The cell provisioning scheme is performed by using both two-dimensional continuous-time Markov chain and an iterative method called Gauss-Seidel method. Numerical and simulation results demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints.