Channel allocation in cellular radio networks

Cited 10 time in webofscience Cited 0 time in scopus
  • Hit : 1063
  • Download : 104
In this article, two efficient heuristic algorithms are suggested for the channel allocation problem which minimizes the average blocking probability of the whole network subject to the co-channel, adjacent-site and co-site interference constraints, given the number of available channels. We convert this problem into a convenient form using the piecewise linearization technique and the concept of pattern, and apply Lagrangean relaxation and subgradient optimization techniques. Computational experiments show that this procedure provides high-quality solutions with information about their error ranges for networks with special compatibility matrices. We also suggest a general procedure using a GOS (grade of service) updating scheme, and provide encouraging computational results. (C) 1997 Elsevier Science Ltd.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1997
Language
English
Article Type
Article
Keywords

FREQUENCY ASSIGNMENT; SUBGRADIENT METHOD; MOBILE SYSTEMS; OPTIMIZATION; ALGORITHM

Citation

COMPUTERS & OPERATIONS RESEARCH, v.24, pp.849 - 860

ISSN
0305-0548
URI
http://hdl.handle.net/10203/1847
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 10 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0