File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Dynamic gNodeB Sleep Control for Energy-Conserving Radio Access Network

TitleDynamic gNodeB Sleep Control for Energy-Conserving Radio Access Network
Authors
KeywordsBase station sleep control
greedy policy
index policy
Markov decision process
NG-RAN
Issue Date2024
Citation
IEEE Transactions on Cognitive Communications and Networking, 2024, v. 10, n. 4, p. 1371-1385 How to Cite?
Abstract—5G radio access network (RAN) is consuming much more energy than legacy RAN due to the denser deployments of gNodeBs (gNBs) and higher single-gNB power consumption. In an effort to achieve an energy-conserving RAN, this paper develops a dynamic on-off switching paradigm, where the ON/OFF states of gNBs can be dynamically configured according to the evolvements of the associated users. We formulate the dynamic sleep control for a cluster of gNBs as a Markov decision process (MDP) and analyze various switching policies to reduce the energy expenditure. The optimal policy of the MDP that minimizes the energy expenditure can be derived from dynamic programming, but the computation is expensive. To circumvent this issue, this paper puts forth a greedy policy and an index policy for gNB sleep control. When there is no constraint on the number of gNBs that can be turned off, we prove the dual-threshold structure of the greedy policy and analyze its connections with the optimal policy. Inspired by the dual-threshold structure and Whittle index, we develop an index policy by decoupling the original MDP into multiple one-dimensional MDPs – the indexability of the decoupled MDP is proven and an algorithm to compute the index is proposed. Extensive simulation results verify that the index policy exhibits close-to-optimal performance in terms of the energy expenditure of the gNB cluster. As far as the computational complexity is concerned, the index policy is much more efficient than the optimal policy, which is computationally prohibitive when the number of gNBs is large.
Persistent Identifierhttp://hdl.handle.net/10722/363615

 

DC FieldValueLanguage
dc.contributor.authorShen, Pengfei-
dc.contributor.authorShao, Yulin-
dc.contributor.authorCao, Qi-
dc.contributor.authorLu, Lu-
dc.date.accessioned2025-10-10T07:48:10Z-
dc.date.available2025-10-10T07:48:10Z-
dc.date.issued2024-
dc.identifier.citationIEEE Transactions on Cognitive Communications and Networking, 2024, v. 10, n. 4, p. 1371-1385-
dc.identifier.urihttp://hdl.handle.net/10722/363615-
dc.description.abstract—5G radio access network (RAN) is consuming much more energy than legacy RAN due to the denser deployments of gNodeBs (gNBs) and higher single-gNB power consumption. In an effort to achieve an energy-conserving RAN, this paper develops a dynamic on-off switching paradigm, where the ON/OFF states of gNBs can be dynamically configured according to the evolvements of the associated users. We formulate the dynamic sleep control for a cluster of gNBs as a Markov decision process (MDP) and analyze various switching policies to reduce the energy expenditure. The optimal policy of the MDP that minimizes the energy expenditure can be derived from dynamic programming, but the computation is expensive. To circumvent this issue, this paper puts forth a greedy policy and an index policy for gNB sleep control. When there is no constraint on the number of gNBs that can be turned off, we prove the dual-threshold structure of the greedy policy and analyze its connections with the optimal policy. Inspired by the dual-threshold structure and Whittle index, we develop an index policy by decoupling the original MDP into multiple one-dimensional MDPs – the indexability of the decoupled MDP is proven and an algorithm to compute the index is proposed. Extensive simulation results verify that the index policy exhibits close-to-optimal performance in terms of the energy expenditure of the gNB cluster. As far as the computational complexity is concerned, the index policy is much more efficient than the optimal policy, which is computationally prohibitive when the number of gNBs is large.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Cognitive Communications and Networking-
dc.subjectBase station sleep control-
dc.subjectgreedy policy-
dc.subjectindex policy-
dc.subjectMarkov decision process-
dc.subjectNG-RAN-
dc.titleDynamic gNodeB Sleep Control for Energy-Conserving Radio Access Network-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TCCN.2024.3375508-
dc.identifier.scopuseid_2-s2.0-85187979877-
dc.identifier.volume10-
dc.identifier.issue4-
dc.identifier.spage1371-
dc.identifier.epage1385-
dc.identifier.eissn2332-7731-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats