A novel Scheduling Algorithm emphasizing fairness for Cross Layer Design in wireless networks

The fundamental motivation behind the development of Cross Layered Design is the ability to adapt and deliver a certain performance as specified by the Quality of Service (QoS) parameter. Two of the essential attributes of the QoS parameter are throughput and fairness. A system under consideration can have maximised throughput or fairness according to the specification of the given network. But having one implies decreasing the other. Depending on the preference of either of the two features, algorithms and methods are formulated to assign or schedule users to prioritise either to maximise throughput, maximise fairness or finding the appropriate balance between the two. One such method is the Proportional Fairness (PF) algorithm, which yields a moderate fairness but substantially reduces throughput. In this paper, the state of the art for scheduling algorithms, the PF algorithm is discussed and an algorithm to increase the fairness factor of the considered system is proposed, termed as the Convergent Fairness Scheduling Algorithm. The proposed method is a modification of the original algorithm and performance of the same is compared with that of the PF algorithm. Through this study, we may realize the various implications and potential benefits which can be provided by implementing the Convergent Fairness Scheduling Algorithm.