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

Simulation Analysis of a Base Station Using Finite Buffer M/G/1 Queueing System with Variant Sleeps

Author

Listed:
  • V. Deepa

    (PSG College of Technology)

  • M. Haridass

    (PSG College of Technology)

Abstract

In communication networks, the signals from mobile phones are transmitted through Base Stations(BS). Nowadays the usage of mobile phones has tremendously increased. Approximately 80% of the input energy is dissipated as heat by the components of base stations (Holtkamp et al. in IEEE J Sel Areas Commun PP(99):1–10, 2013; Wu et al. in IEEE Commun Surveys Tuts 17(2):803–826, 2015). Various strategies are available to minimize the power consumption in a base station. One of the effective ways to reduce power consumption is sleeping strategy. Some of them are single sleep, multiple sleep, light sleep, deep sleep, N-policy. According to N-policy, the BS only enters the active state when there are N URs waiting in the queue. In this paper, a base station is modelled as finite buffer M/G/1 queue with two different sleeping modes namely, short sleep and long sleep. The probability generating function of queue size distribution is derived using supplementary variable technique. The expressions for expected power consumption and delay are derived. The proposed work is numerically justified using simulation. The simulation results are obtained and graphically verified in the proposed work.

Suggested Citation

  • V. Deepa & M. Haridass, 2023. "Simulation Analysis of a Base Station Using Finite Buffer M/G/1 Queueing System with Variant Sleeps," Methodology and Computing in Applied Probability, Springer, vol. 25(4), pages 1-18, December.
    • Handle: RePEc:spr:metcap:v:25:y:2023:i:4:d:10.1007_s11009-023-10052-z
    DOI: 10.1007/s11009-023-10052-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-023-10052-z
    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-10052-z?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. Tony T. Lee, 1984. "M / G /1/ N Queue with Vacation Time and Exhaustive Service Discipline," Operations Research, INFORMS, vol. 32(4), pages 774-784, August.
    2. Dieter Fiems & Stijn Vuyst & Sabine Wittevrongel & Herwig Bruneel, 2009. "Packet loss characteristics for M/G/1/N queueing systems," Annals of Operations Research, Springer, vol. 170(1), pages 113-131, September.
    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. Doo Il Choi & Dae-Eun Lim, 2020. "Analysis of the State-Dependent Queueing Model and Its Application to Battery Swapping and Charging Stations," Sustainability, MDPI, vol. 12(6), pages 1-15, March.
    2. Chris Blondia, 2021. "A queueing model for a wireless sensor node using energy harvesting," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 77(2), pages 335-349, June.
    3. Luis Zabala & Josu Doncel & Armando Ferro, 2023. "Modeling a Linux Packet-Capturing System with a Queueing System with Vacations," Mathematics, MDPI, vol. 11(7), pages 1-27, March.
    4. Grasman, Scott E. & Olsen, Tava Lennon & Birge, John R., 2005. "Finite buffer polling models with routing," European Journal of Operational Research, Elsevier, vol. 165(3), pages 794-809, September.
    5. Chris Blondia, 2022. "Evaluation of the Waiting Time in a Finite Capacity Queue with Bursty Input and a Generalized Push-Out Strategy," Mathematics, MDPI, vol. 10(24), pages 1-12, December.
    6. Seok Ho Chang & Dae Won Choi, 2006. "Modeling and Performance Analysis of a Finite-Buffer Queue with Batch Arrivals, Batch Services, and Setup Times: The M X /G Y /1/K + B Queue with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 218-228, May.
    7. Mu-Song Chen & Hao-Wei Yen, 2016. "A two-stage approach in solving the state probabilities of the multi-queue //1 model," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(5), pages 1230-1244, April.

    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:4:d:10.1007_s11009-023-10052-z. 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.