Cost based Heterogeneous Access Management in Multi-Service, Multi-System Scenarios

This paper covers the issue of how mobile users of different service classes should be assigned to a set of radio access technologies (RATs) with overlapping coverage from a practical perspective. The aim is to allocate users with minimum rate constraints to all RATs that the weighted sum of assignable users is maximized. We introduce the concept of resource costs to formulate an optimization problem, which is very expensive to solve (NP-complete). Using the approach of continuous relaxation, we develop a suboptimal radio access selection algorithm which is designed for practical applications and converges close to the optimum. Simulation results show considerable gains of the utility in comparison to a standard Load Balancing Strategy.

[1]  Anders Furuskar,et al.  Multiservice allocation for multiaccess wireless systems , 2005, IEEE Transactions on Wireless Communications.

[2]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3]  Gerhard Wunder,et al.  User Allocation in Multi-System, Multi-Service Scenarios: Upper and Lower Performance Bound of Polynomial Time Assignment Algorithms , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[4]  V. Mirrokni,et al.  Tight approximation algorithms for maximum general assignment problems , 2006, SODA 2006.

[5]  Martin Grötschel,et al.  The Ellipsoid Method , 1993 .

[6]  Steffen Rebennack,et al.  Ellipsoid Method , 2009, Encyclopedia of Optimization.

[7]  K. David,et al.  Performance investigation of multi standard radio resource management for packet switched services , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[8]  Ingo Karla,et al.  Performance of Distributed MXRRM , 2006, 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications.