Abstract

The need for smart and sustainable communication systems has led to the development of mobile communication networks. In turn, the vast functionalities of the global system of mobile communication (GSM) have resulted in a growing number of subscribers. As the number of users increases, the need for efficient and effective planning of the “limited” frequency spectrum of the GSM is inevitable, particularly in densely-populated areas. As such, there are ongoing discussions about frequency (channel) allocation methods to resolve the challenges of channel allocation, which is a complete NP (Nondeterministic Polynomial time) problem. In this paper, we propose an algorithm for channel allocation which takes into account soft constraints (co-channel interference and adjacent channel interference). By using the Manhattan distance concept, this study shows that the formulation of the algorithm is correct and in line with results in the literature. Hence, the Manhattan distance concept may be useful in other scheduling and optimization problems. Furthermore, this unique concept makes it possible to develop a more sustainable telecommunication system with ease of connectivity among users, even when several subscribers are on a common frequency.

Highlights

  • Due to its vast functions, the global system of the mobile communication (GSM) cellular network has experienced a rapid increase in the number of subscribers

  • We propose an algorithm for channel allocation which takes into account soft constraints

  • By using the Manhattan distance concept, this study shows that the formulation of the algorithm is correct and in line with results in the literature

Read more

Summary

Introduction

Due to its vast functions, the global system of the mobile communication (GSM) cellular network has experienced a rapid increase in the number of subscribers. In GSM technology, the allocation or assignment of planning frequency is crucial in the modern telecommunication regime. This is useful at the system commencement phase, and at later stages of network modification or expansion, which should cater for high levels of interference and mass usage, among other factors [4,5,6]. Definition 4: A coloring algorithm, L(h,k), labels integers that are greater than 0 to the vertex U in a manner that allows neighboring nodes to be color-labeled and to be separated by at least a distance h; the same applies to the vertices (distance 2), which are color-labeled and separated by at least a distance k This coloring algorithm reduces the differences between the most and the least used colors, i.e., the span σh, k(U).

Related Works
MeDthefiodnition 7
Design of Channel Group Allocation
Method for Calculating the Reuse Distance
Time Complexity for Selected Algorithms
Conclusion
Conclusions
Future Work
Full Text
Published version (Free)

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