Intercell coordination and cooperation techniques are some of the most promising approaches to increase the spectral efficiency of future wireless systems as required by the forecasted market needs. Among them, intercell coordinated scheduling (ICCS) arises as a near-term feasible solution due to its lower inter-BS communication requirements when compared to full cooperative approaches. In this paper we present our proposed Reservation Information Aware Intercell Coordinated Scheduling (RIA-ICCS) solution which considers application reservation information when constructing an interference graph for ICCS purposes. Our results shows that i) RIA-ICCS allows to significantly reduce the number of edges in an interference graph for ICCS solutions and its benefit increases as the number of mobile stations grows, i.e., when the system needs it most and ii) the reduced number of edges in the interference graph can be effectively translated to a lower blocking probability using state- of-the-art resource allocation algorithms

RIA-ICCS: A novel Intercell Coordinated Scheduling approach using Application Reservation Information

CAPONE, ANTONIO
2013

Abstract

Intercell coordination and cooperation techniques are some of the most promising approaches to increase the spectral efficiency of future wireless systems as required by the forecasted market needs. Among them, intercell coordinated scheduling (ICCS) arises as a near-term feasible solution due to its lower inter-BS communication requirements when compared to full cooperative approaches. In this paper we present our proposed Reservation Information Aware Intercell Coordinated Scheduling (RIA-ICCS) solution which considers application reservation information when constructing an interference graph for ICCS purposes. Our results shows that i) RIA-ICCS allows to significantly reduce the number of edges in an interference graph for ICCS solutions and its benefit increases as the number of mobile stations grows, i.e., when the system needs it most and ii) the reduced number of edges in the interference graph can be effectively translated to a lower blocking probability using state- of-the-art resource allocation algorithms
IEEE WCNC 2013
978-1-4673-5939-9
File in questo prodotto:
File Dimensione Formato  
06554624.pdf

Accesso riservato

: Altro materiale allegato
Dimensione 417.33 kB
Formato Adobe PDF
417.33 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/739779
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact