HetWN Selection Scheme Based on Bipartite Graph Multiple Matching

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.