Dynamic RAT selection for multiple calls in heterogeneous wireless networks using group decision-making technique

  • Authors:
  • Olabisi E. Falowo;H. Anthony Chan

  • Affiliations:
  • Department of Electrical Engineering, University of Cape Town, South Africa;Department of Electrical Engineering, University of Cape Town, South Africa

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Existing radio access technology (RAT)-selection algorithms for heterogeneous wireless networks (HWNs) do not consider the problem of RAT selection for a group of calls from a multimode terminal (MT). Multimode terminals (MTs) for next generation wireless networks have the capability to support two or more classes of calls simultaneously. When a new call is initiated on an MT already having an ongoing call in an HWN, the current RAT may no longer be suitable for the two calls (incoming call and the existing call). Thus, a new RAT may be more suitable for the two calls. The problem of RAT selection for two or more calls from an MT in an HWN is a group decision problem. This paper addresses the problem of RAT selection for a group of calls from an MT in an HWN by using the modified TOPSIS group decision-making technique. The paper proposes a dynamic RAT-selection algorithm that selects the most suitable RAT for a single call or group of calls from an MT in an HWN. The algorithm considers users' preferences for individual RATs, which vary with each class of calls, in making RAT selection decisions in an HWN. A user's preference for each of the available RATs is specified by weights assigned by the user to RAT selection criteria for different classes of calls. Based on the assigned weights, the proposed algorithm aggregates individual calls' weights specified by the user to make a RAT-selection decision for a group of calls. In order to reduce the frequency of vertical handover, the proposed algorithm uses RAT preference margin in making RAT selection decisions. RAT preference margin is a measure of the degree to which the newly preferred RAT is better than the current RAT. Performance of the proposed algorithm is evaluated through numerical simulations. Results are given to show the effectiveness of the proposed RAT-selection algorithm.