Joint Cell Muting and User Scheduling in Multicell Networks with Temporal Fairness

Abstract

A semicentralized joint cell muting and user scheduling scheme for interference coordination in a multicell network is proposed under two different temporal fairness criteria. In the proposed scheme, at a decision instant, each base station (BS) in the multicell network employs a cell-level scheduler to nominate one user for each of its inner and outer sections and their available transmission rates to a network-level scheduler which then computes the potential overall transmission rate for each muting pattern. Subsequently, the network-level scheduler selects one pattern to unmute, out of all the available patterns. This decision is shared with all cell-level schedulers which then forward data to one of the two nominated users provided the pattern they reside in was chosen for transmission. Both user and pattern selection decisions are made on a temporal fair basis. Although some pattern sets are easily obtainable from static frequency reuse systems, we propose a general pattern set construction algorithm in this paper. As for the first fairness criterion, all cells are assigned to receive the same temporal share with the ratio between the temporal share of a cell center section and that of the cell edge section being set to a fixed desired value for all cells. The second fairness criterion is based on max-min temporal fairness for which the temporal share of the network-wide worst case user is maximized. Extensive numerical results are provided to validate the effectiveness of the proposed schemes and to study the impact of choice of the pattern set.

Opportunistic Temporal Fair Mode Selection and User Scheduling for Full-duplex Systems

“…The parameter c is the step-size. Lines (8)(9)(10)(11)(12)(13)(14)(15)(16)(17)(18)(19)(20)(21)(22)(23) verify that the temporal demand constraints and dual feasibility conditions are satisfied. The computational complexity of the algorithm is proportional to the number of virtual users which is O(n 2 ).…”

“…Short-term temporal fair schedulers guarantee that each user is activated in at least a predefined fraction of time-slots at each finite scheduling window, whereas under long-term temporal fairness, the temporal demands are met over infinitely large window-lengths. Temporal fair scheduling have been investigated in HD wireless local area networks (WLAN) [11], [12] and HD cellular systems [13], [14].…”

Joint user scheduling and power optimization in full-duplex cells with successive interference cancellation

“…Without loss of generality, we assume that each user has UL and DL traffic to send and receive. Thus, we split each user [10]. When full-duplex transmissions are allowed, we call the system weighted temporal fair, if and only if ∀i :…”

A General Framework for Temporal Fair User Scheduling in NOMA Systems

“…From the perspective of the network provider, an additional upside of temporally fair schedulers is that users with low channel quality do not hinder network throughput as severely as in utilitarian fair schedulers [22]. There has been a significant body of work dedicated to the study of temporally arXiv:1809.06431v1 [eess.SP] 17 Sep 2018 fair schedulers in wireless local area networks (WLAN) [23], [24] and OMA cellular systems [20], [25], [26]. However, temporal fairness of NOMA schedulers, which is the topic of this paper, has not been investigated before.…”