Location of Repository

Frequency reassignment in cellular phone networks

By John Billingham, Robert Leese and Hannu Rajaniemi

Abstract

In cellular communications networks, cells use beacon frequencies to ensure the smooth operation of the network, for example in handling call handovers from one cell to another. These frequencies are assigned according to a frequency plan, which is updated from time to time, in response to evolving network requirements. The migration from one frequency plan to a new one proceeds in stages, governed by the network's base station controllers. Existing methods result in periods of reduced network availability or performance during the reassgnment process. The problem posed to the Study Group was to develop a dynamic reassignment algorithm for implementing a new frequency plan so that there is little or no disruption of the network's performance during the transition. This problem was naturally formulated in terms of graph colouring and an effective algorithm was developed based on a straightforward approach of search and random colouring

Topics: Information and communication technology
Year: 2006
OAI identifier: oai:generic.eprints.org:69/core70

Suggested articles

Preview

Citations

  1. (2005). [2] Computational Geometry: An Introduction,
  2. (2005). [3] Connectedness of the graph of vertex colourings, doi
  3. (2005). [3] Connectedness of the graph of vertex colourings, L.Cereceda, J.van den Heuvel and M.Johnson, doi
  4. (1998). [4] On coloring unit disk graphs, doi
  5. (1998). [4] On coloring unit disk graphs, A.Graf, M.Stumpf and G.Weissenfels, doi
  6. (2000). [5] Frequency assignment in mobile radio systems using branch-and-cut techniques, doi
  7. (2000). [5] Frequency assignment in mobile radio systems using branch-and-cut techniques, M.Fischetti, C.Lepschy, G.Minerva, G.Romanin-Jacur and E.Toto, doi
  8. (1995). [6] A very simple algorithm for estimating the number of k-colourings of a low-degree graph, doi
  9. (1995). [6] A very simple algorithm for estimating the number of k-colourings of a low-degree graph, M.Jerrum, Random Structures and Algorithms, doi
  10. (2004). [7] The Glauber dynamics on colorings of a graph with high girth and maximum degree, doi
  11. (2004). [7] The Glauber dynamics on colorings of a graph with high girth and maximum degree, M.Molloy, doi
  12. (1998). [8] Graph labelling and radio doi
  13. (1998). [8] Graph labelling and radio channel assignment, J.van den Heuvel, R.A.Leese and M.A.Shepherd, doi
  14. (1985). Theory, (3rd edition), R.Diestel, Springer-Verlag (2005). [2] Computational Geometry: An Introduction, F.P.Preparata and M.I.Shamos, Springer-Verlag

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.