Abstract
The Resource Auction Multiple Access (RAMA) protocol was recently proposed for fast resource assignment in wireless PCS networks. The protocol assigns communication resources to subscribers using a collision resolution method based on subscriber ID‘s. In each auction cycle, the subscriber with the highest ID will obtain the resource. Thus the RAMA protocol encounters the unfairness problem since subscribers with lower ID‘s might be delayed forever. In this paper, we propose two modifications to the RAMA protocol to solve the unfairness problem. The first modification forces the RAMA protocol to process requests in bursts, i.e., new requests are not processed until the current burst of requests are all satisfied. The second modification asks the base station to select subscribers randomly instead of the one with the highest ID. We derive mathematical models to compare the performances of proposed and original protocols. Performance results indicate that the modification of random selection is fairer than other protocols in terms of the waiting time distribution.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call