TY - JOUR
T1 - A distance-sensitive distributed repulsive sleeping approach for dependable coverage in heterogeneous cellular networks
AU - Tang, Liangrui
AU - He, Yanhua
AU - Zhou, Zhenyu
AU - Ren, Yun
AU - Mumtaz, Shahid
AU - Rodriguez, Jonathan
N1 - Funding Information:
This work was supported by the Fundamental Research Funds for the Central Universities (2018QN003).
Publisher Copyright:
© 2019 John Wiley & Sons, Ltd.
PY - 2019/11/1
Y1 - 2019/11/1
N2 - Base station (BS) sleeping technology has become one of the significant technologies in fifth-generation green communications. However, enormous communication overhead and coverage holes produced by existing sleeping strategies will decline the robustness of the network. To tackle this problem, this paper proposes a distance-sensitive distributed repulsive sleeping strategy (DSDRSS), based on hard-core point process (HCPP). First, through information exchanges, presleeping BSs in the same region form a sleeping cluster (SC) whose size is limited by sleeping distance. Second, BSs in the SC perform BS sleeping with a mark method where BSs will be randomly assigned a mark, and BSs with the lowest mark will remain on to ensure the coverage. Third, to characterize the performance of DSDRSS, the analytical expressions of sleeping probability, coverage probability, and average achievable rate for user equipment (UE) under DSDRSS are derived. Finally, the coverage characteristics of UE under DSDRSS are analyzed and compared with those under different sleeping operations. DSDRSS realizes sleeping operations through the cooperation between BSs in an SC, not relying on the feedback links between a small BS and the control center. As a result, DSDRSS can not only enable flexible perception of traffic changes in sleeping area but also complete sleeping with less overhead. The simulation results show that DSDRSS supports more dependable coverage compared with random sleeping strategy and general repulsive sleeping strategy.
AB - Base station (BS) sleeping technology has become one of the significant technologies in fifth-generation green communications. However, enormous communication overhead and coverage holes produced by existing sleeping strategies will decline the robustness of the network. To tackle this problem, this paper proposes a distance-sensitive distributed repulsive sleeping strategy (DSDRSS), based on hard-core point process (HCPP). First, through information exchanges, presleeping BSs in the same region form a sleeping cluster (SC) whose size is limited by sleeping distance. Second, BSs in the SC perform BS sleeping with a mark method where BSs will be randomly assigned a mark, and BSs with the lowest mark will remain on to ensure the coverage. Third, to characterize the performance of DSDRSS, the analytical expressions of sleeping probability, coverage probability, and average achievable rate for user equipment (UE) under DSDRSS are derived. Finally, the coverage characteristics of UE under DSDRSS are analyzed and compared with those under different sleeping operations. DSDRSS realizes sleeping operations through the cooperation between BSs in an SC, not relying on the feedback links between a small BS and the control center. As a result, DSDRSS can not only enable flexible perception of traffic changes in sleeping area but also complete sleeping with less overhead. The simulation results show that DSDRSS supports more dependable coverage compared with random sleeping strategy and general repulsive sleeping strategy.
U2 - 10.1002/ett.3784
DO - 10.1002/ett.3784
M3 - Article
AN - SCOPUS:85075014035
VL - 30
JO - Transactions on Emerging Telecommunications Technologies
JF - Transactions on Emerging Telecommunications Technologies
SN - 2161-3915
IS - 11
M1 - e3784
ER -