network capacity, thanks to new paradigms such as network densification. However, in dense networks interference can be a limiting factor, and must be suitably managed. In this paper multiple cells coordinate to mitigate the mutual interference: cross-tier interference is limited by means of the traditional enhanced Inter Cell Interference Coordination approach, while a new co-tier interference management strategy based on Matching Theory is proposed. The objective is to provide a stable matching between the set of small cells and the set of available subframes left almost blank by the macrocell and used by the small cells to communicate with their most vulnerable users. The proposed solution aims at improving the throughput of most critical users with an affordable computational complexity. The ffectiveness of the proposed scheme has been verified in comparison with benchmark methods.
Bartoli, G., Fantacci, R., Marabissi, D., Picano, B. (2019). Efficient Matching for Almost Blank Subframes Allocation in Ultra Dense Networks. In 2019 IEEE Wireless Communications and Networking Conference (WCNC) (pp.1-5). New York : IEEE [10.1109/WCNC.2019.8885735].
Efficient Matching for Almost Blank Subframes Allocation in Ultra Dense Networks
Giulio Bartoli;
2019-01-01
Abstract
network capacity, thanks to new paradigms such as network densification. However, in dense networks interference can be a limiting factor, and must be suitably managed. In this paper multiple cells coordinate to mitigate the mutual interference: cross-tier interference is limited by means of the traditional enhanced Inter Cell Interference Coordination approach, while a new co-tier interference management strategy based on Matching Theory is proposed. The objective is to provide a stable matching between the set of small cells and the set of available subframes left almost blank by the macrocell and used by the small cells to communicate with their most vulnerable users. The proposed solution aims at improving the throughput of most critical users with an affordable computational complexity. The ffectiveness of the proposed scheme has been verified in comparison with benchmark methods.File | Dimensione | Formato | |
---|---|---|---|
2019_IEEE_WCNC_Efficient_Matching_for_Almost_Blank_Subframes_Allocation_in_Ultra_Dense_Networks.pdf
non disponibili
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
417.93 kB
Formato
Adobe PDF
|
417.93 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/1218784