A Distributed Approximation of Greedy Maximal Scheduling using Multi-class Contention in Multi-hop Wireless Networks

Problems of optimizing the performance of wired and wireless networks have been widely studied in recent past. In wireless network, activating a link affects the performance of network significantly as the capacity of a link is highly dependent to other links ’ activation. Unfortunately, neither optimal algorithm nor Greedy Maximal Scheduling, a well-known sub-optimal algorithm, is feasible to use in general because of the complexity and the centralized implementation. In this paper, we design a novel scheduling algorithm which approximates Greedy Maximal Scheduling in a distributed manner using multi-class contention. We also analysis the efficiency of our scheduling algorithm compared to the reference policy. The performance obtained from simulation results are close to that of Greedy Maximal Scheduler thus validating our analytic model. I