The Community for Technology Leaders
Green Image
Issue No. 10 - October (2008 vol. 7)
ISSN: 1536-1233
pp: 1257-1270
Xavier Gelabert , Universitat Politecnica de Catalunya (UPC), Barcelona
Jordi Pérez-Romero , Universitat Politecnica de Catalunya (UPC), Barcelona
Oriol Sallent , Universitat Politecnica de Catalunya (UPC), Barcelona
Ramon Agustí , Universitat Politecnica de Catalunya (UPC), Barcelona
This paper addresses the problem of Radio Access Technology (RAT) selection in heterogeneous multi-access/multi-service scenarios. For such purpose, a Markov model is proposed to compare the performance of various RAT selection policies within these scenarios. The novelty of the approach resides in the embedded definition of the aforementioned RAT selection policies within the Markov chain. In addition, the model also considers the constraints imposed by those users with terminals that only support a subset of all the available RATs (i.e. multi-mode terminal capabilities). Furthermore, several performance metrics may be measured to evaluate the behaviour of the proposed RAT selection policies under varying offered traffic conditions. In order to illustrate the validation and suitability of the proposed model, some examples of operative radio access networks are provided, including the GSM/EDGE Radio Access Network (GERAN) and the UMTS Radio Access Network (UTRAN), as well as several service-based, load-balancing and terminal-driven RAT selection strategies. The flexibility exhibited by the presented model enables to extend these RAT selection policies to others responding to diverse criteria. The model is successfully validated by means of comparing the Markov model results with those of system-level simulations.
Algorithm design and analysis, Markov processes, Mobile communication systems, radio resource management.

J. Pérez-Romero, R. Agustí, X. Gelabert and O. Sallent, "A Markovian Approach to Radio Access Technology Selection in Heterogeneous Multiaccess/Multiservice Wireless Networks," in IEEE Transactions on Mobile Computing, vol. 7, no. , pp. 1257-1270, 2008.
90 ms
(Ver 3.3 (11022016))