Downlink Coordinated Scheduling (DL CS) Sample Clauses

Downlink Coordinated Scheduling (DL CS). In CS however, a central base station in a network cluster, with full knowl- edge of the interference situation of the neighbouring ones, will determine which radio links between users and other base stations will need to be active [12]. The feasibility and potential gains of this technique will highly depend on the X2 transmission technology employed, such as fibre optics or microwave connections and also the size of the cluster, as excessive overhead volume will render this scheme counter-productive. Dynamic Point Blanking (DPB) is an example CS-based algorithm in which inter- xxxxxxx arising from certain base stations are muted dynamically [9]. Due to the coordinated nature of CB and CS, base station cooperation needs to be facilitated through the exchange of CSI. Depending on given cell loads and available backhaul capacity and latency, appropriate feedback sharing mecha- nisms can be adopted. The CB and CS can be jointly implemented to achieve minimum multi-user and multi-cell interference [8].