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.
|Number of pages||2|
|Publication status||Published - 2013|
|Event||32nd IEEE International Conference on Computer Communications (INFOCOM 2013) - Turin, Italy|
Duration: 14 Apr 2013 → 19 Apr 2013
|Conference||32nd IEEE International Conference on Computer Communications (INFOCOM 2013)|
|Period||14/04/2013 → 19/04/2013|