Abstract
Base Stations (BSs) sleeping strategy is an efficient way to obtain the energy efficiency of cellular networks. To meet the increasing demand of high-data-rate for wireless applications, small cell BSs provide a promising and feasible approach but that consumes more power. Hence, energy efficiency in small cell BSs is a major issue to be concerned. To get the energy efficiency, in this research work, we have addressed the total power consumption and delay of User Requests (URs) in the small cell as well as 5G small cell BSs with sleeping strategy and N limited scheme. One of the effective ways to reduce the power consumption is introduce BSs sleeping strategy. Here, the small cell BSs are modeled as a M/G/1 queueing system with two different types of sleep modes namely, short sleep mode and long sleep mode. Short sleep mode is consists of maximum M number of short sleep. Here, the steady state probabilities of the small cell BSs in active, short sleep and long sleep modes are derived using supplementary variable technique. The expressions for expected power consumption and expected delay are also obtained. Finally, to get the energy consumption from the small cell BSs, the optimization of expected power consumption and expected delay is presented. The numerical results displays the impact of various parameters on power consumption and delay in small cell BSs. Also, the comparative analysis for the proposed model with the existing model has been presented.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Blondia, C. (2021). A queueing model for a wireless sensor node using energy harvesting. Telecommunication Systems, 77(2), 335–349. https://doi.org/10.1007/s11235-021-00758-1
Castañeda, L. B., Arunachalam, V., & Dharmaraja, S. (2012). Introduction to probability and stochastic processes with applications. Wiley.
Choudhury, G. (2002). Some aspects of M/G/1 queue with two different vacation times under multiple vacation policy. Stochastic Analysis and Applications., 20(5), 901–909. https://doi.org/10.1081/SAP-120014547
Farooq, H., & Imran, A. (2016). Spatiotemporal mobility prediction in proactive self-organizing cellular networks. IEEE Communications Letters, 21(2), 370–373. https://doi.org/10.1109/LCOMM.2016.2623276
Ge, X., Yang, J., Gharavi, H., & Sun, Y. (2017). Energy efficiency challenges of 5G small cell networks. IEEE Communications Magazine, 55(5), 184–191. https://doi.org/10.1109/MCOM.2017.1600788
Guo, X., Niu, Z., Zhou, S., & Kumar, P. R. (2016). Delay-constrained energy-optimal base station sleeping control. IEEE Journal on Selected Areas in Communications, 34(5), 1073–1085. https://doi.org/10.1109/JSAC.2016.2520221
Hawasli, M., & Çolak, S. A. (2017). Toward green 5G heterogeneous small-cell networks: power optimization using load balancing technique. AEU-International Journal of Electronics and Communications, 82, 474–485. https://doi.org/10.1016/j.aeue.2017.09.012
Huang, X., Tang, S., Zheng, Q., Zhang, D., & Chen, Q. (2018). Dynamic femtocell gNB on/off strategies and seamless dual connectivity in 5G heterogeneous cellular networks. IEEE Access, 6, 21359–21368. https://doi.org/10.1109/ACCESS.2018.2796126
Lee, H. W., Lee, S. S., Park, J. O., & Chae, K. C. (1994). Analysis of the \(M^x/G/1\) queue by \(N\)-policy and multiple vacations. Journal of Applied Probability, 31(2), 476–496. https://doi.org/10.2307/3215040
Liu, C., Natarajan, B., & Xia, H. (2015). Small cell base station sleep strategies for energy efficiency. IEEE Transactions on Vehicular Technology, 65(3), 1652–1661. https://doi.org/10.1109/TVT.2015.2413382
Niu, Z., Guo, X., Zhou, S., & Kumar, P. R. (2015). Characterizing energy-delay tradeoff in hyper-cellular networks with base station sleeping control. IEEE Journal on Selected Areas in Communications, 33(4), 641–650. https://doi.org/10.1109/JSAC.2015.2393494
Parvez, I., Rahmati, A., Guvenc, I., Sarwat, A. I., & Dai, H. (2018). A survey on low latency towards 5G: RAN, core network and caching solutions. IEEE Communications Surveys & Tutorials, 20(4), 3098–3130. https://doi.org/10.1109/COMST.2018.2841349
Pei, L., Huilin, J., Zhiwen, P., & Xiaohu, Y. (2017). Energy-delay tradeoff in ultra-dense networks considering BS sleeping and cell association. IEEE Transactions on Vehicular Technology, 67(1), 734–751. https://doi.org/10.1109/TVT.2017.2740439
Schulz, P., Matthe, M., Klessig, H., Simsek, M., Fettweis, G., Ansari, J., Ashraf, S. A., Almeroth, B., Voigt, J., Riedel, I., Puschmann, A., & Windisch, M. (2017). Latency critical IoT applications in 5G: Perspective on the design of radio interface and network architecture. IEEE Communications Magazine, 55(2), 70–78. https://doi.org/10.1109/MCOM.2017.1600435CM
Shariatmadari, H., Duan, R., Iraji, S., Li, Z., Uusitalo, M. A., & Jäntti, R. (2017). Resource allocations for ultra-reliable low-latency communications. International Journal of Wireless Information Networks, 24(3), 317–327. https://doi.org/10.1007/s10776-017-0360-5
Shortle, J. F., Thompson, J. M., Gross, D., & Harris, C. M. (2018). Fundamentals of queueing theory (Vol. 399). Wiley.
Takagi, H. (1991). Queueing analysis: A foundation of performance evaluation. Vacation and Priority Systems, 1(1).
Valenzuela-Valdés, J. F., Palomares, A., González-Macías, J. C., Valenzuela-Valdés, A., Padilla, P., & Luna-Valero, F. (2018). On the ultra-dense small cell deployment for 5G networks. In 2018 IEEE 5G World Forum (5GWF) (pp. 369–372). https://doi.org/10.1109/5GWF.2018.8516948.
Venkateswararao, K., & Swain, P. (2022). Binary-PSO-based energy-efficient small cell deployment in 5G ultra-dense network. The Journal of Supercomputing, 78(1), 1071–1092. https://doi.org/10.1007/s11227-021-03910-5
Wang, Y., Dai, X., Wang, J. M., & Bensaou, B. (2019). A reinforcement learning approach to energy efficiency and QoS in 5G wireless networks. IEEE Journal on Selected Areas in Communications, 37(6), 1413–1423. https://doi.org/10.1109/JSAC.2019.2904365.
Woon, L. J., Ramasamy, G., & Thiagarajah, S. P. (2021). Peak power shaving in hybrid power supplied 5G base station. Bulletin of Electrical Engineering and Informatics, 10(1), 62–69. https://doi.org/10.11591/eei.v10i1.2705.
Wu, J., Wong, E. W., Chan, Y. C., & Zukerman, M. (2020). Power consumption and GoS tradeoff in cellular mobile networks with base station sleeping and related performance studies. IEEE Transactions on Green Communications and Networking, 4(4), 1024–1036. https://doi.org/10.1109/TGCN.2020.3000277
Wu, J., Zhou, S., & Niu, Z. (2013). Traffic-aware base station sleeping control and power matching for energy-delay tradeoffs in green cellular networks. IEEE Transactions on Wireless Communications, 12(8), 4196–4209. https://doi.org/10.1109/TWC.2013.071613.122092
Yang, J., Wang, W., & Zhang, X. (2017). Hysteretic base station sleeping control for energy saving in 5g cellular network. In 2017 IEEE 85th Vehicular Technology Conference (VTC Spring) (pp. 1–5). https://doi.org/10.1109/VTCSpring.2017.8108599.
Yang, J., Zhang, X., & Wang, W. (2016). Two-stage base station sleeping scheme for green cellular networks. Journal of Communications and Networks, 18(4), 600–609. https://doi.org/10.1109/JCN.2016.000083
Zhang, H., Liu, H., Cheng, J., & Leung, V. C. (2017). Downlink energy efficiency of power allocation and wireless backhaul bandwidth allocation in heterogeneous small cell networks. IEEE Transactions on Communications, 66(4), 1705–1716. https://doi.org/10.1109/TCOMM.2017.2763623
Acknowledgements
One of the authors (Deepa V) acknowledges the Summer Faculty Research Fellow (SFRF-2021) Programme of CEP, IIT Delhi, which enabled to pursue research in IIT Delhi. One of the authors (Dharmaraja Selvamuthu) thanks Bharti Airtel Limited, India, for financial support in this research work.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix A
Proof of Theorem 1
Since the system does not change over time in steady state, the assumptions \(P_{1,n}(x)=\lim _{t\rightarrow \infty } P_{1,n}(x,t),\quad Q^1_{j,n}(x)=\lim _{t\rightarrow \infty }Q^1_{j,n}(x,t), Q^2_{n}(x)= \lim _{t\rightarrow \infty }Q^2_{n}(x,t), \) are taken to obtain the steady state probabilities. Using these assumptions in Eqs. (1) to (11), the steady state equations are obtained as follows:
The Laplace-Stieltjes transform of \(P_{1,n}(x)\), \(Q^{1}_{j,n}(x)\) and \(Q^{2}_{n}(x)\) are defined as
Taking Laplace-Stieltjes transform on both sides of the Eqs. (A.1) to (A.11),
To find the steady state probability generating function (PGF) of the number of URs in the queue at an arbitrary time epoch, the following PGFs are defined as:
Multiplying Eq. (A.16) by \(z^0\), (A.17) by \(z^n,(n=1,2,\ldots )\) and taking summation from 0 to \(\infty \) and using Eq. (A.23)
Multiplying Eq. (A.18) by \(z^0\), (A.19) by \(z^n, (n=1,2,\ldots , N-1)\), (A.20) by \(z^n (n=N,N+1,\ldots )\) taking summation from 0 to \(\infty \) and using Eq. (A.23)
Multiplying Eq. (A.21) by \(z^0\), (A.22) by \(z^n (n=1,2,\ldots , N-1)\) and taking summation from 0 to \(N-1\) and using Eq. (A.23)
Multiplying Eq. (A.12) by \(z^0\), (A.13) by \(z^n (n=1,2,\ldots , N-2)\), (A.14) by \(z^{N-1}\), (A.15) by \(z^n,(n=N,N+1,\ldots )\) and taking summation from 0 to \(\infty \) and using Eq. (A.23)
Substituting \(\theta =\lambda -\lambda z\) in Eqs. (A.24),(A.25),(A.26), and (A.27), we obtain the following
Substituting Eq. (A.28) in (A.24), we have
Substituting Eq. (A.29) in (A.25), we obtain the following
Substituting Eq. (A.30) in (A.26), we get
Substituting Eq. (A.31) in (A.27), we obtain
\(\square \)
1.1 The probability generating Function of number of user requests in the queue P(z) at an arbitrary time epoch
Substituting Eqs. (A.32), (A.33), (A.34) and (A.35) in the above equation, we get
where \(q^{1}_n=\sum _{j=1}^{M-1}Q^1_{j,n}(0)\). The probability generating function P(z) has to satisfy \(P(1) = 1\). In order to satisfy the condition, applying L’Hospital’s rule and evaluating \(\lim _{z\rightarrow 1} P(z)\) and equating the expression to 1, \(( 1-\lambda E(S)) > 0 \) is obtained. Let \(\rho = \lambda E[S]\). Thus \(\rho <1\) is the stability condition for the proposed model.
Appendix B
Proof of Theorem 2
Since \(\beta _i\) is the probability of i URs arrive during the short sleep period.
Multiplying both sides of the above equation by \(z^i\) and taking the summation from \(i=0\) to \(\infty \), we obtain the following
\(\square \)
Appendix C
Proof of Theorem 3
From Eqs. (A.28), (A.29) and using (A.23), we get
Using Theorem 1, we get
where \(\beta _i\) is the probability that ‘i’ URs arrive during the short sleep period. \(\square \)
Equating the coefficients of \(z^n , n= 0,1,\ldots N-1\) on both sides of equation, we have
and
By substituting \(b_0=\frac{\beta _0}{1-\beta _{0}}\) and \(c_{0}= \frac{Q^1_{M,0}(0)}{1-\beta _{0}}\), the above equation reduces to \( q^{1}_{0} = b_{0}P_{1,0}-c_{0}\).
In Eq. (C.1), when \(n=1\) we get
Substituting Eq. (C.2) in the above equation, we get
In Eq. (C.1), when \( n=2\), we get
From Eq. (A.28), we have
Coefficient of \(z^n\) in the above equation is \(Q^1_{1,n}\) =\(\beta _n P_{1,0}(0)\).
From Eq. (A.29), we have
Coefficient of \(z^n\) in the above equation is
From Eq. (A.29), we have
Coefficient of \(z^n\) in the above equation is
By generalizing this, we get the coefficient of \(z^n\) in \(Q_{M} (z,0)\) is
Appendix D
Proof of Theorem 4
From Eq. (A.21), we have
Substituting \(\theta = \lambda \) in (D.1), we get
Therefore,
Substituting \(n = 1\) in Eq. (A.22), we get
when \(\theta =\lambda \), the above equation reduces to
Substituting the above in Eq. (D.2), we get
Substituting \(n = 2\) in Eq. (A.22), we get
When \(\theta = \lambda \), the above equation reduced to
Substituting the above in Eq. (D.3), we get
where \(k_{2} = \frac{\widetilde{V}^{2}_{2}({\lambda })+k_{1}}{(\theta - \lambda )}\).
Substituting \(n = 3\) in Eq. (A.22), we get
When \(\theta = \lambda \), the above equation reduced to
Substituting the above in Eq. (D.4), we get
where \(k_{3} = \frac{V^{3}_{2}(\lambda )+k_{2}}{\theta -\lambda }\).
Generalizing this, we have
where \(k_{j}=\frac{\widetilde{V}_{2}^{j}(\lambda )+k_{j-1}}{\theta -\lambda }\quad \text {and} \qquad k_{0}=\frac{\widetilde{V}_{2}(\lambda )-\widetilde{V}_{2}(\theta )}{\theta -\lambda }\). \(\square \)
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Deepa, V., Haridass, M., Selvamuthu, D. et al. Analysis of energy efficiency of small cell base station in 4G/5G networks. Telecommun Syst 82, 381–401 (2023). https://doi.org/10.1007/s11235-022-00987-y
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-022-00987-y