Particle Swarm Optimization Based Approach for Location Area Planning in Cellular Networks

Year 2015, Volume: 3 Issue: 2, 46 - 51, 01.04.2015

Mays Algebary

https://doi.org/10.18201/ijisae.24975

Abstract

Location area planning problem plays an important role in cellular networks because of the trade-off caused by paging and registration signalling (i.e., location update). Compromising between the location update and the paging costs is essential in order to improve the performance of the network. The trade-off between these two factors can be optimized in such a way that the total cost of paging and location update can be minimized along with the link cost. Due to the complexity of this problem, meta-heuristic techniques are often used for analysing and solving practical sized instances. In this paper, we propose an approach to solve the LA planning problem based on the Particle Swarm Optimization (PSO) algorithm. The performance of the approach is investigated and evaluated with respect to the solution quality on a range of problem instances. Moreover, experimental work demonstrated the performance comparison in terms of different degree of mobility, paging load, call traffic load, and TRX load. The performance of the proposed approach outperform other existing meta-heuristic based approaches for the most problem instances.

Keywords

Particle Swarm Optimization, Simulated Annealing Optimization, Ant Colony Optimization, Location Management in Cellular Networks, Swarm Intelligence.

References

• Author, Author, and I. El-Feghi,”Ant Colony Optimization for Location Area Planning Problem in Cellular Networks,” In the 9th International Arab Conference on Information Technology, Hammamet- Tunisia, December 16-18, 2008.
• A. Merchant and B. Sengupta, “Assignment of cells to switches in PCS networks,” IEEE/ACM Transactions on Networking 3 (5), 521–526 October, 1995.
• A. Mukherjee, S. Bandyopadhyay, and D. Saha, “Location Management and Routing in Mobile Wireless Networks, Mobile communication Series, Artech House INC., ISBN:1-58053-355-8, 2003.
• A.Quintero and S. Pierre,”Evolutionary Approach to optimize the assignment of Cells to Switches in Personal Communication Networks,” Wireless Communications Vol.26 (9) pp. 927-938, June, 2003.
• C. Hedible and S. Pierre,”A Genetic Algorithm for Assigning Cells to Switches in Personal Communication Networks,” IEEE Canadian Review 44, pp. 21–24, 2003.
• I. Demirkol, C. soy, M. Caglayun, and H. Delic, “Location Area Planning in Cellular Networks Using Simulated Annealing,” Proc. INFOCOM, pp. 566-573, March 2001.
• R. Eberhart and J. Kennedy, “A New Optimizer Using Particle Swarm Theory,” in Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39-43,1995.
• R. Fournier and S. Pierre, ”Assigning Cell to Switches in Mobile Networks using an Ant Colony Optimization heuristics,” Computer Communications28, pp. 65-73, 2005.
• J. Kennedy, R. Eberhart, “A Discrete Binary Version of the Particle Swarm Algorithm,” IEEE international conference on Systems, Man, and Cybernetics, pp. 4104 – 4108, 1997.
• Y. Chun-man, G. Bao-long, W. Xian-xiang, “Empirical Study of the Inertia Weight Particle Swarm Optimization with Constraint Factor,” International Journal of Soft Computing And Software Engineering (JSCSE) ISSN: 2251-7545 Vol.2, No2, 2012.
• K. Udgata1, U. Anuradha, G. Pavan Kumar,” Assignment of Cells to Switches in a Cellular Mobile Environment using Swarm Intelligence,” IEEE, International Conference on Information Technology (ICIT), pp. 189-194, 2008.