Premium
Competitive algorithms and lower bounds for online randomized call control in cellular networks
Author(s) -
Caragiannis Ioannis,
Kaklamanis Christos,
Papaioannou Evi
Publication year - 2008
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20244
Subject(s) - competitive analysis , online algorithm , computer science , cellular network , upper and lower bounds , randomized algorithm , algorithm , wireless network , call control , simple (philosophy) , reuse , mathematics , wireless , computer network , telecommunications , mathematical analysis , philosophy , ecology , epistemology , biology
We address an important communication issue arising in wireless cellular networks that utilize frequency division multiplexing (FDM) technology. In such networks, many users within the same geographical region (cell) can communicate simultaneously with other users of the network using distinct frequencies. The spectrum of the available frequencies is limited; thus, efficient solutions to the call control problem are essential. The objective of the call control problem is, given a spectrum of available frequencies and users that wish to communicate, to maximize the benefit, i.e., the number of users that communicate without signal interference. We consider cellular networks of reuse distance k ≥ 2 and we study the online version of the problem using competitive analysis. In cellular networks of reuse distance 2, the previously best known algorithm that beats the lower bound of 3 on the competitiveness of deterministic algorithms, works on networks with one frequency, achieves a competitive ratio against oblivious adversaries, which is between 2.469 and 2.651, and uses a number of random bits at least proportional to the size of the network. We significantly improve this result by presenting a series of simple randomized algorithms that have competitive ratios significantly smaller than 3, work on networks with arbitrarily many frequencies, and use only a constant number of random bits or a comparable weak random source. The best competitiveness upper bound we obtain is 16/7 using only four random bits. In cellular networks of reuse distance k > 2, we present simple randomized online call control algorithms with competitive ratios, which significantly beat the lower bounds on the competitiveness of deterministic ones and use only O (log k ) random bits. Also, we show new lower bounds on the competitiveness of online call control algorithms in cellular networks of any reuse distance. In particular, we show that no online algorithm can achieve competitive ratio better than 2, 25/12, and 2.5, in cellular networks with reuse distance k ε {2, 3, 4}, k = 5, and k ≥ 6, respectively. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008