Publication | Closed Access
Dynamic Base Station Switching-On/Off Strategies for Green Cellular Networks
413
Citations
23
References
2013
Year
Energy ConsumptionMobile Data OffloadingWireless Cellular NetworksEngineeringEnergy ManagementEdge ComputingEnergy EfficiencyGreen Cellular NetworksComputer EngineeringGreen CommunicationPower ControlMobile ComputingDynamic Base StationGreen Communication SystemPower-efficient ComputingGreen NetworkingSmall CellEnergy-efficient Networking
The energy‑minimization problem for base‑station switching is a difficult combinatorial challenge that incurs high computational complexity and large signaling overhead. The study investigates dynamic base‑station switching to reduce energy consumption in wireless cellular networks and proposes a distributed, low‑complexity SWES algorithm. The authors formulate a general energy‑minimization problem and propose a distributed SWES algorithm that sequentially turns off BSs using a network‑impact metric, with three heuristic variants that approximate this metric to reduce signaling overhead, and describe protocol‑level implementation and first‑order energy‑saving estimates. Simulations show that the SWES algorithms can cut total energy consumption by 50–80% using a real metropolitan traffic profile.
In this paper, we investigate dynamic base station (BS) switching to reduce energy consumption in wireless cellular networks. Specifically, we formulate a general energy minimization problem pertaining to BS switching that is known to be a difficult combinatorial problem and requires high computational complexity as well as large signaling overhead. We propose a practically implementable switching-on/off based energy saving (SWES) algorithm that can be operated in a distributed manner with low computational complexity. A key design principle of the proposed algorithm is to turn off a BS one by one that will minimally affect the network by using a newly introduced notion of network-impact, which takes into account the additional load increments brought to its neighboring BSs. In order to further reduce the signaling and implementation overhead over the air and backhaul, we propose three other heuristic versions of SWES that use the approximate values of network-impact as their decision metrics. We describe how the proposed algorithms can be implemented in practice at the protocol-level and also estimate the amount of energy savings through a first-order analysis in a simple setting. Extensive simulations demonstrate that the SWES algorithms can significantly reduce the total energy consumption, e.g., we estimate up to 50-80% potential savings based on a real traffic profile from a metropolitan urban area.
| Year | Citations | |
|---|---|---|
Page 1
Page 1