Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols
Abstract 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 assi...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2017-05-01
|
| Series: | EURASIP Journal on Wireless Communications and Networking |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13638-017-0875-6 |
| _version_ | 1819206140968304640 |
|---|---|
| author | Charles Jumaa Katila Chiara Buratti Melchiorre Danilo Abrignani Roberto Verdone |
| author_facet | Charles Jumaa Katila Chiara Buratti Melchiorre Danilo Abrignani Roberto Verdone |
| author_sort | Charles Jumaa Katila |
| collection | DOAJ |
| description | Abstract 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. |
| first_indexed | 2024-12-23T05:02:52Z |
| format | Article |
| id | doaj.art-e0a11a719e754ac5bd6732b4c358e5a4 |
| institution | Directory Open Access Journal |
| issn | 1687-1499 |
| language | English |
| last_indexed | 2024-12-23T05:02:52Z |
| publishDate | 2017-05-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | EURASIP Journal on Wireless Communications and Networking |
| spelling | doaj.art-e0a11a719e754ac5bd6732b4c358e5a42022-12-21T17:59:11ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14992017-05-012017111210.1186/s13638-017-0875-6Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocolsCharles Jumaa Katila0Chiara Buratti1Melchiorre Danilo Abrignani2Roberto Verdone3Electrical, Electronics and Information Engineering Department, University of BolognaElectrical, Electronics and Information Engineering Department, University of BolognaElectrical, Electronics and Information Engineering Department, University of BolognaElectrical, Electronics and Information Engineering Department, University of BolognaAbstract 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.http://link.springer.com/article/10.1186/s13638-017-0875-6Proportional FairNeighbors-AwareSchedulingUnslotted CSMAPacket delivery rateFairness |
| spellingShingle | Charles Jumaa Katila Chiara Buratti Melchiorre Danilo Abrignani Roberto Verdone Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols EURASIP Journal on Wireless Communications and Networking Proportional Fair Neighbors-Aware Scheduling Unslotted CSMA Packet delivery rate Fairness |
| title | Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols |
| title_full | Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols |
| title_fullStr | Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols |
| title_full_unstemmed | Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols |
| title_short | Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols |
| title_sort | neighbors aware proportional fair scheduling for future wireless networks with mixed mac protocols |
| topic | Proportional Fair Neighbors-Aware Scheduling Unslotted CSMA Packet delivery rate Fairness |
| url | http://link.springer.com/article/10.1186/s13638-017-0875-6 |
| work_keys_str_mv | AT charlesjumaakatila neighborsawareproportionalfairschedulingforfuturewirelessnetworkswithmixedmacprotocols AT chiaraburatti neighborsawareproportionalfairschedulingforfuturewirelessnetworkswithmixedmacprotocols AT melchiorredaniloabrignani neighborsawareproportionalfairschedulingforfuturewirelessnetworkswithmixedmacprotocols AT robertoverdone neighborsawareproportionalfairschedulingforfuturewirelessnetworkswithmixedmacprotocols |