Browsing by Subject "Temporal fairness"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Open Access Is proportional fair scheduling suitable for age-sensitive traffic?(Elsevier, 2023-05) Akar, Nail; Karaşan, EzhanProportional Fair (PF) scheduling with successful deployments in various cellular wireless networks and wireless LANs, aims at maximizing the sum of the logarithms of user throughputs. PF scheduling is known to strike an appropriate balance between fairness and throughput, for conventional data traffic. On the other hand, there has recently been a surge of interest in status update networks carrying age-sensitive traffic for which information freshness is crucial and therefore network performance metrics driven by Age of Information (AoI) are instrumental, as opposed to conventional performance metrics such as delay, loss, or throughput, used for conventional data traffic. This paper studies the scheduling problem for the downlink of a cellular wireless network with a transmitter sending age-sensitive status update packets from multiple information sources to users with the goal of keeping the information as fresh as possible for the users. For this purpose, under the generate-at-will scenario, an age-agnostic model-free scheduler is proposed with the goal of minimizing the weighted sum peak AoI of the network, which is the performance metric used in this paper for quantifying information freshness. With numerical examples, the proposed scheduler is compared and contrasted with weighted PF scheduling in terms of implementation and performance, in both non-opportunistic and opportunistic scenarios.Item Open Access Power allocation and temporal fair user group scheduling for downlink NOMA(Springer, 2021-08) Erturk, E.; Yildiz, O.; Shahsavari, S.; Akar, NailNon-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.Item Open Access A two-level temporal fair scheduler for multi-cell wireless networks(Department of Electrical and Electronics Engineers, 2015) Shahsavari, S.; Akar, N.We propose a two-level scheduler for a frequency reuse-1 multi-cell wireless network satisfying inter-and intra-cell weighted temporal fairness constraints. As opposed to hard partitioning of the entire frequency band to different cell patterns in frequency reuse-M systems (M>1), we propose sharing this band opportunistically in time by these patterns. Through numerical examples, we show notable gains in overall network throughput due to improved multi-user diversity in comparison with a conventional frequency reuse-3 system. © 2012 IEEE.