Paper Info
Title
Hetwn Selection Scheme Based On Bipartite Graph Multiple Matching
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.
Year
DOI
Venue
2018
10.1007/978-3-030-06161-6_58
COMMUNICATIONS AND NETWORKING, CHINACOM 2018
Keywords
Field
DocType
Heterogeneous wireless network, Bipartite graph, Minimum cost and maximum flow
Wireless network,Resource (disambiguation),Telecommunications network,Optimal matching,Heterogeneous wireless network,Computer science,Bipartite graph,Selection algorithm,Computer network,Maximum flow problem
Conference
Volume
ISSN
Citations 
262
1867-8211
0
PageRank 
References 
Authors
0.34
5
3
Name
Order
Citations
PageRank
Xiaoqian Wang133516.72
Xin Su228353.83
Bei Liu32612.94