Abstract
This article deals with the frequency assignment problem (FAP) in slow frequency hopping (GSM) networks, a generalization of the classical FAP. Due to symmetry in the solutions, a natural integer linear programming formulation does not yield a good solution procedure. Instead, we decompose the co-channel and adjacent channel interference minimization and develop a two-stage algorithm. The co-channel optimization problem is solved with a column generation model, whereas the second stage is solved by a cutting plane approach. Computational experiments reveal, that although no optimal solutions can be guaranteed, the approach provides promising results, both regarding practical applicability and further research potential.
Highlights
Mobile communication, as a key aspect of modern society, looks upon a history of success and growth
On the background of GSM technology or modified for more modern standards like WLAN, UMTS, and LTE, the settings of the classical frequency assignment problem (FAP) have commonly been accepted as an insightful point of research for questions related to FAPs
FAP focuses on the optimization of mobile communication quality by means of minimizing mutual interference between signal transceivers (TRX)
Summary
As a key aspect of modern society, looks upon a history of success and growth. On the background of GSM technology or modified for more modern standards like WLAN, UMTS, and LTE, the settings of the classical frequency assignment problem (FAP) have commonly been accepted as an insightful point of research for questions related to FAPs. FAP focuses on the optimization of mobile communication quality by means of minimizing mutual (co- and adjacent channel) interference between signal transceivers (TRX). Randomization effectively lowers the network’s signal-to-noise ratio, resulting in an increased capacity or improved transmission quality compared to non-hopping networks In the following, this problem is denoted with SFH-FAP. The amount of interference in a FAP instance on a link between two TRXs can be measured any time, but the amount of interference between two STRXs. I and J is not a fixed value any longer, due to the randomization concept of SFH. For each pair of STRXs I and J, these expected co- and adjacent channel interferences co(I, J) and ad(I, J) can be determined as follows
Sign-in/Register to view highlights & summary 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 callMore From: EURASIP Journal on Wireless Communications and Networking
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.
