Open Access Open Access  Restricted Access Subscription or Fee Access

Optimization of Call Admission Control in Wireless Networks

S. Tamilselvan, R. Madhivanan, K.M. Rajasekaran

Abstract


Wireless network refers to any type of computer network that is wireless, and is commonly associated with a telecommunications network whose interconnections between nodes are implemented without the use of wires. To accommodate various features of wireless networks, the 2D uplink and downlink wireless CAC problems are decomposed into two independent 1D CAC. To formulate the 1D CAC optimizations, the demands of service providers and subscribers are jointly taken into consideration. To solve the optimization problem, a utility and fairness-constrained optimal revenue policy and corresponding approximation algorithm is developed. Optimal utility and optimal revenue were obtained by using fairness constrained greedy algorithm. The average revenue and the blocking probability were determined. In order to compare the performance of different traffic arrival rate the utility and fairness constrained optimal revenue algorithm has been implemented. Simulation results are presented to demonstrate the effectiveness of the proposed wireless approach.

Keywords


Call Admission Control (CAC), Optimization, Orthogonal Frequency-Division Multiple Access (OFDMA), Time-Division Duplex (TDD).

Full Text:

PDF

References


Bo Rong, Yi Qian and Kejie Lu, ―Call Admission Control Optimization in WiMAX Networks‖, IEEE Trans., Vehicular Technology, vol.57, no.4, Jun. 2009.

Vaughan Nichols S.J., ―Achieving wireless broadband with WiMAX‖. Computer. vol.37, no.6,pp. 10-13, Jun. 2008.

Altman.E, Jimenez.T, and Koole.G, ―On optimal call admission control in resource-sharing system‖, IEEE Trans., vol.49, no. 9, pp. 1659-1668, Sep. 2006.

Ross K. W and Tsang D. H. K, ―The Stochastic knapsack problem‖, IEEE Trans., Commun., vol. 37, no. 7, pp. 884-895, July 2006.

Jiang Z., Ge Y., and LiY., ―Max-utility wireless resource management for best-effort traffic‖, IEEE Trans. Wireless Commun., vol. 4, no. 1, pp. 100– 111, Jan. 2005.

Yi Qian, Kejie Lu, Hsiao-Hwa Chen and Mohsen Guizani , ―Call Admission Control Optimization in WiMAX Networks‖ IEEE Trans. on Vehicular Technology, vol. 57, no. 4, pp. 2509-2522 Jul 2008.

K.W. Ross and D. H. K. Tsang, ―The stochastic knapsack problem,‖ IEEE Trans. Commun., vol. 37, no. 7, pp. 884–895, Jul. 1989.

Altman E., Jimenez T., and Koole G., ―On optimal call admission control in resource-sharing system,‖ IEEE Trans. Commun., vol. 49, no. 9, pp. 1659–1668, Sep. 2001.

Ormeci E. L., ―Dynamic admission control in a call center with one shared and two dedicated service facilities,‖ IEEE Trans. Autom. Control, vol. 49, no. 7, pp. 1157–1161, Jul. 2004.

Koffman I. and Roman V., ―Broadband wireless access solutions based on OFDM access in IEEE 802.16,‖ IEEE Commun. Mag., vol. 40, no. 4, pp. 96–103, Apr. 2002.

Rong B., Qian Y. and Lu K., ―Integrated downlink resource management for multiserviceWiMAX networks,‖ IEEE Trans. Mobile Comput., vol. 6, no. 6, pp. 621–632, Jun. 2007.

Rong B., Qian Y., and Lu K., ―Downlink call admission control in multiservice WiMAX networks,‖ in Proc. IEEE ICC, Jun. 2007, pp. 5082–5087.

Sang A. and Li S., ―A predictability analysis of network traffic,‖ in Proc. IEEE Infocom, Mar. 26–30, 2000, pp. 342–351.

G. Song and Y. G. Li, ―Cross-layer optimization for OFDM wireless networks—Part I: Theoretical framework,‖ IEEE Trans. Wireless Commun., vol. 4, no. 2, pp. 614–624, Mar. 2005.

Kaufman J. S., ―Blocking in a shared resource environment,‖ IEEE Trans. Commun., vol. COM-29, no. 10, pp. 1474–1481, Oct. 1981.

Jiang Z., Ge Y., and Li Y., ―Max-utility wireless resource management for best-effort traffic,‖ IEEE Trans. Wireless Commun., vol. 4, no. 1, pp. 100– 111, Jan. 2005.

Hwang R. H. and Chi C. F., ―Fairness in QoS guaranteed networks communications,‖ in Proc. IEEE ICC, vol. 1, pp. 218–222, May 2003.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.