Abstract
We consider an uplink wireless collision channel, shared by multiple mobile users. The medium access protocol incorporates channel reservation that relies on RTS (request-to-send) and CTS (clear-to-send) control packets. Consequently, collisions are reduced to the relatively short periods where mobiles request channel use. In our model, users individually schedule their channel requests, and the objective of each user is to minimize its own power investment subject to a minimum-throughput demand. Our analysis reveals that for feasible throughput demands, there exist exactly two Nash equilibrium points in stationary strategies, with one superior to the other uniformly over all users. We then show how this better equilibrium point can be obtained through distributed best-response mechanisms. Finally, we quantify and discuss the effect of the relative length of data and control periods on capacity, power and delay.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Altman, E., El-Azouzi, R., & Jimenez, T. (2004). Slotted aloha as a game with partial information. Computer Networks, 45(6), 701–713.
Fiat, A., Mansour, Y., & Nadav, U. (2007). Efficient contention resolution for selfish agents. In Symposium on discrete computing (SODA) (pp. 179–188).
Fudenberg, D., & Tirole, J. (1991). Game theory. Cambridge: MIT Press.
Hua, Z., Ming, L., Chlamtac, I., & Prabhakaran, B. (2004). A survey of quality of service in IEEE 802.11 networks. IEEE Wireless Communications, 11, 6–14.
IEEE 802.11 standards. Available from http://standards.ieee.org/getieee802/802.11.html.
Inaltekin, H., & Wicker, S. (2005). A one-shot random access game for wireless networks. In International conference on wireless networks, communications and mobile computing (pp. 940–945).
Johari, R., Mannor, S., & Tsitsiklis, J. N. (2004). Efficiency loss in a network resource allocation game: the case of elastic supply. IEEE Transactions on Automatic Control, 50(11), 1712–1724.
Mandayam, N. B., Wicker, S. B., Walrand, J., Basar, T., & Huang, J. (eds.) (2008). D.P.P.: Special issue on game theory in communication systems. Journal of Selected Areas in Communications 26(7), 1042–1046.
Menache, I., & Shimkin, N. (2008). Decentralized rate regulation in random access channels. In Proceedings of INFOCOM.
Menache, I., & Shimkin, N. (2008). Efficient rate-constrained Nash equilibrium in collision channels with state information. In Proceedings of INFOCOM.
Menache, I., & Shimkin, N. (2008). Noncooperative power control and transmission scheduling in wireless collision channels. In Proceedings of ACM sigmetrics.
Menache, I., & Shimkin, N. (2008). Rate-based equilibria in collision channels with fading. Journal of Selected Areas in Communications, 26(7), 1070–1077.
Meshkati, F., Poor, H. V., & Schwartz, S. C. (2007). Energy-efficient resource allocation in wireless networks. IEEE Signal Processing Magazine, 24(3), 58–68.
Muqattash, A., & Krunz, M. (2003). CDMA-based MAC protocol for wireless ad hoc networks. In MobiHoc ’03: Proceedings of the 4th ACM international symposium on mobile ad hoc networking & computing (pp. 153–164).
Ross, S. M. (2006). Introduction to probability models. San Diego: Academic Press.
Roughgarden, T., & Tardos, E. (2002). How bad is selfish routing. Journal of the ACM, 49, 236–259.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Menache, I., Shimkin, N. Reservation-based distributed medium access in wireless collision channels. Telecommun Syst 47, 95–108 (2011). https://doi.org/10.1007/s11235-010-9304-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-010-9304-4