Neighbours-aware proportional fair scheduler for future wireless networks

n this paper, we present an uplink scenario where primary and secondary users coexist on the same set of radio resources. The primary users rely solely on a centralised scheduler within the base station for the assignment of resources, and the secondary users rely on an unslotted Carrier Sense Multiple Access (CSMA) protocol for channel access. We propose a novel centralised scheduling algorithm, Neighbours-Aware Proportional Fair (N-PF), which considers the uplink channel state conditions and the number of secondary users neighbouring each primary user in the aggregate scheduling metric. Through simulations we demonstrate that N-PF outperforms the chosen benchmark algorithm, Proportional Fair (PF), in terms of packet delivery rate while maintaining fairness. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2016.