DMCA
Greedy Online Frequency Allocation in Cellular Networks
Cached
Download Links
- [i.cs.hku.hk]
- [www.cs.hku.hk]
- [i.cs.hku.hk]
- DBLP
Other Repositories/Bibliography
| Citations: | 2 - 2 self |
BibTeX
@MISC{Chan_greedyonline,
author = {Wun-tat Chan and Francis Y. L. Chin and Deshi Ye and Yong Zhang and Hong Zhu},
title = {Greedy Online Frequency Allocation in Cellular Networks},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The online frequency allocation problem for cellular networks has been well studied in these years. Given a mobile telephone network, whose geographical coverage area is divided into cells, phone calls are served by assigning frequencies to them, and no two calls emanating from the same or neighboring cells are assigned the same frequency. Assuming an online setting that the calls arrive one by one, the problem is to minimize the span of the frequencies used. In this paper, we study the greedy approach for the online frequency allocation problem, which assigns the minimal available frequency to a new call so that the call does not interfere with calls of the same cell or neighboring cells. If the calls have infinite duration, the competitive ratio of greedy algorithm has a tight upper bound of 17/7, which closes the gap of [17/7, 2.5) in [3]. If the calls have finite duration, i.e., each call may be terminated at some time, the competitive ratio of the greedy algorithm has a tight upper bound of 3.
Keyphrases
cellular network greedy online frequency allocation tight upper bound competitive ratio online frequency allocation problem neighboring cell greedy algorithm new call greedy approach phone call infinite duration mobile telephone network geographical coverage area online setting minimal available frequency
