Abstract
The growth of wireless technology made opportunistic scheduling a widespread theme in recent research. Providing high system throughput without reducing fairness allocation is becoming a very challenging task. The purpose of this work is twofold. On the one hand, we proposed a new optimization problem called Satisfaction Probability which consists in maximizing the number of satisfied users. On the other hand, we proposed a new scheduling scheme based on Round Robin (RR) Algorithm. Because of its non-opportunistic process, RR does not take in account radio conditions and consequently it affect both system throughput and multiusers diversity. Our contribution called MORRA (Modified Opportunistic Round Robin Algorithm) consists to propose a solution to this issue. MORRA not only exploits the concept of opportunistic scheduler but also takes into account other parameters in the allocation process. The first parameter is called courtesy coefficient (CC) and the second is called Buffer Occupancy (BO). Performance evaluation shows that this well-balanced resource allocation scheme outperforms other existing scheduler algorithms (MaxSNR, PF and RR) and demonstrate that choosing between high system capacity and high fairness is not required.