Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

Frequency Assignments in Radio Networks

Viyyure, Uday Kiran Varma

Abstract Details

2008, MS, Kent State University, College of Arts and Sciences / Department of Computer Science.
In our paper we discuss the frequency assignment problem for cellular networks. Many methods and ways have been proposed for solving this problem like neural networks, genetic algorithms, evolutionary approach, local search and integer programming. We approach the problem using a variant of graph coloring. In this method we represent a cellular network using a graph and try to color those graph nodes using minimum number of colors. Colors in graph coloring represent the frequencies used by a cellular network. In this thesis we discuss L(1), L(1,1), L(2,1), L(1,1,1) and L(2,1,1) graph coloring scenarios known from literature and propose a graph coloring function for L(3,1,1).
Feodor Dragan, PhD (Advisor)
Hassan Peyravi, Phd (Committee Member)
Kenneth Batcher, PhD (Committee Member)
40 p.

Recommended Citations

Citations

  • Viyyure, U. K. V. (2008). Frequency Assignments in Radio Networks [Master's thesis, Kent State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=kent1209060158

    APA Style (7th edition)

  • Viyyure, Uday Kiran. Frequency Assignments in Radio Networks. 2008. Kent State University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=kent1209060158.

    MLA Style (8th edition)

  • Viyyure, Uday Kiran. "Frequency Assignments in Radio Networks." Master's thesis, Kent State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=kent1209060158

    Chicago Manual of Style (17th edition)