Neighbours-Aware Proportional Fair Scheduler for Future Wireless Networks

Katila, Charles Jumaa; Abrignani, Melchiorre Danilo; Verdone, Roberto

doi:10.1007/978-3-319-40352-6_12

Cited by 4 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This area is denoted hereafter as Hidden Neighbor Free (HNF), and nodes within it are assigned an opportunity to transmit longer packets, because they can experience lower interference. Therefore, CA algorithm logically partitions the scheduled nodes into two sets: those which suffer from the hidden terminal problem (i.e., nodes outside the HNF region), using a discrete uniform distribution (DUD) scheme for packets lengths and nodes not having hidden terminals (i.e., nodes in the HNF region) allowed to transmit longer packets.This paper is an extension of our previous work reported in [9]. As main differences w.r.t.…”

supporting

confidence: 52%

“…[9], we underline the following: (1) we propose here a novel packet length adaptation algorithm, i.e., CA algorithm not included in [9]; (2) we made some modifications to the resource Katila et al EURASIP Journal on Wireless Communications and Networking (2017) scheduling algorithm, N-PF; and (3) we consider here more different performance metrics, evaluating in details N-PF with different packet length adaptation schemes, and different system parameters.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols

Katila

Buratti

Abrignani

et al. 2017

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

In this paper, we consider a beyond-5G scenario, where two types of users, denoted as scheduled and uncoordinated nodes, coexist on the same set of radio resources for sending data to a base station. Scheduled nodes rely solely on a centralized scheduler within the base station for the assignment of resources, while uncoordinated nodes use an unslotted Carrier Sense Multiple Access (CSMA) protocol for channel access. We propose and evaluate through simulations: (a) a novel centralized resource scheduling algorithm, called Neighbors-Aware Proportional Fair (N-PF) and (b) a novel packet length adaptation algorithm, called Channel-Aware (CA) Packet Length Adaptation algorithm for the scheduled nodes. The N-PF algorithm considers the uplink channel state conditions and the number of uncoordinated nodes neighboring each scheduled node in the aggregate scheduling metric, in order to maximize packet transmission success probability. The CA algorithm provides an additional degree of freedom for improving the performance, thanks to the fact that scheduled nodes with lower number of hidden terminals, i.e., having higher packet capture probability, are assigned longer packet transmission opportunities. We consider two benchmark schemes: Proportional Fair (PF) algorithm, as a resource scheduling algorithm, and a discrete uniform distribution (DUD) scheme for packet lengths distribution. Simulation results show that the proposed schemes can result in significant gain in terms of network goodput, without compromising fairness, with respect to two benchmark solutions taken from the literature.Keywords: Proportional Fair, Neighbors-Aware, Scheduling, Unslotted CSMA, Packet delivery rate, Fairness, Packet length adaptation BackgroundIn future wireless systems, such as 5G and beyond, the current dominating human-centric communication systems will be complemented by a tremendous increase in the number of smart devices, i.e., things, equipped with radio devices, possibly sensors, and uniquely addressable [1]. This will result in explosion of wireless traffic volume [2] and consequently exponential growth in demand of radio spectrum. However, the radio spectrum resource will remain limited, and thus, efficient radio resource utilization techniques, such as advanced medium access control (MAC) schemes, will be of paramount importance.*Correspondence: charlesjumaa.katila@unibo.it Electrical, Electronics and Information Engineering Department, University of Bologna, Bologna, Italy Based on the above motivation, we envision a novel scenario, where some users (hereafter denoted as scheduled nodes), synchronized and coordinated by a base station (BS), coexist on the same set of radio resources with some other users (hereafter denoted as uncoordinated nodes), asynchronous with the BS and among them. As shown in Fig. 1, scheduled nodes could be user equipment (i.e., cellular users), while uncoordinated nodes could be things of the Internet of Things (IoT) paradigm, i.e., cars, machines, buildings [3].In wireless networks, MAC prot...

show abstract

supporting

confidence: 52%

Section: Introductionmentioning

confidence: 99%