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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.C. Cox, "Personal Communications – A Viewpoint", IEEE Communications Magazine, Vol. 128, No. 11, 1990.
G.H. Forman and J. Zahorjan, "The Challenges of Mobile Computing", IEEE Computer, pp. 38–47, 1994.
M. Woo, N. Prabhu and A. Ghafoor, "Dynamic Resource Allocation for Multimedia Services in Mobile Communications Environments", IEEE Journal on Selected Areas in Communications, Vol. 13, No. 5, pp. 913–922, 1995.
A.S. Tanenbaum, Computer Networks, 2nd ed. NJ: Prentice-Hall, 1988.
N. Amitay, "Resource Auction Multiple Access (RAMA): Efficient Method for Fast Resource Assignment in Decentralized Wireless PCS", Electronics Letters, Vol. 28, No. 8, pp. 799–801, 1992.
D.J. Goodman<nt>et al.</nt>, "Packet Reservation Multiple Access for Local Wireless Communications", IEEE Transactions on Communications, Vol. 37, No. 8, pp. 885–890, 1989.
C. Namislo, "Analysis of Mobile Radio Slotted ALOHA Network", IEEE Journal on Selected Areas in Communications, Vol. 2, pp. 563–574, 1984.
S. Tasaka, "Stability and Performance Analysis of the R-ALOHA Packet Broadcast System", IEEE Transactions on Computers, Vol. 32, No. 9, pp. 717–725, 1983.
N. Amitay, "Distributed Switching and Control with Fast Resource Assignment/Handoff for Personal Communications Systems", IEEE Journal on Selected Areas in Communications, Vol. 11, No. 6, pp. 842–849, 1993.
N. Amitay, "Resource Auction Multiple Access (RAMA) in the Cellular Environment", IEEE Transactions on Vehicular Technology, Vol. 43, No. 4, pp. 1101–1110, 1994.
Y.-B. Lin, A. Noerpel and D. Harasty, "Sub-Rating Channel Assignment Strategy for Hand-Offs", IEEE Transactions on Vehicular Technology, 1996.
H.M. Taylor and S. Karlin, An Introduction to Stochastic Modeling, Academic Press, 1984.
L. Kleinrock, Queueing Systems, Volume 1: Theory, John Wiley & Sons, Inc., 1975.
M.J. Karol and C.H. I, "A Protocol for Fast Resource Assignment in Wireless PCS", IEEE Transactions on Vehicular Technology, Vol. 43, No. 3, pp. 727–732, 1994.
A.L.A. Pinheiro and J.R.B. de Marca, "Performance of Deterministic Packet Access for Personal Communication Systems", Proc. IEEE Vehicular Technology Conference, pp. 267–271, 1996.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hwang, SY., Wang, TP. Two Auction-Based Protocols for Fair and Fast Resource Assignment in Wireless PCS. Wireless Personal Communications 10, 175–187 (1999). https://doi.org/10.1023/A:1018323428424
Issue Date:
DOI: https://doi.org/10.1023/A:1018323428424