Electronic International Standard Serial Number (EISSN)
This paper proposes a novel semi-distributed and practical ICIC scheme based on the Almost Blank Sub-Frame (ABSF) approach specified by 3GPP. We define two mathematical programming problems for the cases of guaranteed and best-effort traffic, and use game theory to study the properties of the derived ICIC distributed schemes, which are compared in detail against unaffordable centralized schemes. Based on the analysis of the proposed models, we define Distributed Multi-traffic Scheduling (DMS), a unified distributed framework for adaptive interference-aware scheduling of base stations in future cellular networks, which accounts for both guaranteed and best-effort traffic. DMS follows a two-tier approach, consisting of local ABSF schedulers, which perform the resource distribution between the guaranteed and best effort traffic, and a light-weight local supervisor, which coordinates ABSF local decisions. As a result of such a two-tier design, DMS requires very light signaling to drive the local schedulers to globally efficient operating points. As shown by means of numerical results, DMS allows to: (i) maximize radio resources resue; (ii) provide requested quality for guaranteed traffic; (iii) minimize the time dedicated to guaranteed traffic to leave room for best-effort traffic; and (iv) maximize resource utilization efficiency for the best-effort traffic.
eICIC 3GPP ABSF ICIC Scheduling Distributed algorithm Game theory