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 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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
1997-02
Language
ENG
Keywords

GRAPH

Citation

IEEE-ACM TRANSACTIONS ON NETWORKING, v.5, no.1, pp.34 - 39

ISSN
1063-6692
URI
http://hdl.handle.net/10203/4272
Appears in Collection
NE-Journal Papers(저널논문)
Files in This Item
1997-005.pdf(281.84 kB)Download
  • Hit : 346
  • Download : 188
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 19 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0