Towards a Zero-Failure Distributed Access for Wireless Collision Channels
Currently in the literature, there is a significant number of access methods to the shared communication channel. For this purpose, two major classes of protocols are defined: controlled access protocols and competing protocols, in which our work is registered. In our paper, we define an access protocol where each station possesses a different and unique contention sequence CS, with which they enter in a battle with other stations. In the end of the competition, only one station is identified as a winner, and will be allowed to access to the channel and transmit its information successfully without any risk of failure. This technique is named zero failure access ZFA.
The object of this paper is to compare the present technique ZFA with the other existing techniques and access methods, for instance slotted ALOHA and DCF protocols. For this issue, we derive the throughput for the three different access methods and finally illustrate the results by simulation.
KeywordsZero Failure Access ZFA Competition Battle DCF Slotted ALOHA Contention Sequence CS Fairly Uniqueness
Unable to display preview. Download preview PDF.
- 1.El Mesbahi, J., Errami, A., Khaldoun, M.: Method and System for Resolving the Problem of Conflict in a Shared Communication Channel, WO 2007/123383 A1, Novembre 1, 2007Google Scholar
- 2.Bianchi, G.: Performance analysis of the IEEE 802.11 distributed coordination function. IEEE Journal of Selected Areas in Communications 18, March 2000Google Scholar
- 3.Medepalli, K., Tobagi, F.A.: Towards performance modeling of IEEE 802.11 based wireless networks: a unified framework and its applications. In: Proceedings of IEEE INFOCOM (2006)Google Scholar
- 4.Yang, Y., Hou, V., Kung, L.C.: Modeling the effect of transmit power and physical carrier sense in multi-hop wireless networks. In: Proceedings of IEEE INFOCOM (2007)Google Scholar
- 5.Gollakota, S., Katabi, D.: ZigZag decoding: combating hidden terminals in wireless networks. In: SIGCOMM 2008 Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, pp. 159–170 (2008)Google Scholar
- 6.Paek, J., Neely, M.J.: Mathematical analysis of throughput bounds in random access with ZIGZAG decoding. In: 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOPT 2009, pp. 1–7, June 2009Google Scholar
- 7.Arabi, S., Sabir, E., Sadik, M.: ZigZag decoding-enabled multi-hop Ad hoc networks: taking benefit from collisions. In: 2014 Fifth International Conference on Next Generation Networks and Services NGNS, May 28–30, 2014Google Scholar
- 8.Arabi, S., Sabir, E., Sadik, M.: Towards a ZigZag-decoding-enabled distributed coordination function for WLANs. In: Fifth International Workshop on Codes, Cryptography and Communication Systems, IWCCCS, November 27–28, 2014Google Scholar
- 9.Barcelo, J., Bellalta, B., Cano, C., Sfairopoulou, A., Oliver, M.: Carrier sense multiple access with enhanced collision avoidance: a performance analysis. In: Proceedings ACM IWCMC 2009 (2009)Google Scholar
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.