Performance of Random Contention PRMA: A Protocol for Fixed Wireless Access
Salman Ali AlQahtani, Ahed Alshanyour, Ashraf Mahmoud
.
DOI: 10.4236/ijcns.2011.47049   PDF    HTML     4,379 Downloads   7,778 Views   Citations

Abstract

This paper introduces a packet reservation multiple access (PRMA) with random contention for fixed wireless access communications. The performance of PRMA scheme with random contention is compared with the performances of traditional PRMA under permission contention scheme. The proposed scheme is a simpler contention mechanism that does not depend on a pre-determined permission probability as PRMA under permission contention scheme. In this new method, terminals select the contention slot uniformly from the pool of remaining free slots in the current frame. We evaluate the performance of the new contention mechanism in terms of various metrics including maximum number of carried voice calls and packet delays for a given acceptable drop rate of voice packets. We show that the new mechanism is superior to that of PRMA under permission contention scheme for loaded systems and is expected to be insensitive for traffic source burstiness.

Share and Cite:

S. AlQahtani, A. Alshanyour and A. Mahmoud, "Performance of Random Contention PRMA: A Protocol for Fixed Wireless Access," International Journal of Communications, Network and System Sciences, Vol. 4 No. 7, 2011, pp. 417-423. doi: 10.4236/ijcns.2011.47049.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] S. Nanda, D. J. Goodman and U. Timor, “Performance of PRMA: A Packet Voice Protocol for Cellular Systems,” IEEE Transactions on Vehicular Technology, Vol. 40, No. 3, August 1991, pp. 584-598. doi:10.1109/25.97513
[2] D. J. Goodman, R. A. Valenzuela, K. T. Gayliard and B. Ramamurthi, “Packet Reservation Multiple Access for Local Wireless Communications,” IEEE Transactions on Communications, Vol. 37, No. 8, August 1989, pp. 885- 890. doi:10.1109/26.31190
[3] D. J. Goodman and S. X. Wei, “Efficiency of Packet Reservation Multiple Access,” IEEE Transactions on Vehicular Technology, Vol. 40, No. 1, February 1991, pp. 170-176. doi:10.1109/25.69985
[4] S. Nanda, “Analysis of PRMA: Voice Data Integration for Wireless Networks,” Proceedings of IEEE Global Telecommunications Conference, San Diego, December 1992, pp. 1984-1988.
[5] F. Barcelo and A. Ramon, “Minislotted Packet Reservation Multiple Access Protocol for Integrated Voice-Data Transmission,” Proceedings of Singapore ICCS ‘94 Conference, Vol. 1, 14-18 November 1994, Singapore, pp. 320-323.
[6] J. -H. Wen and J.-W. Wang, “A New Protocol For Wireless Voice Communications-Non-Collision Packet Reservation Multiple Access,” Proceedings of the 6th IEEE International Symposium on Personal Indoor and Mobile Radio Communications, Toronto, Vol. 2, 27-29 September 1995, pp. 638-642. doi:10.1109/PIMRC.1995.480946
[7] G. Pierobon, A. Zanella, A. Salloum, “Contention- TDMA Protocol: Performance Evaluation,” IEEE Transactions on Vehicular Technology, Vol. 51, No. 4, July 2002, pp. 781-788. doi:10.1109/TVT.2002.1015358
[8] J.-H. Wen, Y.-S. Chen, T.-S. Chang, and J.-K. Lain, “Theoretical Analysis and Performance of NC-PRMA Protocol for Multichannel Wireless Networks,” Wireless Personal Communications, Vol. 39, No. 2, 2006, pp. 199-213. doi:10.1007/s11277-006-9088-8
[9] A. Al-Shanyour, A. A. Mahmoud, T. Sheltami and S. A. AlQahtani, “Packet Reservation Multiple Access (PRMA) with Random Contention,” Proceedings of ACS/IEEE International Conference on Computer Systems and Applications, Amman, May 13-16 2007, pp. 158-164.
[10] N. Wattanamongkhol, W. Srichavengsup, P. Vara-urairat, S. Siwamogsatham and L. Wuttisiittikulkij, “Analysis of a Multiple-Token Contention Scheme for Broadband Wireless Access Networks,” Proceedings of IEEE International Conference on Communications Workshops, Beijing, 19-23 May 2008, pp. 68-72. doi:10.1109/ICCW.2008.18

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.