IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v25y2023i2d10.1007_s11009-023-10026-1.html
   My bibliography  Save this article

Energy Efficiency in a Base Station of 5G Cellular Networks using M/G/1 Queue with Multiple Sleeps and N-Policy

Author

Listed:
  • Deena Merit C.K.

    (PSG College of Technology)

  • Haridass M.

    (PSG College of Technology)

  • Dharmaraja Selvamuthu

    (Bhattadev University)

  • Priyanka Kalita

    (Bhattadev University)

Abstract

Reducing energy consumption is the vital goal of green communication. Base station (BS) is a radio receiver/transmitter that serves as the hub of the local wireless network. It is a gateway between a wired network and the wireless network. BS consumes high energy to receive and transfer the signals. Power consumption in base station can be minimized by using effective sleep and wake-up/setup operations with a tolerable delay. In this research work, the service process of the BS is considered as an M/G/1 queue with close down, sleep and setup. The strategy N-Policy is introduced to awake the BS from multiple sleeps (MS) after a predefined number N of user requests (URs) accumulated in the system. The supplementary variable technique is used to obtain the probability-generating functions and the steady-state probabilities for different states of the BS. The mean delay of the UR and mean power consumption of the BS are also derived. Also, the comparative analysis of the proposed model with the existing model has been presented. Computational results show that multiple sleeps with N-policy consumes less power than multiple sleeps without N-policy.

Suggested Citation

  • Deena Merit C.K. & Haridass M. & Dharmaraja Selvamuthu & Priyanka Kalita, 2023. "Energy Efficiency in a Base Station of 5G Cellular Networks using M/G/1 Queue with Multiple Sleeps and N-Policy," Methodology and Computing in Applied Probability, Springer, vol. 25(2), pages 1-28, June.
    • Handle: RePEc:spr:metcap:v:25:y:2023:i:2:d:10.1007_s11009-023-10026-1
    DOI: 10.1007/s11009-023-10026-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-023-10026-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-023-10026-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. B. A. Powell & B. Avi-Itzhak, 1967. "Queuing Systems with Enforced Idle Time," Operations Research, INFORMS, vol. 15(6), pages 1145-1156, December.
    2. Priyanka Kalita & Gautam Choudhury & Dharmaraja Selvamuthu, 2020. "Analysis of Single Server Queue with Modified Vacation Policy," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 511-553, June.
    3. M. Haridass & R. Arumuganathan, 2012. "A batch service queueing system with multiple vacations, setup time and server's choice of admitting reservice," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 14(2), pages 156-186.
    4. Hanoch Levy & Leonard Kleinrock, 1986. "A Queue with Starter and a Queue with Vacations: Delay Analysis by Decomposition," Operations Research, INFORMS, vol. 34(3), pages 426-436, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.
    2. B. Kumar & D. Arivudainambi & A. Krishnamoorthy, 2006. "Some results on a generalized M/G/1 feedback queue with negative customers," Annals of Operations Research, Springer, vol. 143(1), pages 277-296, March.
    3. G. Ayyappan & S. Karpagam, 2018. "An M [ X ] / G ( a , b )/1 Queueing System with Breakdown and Repair, Stand-By Server, Multiple Vacation and Control Policy on Request for Re-Service," Mathematics, MDPI, vol. 6(6), pages 1-18, June.
    4. M. Vadivukarasi & K. Kalidass, 2022. "Discussion on the transient solution of single server Markovian multiple variant vacation queues with disasters," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1352-1376, December.
    5. Offer Kella & Uri Yechiali, 1988. "Priorities in M/G/1 queue with server vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 23-34, February.

    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:spr:metcap:v:25:y:2023:i:2:d:10.1007_s11009-023-10026-1. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.