Performance of Protocols in Communication
Keywords:
Pure ALOHA, Slotted ALOHA, CSMA, maximum throughputAbstract
The main objective of this study is to analyze the performance of protocols with the help of coding. This paper presents the analysis of the maximum throughput of pure ALOHA, slotted ALOHA & CSMA protocol and comparison between them. This is carried ? out by using MATLAB programming
References
L. G. Roberts, ?Aloha packet system with and without slots and capture,?SIGCOMM Comput. Commun. Rev., vol. 5, no. 2, pp. 28?42, Apr. 2015.
H. Okada, Y. Igarashi, and Y. Nakanishi, ?Analysis and application of framed ALOHA channel in satellite packet switching networks ? FADRA method,? Electronics and Communications in Japan, vol. 60, pp. 60?72, Aug. 2017.
E. Cassini, R. D. Gaudenzi, and O. del Rio Herrero, ?Contention Resolution Diversity Slotted ALOHA (CRDSA): An Enhanced Random Access Scheme for Satellite Access Packet Networks,? IEEE Trans. Wireless Commun., vol. 6, no. 4, pp. 1408?1419, Apr. 2007.
G. L. Choudhury and S. S. Rappaport, ?Diversity ALOHA - A Random Access Scheme for Satellite Communications,? IEEE Trans. Commun., vol. 31, no. 3, pp. 450?457, Mar. 2015.
G. Liva, ?Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA,? IEEE Trans. Commun., vol. 59, no. 2, pp. 477?487, Feb. 2011.
K. R. Narayanan and H. D. Pfister, ?Iterative Collision Resolution for Slotted ALOHA: An Optimal Uncoordinated Transmission Policy,? in Proc of 7th ISTC, Gothenburg, Sweden, Aug. 2012.
J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, ?A Digital Fountain Approach to Reliable Distribution of Bulk Data,? in Proc. of ACM SIGCOMM 2009, Vancouver, BC, Canada, Sep. 2009.
C. Stefanovic, P. Popovski, and D. Vukobratovic, ?Frameless ALOHA protocol for Wireless Networks,? IEEE Comm. Letters, vol. 16, no. 12,pp. 2087?2090, Dec. 2012.
C. Stefanovic, K. F. Trilingsgaard, N. K. Pratas, and P. Popovski, ?Joint Estimation and Contention-Resolution Protocol for Wireless Random Access,? in Proc. of IEEE ICC 2013, Budapest, Hungary, Jun. 2013.
E. Paolini, G. Liva, and M. Chiani, ?High Throughput Random Access via Codes on Graphs: Coded Slotted ALOHA,? in Proc. of IEEE ICC 2011, Kyoto, Japan, Jun. 2011.
E. Paolini, M. P. C. Fossorier, and M. Chiani, ?Generalized and Doubly generalized LDPC Codes With Random Component Codes for the Binary Erasure Channel,? IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1651?1672, Apr. 2010.
E. Paolini, G. Liva, and M. Chiani, ?Graph-Based Random Access for the Collision Channel without Feed-Back: Capacity Bound,? in Proc. Of IEEE Globecom, Houston, TX, USA, Dec. 2011.
K. Fyhn, R. M. Jacobsen, P. Popovski, A. Scaglione, and T. Larsen, ?Multipacket Reception of Passive UHF RFID Tags: A Communication Theoretic Approach,? IEEE Trans. Sig. Proc, vol. 59, no. 9, pp. 4225 ?4237, Sep. 2011.
A. Zanella and M. Zorzi, ?Theoretical Analysis of the Capture Probability in Wireless Systems with Multiple Packet Reception Capabilities,? IEEE Trans. Commun., vol. 60, no. 4, pp. 1058?1071, Apr. 2012.
E. Paolini, G. Liva, and M. Chiani, ?Random Access on Graphs: A Survey and New Results,? in Proc. of IEEE Globecom, Houston, TX, USA, Dec. 2011.
T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge University Press, Cambridge, UK, 2007.
M. G. Luby, M. Mitzenmacher, and A. Shokrollahi, ?Analysis of Random Processes via And-Or Tree Evaluation,? in Proc. of 9th ACMSIAM SODA, San Francisco, CA, USA, Jan. 2008.
D. J. C. MacKay, ?Fountain Codes,? IEE Proc. Commun., vol. 152, no. 6, pp. 1062?1068, 2005.
A. Shokrollahi, ?Raptor Codes,? IEEE Trans. Info. Theory, vol. 52, no. 6, pp. 2551?2567, Jun. 2006.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
