RIA-ICCS: Intercell coordinated scheduling exploiting application Reservation Information

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

E-Diophantine estimating peak allocated capacity in wireless networks

“…This new algorithm improves the accuracy of prediction versus complexity trade off when compared with currently available approaches. The results here presented extend our previous work in [7] and [8] by: (i) analyzing the E-Diophantine complexity as compared to competing approaches and (ii) designing and evaluating two heuristics, E-diophantine-W and E-diophantine-UW, that reduce the E-Diophantine computational load from exponential to polynomial (cubic) at a low estimation error probability cost.…”