magistrsko delo
Janez Dolšak (Author), Drago Bokal (Mentor), Tanja Gologranc (Co-mentor)

Abstract

Magistrsko delo obravnava problem dodeljevanja frekvenčnih kanalov v brezžičnih omrežjih. Predstavljena sta dva različna pristopa, ki sta relativno nova in zato navdihujeta raziskovanje v tej smeri. Prvi pristop je iz teorije grafov, kjer je problem zastavljen kot maksimalen k-prerez ter reševan s pomočjo semidefinitnega programiranja. Drugi pristop pa je iz teorije iger, kjer je problem zastavljen kot ordinalna potencialna igra. Na začetku je predstavljen izvor problema in njegovo teoretično ozadje. Sledi opis osnovnih pojmov, ki so potrebni za nadaljnje razumevanje tega dela. Zadnja poglavja so namenjena empiričnemu delu raziskovanja problema. S pomočjo konkretnih podatkov so bile preizkušene različne metode. Sledijo jim rezultati ter njihova analiza. Kljub temu da sta opisana modela razmeroma nova na področju dodeljevanja frekvenčnih kanalov, njuni rezultati kažejo učinkovito reševanja problema. Predstavljene razširitve navdihujejo nadaljnje raziskovanje v tej smeri.

Keywords

magistrska dela;dodeljevanje frekvenčnih kanalov;kombinatorična optimizacija;aproksimacijske metode;hevristične metode;posplošena barvanja grafov;maksimalni k-prerez;

Data

Language: Slovenian
Year of publishing:
Typology: 2.09 - Master's Thesis
Organization: UM FNM - Faculty of Natural Sciences and Mathematics
Publisher: [J. Dolšak]
UDC: 519.85(043.2)
COBISS: 22530312 Link will open in a new window
Views: 1037
Downloads: 115
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: Optimal channel assignment in wireless networks
Secondary abstract: The thesis considers the problem of channel assignment in wireless networks. It presents two different approaches, which are relatively new and therefore inspire research in this direction. The first approach is from graph theory, where the problem is set as a maximum k-cut and solved by semidefinite programming. The second approach is from game theory, where the problem is set as an ordinal potential game. In the beginning we describe origin of the problem and its theoretical background, introducing the basic concepts that are necessary for further understanding of this thesis. Subsequent chapters are intended to empirical research of the problem. With the use of realistic data, we evaluate various different methods. After that, the results and their analysis are presented. Despite the fact that the described models are relatively new in the area of channel assignment, their results show effective problem solving. Featured extensions inspire further research in this direction.
Secondary keywords: master theses;frequency channel assignment;combinatorial optimization;approximation methods;heuristics methods;generalized graph colorings;maximal k-cut;
URN: URN:SI:UM:
Type (COBISS): Master's thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za naravoslovje in matematiko, Oddelek za matematiko in računalništvo
Pages: IX, 58 f.
ID: 9166472