Modeling iCAR via multi-dimensional Markov Chains

  • Authors:

  • Hongyi Wu;Chunming Qiao

  • Affiliations:

  • The Center for Advanced Computer Studies, University of Louisiana at Lafayette, P.O. Box 44330, Lafayette, LA;Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY

  • Venue:
  • Mobile Networks and Applications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

iCAR is a new wireless system architecture based on the integration of cellular and modern ad hoc relaying technologies. It addresses the congestion problem due to limited channel access in a cellular system and provides interoperability for heterogeneous networks. The iCAR system can efficiently balance traffic loads and share channel resource between cells by using ad hoc relaying stations (ARS) to relay traffic from one cell to another dynamically. Analyzing the performance of iCAR is nontrivial as the classic Erlang-B formula no longer applies when relaying is used. In this paper, we build multi-dimensional Markov chains to analyze the performance of the iCAR system in terms of the call blocking probability. In particular, we develop an approximate model as well as an accurate model. While it can be time-consuming and tedious to obtain the solutions of the accurate model, the approximate model yields analytical results that are close to the simulation results we obtained previously. Our results show that with a limited number of ARSs, the call blocking probability in a congested cell as well as the overall system can be reduced.