Abstract

AbstractPlanning of location area (LA) in cellular networks plays a vital role in utilizing the resources efficiently and economically. Location update and paging costs directly affect the cost to the service provider. When the size of the Mobile Switching Centre (MSC) is large, the paging cost becomes maximum. Though, no location update is required for this case. On the contrary, paging cost shoots high if each cell forms individual LA, but in this case, location update cost shoots to the maximum value. Therefore, deducing the network to the optimal amount of LA's is an intractable combinatorial optimization problem. In this paper, we intend to optimize the partitions of the MSC service area into an optimal number of LA, to curtail the total location management cost. We propose a novel scheme bearing in mind cell attributes of the network to deduce an optimum number of location areas, leading to minimum cost per call. It is revealed by the results of this work, attained after simulating the scenario on MATLAB 2018a that Cell Attributes Based Algorithm is a very promising scheme for cellular networks, and it outperforms the existing algorithms in a practical scenario.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.