Cell Selection Using Recursive Bipartite Matching

Wireless communication network consist nowadays of multiple standards, as well as cells of different sizes and coverage. Providing the best connection in such environment is a challenging task. We propose a new approach of solving the cell selection problem in heterogeneous networks. The method recursively applies efficient algorithms for bipartite graph matching to provide the final solution.