Coded Random Access Technique Based on Repetition Codes for Prioritizing Emergency Communication

Article Sidebar

PDF
Published: Dec 27, 2020
DOI: https://doi.org/10.17933/bpostel.2020.180205
Keywords:
Repetition Codes, Coded Random Access, Super-dense Networks, EXIT Chart
Dimensions
Altmetrics
Statistics
Read Counter : 303
Download : 239
Crossmark/ Data Version

Main Article Content

Khoirun Ni'amah
Institut Teknologi Telkom Purwokerto
Solichah Larasati
Institut Teknologi Telkom Purwokerto
Alfin Hikmaturokhman
Institut Teknologi Telkom Purwokerto
Muntaqo Alfin Amanaf
Institut Teknologi Telkom Purwokerto
Achmad Rizal Danisya
Institut Teknologi Telkom Purwokerto

Abstract

This research uses repetition codes based on Coded Random Access (CRA) to support Internet of Things (IoT) to give priority to emergency commutations in super-dense networks. Degree distribution for emergency group and general group are obtained with extrinsic information transfer (EXIT) analysis to achieve small error performance shown by the very small gap between emergency group curve and general group curve. This research also evaluates performance by observing throughput and packet-loss rate (PLR) parameters from every groups. Offered traffic in PLR  for emergency group user is G= 0,7 packet/slot without fading and G= 0,65 packet/slot with fading, while for public group is G=0,699 packet/slot without fading and G=0,42 packet/slot with fading. Peak throughput for emergency group is G= 0,737 packet/slot without fading and G= 0,729 packet/slot with fading. Peak Throughput for public group is G= 0,699 packet/slot without fading and G=0,685 packet/slot with fading. Throughput values of emergency group are higher than those of the general group, indicating successful process of giving priority for emergency group.

Article Details

Issue
Vol. 18 No. 2 (2020): December 2020
Section
Telecommunication

Authors who publish with this journal agree to the following terms:

  1. Copyright on any article is retained by the author(s).
  2. Author grant the journal, right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work’s authorship and initial publication in this journal.
  3. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal’s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  4. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
  5. The article and any associated published material is distributed under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

 

 

References

Abbas, R., Shirvanimoghaddam, M., Li, Y., & Vucetic, B. (2017). Random Access for M2M Communications With QoS Guarantees. IEEE Transactions on Communications, 65(7), 2889–2903. https://doi.org/10.1109/TCOMM.2017.2690900

Anwar, K. (2016a). Coded Super-Dense Networks Exploiting Side Information for the Internet-of-Things (IEICE Technical Report HPB2016). Tokyo Denki University.

Anwar, K. (2016b). Decoding for wireless super-dense networks and its finite-length analysis for practical applications. 2016 International Symposium on Electronics and Smart Devices (ISESD), 347–354. https://doi.org/10.1109/ISESD.2016.7886746

Anwar, K. (2016c). Graph-Based Decoding for High-Dense Vehicular Multiway Multirelay Networks. 2016 IEEE 83rd Vehicular Technology Conference (VTC Spring), 1–5. https://doi.org/10.1109/VTCSpring.2016.7504263

Anwar, K., & Astuti, R. P. (2016). Finite-length analysis for wireless super-dense networks exploiting coded random access over Rayleigh fading channels. 2016 IEEE Asia Pacific Conference on Wireless and Mobile (APWiMob), 7–13. https://doi.org/10.1109/APWiMob.2016.7811441

Anwar, K., Juansyah, Syihabuddin, B., & Adriansyah, N. M. (2017). Coded random access with simple header detection for finite length wireless IoT networks. 2017 Eighth International Workshop on Signal Design and Its Applications in Communications (IWSDA), 94–98. https://doi.org/10.1109/IWSDA.2017.8097063

Arikan, E. (2009). Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels. IEEE Transactions on Information Theory, 55(7), 3051–3073. https://doi.org/10.1109/TIT.2009.2021379

Hasan, M. N., & Anwar, K. (2015). Massive uncoordinated multiway relay networks with simultaneous detections. 2015 IEEE International Conference on Communication Workshop (ICCW), 2175–2180. https://doi.org/10.1109/ICCW.2015.7247504

Kythe, D. K., & Kythe, P. K. (2017). Algebraic and Stochastic Coding Theory (0 ed.). CRC Press. https://doi.org/10.1201/b11707

Liva, G. (2011). Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA. IEEE Transactions on Communications, 59(2), 477–487. https://doi.org/10.1109/TCOMM.2010.120710.100054

Ni’amah, K., Ramatryana, I. N. A., & Anwar, K. (2018). Coded Random Access Prioritizing Human Over Machines for Future IoT Networks. 2018 2nd International Conference on Telematics and Future Generation Networks (TAFGEN), 19–24. https://doi.org/10.1109/TAFGEN.2018.8580480

Niramah, K., Ramatryana, I. N. A., & Anwar, K. (2018). Coded Random Access Prioritizing Human Over Machines for Future IoT Networks. 2018 2nd International Conference on Telematics and Future Generation Networks (TAFGEN), 19–24. https://doi.org/10.1109/TAFGEN.2018.8580480

Purwita, A., & Anwar, K. (2016). Massive Multiway Relay Networks Applying Coded Random Access. IEEE Transactions on Communications, 1–1. https://doi.org/10.1109/TCOMM.2016.2600562

Rancy, F. (2015). IMT for 2020 and Beyond (pp. 69–84). Radiocommunication Bureau, International Telecommunication Union. https://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=&cad=rja&uact=8&ved=2ahUKEwjP9djt2KHtAhWCV30KHUjLDtQQFjAAegQIARAC&url=https%3A%2F%2Fwww.riverpublishers.com%2Fpdf%2Febook%2Fchapter%2FRP_9788793379787C6.pdf&usg=AOvVaw3UVZnEp7ApoJnlQRBKFkfi

Shokrollahi, A. (2006). Raptor codes. IEEE Transactions on Information Theory, 52(6), 2551–2567. https://doi.org/10.1109/TIT.2006.874390

Tjaja, R. P. (2009). Menuju Penduduk Tumbuh Seimbang Tahun 2020. Bappenas. https://www.bappenas.go.id/index.php/download_file/view/10723/2439/

Toni, L., & Frossard, P. (2015). Prioritized Random MAC Optimization Via Graph-Based Analysis. IEEE Transactions on Communications, 63(12), 5002–5013. https://doi.org/10.1109/TCOMM.2015.2494044