Neighbours-Aware Proportional Fair Scheduler for Future Wireless Networks
In 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
- PDF / 533,095 Bytes
- 12 Pages / 439.37 x 666.142 pts Page_size
- 51 Downloads / 170 Views
Abstract. In 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. Keywords: Proportional Fair · Neighbours-Aware · Primary users Secondary users · Unslotted CSMA · Packet delivery rate · Fairness
1
·
Introduction
One of the practical challenges in the design of future wireless networks will be the presence of interference. Because the spectrum resource will remain limited, numerous primary users (hereafter denoted as scheduled nodes) and secondary users (hereafter denoted as uncoordinated nodes) will have to coexist on the same set of radio resources, resulting in enormous interference on communication links and consequently network performance degradation. Advanced medium access schemes can play a significant role towards achieving efficient utilization of radio resources and hence, current research activities on Medium Access Control (MAC) protocols are of paramount importance. In this paper we present an uplink scenario where scheduled nodes and uncoordinated nodes coexist on the same pool of radio resources within a cell. Both groups of nodes transmit to a common base station (BS) but unlike scheduled nodes, the uncoordinated nodes do not have a global reference time and therefore, they are totally asynchronous with the base station and with each other. To access the channel, the uncoordinated nodes rely on an unslotted Carrier Sense Multiple Access with Collisions Avoidance (CSMA/CA) protocol, while c ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2016 D. Noguet et al. (Eds.): CROWNCOM 2016, LNICST 172, pp. 142–153, 2016. DOI: 10.1007/978-3-319-40352-6 12
Neighbours-Aware Proportional Fair Scheduler
143
the scheduled nodes rely on a centralised scheduling algorithm located within the base station for radio resources assignment. This scenario could be applicable in many different network instances of future generation wireless networks e.g., 5G and beyond. We propose and evaluate through simulation a novel centralised scheduling algorithm, which outperforms the baseline algorithm, i.e., proportional fair (PF), in terms of packet delivery rate, while maintaining fairness. In wireless networks, MAC protocols are classified into two main groups: contention-based and contention-free MAC protocols. The contention-based MAC protocols are distributed in nature and suff
Data Loading...
