Efficient distributed channel allocation for cellular networks

  • Authors:

  • G Cao;M Singhal

  • Affiliations:

  • Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA 16802, USA;Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA 16802, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2000

Quantified Score

Hi-index 0.25

Visualization

Abstract

The performance of a distributed dynamic channel allocation algorithm is measured by the call blocking rate, the number of messages exchanged per channel acquisition and the delay incurred in acquiring a channel. In general, there are two approaches in designing distributed channel allocation algorithms: Search and Update. Both of these approaches have advantages and disadvantages. The update approach has shorter acquisition delay and lower call blocking rate, but higher message complexity. On the other hand, the search approach has lower message complexity, but longer acquisition delay and higher call blocking rate. In this paper, we first propose a novel distributed acquisition algorithm, which has similar message complexity as the search approach and similar acquisition delay as the update approach. Then, we present a channel selection algorithm and integrate it into our distributed acquisition algorithm. By a rigorous analysis in terms of delay and message complexity, we show that our channel selection algorithm performs significantly better than the update approach [X. Dong, T.H. Lai, Proceedings of the International Conference on Distributed Computing systems, 1997] and the search approach [R. Prakash, N. Shivaratri, M. Singhal, Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, 1995, pp. 47-56]. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. The performance of our algorithm is compared with those of the Geometric strategy [A. Baiocchi, F.D. Proscoli, F. Grilli, F. Sestini, IEEE Trans. Veh. Technol. February (1995) 14-23], the Search approach [R. Prakash, N. Shivaratri, M. Singhal, Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, 1995, pp. 47-56] and the Update approach [X. Dong, T.H. Lai, Proceedings of the International Conference on Distributed Computing systems, 1997]. Simulation results show that our algorithm outperforms all other approaches in terms of call blocking probability under uniform as well as non-uniform traffic distributions.