Efficient Mobile Network Planning Algorithm in the Presence of Obstacles

Abstract

The size and complexity of today's mobile networks is continuously growing, and with it the cost of planning and operating these networks. Network planning and engineering have to reach a delicate balance between cost, network performance, and up-time of business critical services. With this rapid development in mobile network we need effective network planning tool to satisfy the need of customers. However, deciding upon the optimum placement for the base stations to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks by modified the original density-based Spatial Clustering of Applications with Noise algorithm. The density-based Spatial Clustering of Applications with Noise original algorithm has been modified and a new algorithm Clustering Density Base in Presence of Obstacles has been proposed by the authors to solve the problem of obstructs in Mobile Network Planning. Implementation of this algorithm to a real case study is presented. Results demonstrate the effectiveness and flexibility of the modifying algorithm in tackling the important problems of mobile network planning.