Fairness evaluation of scheduling algorithms for dense M2M implementations

摘要

We propose a simple yet effective and fair scheduler for dense Machine to Machine (M2M) implementations. The proposed scheduler aims to insure that all the devices that are randomly requesting for channel time are equally catered to. In other words the number of times each device is given access to the channel should approximately be equal to the number of times the rest of the devices are given access. The proposed scheduler known as the Improved Rejection Ratio (IRR) mainly takes decisions based on the previous history of successful attempts by a device to access the channel as well its unsuccessful attempts. Upon comparison with other relevant schedulers, the hardware based performance evaluation reveal the advantages of the proposed scheduler in terms of provision of fair and relatively uniform access to the devices requesting for channel time.