Research Article
HetWN Selection Scheme Based on Bipartite Graph Multiple Matching
@INPROCEEDINGS{10.1007/978-3-030-06161-6_58, author={Xiaoqian Wang and Xin Su and Bei Liu}, title={HetWN Selection Scheme Based on Bipartite Graph Multiple Matching}, proceedings={Communications and Networking. 13th EAI International Conference, ChinaCom 2018, Chengdu, China, October 23-25, 2018, Proceedings}, proceedings_a={CHINACOM}, year={2019}, month={1}, keywords={Heterogeneous wireless network Bipartite graph Minimum cost and maximum flow}, doi={10.1007/978-3-030-06161-6_58} }- Xiaoqian Wang
Xin Su
Bei Liu
Year: 2019
HetWN Selection Scheme Based on Bipartite Graph Multiple Matching
CHINACOM
Springer
DOI: 10.1007/978-3-030-06161-6_58
Abstract
Next generation communication networks will be a heterogeneous wireless networks (HetWN) based on 5G. Studying the reasonable allocation of new traffics under the new scenario of 5G is helpful to make full use of the network resources. In this paper, we propose a HetWN selection algorithm based on bipartite graph multiple matching. Firstly, we use the AHP-GRA method to calculate the user’s preference for network and the network’s preference for user. After these two preferences are traded off as the weights of edges in bipartite graph, we can extend the bipartite graph to a bipartite graph network. The minimum cost maximum flow algorithm is used to obtain the optimal matching result. Simulations show that our scheme can balance the traffic dynamically. And it is a tradeoff between user side decision and network side decision.
