A weighted bipartite graph based network selection scheme for multi-flows in heterogeneous wireless network

Authors:
Yucheng Zhang;Yao Yuan;Jihua Zhou;Jinglong Hu;Jiangtao Dong;Jinglin Shi
Affiliations:
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China;Chongqing Jinmei Communication Co. Ltd., Chongqing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China;The 54th Research Institute if CETC;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 5
Cited 0

A game-theoretic approach to bandwidth allocation and admission control for polling services in IEEE 802.16 broadband wireless networks

QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
A comparison of multiobjective evolutionary algorithms with informed initialization and kuhn-munkres algorithm for the sailor assignment problem

Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Always best connected

IEEE Wireless Communications
A survey of mobility management in next-generation all-IP-based wireless systems

IEEE Wireless Communications
A new 4G architecture providing multimode terminals always best connected services

IEEE Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network selection is an important issue in the next generation of heterogeneous wireless network and well studied for individual flows. However, researches of network selection for multi-flows at network side are seldom touched upon but also important from the global view of optimizing usage of network resources. In this paper, a weighted bipartite graph based network selection scheme for multi-flows is proposed, which adopt secondary exponential smoothing method to perform network resource prediction and assign flows to networks based on Matching Degree(MD). The network selection scheme is modeled as weighted bipartite graph with objectives of maximizing Matching Degrees and access ratio as well as the constraint of guaranteeing no network overloaded. Weighted Bipartite Graph Algorithm (WBGA) is designed to achieve the goals. Simulation results show that WBGA demonstrates best performance compared to other schemes, with regard to average MD, access ratio and utilization ratio of network resources.