A General Framework for Temporal Fair User Scheduling in NOMA Systems

Shahsavari, Shahram; Shirani, Farhad; Erkip, Elza

doi:10.1109/jstsp.2019.2903745

Cited by 18 publications

(28 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Opportunistic multi-user scheduling under long-term temporal fairness constraints was formulated in [7]. We provide a summary and formulate multi-user scheduling under short-term fairness constraints.…”

Section: Problem Formulationmentioning

confidence: 99%

“…It was shown in [7], that under long-term fairness constraints, a special class of scheduling strategies called threshold based strategies (TBS) achieve optimal system utility. However, application of TBSs does not guarantee short-term fairness.…”

Section: Multi-user Scheduling Strategymentioning

confidence: 99%

“…In [7], it was shown that TBSs achieve optimal average system utility under long-term temporal fairness constraints. The following theorem builds upon this to show that ATBSs DRAFT achieve optimal average system utility as the window-length is increased asymptotically and to provide rates of convergence to the optimal long-term utility.…”

Section: : End Formentioning

confidence: 99%

“…The design of efficient resource allocation and scheduling schemes in cellular communications is a topic of significant interest [1]- [7]. Opportunistic scheduling strategies maximize system utility by exploiting the channel state information while guaranteeing satisfaction of fairness constraints -such as temporal fairness -for individual users in the network.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints

Shahsavari

Shirani

Erkip

2019

2019 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

In the conventional information theoretic analysis of multiterminal communication scenarios, it is often assumed that all of the distributed terminals use the communication channel simultaneously. However, in practical wireless communication systems -due to restricted computation complexity at network terminals -a limited number of users can be activated either in uplink or downlink simultaneously. This necessitates the design of a scheduler which determines the set of active users at each time-slot. A well-designed scheduler maximizes the average system utility subject to a set of fairness criteria, which must be met in a limited window-length to avoid long starvation periods. In this work, scheduling under short-term temporal fairness constraints is considered. The objective is to maximize the average system utility such that the fraction of the time-slots that each user is activated is within desired upper and lower bounds in the fairness window-length. The set of feasible window-lengths is characterized as a function of system parameters. It is shown that the optimal system utility is non-monotonic and super-additive in window-length. Furthermore, a scheduling strategy

show abstract

Section: Problem Formulationmentioning

confidence: 99%

Section: Multi-user Scheduling Strategymentioning

confidence: 99%

Section: : End Formentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints

Shahsavari

Shirani

Erkip

2019

2019 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The proof is provided in Appendix C. Note that the arguments provided in [16] to prove a similar statement for NOMA systems are not directly applicable since the proof depends on the set of virtual users which is different in FD systems. The following Corollary provides sufficient optimality conditions which will be used for devising a low complexity algorithm to estimate the optimal thresholds in the next sections.…”

Section: A Scheduling Under Long-term Fairness Constraintsmentioning

confidence: 99%

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

Shahsavari¹,

Shirani²,

Khojastepour³

et al. 2019

2019 IEEE 30th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops)

Self Cite

View full text Add to dashboard Cite

In-band full-duplex (FD) communications -enabled by recent advances in antenna and RF circuit design -has emerged as one of the promising techniques to improve data rates in wireless systems.One of the major roadblocks in enabling high data rates in FD systems is the inter-user interference (IUI) due to activating pairs of uplink and downlink users at the same time-frequency resource block.Opportunistic user scheduling has been proposed as a means to manage IUI and fully exploit the multiplexing gains in FD systems. In this paper, scheduling under long-term and short-term temporal fairness for single-cell FD wireless networks is considered. Temporal fair scheduling is of interest in delay-sensitive applications, and leads to predictable latency and power consumption. The feasible region of user temporal demand vectors is derived, and a scheduling strategy maximizing the system utility while satisfying long-term temporal fairness is proposed. Furthermore, a short-term temporal fair scheduling strategy is devised which satisfies user temporal demands over a finite window-length. It is shown that the strategy achieves optimal average system utility as the window-length is increased asymptotically. Subsequently, practical construction algorithms for long-term and short-term temporal fair scheduling are introduced. Simulations are provided to verify the derivations and investigate the multiplexing gains. It is observed that using successive interference cancellation at downlink users improves FD gains significantly in the presence of strong IUI.

show abstract

Power allocation and temporal fair user group scheduling for downlink NOMA

et al. 2021

Self Cite

View full text Add to dashboard Cite

Non-Orthogonal Multiple Access (NOMA) has been proposed as a new radio access technique for cellular networks as an alternative to OMA (Orthogonal Multiple Access) in which the users of a group (pairs or triples of users in a group are considered in this paper) are allowed to use the wireless channel simultaneously. In this paper, for downlink single-input single-output SISO-NOMA, a heuristic power allocation algorithm within a group is first proposed which attempts to ensure that the users of a group benefit from simultaneous transmission equally in terms of achievable throughput. Moreover, a user group scheduling algorithm is proposed for downlink NOMA systems by which a user group is to be dynamically selected for transmission while satisfying long term temporal fairness among the individual contending users. The effectiveness of the proposed power allocation method along with the temporal fair scheduling algorithm for downlink NOMA is validated with simulations and the performance impact of the transmit power and the coverage radius of the base station as well as the number of users are thoroughly studied.

show abstract

A General Framework for Temporal Fair User Scheduling in NOMA Systems

Cited by 18 publications

References 43 publications

On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints

On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints

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

Power allocation and temporal fair user group scheduling for downlink NOMA

Contact Info

Product

Resources

About