A Resource Matching Algorithm for Dynamic Multi-Homing Service Environment

This paper investigates the matching problem between radio resources and multi-homing services in a dynamic heterogeneous wireless environment. A mobile terminal (MT) with multi-homing service simultaneously transmits data to multiple radio access networks using multiple air interfaces. We develop an energy efficient resource matching algorithm for statistically guaranteeing the transmission rate of each MT with the minimum power consumption. Firstly, aided with the resource matching conception and the dynamic characteristics of wireless channels, we propose a matching probability metric to construct resource matching model for maximizing energy efficiency of all MTs subject to statistical guarantee requirements, and simplify the dynamic channels characteristic based on matching theory. Secondly, we propose a two-level distributed matching algorithm (TLDMA), with inner minimum power consumption and outer maximum matching probability, which realizes joint optimal allocation of bandwidth, transmission power and rate. Simulation results show that TLDMA outperforms conventional algorithms in terms of wireless resources management.