Dac-Nhuong Le

A New Ant Colony Optimization Algorithm Applied to Optimizing Centralized Wireless Access Network

Full Text (PDF, 471KB), PP.30-36

Views: 0 Downloads: 0

Author(s)

Dac-Nhuong Le ^1,*

1. Faculty of Information Technology, Haiphong University, Haiphong, Vietnam

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2014.04.03

Received: 25 May 2013 / Revised: 9 Oct. 2013 / Accepted: 17 Dec. 2013 / Published: 8 Mar. 2014

Index Terms

Wireless Access Network, Base Station, Mobile Switching Center, Ant Colony Optimization

Abstract

The wireless access networks design problem is formulated as a constrained optimization problem, where the goal is to find a network topology such that an objective function is optimized, subject to a set of constraints. The objective function may be the total cost, or some performance measure like utilization, call blocking or throughput. The constraints may be bounds on link capacities, cost elements, or some network performance measure. However, the optimization problem is too complex. In this paper, we propose a novel Ant Colony Optimization (ACO) algorithm to finding the total cost of connecting the BSs to the MSCs, and connecting the MSCs to the LE called by the optimal centralized wireless access network. Numerical results show that performance of our proposed algorithm is much better than previous studies.

Cite This Paper

Dac-Nhuong Le, "A New Ant Colony Optimization Algorithm Applied to Optimizing Centralized Wireless Access Network", International Journal of Information Technology and Computer Science(IJITCS), vol.6, no.4, pp.30-36, 2014. DOI:10.5815/ijitcs.2014.04.03

Reference

[1]Mathar, R., Niessen, T., Optimum positioning of base stations for cellular radio networks, Wireless Networks, N0.6 (2000).

[2]Schwartz, M., Computer-communication Networks, Prentice-Hall, (1977).

[3]Dac-Nhuong Le, Nhu Gia Nguyen, and Trong Vinh Le, A Novel PSO-Based Algorithm for the Optimal Location of Controllers in Wireless Networks, International Journal of Computer Science and Network Security, Vol.12 No.8,23--27 (2012).

[4]J. Kennedy and R. Eberhart, Swarm Intelligence, Morgan Kaufmann Publisher Inc (2001).

[5]K. Kraimeche, B. Kraimeche, K. Chiang, Optimization of a wireless access network (2005).

[6]Glaber, C., S. Reith, and H. Vollmer., The Complexity of Base Station Positioning in Cellular Networks. Approximation and Randomized Algorithms in Communication Networks, In Proceedings of ICALP,167--177 (2000).

[7]Galota, M., Glaber, C., Reith, S. Vollmer, H., A Polynomial-time approximation scheme for base station positioning in UMTS networks, ACM (2001).

[8]B. Krishnamachari, S.Wicker, Base station location optimization in cellular wireless networks using heuristic search algorithms, Wang, L.(Ed.), Soft Computing in Communications, Springer.

[9]Raisane, L., Whitaker, R., Hurley, S., A comparison of randomized and evolutionary approaches for optimizing base station site selection, ACM Symposium on Applied Computing (2004).

[10]M. Dorigo, V. Maniezzo, and A. Colorni, Ant system: Optimization by a colony of cooperating agents, IEEE Trans. on System, MAN, and Cybernetics-Part B, vol. 26,29-41, (1996).

[11]E. Rajo-Iglesias, O. Quevedo-Teruel, Linear Array Synthesis using an Ant Colony Optimization based Algorithm, IEEE Trans. on Antennas and Propagation (2005).

[12]M. Dorigo, M. Birattari, and T. Stitzle, Ant Colony Optimization: Artificial Ants as a Computational Intelligence Technique”, IEEE computational intelligence magazine, (2006).

[13]F. Houeto, S. Pierre, Assigning cells to switches in cellular mobile networks using taboo search, Systems, Man and Cybernetics, Part B, IEEE Transactions, vol. 32 No.3, 351—356 (2002).

[14]S. Salcedo-Sanz, and Xin Yao, A hybrid Hopfield network-genetic algorithm for the terminal assignment problem, IEEE Transaction on Systems, Man and Cybernetics. B. v34 i6. 2343—2353 (2006).

[15]S. Salcedo-Sanz, J. A. Portilla-Figueras, E. G. Ortiz-García, A. M. Pérez-Bellido, C. Thraves, A. Fernández-Anta, and X. Yao, “Optimal switch location in mobile communication networks using hybrid genetic algorithms”, Applied Soft Computing, 1486--1497 (2008).

[16]Dac-Nhuong Le, Optimizing Resource Allocation to Support QoS Requirements in Next Generation Networks using ACO Algorithm, International Journal of Computer Science and Information Technology & Security (IJCSITS), Vol.2, No.5, pp.931-938, 2012.

[17]Dac-Nhuong Le, Optimizing the cMTS to Improve Quality of Service in Next Generation Networks based on ACO Algorithm, International Journal of Computer Network and Information Security (IJCNIS), Vol.5, No.4, pp.25-30, 2013

[18]Dac-Nhuong Le, PSO and ACO Algorithms Applied to optimal Resource Allocation to Support QoS Requirements in Next Generation Networks, International Journal of Information & Network Security (IJINS), Vol.2, No.3, pp.216-228, 2013.

[19]Dac-Nhuong Le, PSO and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks, International Journal of Computer Science and Telecommunications, Vol.3 No.10, pp.1-7, 2012.

[20]Dac-Nhuong Le, Optimizing QoS Matching for Multimedia Services in Next Generation Network based on ACO Algorithm, International Journal of Information Technology and Computer Science (IJITCS), Vol.5 No.10,pp.30-38, 2013.

[21]Dac-Nhuong Le, Son Hong Ngo, and Vinh Trong Le, ACO Algorithm Applied to Multi-Objectives Optimal of Capacity Expansion in NGWN, International Journal of Wireless and Microwave Technologies (IJWMT), Vol.3 No.1, pp.37-49, 2013.

[22]Dac-Nhuong Le, Improving Genetic Algorithm to solve Multi-Objectives Optimal of Upgrading Infrastructure in NGWN, International Journal of Intelligent Systems and Applications (IJISA), Vol.5 No.12, pp.53-63, 2013.

International Journal of Information Technology and Computer Science (IJITCS)