Home
Author Guide
Editor Guide
Reviewer Guide
Special Issues
Special Issue Introduction
Special Issues List
Topics
Published Issues
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2010
2009
2008
2007
2006
journal menu
Aims and Scope
Editorial Board
Indexing Service
Article Processing Charge
Open Access Policy
Publication Ethics
Digital Preservation Policy
Editorial Process
Subscription
Contact Us
General Information
ISSN:
1796-2021 (Online); 2374-4367 (Print)
Abbreviated Title:
J. Commun.
Frequency:
Monthly
DOI:
10.12720/jcm
Abstracting/Indexing:
Scopus
;
DBLP
;
CrossRef
,
EBSCO
,
Google Scholar
;
CNKI,
etc.
E-mail questions
or comments to
jocm@vip.163.com
;
jcm@etpub.com
Acceptance Rate:
27%
APC:
400 USD
Average Days to Accept:
121 days
Journal Metrics
2.5
2022
CiteScore
41st percentile
Powered by
Editor-in-Chief
Prof. Maode Ma
College of Engineering, Qatar University, Doha, Qatar
I'm very happy and honored to take on the position of editor-in-chief of JCM, which is a high-quality journal with potential and I'll try my every effort to bring JCM to a next level...
[Read More]
What's New
2024-04-17
Volume 19, No. 3 has been indexed by Scopus.
2024-04-17
Volume 19, No. 2 has been indexed by Scopus.
2024-04-17
Vol. 19, No. 4 has been published online!
Home
>
Published Issues
>
2023
>
Volume 18, No. 8, August 2023
>
JCM 2023 Vol.18(8): 481-488
Doi: 10.12720/jcm.18.8.481-488
Design of Degree Distribution with Maximum Distance Separable Codes for User Priority
Solichah Larasati *, Khoirun Ni’amah, Reni Dyah Wahyuningrum, and Alfin Hikmaturokhman
Institut Teknologi Telkom Purwokerto, Faculty of Telecommunications and Electrical Engineering, Purwokerto, Indonesia; Email: {irun, reni, alfin}@ittelkom-pwt.ac.id (K.N., R.D.W., A.H.)
*Correspondence: laras@ittelkom-pwt.ac.id (S.L.)
Manuscript received January 2, 2023; revised February 27, 2023; accepted March 7, 2023.
Abstract
—In the super-dense future network communication, human and machine communications are mixed in a single network. They will trespass each other and could lead to an intersection. This paper develops Coded Random Access (CRA) using Maximum Distance Sparable (MDS) codes as a multiple access scheme to serve millions of users, covering human and machines. This research aims to maximum number of user human and machines, where the priority access is given to the human. Two keywords of CRA, i.e., coding (solved by optimal degree distributions) and random. To analyze design degree distribution using Extrinsic Information Transfer (EXIT) Chart projection under binary erasure channels (BEC). The priority scheme for human communications is determined based on utility functions. The parameters used to see the performance of the EXIT chart are packet-loss-rate (PLR) and throughput. Based on the results, the degree design has succeeded in prioritizing humans, which is indicated by the small PLR value but large throughput, as well as the EXIT curve with its very small gap.
Keywords
—CRA, EXIT Chart, MDS Codes, PLR, throughput
Cite: Solichah Larasati, Khoirun Ni’amah, Reni Dyah Wahyuningrum, and Alfin Hikmaturokhman, “Design of Degree Distribution with Maximum Distance Separable Codes for User Priority," Journal of Communications vol. 18, no. 8, pp. 481-488, August 2023.
Copyright © 2023 by the authors. This is an open access article distributed under the Creative Commons Attribution License (
CC BY-NC-ND 4.0
), which permits use, distribution and reproduction in any medium, provided that the article is properly cited, the use is non-commercial and no modifications or adaptations are made.
附件说明
PREVIOUS PAPER
A Non-hierarchical Multipath Routing Protocol Using Fuzzy Logic for Optimal Network Lifetime in Wireless Sensor Network
NEXT PAPER
An Optimized Vertical Handover Decision Model for the Heterogeneous DSRC/LTE Vehicular Networks