Efficient Frequency Grouping Algorithms for iDEN
Independent thesis Basic level (professional degree)Student thesis
This Master’s Thesis deals with a special problem that may be of importance when planning a frequency hopping mobile communication network. In normal cases the Frequency Assignment Problem is solved, in order to plan the use of frequencies in a network. The special case discussed in this thesis occurs when the network operator requires that the frequencies must be arranged into groups. In this case the Frequency Assignment Problem must be solved with respect to the groups, i.e. a Group assignment Problem.
The thesis constitutes the final part of the Master of Science in Communication and Transport Systems Engineering education, at Linköping University, Campus Norrköping. The Group Arrangement Problem was presented by ComOpt, a company that has specialized in solving the Frequency Assignment Problem for network operators.
This thesis does not deal with solutions for the Frequency Assignment Problem, with respect to the groups. The main issue in the thesis is to construct a computer based algorithm that solves the Group Arrangement Problem, i.e. creating the groups. The goal is to construct an algorithm that creates groups which imply a better solution for the Frequency Assignment Problem than manually created groups.
Two algorithms are presented and tested on two cases. Their respective results for both cases are compared with the results from a manual grouping. The two computer based algorithms creates better groups than the manual grouping strategy, according to an artificial quality measure. As of spring 2003 a variant of one of the presented algorithms was implemented in ComOpt’s product for solving the Frequency Assignment Problem.
Place, publisher, year, edition, pages
Institutionen för teknik och naturvetenskap , 2003. , 65 p.
Technology, Telecommunication, iDEN, Frequency Assignment Problem, FAP, heuristics
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-2094ISRN: LITH-ITN-KTS-EX--03/020--SEOAI: oai:DiVA.org:liu-2094DiVA: diva2:19423