proposed as another technical challenge in the
design of 5G systems, [16].
Specifically, according to some surveys on
energy consumption, [17], [18],, 80% of energy
consumption in mobile communication networks is
due to the operation of BSs. Further, based on the
results from laboratory tests done by China Mobile
Communications Corporation, a BS consumes
100% energy in the state with the maximum traffic
load and about 50%-60% energy in the state with
zero traffic load, while the energy consumption of
a BS can be reduced to 40% if it is switched off
(i.e., in the sleeping state). Therefore, an effective
way to achieve energy saving in mobile
communication networks is to dynamically switch
off BSs, especially for scenarios with low traffic
load where fewer BSs can meet the traffic needs of
all user equipment (UEs), [19].
A traditional BS consists of baseband unit
(BBU) for a baseband signal processing and a
remote radio head (RRH) for
transmitting/receiving radio signals, [20]. When a
traditional BS is switched off, BBU and RRH of
this BS would be switched off together. In
contrast, in cloud radio access networks (CRANs)
which would be investigated and pursued in 5G
systems, BBUs of several traditional BSs are
centralized in a single location and the
corresponding BBU resources are sliced via
virtualization technologies, while RRHs are left at
cell sites. With this kind of system architecture, the
switch-off operation for RRHs and virtual BBUs
could be done separately, through combination
with flexible resource allocation on virtual BBUs.
The energy consumption on the base station (BS)
accounts for more than 50% of the total energy
consumption of the cellular network. Due to the
space-time characteristics of the traffic, the BS
cannot allocate resources reasonably, which results
in wasted energy consumption and low energy
efficiency (EE), [21]. Base station ON-OFF
switching in 5G wireless networks: approaches and
challenges to achieve the expected 1000x data
rates under the exponential growth of traffic
demand, a large number of base stations (BS) or
access points (AP) will be deployed in the fifth
generation (5G) wireless systems, to support high
data rate services and to provide seamless
coverage. Although such BSs are expected to be
small-scale with lower power, the aggregated
energy consumption of all BSs would be
remarkable, resulting in increased environmental
and economic concerns, [22], [23]. However, in
5G systems with new physical layer techniques
and highly heterogeneous network architecture,
new challenges arise in the design of BS ON-OFF
switching strategies. In this article, we begin with a
discussion on the inherent technical challenges of
BS ON-OFF switching. We then provide a
comprehensive review of recent advances in
switching mechanisms in different application
scenarios. Spectrum Slicing is arising as an
important notion for 5G wireless networks as it
helps in increasing the data rate, capacity and
therefore energy efficiency and spectral efficiency
of 5G networks. In this paper, traffic modelling is
done based on user density and demand. The
system model for spectrum slicing is analyzed
based on traffic density pattern analysis so that
utilization of spectrum is based on the probability
of active users in different zones i.e. urban,
suburban and rural areas which has the objective of
increasing spectral efficiency. Moreover, the
Hidden Markov Model is used for training and
preserving of Base station such that probabilistic
spectrum allocation to different user densities can
be achieved which aims to use the spectrum
efficiently.
3 Existing Work
Till now, we have been scheduling the processes
according to their arrival time (in FCFS
scheduling). However, the SJF scheduling
algorithm, schedules the processes according to
their burst time. In SJF scheduling, the process
with the lowest burst time, among the list of
available processes in the ready queue, is going to
be scheduled next. However, it is very difficult to
predict the burst time needed for a process hence
this algorithm is very difficult to implement in the
system. The advantages of SJF are the maximum
throughput and Minimum average waiting and
turnaround time. The disadvantage of SJF is they
may suffer from the problem of starvation. And
also it is not implementable because the exact
Burst time for a process can't be known in
advance. There are different techniques available
by which, the CPU burst time of the process can be
determined. We will discuss them later in detail.
Since-, No Process arrives at time 0 hence;
there will be an empty slot in the Gantt
chart from time 0 to 1 (the time at which the first
process arrives). According to the algorithm, the
OS schedules the process which is having the
lowest burst time among the available processes in
the ready queue. Till now, we have only one
process in the ready queue hence the scheduler will
schedule this to the processor no matter what is its
burst time. This will be executed for 8 units of
time.
WSEAS TRANSACTIONS on COMMUNICATIONS
DOI: 10.37394/23204.2023.22.15