Cell Selection Using Recursive Bipartite Matching

Research output: Contribution to conferencePaperResearchpeer-review

475 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 languageEnglish
Publication date2013
Number of pages2
Publication statusPublished - 2013
Event32nd IEEE International Conference on Computer Communications (INFOCOM 2013) - Turin, Italy
Duration: 14 Apr 201319 Apr 2013
http://infocom.di.unimi.it/

Conference

Conference32nd IEEE International Conference on Computer Communications (INFOCOM 2013)
CountryItaly
CityTurin
Period14/04/201319/04/2013
Internet address

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.

Fingerprint Dive into the research topics of 'Cell Selection Using Recursive Bipartite Matching'. Together they form a unique fingerprint.

Cite this