Cell Selection Using Recursive Bipartite Matching

Anna Zakrzewska; Sarah Renée Ruepp; Michael Stübert Berger

Cell Selection Using Recursive Bipartite Matching

Anna Zakrzewska, Sarah Renée Ruepp, Michael Stübert Berger

Research output: Contribution to conference › Paper › Research › peer-review

565 Downloads (Pure)

Abstract

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.

Original language	English
Publication date	2013
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 http://infocom.di.unimi.it/

Conference

Conference	32nd IEEE International Conference on Computer Communications (INFOCOM 2013)
Country/Territory	Italy
City	Turin
Period	14/04/2013 → 19/04/2013
Internet address	http://infocom.di.unimi.it/

Bibliographical note

The paper was used during the review process (extended abstract), but is not published. The work was presented as a poster at INFOCOM 2013 Student Session.

Access to Document

BipartiteMatching 1569713595

OpenUrl availability

Full text

Cite this

@conference{22db846a781a4b1588c3ccf2c94b03bc,

title = "Cell Selection Using Recursive Bipartite Matching",

abstract = "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.",

author = "Anna Zakrzewska and Ruepp, {Sarah Ren{\'e}e} and Berger, {Michael St{\"u}bert}",

note = "The paper was used during the review process (extended abstract), but is not published. The work was presented as a poster at INFOCOM 2013 Student Session.; 32nd IEEE International Conference on Computer Communications (INFOCOM 2013) ; Conference date: 14-04-2013 Through 19-04-2013",

year = "2013",

language = "English",

url = "http://infocom.di.unimi.it/",

}

TY - CONF

T1 - Cell Selection Using Recursive Bipartite Matching

AU - Zakrzewska, Anna

AU - Ruepp, Sarah Renée

AU - Berger, Michael Stübert

N1 - The paper was used during the review process (extended abstract), but is not published. The work was presented as a poster at INFOCOM 2013 Student Session.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

M3 - Paper

T2 - 32nd IEEE International Conference on Computer Communications (INFOCOM 2013)

Y2 - 14 April 2013 through 19 April 2013

ER -

Cell Selection Using Recursive Bipartite Matching

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this