| Efficient allocation of radio spectrum becomes increasingly important as the demand for wireless communication has been growing rapidly over the past two decades. Several channel assignment algorithms for increasing channel utilization have been studied. In Fixed Channel Assignment (FCA), channels are permanently allocated to each cell for its exclusive use, whereas in Dynamic Channel Assignment (DCA) the channels are put in a shared pool and dynamically assigned upon request. One example of a DCA scheme is the so-called greedy strategy, where all the channels are kept in a central ordered list and every node uses the first channels which are available. In Fixed Preference Assignment (FPA), each cell has a fixed preference list of all channels and the first available channel in the list will be used to serve an incoming call. In this thesis, we show upper bounds and lower bounds for the competitive ratios of the greedy and FPA strategies for different values of reuse distance. The average case performance analysis of these three schemes is also conducted using computer simulation. |
