A study of dynamic network selection for HSPA dual-network users

Due to the fact that existing 3.5G network cards usually select networks with the highest data rate as their priority choices, the radio resources may not be efficiently and equally utilized in a multiple network environment, even when the network with the highest rate is already congested. In this paper, we propose two dynamic resource allocation algorithms to resolve such issues assuming an HSPA dual-network architecture, which is common in many existing 3.5G networks. The presented algorithms include two major versions: 1) maximum utility algorithm and 2) enhanced maximum utility algorithm. Performance metrics such as the overall system utility (i.e. the satisfaction index), the blocking probability, and the system utilization are employed in the investigation of these two algorithms. Simulations show that the presented algorithms have significant improvements in the overall system performance than that of the existing algorithm. The system performance can be further improved if the concentration ratio can be dynamically adjusted.