Download Now Free registration required
In the literature, various algorithms have been proposed for the frequency assignment problem in a cellular network. The problem has been known to be NP-hard and cannot be easily solved in polynomial time so most of the algorithms suffer from long calculation time. This paper proposes a fast frequency assignment algorithm to approximate the optimal solution in polynomial time. Some traditional sequential algorithms are compared with the proposed algorithm. Simulation results reveal that the proposed algorithm has less number of frequency conflicts than the others does, which is very suitable for the dynamic frequency assignment in TDMA/GSM cellular networks.
- Format: PDF
- Size: 706.8 KB