Abstract: "We present a graph-theoretic model for the frequency assignment problem in Cellular Phone Networks: Obeying several technical and legal restrictions, frequencies have to be assigned to transceivers so that interference is as small as possible. This optimization problem is NP-hard. Go...

Ausführliche Beschreibung

Bibliographische Detailangaben

Format:	Buch
Sprache:	English
Veröffentlicht:	Berlin Konrad-Zuse-Zentrum für Informationstechnik 1997
Schriftenreihe:	Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin 1997,35
Schlagworte:	Cellular telephone services industry Cellular telephone systems Cellular telephones Graph theory Mobile communication systems
Zusammenfassung:	Abstract: "We present a graph-theoretic model for the frequency assignment problem in Cellular Phone Networks: Obeying several technical and legal restrictions, frequencies have to be assigned to transceivers so that interference is as small as possible. This optimization problem is NP-hard. Good approximation cannot be guaranteed, unless P=NP. We describe several assignment heurisitcs. These heuristics are simple and not too hard to implement. We give an assessment of the heuristics' efficiency and practical usefulness. For this purpose, typical instances of frequency assignment problems with up to 4240 transceivers and 75 frequencies of a German cellular phone network operator are used. The results are satisfying from a practitioner's point of view. The best performing heuristics were integrated into a network planning system used in practice."
Beschreibung:	19 S.