IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i5p508-d508652.html
   My bibliography  Save this article

A Poisson Process-Based Random Access Channel for 5G and Beyond Networks

Author

Listed:
  • Alaa Omran Almagrabi

    (Department of Information Systems, Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah 21589, Saudi Arabia
    A.O.A. and R.A. have equally contributed as First Author.)

  • Rashid Ali

    (School of Intelligent Mechatronics Engineering, Sejong University, Seoul 05006, Korea
    A.O.A. and R.A. have equally contributed as First Author.)

  • Daniyal Alghazzawi

    (Department of Information Systems, Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah 21589, Saudi Arabia)

  • Abdullah AlBarakati

    (Department of Information Systems, Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah 21589, Saudi Arabia)

  • Tahir Khurshaid

    (Department of Electrical Engineering, Yeungnam University, Gyeongsan 38541, Korea)

Abstract

The 5th generation (5G) wireless networks propose to address a variety of usage scenarios, such as enhanced mobile broadband (eMBB), massive machine-type communications (mMTC), and ultra-reliable low-latency communications (URLLC). Due to the exponential increase in the user equipment (UE) devices of wireless communication technologies, 5G and beyond networks (B5G) expect to support far higher user density and far lower latency than currently deployed cellular technologies, like long-term evolution-Advanced (LTE-A). However, one of the critical challenges for B5G is finding a clever way for various channel access mechanisms to maintain dense UE deployments. Random access channel (RACH) is a mandatory procedure for the UEs to connect with the evolved node B (eNB). The performance of the RACH directly affects the performance of the entire network. Currently, RACH uses a uniform distribution-based (UD) random access to prevent a possible network collision among multiple UEs attempting to access channel resources. However, in a UD-based channel access, every UE has an equal chance to choose a similar contention preamble close to the expected value, which causes an increase in the collision among the UEs. Therefore, in this paper, we propose a Poisson process-based RACH (2PRACH) alternative to a UD-based RACH. A Poisson process-based distribution, such as exponential distribution, disperses the random preambles between two bounds in a Poisson point method, where random variables occur continuously and independently with a constant parametric rate. In this way, our proposed 2PRACH approach distributes the UEs in a probability distribution of a parametric collection. Simulation results show that the shift of RACH from UD-based channel access to a Poisson process-based distribution enhances the reliability and lowers the network’s latency.

Suggested Citation

  • Alaa Omran Almagrabi & Rashid Ali & Daniyal Alghazzawi & Abdullah AlBarakati & Tahir Khurshaid, 2021. "A Poisson Process-Based Random Access Channel for 5G and Beyond Networks," Mathematics, MDPI, vol. 9(5), pages 1-12, March.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:5:p:508-:d:508652
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/5/508/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/5/508/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:5:p:508-:d:508652. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.