Online computation and competitive analysis
Online computation and competitive analysis
Dynamic Channel Allocation for Real-Time Connections in Highway Macrocellular Networks
Wireless Personal Communications: An International Journal
"Call-level" and "Burst-level" priorities for an effective management of multimedia services in UMTS
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Online frequency allocation in cellular networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Online OVSF Code Assignment with Resource Augmentation
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Three Results on Frequency Assignment in Linear Cellular Networks
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
SIGACT news online algorithms column 14
ACM SIGACT News
Three results on frequency assignment in linear cellular networks
Theoretical Computer Science
A constant-competitive algorithm for online OVSF code assignment
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Deterministic on-line call control in cellular networks
Theoretical Computer Science
Better bounds for incremental frequency allocation in bipartite graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
A 1-local 13/9-competitive algorithm for multicoloring hexagonal graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Better bounds for incremental frequency allocation in bipartite graphs
Theoretical Computer Science
| Hi-index | 0.00 |
We study the online frequency allocation problem for wireless linear (highway) cellular networks, where the geographical coverage area is divided into cells aligned in a line. Calls arrive over time and are served by assigning frequencies to them, and no two calls emanating from the same cell or neighboring cells are assigned the same frequency. The objective is to minimize the span of frequencies used. In this paper we consider the problem with or without the assumption that calls have infinite duration. If there is the assumption, we propose an algorithm with absolute competitive ratio of 3/2 and asymptotic competitive ratio of 1.382. The lower bounds are also given: the absolute one is 3/2 and the asymptotic one is 4/3. Thus, our algorithm with absolute ratio of 3/2 is best possible. We also prove that the Greedy algorithm is 3/2-competitive in both the absolute and asymptotic cases. For the problem without the assumption, i.e. calls may terminate at arbitrary time, we give the lower bounds for the competitive ratios: the absolute one is 5/3 and the asymptotic one is 14/9. We propose an optimal online algorithm with both competitive ratio of 5/3, which is better than the Greedy algorithm, with both competitive ratios 2.