Skip to main content
Springer Nature Link
Log in

Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no two calls emanating from the same or neighboring cells are assigned the same frequency. Assuming an online arrival of calls, the goal is to minimize the span of frequencies used to serve all of the calls.

By first considering χ-colorable networks, which is a generalization of the (3-colorable) cellular networks, we present a (χ+1)/2-competitive online algorithm. This algorithm, when applied to cellular networks, is effectively a positive solution to the open problem posed in (Caragiannis et al. in Theory Comput. Syst. 35(5):521–543, 2002) Does a 2-competitive online algorithm exist for frequency allocation in cellular networks? We further prove a matching lower bound, which shows that our 2-competitive algorithm is optimal.

We discover that an interesting phenomenon occurs for the online frequency allocation problem when the number of calls considered becomes large: previously-derived optimal bounds on competitive ratios no longer hold true. For cellular networks, we show a new asymptotic lower and upper bounds of 1.5 and 1.9126, respectively, which breaks through the optimal bound of 2 shown above.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. Aardal, K.I., van Hoesel, S.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1), 79–129 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  2. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  3. Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Efficient on-line frequency allocation and call control in cellular networks. Theory Comput. Syst. 35(5), 521–543 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y., Zhu, H.: Frequency allocation problems for linear cellular networks. In: Proceedings of the 17th Annual International Symposium on Algorithms and Computation (ISAAC), pp. 61–70 (2006)

  5. Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y., Zhu, H.: Greedy online frequency allocation in cellular networks. Inf. Process. Lett. 102, 55–61 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chin, F.Y.L., Ting, H.F., Zhang, Y.: A constant-competitive algorithm for online OVSF code assignment. In: Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC), pp. 452–463 (2007)

  7. Chin, F.Y.L., Zhang, Y., Zhu, H.: A 1-local 13/9-competitive algorithm for multicoloring hexagonal graphs. In: Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON), pp. 526–536 (2007)

  8. Chin, F.Y.L., Zhang, Y., Zhu, H.: Online OVSF code assignment with resource augmentation. In: Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM), pp. 191–200 (2007)

  9. Erlebach, T., Jacob, R., Mihalák, M., Nunkesser, M., Szabó, G., Widmayer, P.: An algorithmic view on OVSF code assignment. Algorithmica 47(3), 269–298 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  10. Feder, T., Shende, S.M.: Online channel allocation in FDMA networks with reuse constraints. Inf. Process. Lett. 67(6), 295–302 (1998)

    Article  MathSciNet  Google Scholar 

  11. Fitzpatrick, S.L., Janssen, J., Nowakowski, R.J.: Distributive online channel assignment for hexagonal cellular networks with constraints. Discrete Appl. Math. 143(1–3), 84–91 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hale, W.: Frequency assignment: Theory and applications. Proc. IEEE 68(12), 1497–1514 (1980)

    Article  Google Scholar 

  13. Janssen, J., Krizanc, D., Narayanan, L., Shende, S.M.: Distributed online frequency assignment in cellular networks. J. Algorithms 36(2), 119–151 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  14. Katzela, I., Naghshineh, M.: Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey. IEEE Pers. Commun. 3(3), 10–31 (1996)

    Article  Google Scholar 

  15. MacDonald, V.: Advanced mobile phone service: The cellular concept. Bell Syst. Tech. J. 58(1) (1979)

  16. McDiarmid, C., Reed, B.A.: Channel assignment and weighted coloring. Networks 36(2), 114–117 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Murphey, R.A., Pardalos, P.M., Resende, M.G.C.: Frequency assignment problems. In: Du, D.-Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, vol. 4, pp. 331–395. Kluwer Academic, Dordrecht (1999)

    Google Scholar 

  18. Narayanan, L.: Channel assignment and graph multicoloring. In: Stojmenović, I. (ed.) Handbook of Wireless Networks and Mobile Computing, pp. 71–94. Wiley, New York (2002)

    Chapter  Google Scholar 

  19. Narayanan, L., Shende, S.M.: Static frequency assignment in cellular networks. Algorithmica 29(3), 396–409 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  20. Pantziou, G.E., Pentaris, G.P., Spirakis, P.G.: Competitive call control in mobile networks. Theory Comput. Syst. 35(6), 625–639 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  21. Sparl, P., Zerovnik, J.: 2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. J. Algorithms 55(1), 29–41 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, King’s College London, Strand, London, WC2R 2LS, UK

    Joseph Wun-Tat Chan

  2. Department of Computer Science, The University of Hong Kong, Pokfulam Road, Hong Kong, Hong Kong

    Francis Y. L. Chin & Yong Zhang

  3. College of Computer Science, Zhejiang University, Hangzhou, 310027, China

    Deshi Ye

Authors
  1. Joseph Wun-Tat Chan
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Francis Y. L. Chin
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Deshi Ye
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Yong Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Joseph Wun-Tat Chan.

Additional information

F.Y.L. Chin was supported in parts by Hong Kong RGC Research Grant HKU 7113/07E. D. Ye was supported in parts by grant NSFC (10601048). Y. Zhang was supported in parts by National Natural Science Fund (grant no. 60496321).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chan, J.WT., Chin, F.Y.L., Ye, D. et al. Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks. Algorithmica 58, 498–515 (2010). https://doi.org/10.1007/s00453-009-9279-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-009-9279-2

Keywords