Formulation of optimization problems for access selection in next generation wireless networks

Wireless Networks are rapidly evolving, constantly increasing both in coverage and offered bandwidth, while the vision for Next Generation Wireless Networks (NGWNs) encompasses a unified core network incorporating various Radio Access Technologies (RATs) in a unified and seamless manner. In such an environment providers would like to maximize their users' satisfaction, while at the same time avoid overloading their subsystems. In this paper we identify several aspects of access selection and resource allocation in NGWNs and provide different variations of optimization problems that seem to present significant interest in this context. All problem formulations seem to be NP-Hard, and our ongoing research focuses on designing approximation techniques for solving them.

[1]  Nancy Alonistioti,et al.  On the complexity of "Always Best Connected" in 4G mobile networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[2]  Dusit Niyato,et al.  A Cooperative Game Framework for Bandwidth Allocation in 4G Heterogeneous Wireless Networks , 2006, 2006 IEEE International Conference on Communications.

[3]  Gábor Fodor,et al.  Simulative analysis of access selection algorithms for multi-access networks , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[4]  E. Gustafsson,et al.  Always best connected , 2003, IEEE Wirel. Commun..

[5]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .