Loading…

A new lower bound for the frequency assignment problem

We propose a new lower bound on the number of frequencies required to meet the frequency demands in a cellular network. It extends Gamst's (1986) work by devising a procedure of frequency insertion, which makes the best of unexploited frequency spaces between the assigned frequencies. Our lower...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 1997-02, Vol.5 (1), p.34-39
Main Authors: TCHA, D.-W, CHUNG, Y.-J, CHOI, T.-J
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a new lower bound on the number of frequencies required to meet the frequency demands in a cellular network. It extends Gamst's (1986) work by devising a procedure of frequency insertion, which makes the best of unexploited frequency spaces between the assigned frequencies. Our lower bound is claimed to have much wider and easier real-world applicability due to its relaxed prerequisite condition. Furthermore, it is shown via an illustrative example to be much tighter than its previous counterpart.
ISSN:1063-6692
1558-2566
DOI:10.1109/90.554720