TY - JOUR
T1 - Artificial intelligence-based novel scheme for location area planning in cellular networks
AU - Vimal, Vrince
AU - Singh, Teekam
AU - Qamar, Shamimul
AU - Nautiyal, Bhaskar
AU - Udham Singh, Kamred
AU - Kumar, Abhishek
N1 - Funding Information:
Authors are immensely grateful to Graphic ERA University, Dehradun, India, and Deanship of Scientific Research King Khalid University, Saudi Arabia, for the encouragement of collaborative and a real sense of research ambiance that brings this research into fruition.
Publisher Copyright:
© 2020 Wiley Periodicals LLC.
PY - 2021/8
Y1 - 2021/8
N2 - Planning 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.
AB - Planning 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.
UR - http://www.scopus.com/inward/record.url?scp=85087901113&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85087901113&partnerID=8YFLogxK
U2 - 10.1111/coin.12371
DO - 10.1111/coin.12371
M3 - Article
AN - SCOPUS:85087901113
SN - 0824-7935
VL - 37
SP - 1338
EP - 1354
JO - Computational Intelligence
JF - Computational Intelligence
IS - 3
ER -