The need to meet the demands of subscribers of wireless services is imperative to Global System for Mobile (GSM) Communication companies. These demands which evolves round maintenance of good network coverage, reduction in service costs and improved Quality of Service (QoS) depends largely on the nature of cellular network masts hoisting. The existing optimization model however, do not handle hoisting of cellular network masts for small size populated areas effectively as a result of insufficient solution space and thus, suffers from poor network coverage. To overcome this challenge, Greedy Algorithm model was proposed. Object Oriented Analysis and Design Methodology (OOADM) was deployed and the proposed model was developed using Java programming language. A comparative analysis between the developed model and Genetic Algorithm was carried out with an aim of determining the best optimization technique for small size populated areas. The statistical results were significant in all the tests performed. The analysis of the results shows that Greedy Algorithm performed better than Genetic Algorithm in optimizing cellular network masts hoisting for small populated areas. Therefore, with this model, optimization of cellular network mast hoisting for small size populated area will be more accurate and hence, more reliable.

Greedy Algorithm (GR) ; Genetic Algorithm (GA) ; Mast; Optimization; Coverage

[1] T. D`Roza, G. Bilchev, “An overview of location-based services”, BT Technology Journal, Vol. 21, pp. 20-27, 2003.
[2] V. F. O’Flaherty, “The Legal Landscape When a Tower Collapses”, Journal of the Missouri Bar, Vol. 57, 2001.
[3] R. Haupt, S. Haupt, “Practical Genetic Algorithm” 2nd edition, John Wiley & Sons, publication, USA, ISBN 0-417-45565-2, 2004.
[4] Zunia, “The Knowledge Exchange”, 2011.
[5] Mastsanity, “Mast Sanity Quick Guide To Mobile Phone Masts”, Registered UK Charity no: 1109757, 2008.
[6] S. Davood, M. Mahnam, A.S. Nookabadi, “An efficient approach to discrete Multiple Different Facility Location Problem,” Service Operations and Logistics and Informatics, In the proceedings of 2008 IEEE International Conference, Vol.2, pp2519, 2524, 2008.
[7.] Ren et al., “Bilevel Simulated Annealing Algorithm for Facility Location Problem” In the proceedings of the 2008 Information Management, Innovation Management and Industrial Engineering. ICII International Conference, Vol.3, pp 17,22, 2008.
[8] K. Rakesh, M.S. Bhuvan, S. Chamarti, P. Bhat, M. Jothish and K. Annappa, “Algorithmic Approach for Strategic Cell Tower Placement”, In the proceedings of the 2014 Fifth International Conference on Intelligent Systems, Modelling and Simulation, 2014.
[9] C. Ming-Tsung, T. Shian-Shyong, “A genetic algorithm for multicast routing under delay constraint in WDM network with different light splitting”, Journal of Information Science and Engineering, Vol. 21, pp 85–108, 2005.
[10] J. Hubaux, S. Znaty: In K. Terplan, P. Morreale., “The Telecommunications Handbook”, CRC Press LLC, 2000.
[11] International Journal Of Advanced Research in Computer and Communication Engineering Vol.2, Issue 12, 2013.
[12] M. Michael, “Voronoi Diagrams”, The Mathematics Enthusiast: Vol 1: No2, p.44-55, 2004.
[13] L. Snyman,” Practical Mathematical Optimization: An Introduction to Basic Optimization theory and Classical and New Gradient-Based Algorithms”, Springer Science & Business Media, 2005.
[14] Szabó Gábor Vilmos,”Optimization Problems in Mobile Communication”, 2005.
[15] A. Okabe, B. Boots, K. Sugihara & S.N. Chiu, “Spatial Tessellations – Concepts and Applications of Voronoi Diagrams”, John Wiley publisher, 2nd edition., 2000.