Advertisement

Frequency Allocation Problems for Linear Cellular Networks

  • Joseph Wun-Tat Chan
  • Francis Y. L. Chin
  • Deshi Ye
  • Yong Zhang
  • Hong Zhu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4288)

Abstract

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.

Keywords

Neighboring Cell Greedy Algorithm Competitive Ratio Online Algorithm Greedy Approach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anand, S., Sridharam, A., Sivarajan, K.N.: Performance analysis of channelized cellular systems with dynamic channel allocation. IEEE Transactions on vehicular technology 52(4), 847–859 (2003)CrossRefGoogle Scholar
  2. 2.
    Bassiouni, M., Fang, C.: Dynamic channel allocation for linear macrocellular topology. Wireless Personal Communications 19, 121–138 (2001)CrossRefGoogle Scholar
  3. 3.
    Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)MATHGoogle Scholar
  4. 4.
    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), A preliminary version of the paper appeared in SPAA 2000MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Iera, A., Marano, S., Molinaro, A.: Call-Level and Burst-Level Properties of Effective Management of Multimedia Sercies in UMTS. In: Proceedings of IEEE INFOCOM, pp. 1363–1370 (1996)Google Scholar
  6. 6.
    Jiang, H., Rappaport, S.S.: Hybrid channel borrowing and directed retry in highway cellular communications. In: IEEE 46th Vehicular Technology Conference, Mobile Technology for the Human Race, vol. 2, pp. 716–720 (1996)Google Scholar
  7. 7.
    MacDonald, V.H.: The cellular concept. The Bell System Techn. J. 58, 15–41 (1979)Google Scholar
  8. 8.
    Yeung, K.L., Yum, T.P.: Cell group decoupling analysis of a dynamic channel assignment strategy in linear microcellular radio systems. IEEE Transactions on Communications 43, 1289–1292 (1995)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Joseph Wun-Tat Chan
    • 1
  • Francis Y. L. Chin
    • 2
  • Deshi Ye
    • 3
  • Yong Zhang
    • 2
    • 4
  • Hong Zhu
    • 4
  1. 1.Department of Computer ScienceKing’s College LondonUK
  2. 2.Department of Computer ScienceThe University of Hong KongHong Kong
  3. 3.College of Computer ScienceZhejiang UniversityChina
  4. 4.Department of Computer Science and EngineeringFudan UniversityChina

Personalised recommendations