9 attractive for practical implementations. The PMF of the scheduled user location can then be given as: P ( r$_{sel}$ = r$_{k}$ ) = u$_{k}$ U (16) D. Location based Round Robin Scheduling Scheme Location based round robin is another non-opportunistic scheduling scheme which do not require any channel state information, however, it requires the location information of the users. Even though location based scheduling is not common in practice, the location of each mobile user can be determined at the BS using global positioning system (GPS) or estimate based on a power measurement of pilot signals from the surrounding beacons, e.g., using triangulation based techniques. In this regard, there are variety of techniques available in the literature which demonstrate how the location of users can be evaluated at the BS (see [13], [14] and the references therein). Moreover, the users located in different circular regions can also be classified based on the long term average SNRs, i.e ., by computing SNR thresholds for different distances (rings) [4] which is a common technique in fractional frequency reuse (FFR) systems to distinguish between cell-edge and cell center users. In this context, we consider W time slots during which the distance of the users from their serving BS will remain approximately the same. For simplicity, the number of time slots W is set equal to K . At a given time slot T$_{w}$ , we select any arbitrary user from a specific ring (analysis)and circular region (simulations) starting from the cell center. We continue to allocate the users by accessing the circular rings sequentially from cell center to cell edge. At this point, it is important to emphasize that all cells are considered to be time synchronous in allocating the users from particular rings, i.e., at a given time slot T$_{w}$ all cells are selecting the w th ring. Thus, the PMF of r$_{sel}$ for a given time slot w denoted by P ( r$_{sel}$ = r T$_{w}$ k ) can be given as: P ( r$_{sel}$ = r T$_{w}$ k ) =    $^{1}$$^{,}$ if k = w 0 , else (17) The scheme can produce relatively high capacity gains on average compared to the traditional round robin scheme. Moreover, the average fairness measure is very close to the traditional round robin. E. Greedy Round Robin Scheduling Scheme Greedy round robin is an opportunistic scheduling scheme which captures the multiuser diversity while maintaining some fairness among users. In this scheme, we consider W = K time slots during which the