Fair scheduling algorithm for wireless sensor networks

In large scale wireless sensor networks (WSNs), prolonging the network lifetime under energy constraint is a critical issue. Design of energy efficient medium access control can prolong network life in an effective and efficient manner. Zebra medium access control (ZMAC) is a hybrid MAC which introduced distributed random algorithm for scheduling (DRAND). Although DRAND provide necessary scheduling technique but still it has some drawbacks. This paper presents a Fair Scheduling algorithm to overcome the drawbacks of DRAND. According to Fair Scheduling algorithm, GRANT is given to a node on the basis of higher priority in a QUEUE for slot reservation. The algorithm does not require synchronization and it runs periodically to handle new joining and movable nodes. Thus, the algorithm is suitable for static and also for mobile node network. Fair Scheduling algorithm provides negligible delay, minimum overhead and energy consumption in order to prolong network life.