This article has been accepted for publication in a future issue of this journal, but has not been
fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications
Design and Analysis of Trafc-Based Discontinuous
Reception Operations for LTE Systems
Kai-Ten Feng, Wun-Ci Su, and Yu-Ping Yu
Department of Electrical and Computer Engineering
National Chiao Tung University, Hsinchu, Taiwan
ktfeng@mail.nctu.edu.tw, suwc.cm01g@nctu.edu.tw, and peter.id2507@gmail.com
AbstractThe 3GPP long term evolution (LTE) system is developed
to enhance mobile services from the former 3G systems. In order
to prolong the battery life time of mobile device, the discontinuous
reception (DRX) scheme is specied in the LTE standard to reduce
the power consumption of user equipment. Existing analytical models
did not comprehensively consider all essential sleep mode behaviors.
Therefore, a performance analysis including major DRX parameters is
proposed in this paper for sleep mode operation. The correctness of
proposed model is validated and the improvement can be observed via
simulations. Furthermore, according to proposed analytical model, the
DRX parameters can signicantly inuence the power-saving efciency
and quality-of-service (QoS) of LTE system. Hence, a trafc-based DRX
cycles adjustment (TDCA) scheme is proposed to adaptively adjust the
sleep cycles to balance the sleep ratio and mean packet delay based
on trafc estimation. A partially observable Markov decision process
(POMDP) is employed to conjecture the present trafc status. The policy
for selecting DRX parameters can be constructed based the evaluation
metrics in TDCA scheme. Simulation results show that the proposed
TDCA scheme can enhance the energy-saving efciency while the QoS
constraint is still satised.
Index Terms: 3GPP long term evolution (LTE), discon-
tinuous reception (DRX), power-saving, partially observ-
able Markov decision process (POMDP), performance
analysis.
1 I NTRODUCTION
Nowadays, there are many newly-developed technolo-
gies and architecture designs for 5G communication
systems such as massive multiple input multiple out-
put (MIMO), millimeter wave (mmWave), full-duplex
wireless network, and ultra-dense network (UDN). For
the bursty increase of trafc in next generation com-
munication, the aforementioned technologies focus on
1. This work was in part funded by MOST 106-2221-E-009-048,
MOST 106-2221-E-009-050, the Foxconn Technology Group, the Delta
Electronics, the Industrial Technology Research Institute (ITRI), and
the Telecommunication Laboratories at Chunghwa Telecom Co. Ltd,
Taiwan.
1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
enhancing the system capacity. The battery power of
user equipments (UEs) with these advanced technolo-
gies may drain fast for fullling the quality-of-service
(QoS) requirements either for 5G communications or
other wireless communication system such as Internet of
Things (IoT) and machine to machine (M2M) communi-
cations. Energy-saving techniques become unavoidable
to be adopted in data transmission technologies [2][4].
Similar to the sleep mode operation in IEEE 802.16e/m
WiMAX systems [5], the discontinuous reception (DRX)
has been specied in 3GPP LTE standards [1] which
intends to decrease the power consumption of UEs. As
a matter of fact, the DRX power-saving operation can
be directly extended to the low power scenarios for 5G
communications.
In LTE systems, the evolved NodeB (eNB) will co-
ordinate with UE to activate DRX operation by ra-
dio resource control (RRC) [29] when the UE is in
RRC CONNECTED state. By adopting DRX sleep cycles,
the UE will reduce its power consumption by turning
off its receiver periodically. Since the downlink/uplink
(DL/UL) transmissions are assigned via physical down-
link control channel (PDCCH), all transmissions are
paused if the UE does not listen to PDCCH. Therefore,
the DRX operation makes UE to discontinuously monitor
PDCCH and the UE can turn off its receiver when it
does not listen to PDCCH, which can reduce UEs energy
consumption. Moreover, if there is no packet arrival for a
predened time, the length of DRX cycle can be extended
which is one of the important features for LTE DRX
and is the main difference from sleep mode operation
in WiMAX systems. More details about DRX operation
will be described in Subsection 2.1.
The analysis of DRX operation has been investigated
for universal mobile telecommunications system (UMTS)
and LTE system in the past years. The analytical models
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications
are constructed to evaluate the sleep ratio and mean
packet delay based on the Poisson and bursty data trafc
for UMTS [6], [7] and has been extended for LTE DRX
operation in [9]. However, the authors of [10] claimed
that existing modeling techniques are complicate, which
include the steps of computing z-transform, generation
functions, and Laplace transform. A simpler model is
therefore proposed to analyze the DRX operation based
on different computational steps. In additional to estab-
lishing analytical models, there are existing works [8],
[11][19] investigating the power-saving performance
with the adoption of DRX operations. The authors in [14]
proposed an analysis model for packet delay and power
consumption in terms of short and long DRX cycles.
An overview of LTE DRX mechanism with adjustable
and non-adjustable DRX cycles with bursty packet data
trafc has been investigated in [13]. For different types of
trafc, the authors in [16] evaluated the inuences of LTE
DRX light and deep sleep mode on power consumption
for voice over IP (VoIP) and Web trafc. The work in
[15] further discussed the tradeoff between quality-of-
service (QoS) and energy-saving performance for VoIP
applications with DRX conguration. To improve the the
accuracy of the analytical model without increasing its
computational complexity, [11] proposed an approach
with a proper DRX conguration to reduce power con-
sumption of UE without degrading QoS requirement.
To balance the performance of power-saving and trans-
mission delay, the authors in [12] proposed an optimum
problem to nd the tradeoff based on operators prefer-
ence for power-saving. The discussion above intended to
nd the feasible DRX conguration for specic scenarios.
In order to adjust the DRX conguration, the authors of
[17], [18] proposed a scheme based on DRX cycle by uti-
lizing the paging information for UMTS DRX operation;
while the work in [8] designed an idle time threshold
based on performance analysis. On the other hand, for
LTE DRX operation, the authors of [19] proposed a
packet scheduling algorithm to reduce packet loss ratio
while energy-saving efciency can still be maintained.
From analytical results, the performance of DRX oper-
ation is inuenced by both the setting of its parameters
and the status of network trafc. Therefore, the param-
eters in a power-saving mechanism should be carefully
congured based on trafc behavior. However, most ex-
isting studies for trafc-based sleep cycle adjustment are
conducted in IEEE 802.16 WiMAX systems since WiMAX
standards are specied earlier. The sleep cycle length
in IEEE 802.16e systems can be binary exponentially
increased and xed corresponding to the power-saving
class (PSC) I and II, respectively [5]. Existing research
1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
works have been published to enhance energy-saving
performance [20][23]. The work in [20] adaptively con-
trols the initial and nal sleep cycle lengths of PSC I. The
authors of [21] proposed an algorithm to dynamically
switch between the two PSCs based on a semi-Markov
decision process. Moreover, the approach in [22] adjusts
the sleep window length every cycle in sleep mode for
IEEE 802.16m systems [23], which is evolved from the
IEEE 802.16e standard.
However, those power-saving schemes proposed for
IEEE 802.16 standards cannot be directly utilized in LTE
systems. For example, the sleep mode operation of IEEE
802.16m species that sleep window can be recongured
at every sleep cycle within the medium access control
(MAC) layer. Therefore, the scheme proposed in [20]
can adjust the sleep window length every cycle without
inducing additional signaling overhead. Nevertheless, it
is mandated in LTE specication that the parameters of
DRX operation should be determined by RRC function.
In other words, the eNB cannot update or change the
DRX parameters directly in the MAC layer. Moreover, in
order to enhance existing DRX operation, it is important
to construct effective performance metrics with feasible
conguration of DRX parameters. An analytical model
has been derived in [10] to emulate the DRX operation
with simplied modelling assumptions. For example, the
proposed model does not consider the listening time
intervals that are required for the UE to wake up in every
DRX cycle. Furthermore, there exist discrepancies in the
derived mean packet delay under certain situations due
to its simplied performance analysis.
In order to enhance the power-saving capability of
DRX operations, the trafc-based DRX cycles adjustment
(TDCA) scheme is proposed in this paper. An analytical
model is derived for the DRX operations which is en-
hanced from both the DRX model in [10] and the model
constructed for sleep mode operation in IEEE 802.16
systems [24] [25]. Based on the proposed analytical
model, the TDCA scheme adaptively controls the DRX
cycles of LTE system according to trafc estimation. The
target of TDCA scheme is to enhance the energy-saving
performance with the consideration of quality-of-service
(QoS) requirements. In order to avoid reconguring DRX
parameters every cycle by RRC, the decision time instant
at which the TDCA scheme adjusts DRX cycles depends
on the trafc arrivals. A partially observable Markov
decision process (POMDP) is employed to conjecture the
trafc status and provides the selection policy for sleep
cycle lengths. Performance validation indicates that the
proposed analytical model can provide feasible accuracy
to emulate the DRX operations. Simulation results show
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
TON TDS
TI TSC = NSC TDS
OnDurationTimer InactivityTimer ShortCycleTimer
start (re)start (re)start
expire expire expire
Fig. 1. Schematic diagram of DRX operation.
that the proposed TDCA scheme is capable to enhance
the power-saving performance of DRX operation; while
the delay requirements of UE can still be preserved.
Note that a preliminary version of TDCA scheme has
been proposed in our previous work [26]. By adopting
existing power-saving models, a DRX cycles adjustment
scheme was proposed for preliminary performance com-
parison with existing power-saving methods.
The rest of this paper is organized as follows. Section
2 describes the DRX operation and the formulation
of target problem. The proposed analytical model will
be derived in Section 3, and Section 4 explains the
procedures of proposed TDCA scheme. The analytical
model and TDCA scheme are validated and evaluated
in Section 5. Finally, Section 6 draws the conclusions.
2 P ROBLEM S TATEMENT
The 3GPP LTE standard species the DRX operation to
prolong the battery lifetime of UE. The details of DRX
operation will be illustrated in the following subsection.
Furthermore, the insufciency of existing analyses for
DRX operation is explained, and the requirement for a
more comprehensive analysis will be further discussed.
Since the trafc status and DRX parameters will directly
inuence the UEs energy consumption, a DRX cycles
decision problem is formulated at last.
2.1 Discontinuous Reception (DRX) Operation
In LTE systems, all datagram transmissions are indicated
via PDCCH which is called transmission assignment.
The UE has to monitor PDCCH to determine whether
the resource is allocated in either downlink or uplink
direction. In the case that there may not exist packet
to be delivered, the DRX operation activated by RRC
allows the UE to turn off its receiver for energy sav-
ing purpose which temporarily disable UEs capability
for PDCCH monitoring. The DRX operation is mainly
controlled by several timers [1] as Fig. 1 illustrated.
The InactivityTimer is utilized to control the time in-
stant for the UE to start discontinuously monitoring
PDCCH. Once a transmission assignment appears on
1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Transactions on Wireless Communications
TDL PDCCH, the InactivityTimer is activated and starts to
count. When the InactivityTimer is running, the UE will
turn on its receiver listening to PDCCH for potential
packet transmission. The timer will keep counting until
Transmission
assignment either the counter expires or the counter is restarted if
there is another transmission assignment appearing on
PDCCH. The InactivityTimer will expire after it reaches
the threshold TI , which means that there is no trans-
mission assignment arriving within the duration of idle
time TI . After the InactivityTimer expires, the UE will
enter its power-saving mode and start to discontinuously
monitor PDCCH.
The UE still has to periodically turn on its receiver to
verify if there are transmission assignments on PDCCH,
which is executed by the OnDurationTimer as shown
in Fig. 1. The OnDurationTimer will be activated ev-
ery DRX cycle, which can either be a short or a long
cycle with length TDS or TDL , respectively. For each
DRX cycle, the UE will turn on its receiver to monitor
PDCCH for the time duration TON , i.e., the length of
OnDurationTimer. If there is a transmission assignment
appearing on PDCCH when the OnDurationTimer is
running, the InactivityTimer will be activated in order
to ensure the UE to continue monitoring PDCCH. Note
that the UE turns off its receiver only when both In-
activityTimer and OnDurationTimer are not activated.
Furthermore, the ShortCycleTimer with length TSC is
utilized to count the total number of short cycles NSC ,
i.e., NSC = TSC /TDS indicating that TSC is an integer
multiple of short cycle length TDS . The ShortCycleTimer
is activated at the time when the InactivityTimer expires,
and the UE starts to discontinuously listen to PDCCH.
If there is still no transmission assignment appearing on
PDCCH after the ShortCycleTimer expires, i.e., after NSC
short cycles, the long cycle will be congured as DRX
cycle.
2.2 DRX Cycles Decision (DCD) Problem
Most of the existing works utilized semi-Markov process
to model the DRX operation, where z-transform is ap-
plied to formulate the probability generating functions.
The sleep ratio and mean packet delay can be obtained
by converting the generating functions based on Laplace
transformation. Since the above methods are considered
complicate, the analysis in [10] models the DRX oper-
ation by separating its behavior into active and sleep
states. The sleep ratio can be acquired by investigating
the mean time duration of these states and the mean
packet delay is derived by the Pollaczek-Khinchine for-
mula. However, although [10] provided a simple analyt-
ical approach for DRX operation, the proposed model
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications
neglects the inuence of OnDurationTimer with time
duration TON . Since the UE will turn on its receiver for
time TON during every DRX cycle, the sleep ratio can be
decreased with a larger value of TON . Moreover, with the
adoption of an existing simple formula, the analysis of
mean packet delay encounters mismatching under heavy
trafc. Therefore, base on the analytical models in [24]
and [25], an enhanced analysis for DRX operation will
be proposed in this paper by both including more design
parameters and investigating mean packet delay in a
detail manner. The proposed analytical models will be
further explained in Section 3.
From analytical results, it is obvious that the perfor-
mance of DRX operation will be signicantly inuenced
by DRX parameters under varying trafc loads. An in-
appropriate setting of these parameters may cause high
packet delay or low energy-saving performance, which
will lead to unsatisfactory user experiences including
poor QoS on packet transmissions or fast battery drain,
respectively. Therefore, it is important to design a strat-
egy to select feasible DRX parameters. Since trafc load
also inuences power-saving performance, trafc estima-
tion will be considered in the parameter selection of DRX
operations. The power-saving performance including the
mean packet delay can be signicantly inuenced by the
following major DRX parameters, i.e., the short cycle
length TDS , the long cycle length TDL , and the total
number of short cycles NSC . Hence, the TDCA scheme
is proposed to adaptively select a set of TDS , NSC , and
TDL based on trafc estimation. The proposed analytical
model for sleep ratio and mean packet delay are adopted
as evaluation metrics in TDCA scheme in order to evalu-
ate the effect of DRX parameters. The problem is further
formulated in the following clause.
Given the sequences of selectable TDS , NSC , and TDL ,
how to congure these three DRX parameters to maximize the
energy-saving efciency under the constraint of mean packet
delay D ?
3 P ERFORMANCE A NALYSIS OF D ISCONTINU -
OUS R ECEPTION
In this section, the performance of DRX operation with
DL trafc will be analysed based on various DRX
parameters. The trafc is considered to be a Poisson
process with arrival rate , and the service time X is
general distributed with mean E[X] = 1/. Moreover,
it is considered that every packet transmission can be
successfully delivered between eNB and UE under error-
free environment and sufcient bandwidth. Our objec-
tive is to investigate the tradeoff between power-saving
and mean packet delay by introducing DRX operation
1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Successful transmission
Failure transmission
Retransmission
TI TDS
(a) Basic DRX operation model
TI
HARQ RTT Timer drx-RetransmissionTimer TDS
(b) HARQ retransmission DRX operation model
Fig. 2. DRX operation models: (a) basic DRX operation
model adopted in our analytical model. (b) consideration
of retransmission mechanism based on the basic DRX
operation model.
without packet reception error. The reason for error-
free consideration is that packet reception error may
trigger an additional timer for retransmission, i.e., drx-
RetransmissionTimer after a round-trip time (RTT). The
RTT is dened as the duration from the time that NACK
is transmitted by UE to the time of receiving the re-
transmission packet. While the drx-retransmissionTimer
is running, UE must stop the DRX operation temporarily
and stay awake for packet retransmission by hybrid
automatic repeat request (HARQ) process even if the
InactivityTimer expired as shown in Fig. 2. The analysis
of HARQ retransmission model will be more complicate
than the basic error-free model. Hence, we aim at pro-
viding the insight into DRX conguration for balancing
sleep ratio and mean packet delay with the consideration
of basic DRX operation model. The analysis of sleep ratio
can be divided into three parts including the length of
sleep period, on-duration period, and normal state as
shown in Fig. 3. On the other hand, the analysis of mean
packet delay will be derived by busy periods and sleep
periods. Sleep period consists of vacation time and wait-
ing time. The vacation time results from the receiving
delay when UE is in the sleep state, and waiting time
is caused by the unnished packets in the buffer. The
busy period is composed of initial and the other busy
periods. These also include a vacation time and waiting
time. Therefore, the two performance metrics, sleep ratio
and mean packet delay, can be derived in the following
subsections.
3.1 Analytical Model for DRX Operation
The behaviour of DRX operation has been described
in Subsection 2.1. In analytical model, a typical DRX
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications

eNB one packet arrives in the ith sleep cycle, the probability
1st 2nd 3rd
sleep cycle sleep cycle sleep cycle
becomes P r[t < TCi ]. The sleep state being terminated at
S B I B I S O S O S B
UE
Normal state Sleep state
the end of nth sleep cycle means that no packet arrives in
Analysis period previous (n1) successive sleep cycles. Therefore, based
B I S O on memoryless property of exponential distribution, the
Packet arrival Busy period Inactive period Sleep period On-duration period
probability that the UE stays for n sleep cycles in sleep
Fig. 3. Analytical model for DRX operation. state can be formulated as
n1 
 n
n = Pr TCi t < TCi
operation can be separated into normal and sleep states.
The normal state means that the UE keeps listening n1i=1 i=1

to PDCCH. In contrast, the sleep state represents that = P r[t > TCi ] P r[t < TCn ]
the UE discontinuously monitors PDCCH. Since the UE
i=1(n1)T
will transit data between these two states repeatedly, the
e DS
(1 eTDS ),
analysis period is dened as a pair consisting of a normal
1 n NSC
and a sleep states. As illustrated in Fig. 3, the analysis = NSC TDS (nNSC 1)TDL .

e e (1 eTDL ),
period is an interval between the beginning of normal
NSC < n
state and the termination of sleep state. (2)
The length of normal period that the UE continuously
stays in normal state is composed of busy period and
inative period. Once the UE enters normal state, eNB will 3.2 Sleep Ratio
start to transmit packets that are buffered in previous
sleep state. After the packet bufferred in eNB is emptied The sleep ratio shows the fraction of time that the
out, the InactivityTimer is activated and the UE starts UE turns off its receiver. The length of normal state is
to be in inactive period. If there are packet arrivals dened as tN , where the UE always listens to PDCCH
before the InactivityTimer expires, the inactive period during this period. The receiver of UE can be periodi-
is terminated at the time when the rst packet arrives. cally turned off for a sleep period in sleep state, where
After the UE repeatedly enters successive K pairs of the total length of these periods is dened as tS . Note
inactive and busy periods, the InactivityTimer nally that the UE has to monitor PDCCH for an on-duration
reaches TI this time. The UE will be in sleep state since period in every sleep cycle. The total length of these
the InactivityTimer has expired. periods that the UE turns on its receiver in sleep state is
The UE will periodically turn off its receiver after the dened as tO . Therefore, by deriving the mean lengths
UE entering the sleep state, which is composed by sleep of each period, the sleep ratio can be expressed as
cycles. A sleep cycle consists of a pair of sleep and on- E[tS ]
duration periods. In DRX operation, the length of rst SR = . (3)
E[tN ] + E[tO ] + E[tS ]
NSC short sleep cycles is TDS ; while TDL is the length
of each long cycles from the (NSC + 1)th sleep cycle. For clear representation, Table 1 summarizes all the
Therefore, the length of nth sleep cycle is dened as notations for sleep ratio and mean packet delay analyses.
 The notations of analysis model can be categorized into
TDS , 1 n NSC
TC n = . (1) period of time, number of packet arrivals, and probabil-
TDL , NSC < n
ities in different situations. Sleep state and normal state
Note that the nal sleep cycle may not be complete analysis will be elaborated in the following subsection.
due to possible incoming packets. Except for the last
sleep cycle, the UE will be awake to monitor PDCCH
3.2.1 Sleep State Analysis
every sleep cycle for a time duration, which is called
on-duration period TON . The sleep period is an interval As shown in (3), three parameters E[tS ], E[tO ], and E[tN ]
that the UE turns off its receiver, where the length of are required to be derived. The total length of sleep
sleep period in nth sleep cycle can be expressed as periods tS depends on the number of sleep cycles that
TSn = TCn TON . If there is a packet arriving in a the UE has experienced in sleep state. If the sleep state
sleep cycle, the UE will enter normal state at the end is terminated at the end of nth sleep cycle, the total
n
of this cycle. The probability that no packet arrives in time duration for UE to turn off its receiver is i=1 TSi .
the ith sleep cycle is P r[t > TCi ]. In contrast, if at least Considering the probability n obtained from (2), the

1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications

TABLE 1
Notations for sleep ratio and mean packet delay analyses

Parameter Description
E[tS ]
SR Sleep ratio, SR = E[tN ]+E[tO ]+E[tS ]
1
D Mean packet delay, D = pS E[DS ] + pB0 E[DB0 ] + pBm E[DBm ] +
tS , t N , tO Total length of the sleep period, the normal state, the on-duration period
DS Delay of a packet arriving in sleep period
DB0 , DBm Delay of a packet arriving in initial busy period, in other busy period
T Sn Length of sleep period in the nth DRX cycle
TDS , TDL Length of short DRX cycle, long DRX cycle
TON , TI Threshold of OnDurationTimer, InactivityTimer
tON , tO,cpl , tO,last Length of on-duration period, complete on-duration period, incomplete on-duration period in the last cycle
tB , tB0 , tBm , tIm Length of busy period, initial busy period, the mth busy period, the mth inactive period
TV Vacation time that UE is in sleep period
WS , WB , Wtpy Waiting time of transmission delay coming from on-duration, busy period, DRX short/long cycle
NSC Number of continuous short DRX cycles
K Number of inactive and busy period pairs
nP Number of buffered packets
nP,cycle , nP,ON Number of packets arrive during sleep period of short/long DRX cycle, on-duration period
nS , nB0 , nBm Number of packet arrivals in sleep period, initial busy period, other busy period
pON,DS , pON,DL Probability that packets arrive during on-duration period of short DRX cycle, long DRX cycle
pP,DS , pP,DL , pP,ON Probability that buffered packets arrive during sleep period of short, long DRX cycle, on-duration period
pS , pB0 , pBm Probability that packet delay in sleep period, initial busy period, other busy period

mean total length of sleep periods can be formulated as eNB

Last sleep cycle

 
n (incomplete)
E[tS ] = n TS i
n=1 i=1 O S O B

N SC
UE
=(TDS TON )(1 eTDS ) ne(n1)TDS tON
TON
 n=1

NSC TDS TDL TON
+e NSC (TDS TON ) + .
1 eTDL
(4) Fig. 4. Illustration for the last on-duration period for analy-
sis.
Similarly, the total length of on-duration periods tO also
depends on the number of sleep cycles stayed by the UE.
However, as shown in Fig. 4, the packets may arrive
at the middle of on-duration period in the last sleep periods can be derived as
cycle which makes the cycle incomplete. Since the UE
will enter the normal state immediately when a packet 
E[tO,cpl ] = n (n 1)TON
arrives, the length of on-duration period may not be TON n=1
in last sleep period. Therefore, the mean total length of

N SC
on-duration periods consists of two parts and can be = TON (1 eTDS ) (n 1)e(n1)TDS
expressed as n=1
 
E[tO ] = E[tO,cpl ] + E[tO,last ], (5) NSC TDS TON eTDL
+e NSC TON + . (6)
1 eTDL
where tO,cpl represents the total length of complete on-
duration periods. The on-duration period is complete On the other hand, tO,last indicates the length of
only in previous (n 1) sleep cycles if a packet arrives incomplete on-duration period in the last sleep cycle,
in the nth cycle. Since the length of each complete on- which is a time interval between the time instant that
duration period is TON , the mean total length of these OnDurationTimer is activated and the time when the
rst packet arrives in eNB. As shown in Fig. 4, the
length of this incomplete period is dened as tON under
the condition that at least a packet arrivals in the on-
duration period. Therefore, the mean length of the last

1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications

on-duration period can be further formulated as eNB

. . .
E[tO,last ] = (pON,DS + pON,DL )E[tON ], (7) S B0 I1 B1 I2 B2 IK BK IK+1 S
UE
tB0 tI1 t B1 tI2 t B2 tIK tBK TI
where pON,DS and pON,DL represent the probabilities tN
Normal state (Normal period)
that the packets arrive in on-duration period of short Im Bm
S
sleep cycle and long sleep cycle, respectively. These two Packet arrival Sleep period mth busy period mth inactive period

probabilities can be derived as

Fig. 5. Illustration of normal state analysis.
pON,DS
= P r[t < NSC TDS ]P r[(TDS TON ) < t < TDS |t < TDS ]
3.2.2 Normal State Analysis
e(TDS TON ) eTDS
= (1 eNSC TDS ) (8)
1 eTDS The analysis for sleep state has been investigated. In the
pON,DL following paragraph, the mean length of each period in
= P r[NSC TDS < t]P r[(TDL TON ) < t < TDL |t < TDL ] normal state will be further derived. As shown in Fig. 5,
the mean time length that the UE stays in normal state
e(TDL TON ) eTDL
= eNSC TDS , (9) E[tN ] can be formulated as
1 eTDL
where P r[t < NSC TDS ] and P r[NSC TDS < t] indicate E[tN ] = E[tB0 ] + E[K](E[tIm ] + E[tBm ]) + TI . (11)
the probabilities that the sleep state is terminated in The initial busy period tB0 includes the time that the
short sleep cycle and long sleep cycle, respectively. Based UE receives the packets which are buffered in eNB. The
on memoryless property, if the packets appear in on- length of this period depends on the number of buffered
duration period of a sleep cycle with the condition that packets, i.e., packet transmission causes the occurrence
at least a packet arrives in this sleep cycle, the probability of a busy period with the length tB . The mean length of
is P r[Tcycle TON < t < Tcycle |t < Tcycle ] where busy period for M/G/1 queueing model can be derived
Tcycle {TDS , TDL }. form the result in Subsection 5.1.6 of [27] as
1
E[tB ] = . (12)

Since the UE will enter normal state at the subframe Since the number of buffer packets is dened as nP ,
that the rst packet arrives, this subframe will not be the mean length of initial busy period is formulated as
counted in the calculation of tON . The possible index of E[tB0 ] = E[nP ]E[tB ]. The number of buffered packets
the subframe at which the rst packet arrives should depends on the length of last sleep cycle that the rst
belong in the range of {1, 2, , TON }, i.e., the range packet arrives in. The probability that buffered packets
of tON can be obtained as 0 tON TON 1. The arrive in sleep period of short sleep cycle is dened
probability that there is no packet arrival at a subframe as pP,DS and long sleep cycle as pP,DL . Note that the
is P r[t > 1]; whereas the probability is P r[t < 1] if at packets may arrive in on-duration period no matter how
least a packet arrives at a subframe. Moreover, the rst long the sleep cycle is, which corresponds the probability
packet arrives at the ith subframe denotes that there is of pP,ON . Furthermore, the numbers of buffered packets
no packet arrival during the previous (i 1) successive for these three situations are dened as nP,DS , nP,DL ,
subframes. Therefore, the mean value of tON with the and nP,ON , respectively. Therefore, the mean number of
condition that at least one packet arrival in on-duration buffered packets can be expressed as
period can be derived as E[nP ]
TON
(i 1)(P r[t > 1])i1 P r[t < 1] = pP,DS E[nP,DS ] + pP,DL E[nP,DL ] + pP,ON E[nP,ON ].
E[tON ] = i=1 TON (13)
i=1 (P r[t > 1])
i1 P r[t < 1]
TON (i1) The buffered packets arrive in short sleep cycle means
(i 1)e (1 e )
= i=1 TON (i1) . (10) that the packet inter-arrival is less than NSC TDS , which
i=1 e (1 e )
corresponds to the probability of P r[t < NSC TDS ]. In
Consequently, the mean total length of on-duration pe- contrast, if the buffered packets come into long sleep
riods in sleep state can be acquired by substitution (6) cycle, the probability is P r[NSC TDS < t]. According to
and (7) into (5). the memoryless property, the possibility that the packets

1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications
arrive in sleep period with the condition that at least
one packet comes in last sleep cycle is P r[t < Tcycle
TON |t < Tcycle ] where Tcycle {TDS , TDL }. Therefore,
the probability that the buffered packets arrive in sleep
period of short cycle can be computed as
pP,DS = P r[t < NSC TDS ]P r[t < TDS TON |t < TDS ]
TI
1 e(TDS TON )
= (1 eNSC TDS )
TI
1 eTDS
TI (i1)
and long cycle as
TI (i1) . (18)
pP,DL = P r[NSC TDS < t]P r[t < TDL TON |t < TDL ]
1 e(TDL TON )
= eNSC TDS . (15)
1 eTDL
The mean number of arrival packets in sleep period of
the last sleep cycle is (Tcycle TON ) with the condition
that at least a packet comes in this sleep cycle, where
Tcycle {TDS , TDL }. Therefore, according to condition
probability, the mean number of packet arrivals can be
derived as
(Tcycle TON ) (Tcycle TON )
nP,cycle = = .
P r[t < (Tcycle TON )] 1 e(Tcycle TON )
(16)
Moreover, the packet arrival may happen in on-duration
period of the last sleep cycle. Since these three situations
are mutually exclusive, the probability that the packets
arrive in on-duration period can be expressed as pP,ON =
1 pP,DS pP,DL . Since the UE will enter normal state
once a packet arrives in on-duration period, the eNB
may buffer the packets for one subframe. Therefore, the
mean number of buffered packets in on-duration period
is derived as
nP,ON = = . (17)
P r[t < 1] 1 e
By substituting (14) - (17) into (13), the mean number of
buffered packets E[nP ] when the UE enters normal state
can be obtained. Consequently, the mean length of initial
busy period in normal state E[tB0 ] can also be obtained
(12) and (13).
After the initial busy period in normal state, the status
of UE will repeatedly change between the inactive and
busy periods. For each inactive period, the length tIm
depends on the time when a packet comes in eNB.
Since packet arrival makes the inactive period termi-
nated before the InactivityTimer reached TI , the possible
subframe index where the rst packet arrives should
belong to the set {2, 3, , TI }. Moreover, the UE will be
back to busy period immediately once a packet arrives
in inactive period such that the subframe at which the
1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
packet arrives will not be taken into account. If at least
one packet arrives in a subframe, the probability is
P r[t < 1]. In contrast, the possibility that no packet
comes in a subframe is P r[1 < t]. Therefore, the mean
length of inactive period with the condition that the
InactivityTimer does not expire can be obtained as
(i 1)(P r[t > 1])i1 P r[t < 1]
(14) E[tIm ] = i=2
i=1 (P r[t > 1])
i1 P r[t < 1]
(i 1)e (1 e )
= i=2
i=1 e (1 e )
Oh the other hand, the length of busy period tBm
depends on the number of packet arrivals in a subframe.
The mean number with the condition that at least a
packet comes in eNB is /P r[t < 1] = /(1 e ). Each
packet is considered to generate a busy time tB . There-
fore, the mean length of busy period can be acquired
as
E[tBm ] = E[tB ], (19)
1 e
where E[tB ] is obtained from (12). Furthermore, the
number of times K that the UE stays for a pair of inactive
and busy periods depends on the probability of packet
arrivals. According to the analysis of inactive period,
the appearance of inactive period means that the packet
inter-arrival time has continued for one subframe. There-
fore, only (TI 1) subframes are left to make the Inactiv-
ityTimer expire. The probability becomes P r[(TI 1) < t]
if the InactivityTimer reaches TI . In contrast, the restart
of InactivityTimer means that there is at least a packet
arrival in these (TI 1) subframes, which corresponds to
the probability of P r[t < (TI 1)]. Therefore, the mean
number K is derived based on memoryless property as

E[K] = i(P r[t < (TI 1)])i P r[(TI 1) < t]
i=1

1
= i(1 e(TI 1) )i e(TI 1) = 1.
e(TI 1)
i=1
(20)
By substituting (18)-(20) into (11), the mean length of
normal period E[tN ] can be obtained. Finally, the sleep
ratio SR can also be acquired by substituting (4), (5), and
(11) into (3).
3.3 Mean Packet Delay
Since the UE may enter sleep state, the packets will not
always be transmitted immediately. Therefore, the mean
packet delay shall be investigated. In this subsection, the
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications

derivation of mean packet delay will be separated into TV1 WS3

three different parts as follows. Firstly, the delay of a
packet which arrives in sleep period is dened as DS . TV2 WS2
The packet which comes in the initial busy period may Packet arrival
P1 P2 P3
be delayed for DB0 , and the delay is represented as DBm
when packet arrives in other busy periods. The numbers
of packet arrivals in these three situations are dened
S
S P1 P2 P3 I1 Sleep period
as nS , nB0 , and nBm , respectively. The probability for
the packet arriving in these three situations can be B0
formulated as
E[n ]
p = (21)
E[nS ] + E[nB0 ] + E[nBm ]
where {S, B0 , Bm }. Therefore, the mean packet delay Fig. 6. Illustration of mean packet delay in sleep period.
D can be expressed as
1
D = pS E[DS ] + pB0 E[DB0 ] + pBm E[DBm ] + . (22) mean vacation time can be derived as

1
E[TV ] = {pP,DS E[nP,DS ](TDS TON )
2E[nS ]
+ pP,DL E[nP,DL ](TDL TON )}. (24)
3.3.1 Delay from Sleep Periods
Since the FIFO scheduler is considered, those buffered
packets will be transmitted immediately once the On-
The delay of a packet which arrived in sleep period can DuraionTimer is activated. However, since the service
be divided into two parts. At rst, because the UE is rate is limited, a packet may wait for the transmissions of
in sleep period, the packet will wait for a vacation time other datagrams which arrive in eNB earlier. The waiting
which is dened as TV . After the OnDurationTimer is time of the new packet arrival is the processing time of
activated and the UE starts to receive buffered packets, those packets arriving during the early (Tcycle TON )/2
a packet may wait for transmissions of other datagrams. where Tcycle {TDS , TDL }. The mean number of those
The waiting time due to this reason is dened as WS . packets is (Tcycle TON )/2. Considering the fractions
As shown in Fig. 17, TV 1 and TV 2 are the vacation time of packet arrivals in two different sleep cycles, the mean
of the packets of P 1 and P 2, and WS2 and WS3 are the waiting time can be derived based on (14) - (16)as
waiting time of the packets of P 2 and P 3. Therefore, the
1
mean waiting time in sleep period can be formulated as E[WS ] = E[TV ]

E[DS ] = E[TV ] + E[WS ]. (23) 1
= {pP,DS E[nP,DS ](TDS TON )
2E[nS ]
The number of packets arriving in sleep period nS
depends on the probability and number that the packets + pP,DL E[nP,DL ](TDL TON ). (25)
arrive in the sleep period of either short or long sleep As a result, the mean packet delay which arrive in sleep
cycle. Therefore, by substituting (14) - (16), the mean period, i.e., E[DS ], is obtained by substituting (24) and
number of packets E[nS ] can be obtained as E[nS ] = (25) into (23).
pP,DS E[nP,DS ] + pP,DL E[nP,DL ]. The length of vacation
time for a packet depends on the time when the packet 3.3.2 Delay from Busy Periods
arrives in eNB. The time instant of a packet arrival is The following subsection will investigate the packet
uniformly distributed in Poisson process. This implies transmission delay that comes from busy periods. From
that a new packet arrival will appear at the time instant queueing theory [28], the mean packet delay in M/G/1
of (Tcycle TON )/2 averagely for a sleep cycle where model is
Tcycle {TDS , TDL }. Since the sleep cycle can be a short
E[X 2 ]
or long cycle, it is required to consider the fractions of E[WB ] = (26)
2(1 )
packet arrivals in these two cycles. Therefore, the mean
vacation time of a packet which arrives in sleep period where = / is the trafc intensity. For the initial
is (Tcycle TON )/2. Therefore, based on (14) - (16), the busy period, the number of packets can be obtained by

1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications
subtracting the number of packet arrivals in previous
sleep period from the number of packets which are
processed in the initial busy period. Therefore, the mean
number of arrivals E[nB0 ] in the initial busy period
is derived as E[nB0 ] = E[tB0 ] E[nS ] The delay of
these packets is inuenced by transmissions of buffered
packets which arrive in sleep period. As illustrated in
Fig. 7, the initial busy period can be divided into a series
of time sequences. The length of initial period depends
on the number of packets in eNB at the moment the UE
starts to receive data. The mean number is dened as
N0 and the length of the rst period is T1 = N0 / as
shown in Fig. 7. Consequently, the packets which comes
in initial period will cause another period to occur, i.e.,
the mean number of the packet arrivals in initial period
is N1 = T1 = N0 and the corresponding period is
T2 = N1 / = N0 /. Therefore, the mean packet number
and the length of the kth period can be derived as
Nk = k N0 and Tk = k1 N0 /, respectively. Moreover,
considering the vacation time due to previous period
and the waiting time for transmitting earlier packet
arrivals, the mean waiting time in kth period can be
formulated as
 
Tk Nk N0 1 1
Wk = + = + k . (27)
2 2 2 partially observable Markov decision process (POMDP)
The initial number of buffered packets has been derived
from (16) as N0 = E[nP,typ ] where typ {DS, DL}
for two different situations. Considering the fraction of
packet number in these k periods, the mean waiting
time of packets which arrive in the initial busy period is
derived from (27) as
with a nite state space S = {s1 , . . . , sm , . . . , sM }. The
N k Wk E[nP,typ ]2 ( 1 + 1 )2
Wtyp = k=1 = (28)
Ntyp 2(1 2 )Ntyp
where Ntyp is
the
mean total number of packet arrivals
as Ntyp = k=1 k = E[nP,typ ]/(1 ). Therefore,
N
the mean delay of packets which arrives in initial busy
period is acquired as
pP,DS NDS WDS + pP,DL NDL WDL
E[DB0 ] = + E[WB ].
pP,DS NDS + pP,DL NDL
(29)
On the other hand, the delay of a packet which comes
in the other busy periods can be obtained simply by
applying the characteristics of M/G/1 model in (26)
as E[DBm ] = E[WB ]. Moreover, by substituting (19)
and (20), the mean number of these packets can be
computed as E[nBm ] = E[K]E[tBm ]. Finally, the mean
packet delay D can be acquired from (21) and (22) by
substitution.
1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
10
N0 N1 N2 N3 Nk
... ...
P1 P2 P3 P4 P5 P6 P7 P8 P9
... ... Packet arrival
S ... ...
P1 P2 P3 P4 P5 P6 P7 P8 P9
S
T1 T2 T3 ... Tk ... Sleep period
Fig. 7. Illustration of mean packet delay in initial busy
period.
4 P ROPOSED T RAFFIC - BASED DRX C YCLES
A DJUSTMENT (TDCA) S CHEME
Based on the knowledge of trafc, the proposed TDCA
scheme will congure a feasible setting of DRX cycles
to balance the energy-saving efciency and mean packet
delay for solving the DCD problem presented in Subsec-
tion 2.2. The following three major DRX parameers will
be recongured at each decision time with the adoption
of TDCA scheme: the short DRX cycle TDS , the maxi-
mum number of short DRX cycles NSC , and the long
DRX cycle TDL . Note that the decision time is dened
as the timing dt that DRX cycles are adjusted while
the InactivityTimer expires. Since the complete trafc
information is difcult to be captured, we employ the
framework [30] [31] to adjust the DRX cycles with given
policy based on insufcient trafc information, i.e., the
observable packet arrivals within the specic time inter-
vals for trafc status estimation.
The non-real time trafc is modeled as a discrete-time
Markov-modulated Poisson process (dMMPP) [32], [33]
state sm represents a Poisson trafc with the rate sm .
The states transit as a Markov chain with a transition
probability matrix T = {qm,n | the transition probability
from sm to sn }. In order to estimate present trafc status
at each decision point dt , trafc information has to be
collected by the number of arrived packets ndt within
the time period dt from dt1 to dt . As Fig. 8 illustrated,
the observations for the POMDP framework is dened as
zdt = {ndt , dt }, and thus a set of observation function
is dened as Odt = {odt (s1 ), . . . , odt (sm ), . . . , odt (sM )}.
The weighting function odt (sm ) at dt is utilized to rep-
resent the possibility for the present trafc state sdt
to be sm . Based on the Poisson property of a trafc
state, the weighting denotes the probability that the
number of packet arrivals is ndt during dt in state sm ,
which can be expressed as odt (sm ) = P r(zdt |sm ) =
(sm dt )ndt esm dt /(ndt !).
With the consideration of observations in POMDP,
the belief state is introduced to obtain the suboptimal
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications

11

Traffic state set Yi,j,k = {TDS,i , NSC,j , TDL,k }, where a, A ,

sdt-1 sdt sdt+1
Traffic Variation
Unavailable {DS, SC, DL} and {1, , |A |}. The decision policy
Observations Observable for actions will be explained in the next subsection.
from taffic

Odt-1 zdt-1 Odt zdt Odt+1 zdt+1

Adt-1 Adt
Selections of DRX
parameters
Bdt-1 Bdt
dt-1 Decision point dt
Fig. 8. Schematic diagram of POMDP model for TDCA
scheme.
results by estimating the trafc status. The belief state
Bdt = {bdt (s1 ), . . . , bdt (sm ), . . . , bdt (sM )} is a probability
distribution over trafc states in S, and bdt (sm ) is the
probability that the present state sdt is sm at deci-
sion point dt . Note that bdt (sm ) 0, sm S and
sm S bdt (sm ) = 1. Based on the observations and state
transition probabilities, each element of the belief state
Bdt is formulated by applying the Bayes rule as
bdt (sm ) = P r(sm |Bdt1 , zdt )
P r(zdt |Bdt1 , sm )P r(sm |Bdt1 )
= D = D(sm , Yi,j,k ).
P r(zdt |Bdt1 )
odt (sm ) sn S qn,m bdt1 (sn )
=
(30) ned as an action set Ai,j,k where aDS,i , aSC,j , and aDL,j
sm S odt (sm ) sn S qn,m bdt1 (sn )
The belief state represents the present trafc status which
is updated from previous estimation with both observa-
tions and state transitions. Therefore, a belief state can
summarize the statistical history of entire process which
will be updated at each decision point dt .
4.1 Trafc Status Estimation
As shown in Fig. 8, instead of capturing the unavailable
trafc state sdt at each decision point dt , we collect
the obserable trafc information including dt and ndt
as the observations zdt . Based on the observations and
previous estimation of trafc status, the belief state
Bdt is updated to describe the current trafc status.
Afterwards, an action is taken from each action set
A = {a,1 , a,2 , , a,|A | } where {DS, SC, DL}.
The action aDS,i and aDL,k represent that the short
DRX cycle is congured as TDS,i and the long DRX
cycle is set as TDL,k , respectively. The maximum number
of short DRX cycles will be chosen as NSC,j if the
action aSC,j is selected. Therefore, the actions deter-
mined at the decision point dt is dened as Ai,j,k =
{aDS,i , aSC,j , aDL,k } corresponding to a DRX parameter
4.2 Evaluation Metrics and Selection Policy for DRX
Adt+1 Cycles
In order to take appropriate actions, evaluation metrics
Bdt+1 are introduced to provide the sleep ratio and mean
dt+1 packet delay for TDCA scheme. Under Poisson trafc
with rate sm , the sleep ratio and mean packet delay can
be computed if the parameter TDS,i , NSC,j , and TDL,k are
set as the length of short cycle, the maximum number of
short cycles, and the length of long cycle, respectively.
Based on the derivation of analytical models in Section
3, the sleep ratio and mean packet delay in trafc state
sm can be obtained with the substitution of parameter
set Yi,j,k . If the DRX parameter set Yi,j,k is congured for
DRX operation in trafc state sm , the parameters TDS,i ,
NSC,j , TDL,k , and sm will be incorporated into (3) and
(22) which respectively results in the sleep ratio as
SR = SR(sm , Yi,j,k ), (31)
and the mean packet delay as
(32)
Note that selecting the DRX parameter set Yi,j,k is de-
means that TDS,i , TSC,j , and TDL,j are congured as DRX
parameters.
Algorithm 1: Reward Assignment Algorithm
Input: S, ADL , ASC , ADS , constraint D
Output: reward function R
foreach sm S do
foreach aDS,i ADS do
foreach aSC,j ASC do
foreach aDL,k ADL do
if D(sm , Di,j,k ) D then
r(sm , Ai,j,k ) SR(sm , Di,j,k )
else
r(sm , Ai,j,k ) SRmin
end
end
end
end
end
With the derived evaluation metrics, a selection policy
for DRX cycles based on sleep ratio is adopted for the
proposed TDCA scheme. Given a mean packet delay

1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
constraint D , a reward function R of the POMDP frame-
work is utilized to represent the benet of an action set
Ai,j,k in trafc state sm , which is dened as r(sm , Ai,j,k )
and can be obtained via Algorithm 1. Notice that the
mean packet delay constraint D is taken into account
in order to discard infeasible action set Ai,j,k , i.e., the
mean packet delay of such actions determined by (32)
may violate the constraint D . In this case, the minimal
sleep ratio is to reduce unsatised packet delay which
implies that power-saving is our main target under QoS
guaranteed situation. In contrast, minimal delay will be
carried out at the cost of decreased sleep ratio in order
to reach the delay requirement.
The optimal solution to the DCD problem is un-
available since the actual trafc state is not obtainable.
However, the unobservable trafc state can be estimated
since the belief state is employed in POMDP framework,
and the reward of given actions in a trafc state is
calculated in advance. Therefore, the suboptimal DRX
cycles selection at decision point dt can be determined
based on both the reward and belief state. In general,
the T-step value function is utilized to form the objective
function in POMDP. In order to decrease computational
complexity, one-step value function V1 (sm , Ai,j,k ) is ap-
plied in the TDCA scheme and is dened as
V1 (sm , Ai,j,k ) = r(sm , Ai,j,k ).
Therefore, from (30) and (33), the objective function at
decision point dt can be derived as
 subsection.
(Bdt , Ai,j,k ) = bdt (sm )V1 (sm , Ai,j,k ). (34)
sm S
Note that the meaning of one-step value function can
be treated as the score if actions in Ai,j,k are taken in
sm . On the other hand, the objective function denotes
the average score at dt according to the estimated trafc
status, which is the belief state Bdt . The optimization
problem can be formulated as
max (Bdt , Ai,j,k )
Ai,j,k
s.t. a, A , {DS, SC, DL},
{1,
D(sm , Di,j,k ) D , i, j, k,
where (36) is the constraint that the solution of DRX
parameters must follow LTE specication [29], and (37)
is the QoS constraint. The objective is to select the best
values of DRX parameters for achieving highest sleep
ratio under the delay constraint. Therefore, a set of
1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Transactions on Wireless Communications
12
actions Adt at dt can be selected via
Adt = arg max (Bdt , Ai,j,k ). (38)
Ai,j,k
It is intuitive that the selected actions will acquire the
best score, i.e., with the highest sleep ratio. The cor-
responding DRX parameter set Ydt can consequently
be congured at decision point dt . To nd the optimal
solution for the best sleep ratio under delay constraint,
we adopt exhaustive search as shown in Algorithm
1 to select the value of DRX parameters. Hence, the
computational complexity will be affected by the number
of Poisson trafc states and the available values of short
DRX cycle, long DRX cycle, and ShortCycleTimer, i.e.,
O(M |ADS | |ASC | |ADL |).
5 P ERFORMANCE E VALUATION
In the following simulations, the DRX operation between
eNB and UE is implemented by a MATLAB event-driven
simulator. The simulations evaluate the sleep ratio and
mean packet delay under a dMMPP trafc with a mean
packet arrival rate. Each run simulates a 10-minute
process with a subframe as the time unit, and each
outcome is averaged from the results of 100 simulation
runs. To capture the real scenarios, le transfer protocol
(FTP) trafc model has been adopted with le size 0.5
Mbytes and the exponential distributed interarrival time
[34]. Performance validation for TDCA scheme will be
(33)
conducted in the rst subsection; while performance
comparisons between TDCA method and other existing
power-saving mechanisms are presented in the second
5.1 Performance Validation
The proposed analytical model will be validated in this
subsection by comparing with simulations. Moreover,
the improvement from proposed analytical model com-
pared to that in [9] and [10] will also be observed.
The service rate = 1, and the variance of service
time is selected as 2 = 0 for avoiding overloading of
(35) the system. Fig. 9 shows the improvement of proposed
analytical model (P-ana) on the compared analytical
models, i.e., C-ana-1 and C-ana-2, derived in [10] and
, |A |}, (36) [9], respectively. Notice that the parameter TON is not
(37) included in the compared C-ana-1 model. With xed
TDS , NSC , and TDL , it can be observed that the results
of these two analytical models are almost consistent
with that from the simulations when TON = 1 in both
{TI , TON } = {20, 1} and {TI , TON } = {8, 1} cases.
With the lack of considering on-duration period in the
analysis, the C-ana-1 model in the case of TON = 30
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications

13

analysis can provide better accuracy on mean packet

1

C-ana-1-T =8
I delay.
0.9 C-ana-2-T =8, T =1
I ON
Sim-T =8, T =1
0.8
I
P-ana-T =8, T
ON
=1
The proposed P-ana model is validated under different
I ON
0.7 C-ana-1-T =20
I
parameters as shown from Figs. 10 to 13. It will be
0.6
C-ana-2-T =20, T
I ON
=1 observed that all of the analytical results are consistent
Sim-T =20, T =1
I ON with those from simulations, which indicates that the
SR (%)

P-ana-T =20, T =1
0.5
I ON
C-ana-2-T =20, T
I ON
=30 numerical equations are correctly derived in proposed
0.4
Sim-T =20, T
I ON
=30 model. Fig. 10 shows performance validation (sleep ratio
P-ana-T =20, T =30
0.3 I ON and mean packet delay) for P-ana model under different
0.2 packet arrival rates . The sleep ratio decreases under
0.1
heavy trafc since more packet arrival means that the
0
InactivityTimer seldom expires to make the UE enter
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

E[] (packets/ms) sleep state and the packte can transmit innediately. How-
ever, when the loading of transmission is saturate under
(a) Sleep ratio (SR) heavy trafc, the delay will increase. For the longer
short cycle lengths, the sleep ratio only slightly increases;
60
while almost twice of packet delay can be observed. The
effect of inactive threshold TI is investigated in Fig. 11.
50

Based on the standard [29], the available values of TI

are 1, 2, 3, 4, 5, 6, 8, 10, 20, 30, 40, 50, 60, 80, 100,
40

200, 300, 500, 750, 1280, 1920, and 2560 frames. Since
the sleep ratio will approach to zero with larger TI , the
D (ms)

30

performance validation of TI in Fig. 11 presents the TI

20
value until 80 subframes. The results show that both
sleep ratio and mean packet delay become lower as TI
10
increases. Extending the threshold of inactive period will
make UE difcult to enter the sleep state and reduce the
0
packet delay. The increment of cycle length TDS can also
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

E[] (packets/ms) affect mean packet delay more than sleep ratio. On the
other hand, the relationship between the performances
(b) Mean packet delay (D) and short cycles number NSC is investigated in Fig. 12.
As the value of NSC goes up, the probability for UE to
Fig. 9. Performance comparison between proposed an-
adopt long cycle is lowered because the UE needs to
alytical model (P-ana) and compared analytical models,
take more short cycle rst. Therefore, both sleep ratio
i.e., C-ana-1 in [10] and C-ana-2 in [9] under TDS = 64,
and mean packet delay decrease with increased value of
NSC = 2, and TDL = 128.
NSC . The higher NSC makes it hard to turn short cycle
into long cycle, the performances will remain the same.
Fig. 13 shows the effect of short cycle length TDS for
still matches with simulation result with high packet performance validation. As the length TDC increases, the
arrival rate since it is difcult for a UE to enter sleep sleep ratio quickly goes up at rst and then slowly rises
state under high trafc. It does not matter if the on- to reach the saturation condition, which is determined by
duration period is considered or not. However, C-ana-1 the pre-specied parameter set. Moreover, as expected,
model with TON = 30 becomes inaccurate under low smaller value of inactive period with TI = 4 results
packet arrival rate ; while the proposed P-ana model in higher value of sleep ratio compared with that with
can still matches the simulation results under different TI = 20. On the other hand, the mean packet delay in-
values of . The proposed P-ana achieves better accu- creases linearly with respect to the length TDS . It points
racy since both sleep ratio and mean packet delay are out that sleep ratio can not be unlimitedly raised by
comprehensively investigated. For example, the delay extending the length of sleep cycle; while packet delay
for packets arriving in the initial busy period is analyzed will become unreasonably large as the cycle length TDS
via a numerical sequence instead of only substituting is prolonged. This observation suggests that a feasible
the equations in M/G/1 model. Therefore, the proposed value of short cycle length TDS should be determined

1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications

14

0.9 30 0.75 25
SimT =32 SimT =32 SimT =16 SimT =16
DS DS DL DL
0.8 AnaT =32 AnaT =32 AnaT =16 AnaT =16
DS DS DL DL
SimTDS=64 SimTDS=64
0.7 SimT =64 SimTDL=64
25 DL
AnaTDS=64 AnaTDS=64 AnaT =64
20 AnaTDL=64
0.7 DL
0.65
0.6 20

D (subframes)
D (subframes)
15
0.6
0.5

SR
SR

15
0.4 0.55
10
0.3 10
0.5
0.2 5
5 0.45
0.1

0.4 0
0 0 0 5 10 15 20 0 5 10 15 20
0 0.5 1 0 0.5 1
(packets/subframe) (packets/subframe) NSC NSC

(a) Sleep ratio (SR) (b) Mean packet delay (D) (a) Sleep ratio (SR) (b) Mean packet delay (D)

Fig. 10. Performance validation under different Fig. 12. Performance validation under different num-
packet arrival rates with TI = 8, TON = 8, NSC = 2, bers of short cycle NSC with = 0.1, TI = 4,
and TDL = 2TDS . TON = 4, and TDS = 8.
0.9 15
SimT =16 SimT =16 400
DS DS
0.8 AnaT
DS
=16 AnaT
DS
=16 0.8
SimTDS=32 SimTDS=32 350
0.7 AnaTDS=32 AnaTDS=32 0.7
300
0.6 10 0.6
D (subframes)

D (subframes)
250
0.5 0.5
SR

SR

200
0.4 0.4
150
0.3 5 0.3

0.2 0.2 SimT =4

I
100 SimT =4
I
AnaTI=4 AnaTI=4

0.1 0.1 SimTI=20 50 SimTI=20

AnaT =20 AnaT =20
I I
0 0 0 0
0 20 40 60 80 0 20 40 60 80 0 200 400 600 800 0 200 400 600 800
TI (subframes) TI (subframes) TDS (subframes) TDS (subframes)

(a) Sleep ratio (SR) (b) Mean packet delay (D) (a) Sleep ratio (SR) (b) Mean packet delay (D)

Fig. 11. Performance validation under different inactive Fig. 13. Performance validation under different short
thresholds TI with = 0.1, TON = 4, NSC = 2, and cycle length TDS with = 0.1, TON = 4, ,NSC = 2 and
TDL = 2TDS . TDL = 2TDS .

in order to provide adequate sleep ratio with acceptable 5.2 Performance Comparison
mean packet delay. In this subsection, simulations are conducted to evaluate
Finally, the above performance validations not only the performance of proposed TDCA scheme, which will
show the correctness of proposed analytical model, but be compared with the xed DRX (FDRX) operation
also reveal the power-saving behaviors according to the without adaptively adjusting DRX parameters. The pa-
various inuential parameters. Intuitively, the tradeoff rameters congured in simulations and the selectable
between sleep ratio and mean packet delay can be DRX cycles are listed in Tables 2, respectively. Note that
observed, which is affected by different parameters. For the selectable parameters are adopted from LTE RRC
example, the sleep ratio is majorly inuenced by the specications [29].
inactive period TI , and the mean packet delay is mainly Considering various delay constraints D , the perfor-
controlled by the cycle lengths. mances of TDCA scheme under different arrival rates

1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications

15

TABLE 2
Simulation parameters

Simulation parameters
Subframe duration 1 ms
Inactive period (TI ) 10 subframes
On-duration period (TON ) 10 subframes
Mean service rate () 1 packets/subframe
Power consumption in sleep state 1060 mW
Power consumption in active state 1680 mW
Available value of selectable DRX cycle
DRX short cycle (TDS ) 2, 5, 8, 10, 16, 20, 32, 40, 64, 80, 128, 160, 256, 320, 512, 640 subframes
Number of short cycle (NSC ) 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16
DRX long cycle (TDL ) 10, 20, 32, 40, 64, 80, 128, 160, 256, 320, 512, 640, 1024, 1280, 2048, 2560 subframes

0.9 1700 350 1 1600

D=10
300
D=20 0.9
0.8 D=40 Delay Constraint D
300
1600 1500
D=80
0.8
250
D=160
0.7
D=320 250 0.7
1500 1400
0.6 200
0.6

D (subframes)
D (subframes)

200

EC (mW)
EC (mW)

SR
0.5 1300
SR

0.5 1400
150
150
0.4
0.4
1300 1200
0.3 100
100
0.3
0.2
1200 1100 50
50
0.2
0.1
E[]=0.1
E[]=0.2
0.1 1100 0 0 1000 0
0.1 0.2 0.3 0.4 0.5 0.1 0.2 0.3 0.4 0.5 0.1 0.2 0.3 0.4 0.5 0 100 200 300 0 100 200 300 0 100 200 300
E[ ] (packets/subframe) E[ ] (packets/subframe) E[ ] (packets/subframe) D (subframe) D (subframe) D (subframe)

(a) Sleep ratio (SR) (b) Energy consumption (EC) (c) Mean packet dalay (D) (a) Sleep ratio (SR) (b) Energy consumption (EC) (c) Mean packet delay (D)

Fig. 14. Performance of proposed TDCA scheme under Fig. 15. Performance of proposed TDCA scheme under
different arrival rates . different delay constraints D .

are illustrate in Fig. 14. It can be observed that the mean packet delay will be close to the corresponding
sleep ratio for all cases with different delay constraints delay constraint.
are decreased and become almost the same under heavy For investigating the power-saving performance in
trafc at = 0.5. The higher sleep ratio can be achieved LTE system, Figs. 16 and 17 compares the TDCA scheme
with loose delay constraint, e.g., D = 320, under light with FDRX operation which applies a xed set of TDS ,
trafc loading. On the other hand, it is observed that the NSC , and TDL with various queue thresholds including
packet delay constraints can be satised under different 1, 8, 32, and 128 as adopted in [35]. To conserve energy,
cases. [35] reduces frequent packet transmission by deferring
The mean packet delay will not be close to the con- packets until the number of buffered packets are more
straint when the delay constraint is not tight since the than or equal to queue threshold. Higher power-saving
nite set of selectable DRX parameters may make it performance will be reached with larger queue threshold
difcult to choose longer cycle length even with loose since the delay requirement has not been taken into
delay constraint. Note that the up-and-down behavior of account in [35]. Consider the same capability of sched-
mean packet delay for TDCA scheme is owing to the dis- uler without postponing packet transmission, we can
crete manner of selectable DRX parameters. Moreover, focus on the performance of TDCA scheme and FDRX-1
the relationship between the performances and delay method for a fair comparison. In TDCA scheme, the DRX
constraint is further illustrated in Fig. 15 when the trafc parameters, i.e., TDS , NSC , and TDL , can be adaptively
is light, i.e., under = 0.1 and 0.2. It can be observed that adjusted with varying trafc density and different delay
the sleep ratio and energy consumption for both cases requirement. In Fig. 16, the TDCA scheme with delay re-
become saturated under loose delay constraint, and the quirement D = 40 is compared with FDRX method with

1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications

16

4
1 10 1700 1 50 1700
TDCA - =40
D
Modified C-ana-1 -D=10
FDRX-1
0.9 FDRX-2 TDCA -D=10
0.9 45
FDRX-4
FDRX-8 1600 Modified C-ana-1 -D=40 1650
0.8 FDRX-32
FDRX-128 3
10 0.8 TDCA -D=40 40
0.7
1500
0.7 35 1600
0.6

EC (mW)
SR (%)

D (ms)

2
0.6 30
0.5 10 1400 1550

EC (mW)
SR (%)

D (ms)
0.5 25
0.4

1300 1500
0.3 0.4 20
1
10
0.2 0.3 15 1450
1200

0.1
0.2 10
0 1400
0 10 1100
0 0.2 0.4 0.6 0.8 0 0.2 0.4 0.6 0.8 0 0.2 0.4 0.6 0.8 0.1 5
E[] (packets/ms) E[] (packets/ms) E[] (packets/ms)
0 0 1350
0.1 0.2 0.3 0.4 0.5 0.1 0.2 0.3 0.4 0.5 0.1 0.2 0.3 0.4 0.5
E[] (packets/ms) E[] (packets/ms) E[] (packets/ms)
Fig. 16. Performance of sleep ratio, energy consumption,
and delay under different arrival rates with queue thresh-
Fig. 18. Performance comparison of sleep ratio,
old 1, 8, 32, 128 for {TDS , NSC , TDL } = {80, 1, 640}.
delay, and energy consumption under different
arrival rates for {TON , TI } = {1, 20}.
4
1 10 1700
TDCA - =10
D
FDRX-1
0.9 FDRX-2
FDRX-4
FDRX-8 1600 1 50
0.8 FDRX-32 Modified C-ana-1 -D=10
3
FDRX-128 10
TDCA -D=10
0.7 0.9 45
1500 Modified C-ana-1 -D=40 1.65
TDCA -D=40
0.6 0.8 40
EC (mW)
SR (%)

D (ms)

2
1.6
0.5 10 1400
0.7 35

0.4
1.55
0.6 30
1300
0.3

EC (W)
SR (%)

D (ms)
1
10
0.5 25 1.5
0.2
1200
0.4 20
0.1 1.45

0
0 10 1100 0.3 15
0 0.2 0.4 0.6 0.8 0 0.2 0.4 0.6 0.8 0 0.2 0.4 0.6 0.8
E[] (packets/ms) E[] (packets/ms) E[] (packets/ms) 1.4

0.2 10

1.35
0.1 5
Fig. 17. Performance of sleep ratio, energy consumption,
and delay under different arrival rates with queue thresh- 0
1 10
TON
20 30
0
1 10
TON
20 30
1.3
1 10
TON
20 30

old 1, 8, 32, 128 for {TDS , NSC , TDL } = {40, 3, 80}.

Fig. 19. Performance comparison of sleep ratio,
parameter set of {TDS , NSC , TDL } = {80, 1, 640}; while delay, and energy consumption under different
the comparison between TDCA scheme with D = 10 TON = 1, 10, 20, 30 with arrival rate = 0.1.
and FDRX method with {TDS , NSC , TDL } = {40, 3, 80} is
shown in Fig. 17. Note that the FDRX methods require
extensive tuning for obtaining the DRX parameter set is 0.3 by violating the QoS delay constraint. This implies
in order to achieve similar performance as the TDCA that the modeling error in C-ana-1 results in performance
scheme. The major benet of proposed TDCA scheme variation. Therefore, more accurate analysis can pro-
is that it can always satisfy the given delay constraints vided by adopting the TDCA scheme with better sleep
under both QoS cases by adaptively adjusting the values ratio performance and QoS guarantee. To investigate
of DRX parameters under different trafc loadings. the impact of on-duration timer, four different cases of
Furthermore, the proposed TDCA scheme is com- on-duration values are evaluated in Fig. 19 including
pared with the C-ana-1 model with adaptive adjustment TON = 1, 10, 20, and 30. Since the UE may always be
scheme for fair comparison as shown in Figs. 18 and in active status under higher trafc density, we consider
19. In Fig. 18 with {TON , TI } = {1, 20}, the C-ana-1 the scenario of arrival rate = 0.1. We can observe from
method almost approximates to TDCA scheme since the Fig. 19 that the performance of C-ana-1 scheme becomes
analytical model of C-ana-1 neglects the impact of on- worse as the value of on-duration timer becomes larger.
duration timer, where the performance validation has This result shows that the modeling error in C-ana-
been shown in Fig. 9. Notice that C-ana-1 only achieves 1 makes the non-optimal decision for DRX parameter
better power-saving performance when the arrival rate selection. The merits of proposed TDCA scheme can

1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications
therefore be observed.
6 C ONCLUSIONS
In this paper, performance analysis is proposed for
DRX operation in LTE systems. In order to precisely
model the power-saving behaviors of LTE system, the
proposed analytical model is introduced to include ad-
ditional parameters compared to existing models. The
sleep ratio and mean packet delay are adopted as the
measures for performance analysis, and simulations are
carried to validate the correctness of proposed model.
Moreover, a trafc-based DRX cycles adjustment (TDCA)
scheme is proposed to balance the power-saving ef-
ciency and QoS requirement. Based on trafc estimation,
the proposed TDCA scheme adjusts the DRX parameters
according to maximizing the sleep ratio performance
under a given delay constraint. The partially observable
Markov decision process (POMDP) is employed to con-
jecture the trafc status and provide the selection policy
for DRX parameters. Simulation results show that the
proposed TDCA scheme enhances DRX operation with
higher energy-saving capability while the packet delay
constraint can still be satised.
R EFERENCES
[1] 3GPP Technical Specication Group Radio Access Network, Evolved
Universal Terrestrial Radio Access (E-UTRA) - Medium Access Control
(MAC) protocol specication (Release 10), 3GPP TS 36.321 V10.0.0,
Dec. 2010.
[2] X. Ge, B. Yang, J. Ye, G. Mao, C.-X. Wang, and T. Han, Spatial
Spectrum and Energy Efciency of Random Cellular Networks,
IEEE Trans. on Communications, vol. 63, no. 3, pp. 10191030, Mar.
2015.
[3] X. Ge, X. Huang, Y. Wang, M. Chen, Q. Li, T. Han, and C.-X. Wang,
Energy-Efciency Optimization for MIMO-OFDM Mobile Mul-
timedia Communication Systems With QoS Constraints, IEEE
Trans. on Vehicular Technology, vol. 63, no. 5, pp. 21272138, Jun.
2014.
[4] X. Ge, S. Tu, G. Mao, C.-X. Wang, and T. Han, 5G Ultra-Dense
Cellular Networks, IEEE Wireless Communications, vol. 23, no. 1,
pp. 7279, Feb. 2016.
[5] IEEE Standard for Local and Metropolitan Area Networks, Part 16: Air
Interference for Fixed Broadband Wireless Access Systems, Amendment
2: Physical and Medium Access Control Layers for Combined Fixed
and Mobile Operation in Licensed Bands and Corrigendum 1, IEEE
Standard 802.16e-2005, Feb. 2006.
[6] S.-R. Yang and Y.-B. Lin, Modeling UMTS Discontinuous Recep-
tion Mechanism, IEEE Trans. on Wireless Communications, vol. 4,
no. 1, pp. 312319, Jan. 2005.
[7] S.-R. Yang, S.-Y. Yan, and H.-N. Hung, Modeling UMTS Power
Saving with Bursty Packet Data Trafc, IEEE Trans. on Mobile
Computing, vol. 6, no. 12, pp. 13981409, Dec. 2007.
[8] J.-H. Yeh, J.-C. Chen, and C.-C. Lee, Comparative Analysis of
Energy-Saving Techniques in 3GPP and 3GPP2 Systems, IEEE
Trans. on Vehicular Technology, vol. 58, no. 1, pp. 432448, Dec.
2007.
[9] L. Zhou, H. Xu, H. Tian, Y. Gao, L. Du, and L. Chen, Performance
Analysis of Power Saving Mechanism with Adjustable DRX Cy-
cles in 3GPP LTE, Proc. in IEEE VTC-fall, pp. 15, Sep. 2008.
1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
17
[10] S. Jin and D. Qiao, Numerical Analysis of the Power Saving
in 3GPP LTE Advanced and Wireless Networks, IEEE Trans. on
Vehicular Technology, vol. 61, no. 4, pp. 17791875, May 2012.
[11] Y. Y. Mihov, K. M. Kassev, and B. P. Tsankov, Analysis and
Performance Evaluation of the DRX Mechanism for Power Saving
in LTE, Proc. in IEEE IEEEI, pp. 520524, Nov. 2010.
[12] A. T. Koc, S. C. Jha, R. Vannithamby, and M. Torlak, Optimizing
DRX Conguration to Improve Battery Power Saving and Latency
of Active Mobile Applications over LTE-A Network, Proc. in
IEEE WCNC, pp. 568573, Apr. 2013.
[13] S. Fowler, R. S. Bhamber, and A. Mellouk, Analysis of Adjustable
and Fixed DRX Mechanism for Power Saving in LTE/LTE-
Advanced, Proc. in IEEE ICC, pp. 19641969, Jun. 2012.
[14] H.-C. Wang, C.-C. Tseng, G.-Y. Chen, F.-C. Kuo, and K.-C. Ting,
Accurate Analysis of Delay and Power Consumption of LTE
DRX Mechanism with a Combination of Short and Long Cycles,
Proc. in IEEE WPMC, pp. 384388, Sep. 2012.
[15] M. Polignano, D. Vinella, D. Laselva, J. Wigard, and T. B.
Sorensens, Power Savings and QoS Impact for VoIP Application
with DRX/DTX Feature in LTE, Proc. in IEEE VTC-spring, pp.
15, May. 2011.
[16] S. Fowler, Study on Power Saving Based on Radio Frame in
LTE Wireless Communication System Using DRX, Proc. in IEEE
GLOBECOM Workshops, pp. 10621066, Dec. 2011.
[17] S. Yang, M. Yoo, and Y. Shin, An Adaptive Discontinuous
Reception Mechanism Based on Extended Paging Indicator for
Power Saving in UMTS, Proc. in IEEE VTC-fall, pp. 15, Sep.
2006.
[18] S. Yang, M. Yoo, and Y. Shin, Adaptive Discontinuous Reception
Mechanism for Power Saving in UMTS, IEEE Communications
Letters, vol. 11, no. 1, pp. 4042, Jan. 2007.
[19] B. Huang, H. Tian, L. Chen, and J. Zhu, DRX-Aware Scheduling
Method for Delay-Sensitive Trafc, IEEE Communications Letters,
vol. 14, no. 12, pp. 11131115, Dec. 2010.
[20] M.-G. Kim, J.-Y. Choi, and M. Kang, Adaptive Power Saving
Mechanism Considering the Request Period of Each Initiation of
Awakening in the IEEE 802.16e System, IEEE Communications
Letters, vol. 12, no. 2, pp. 106108, Feb. 2008.
[21] L. Kong, G. K. W. Wong, and D. H. K. Tsang, Performance
Study and System Optimization on Sleep Mode Operation in IEEE
802.16e, IEEE Trans. on Wireless Communications, vol. 8, no. 9, pp.
45184528, Sep. 2009.
[22] C.-H. Hsu, K.-T. Feng, and C.-J. Chang, Statistical Control Ap-
proach for Sleep Mode Operations in IEEE 802.16m Systems,
IEEE Trans. on Vehicular Technology, vol. 59, no. 9, pp. 44534466,
Nov. 2010.
[23] DRAFT Amendment to IEEE Standard for Local and Metropolitan
Area Networks, Part 16: Air Interference for Broadband Wireless Access
Systems - Advanced Air Interface, IEEE P802.16m/D12, Feb. 2011.
[24] Y.-P. Hsu and K.-T. Feng, Performance Modeling of Power
Saving Classes with Multiple Connections for Broadband Wireless
Networks, Proc. in IEEE WCNC, pp. 14771482, Mar. 2008.
[25] C.-Y. Chen, C.-H., and K.-T. Feng, Performance Analysis and
Comparison of Sleep Mode Operation for IEEE 802.16m Ad-
vanced Broadband Wireless Networks, Proc. in IEEE PIMRC, pp.
14251430, Sep. 2010.
[26] Y.-P. Yu and K.-T. Feng, Trafc-based DRX Cycles Adjustment
Scheme for 3GPP LTE Systems, Proc. in IEEE VTC Spring, pp.
15, May 2012.
[27] D. Gross, J. F. Shortle, J. M. Thompson, and C. M. Harris,
Fundamentals of Queueing Theory, 4th ed. New York : Wiley, 2008.
[28] H. Takagi, Queueing Analysis : a Foundation of Performance Evalua-
tion. Amsterdam, The Netherlands: NorthHolland, 1991.
[29] 3GPP Technical Specication Group Radio Access Network, Evolved
Universal Terrestrial Radio Access (E-UTRA) - Radio Resource Control
(RRC) protocol specication (Release 10), 3GPP TS 36.331 V10.0.0,
Dec. 2010.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2017.2759207, IEEE
Transactions on Wireless Communications

18

[30] A. C. Cassandra, Exact and Approximate Algorithms for Par- Wun-Ci Su received the B.S. degree from Na-
tially Observable Markov Decision Processes, Ph.D. dissertation, tional Kaohsiung Normal University, Kaohsiung,
Brown Univ., Providence, RI, May 1998. Taiwan, in 2010 and the M.S. degree from Na-
[31] L. P. Kaelbling, M. L. Littman, and A. R. Cassandra, Planning tional Taiwan Normal University, Taipei, Taiwan,
and Acting in Partially Observable Stochastic Domains, Articial in 2012. Since 2012, she has been pursuing
Intelligence, vol. 101, pp. 99134, 1998. the Ph.D. degree in the Institute of Communi-
[32] A. Nogueira, P. Salvador, R. Valadas, and A. Pacheco, Fitting cations Engineering, National Chiao Tung Uni-
Self-similar Trafc by a Superposition of MMPPs Modeling the versity, Hsinchu, Taiwan. Her current research is
Distribution at Multiple Time Scales, IEICE Trans. on Communi- in the eld of energy conservation algorithm de-
cations, vol. E87-B, no. 3, pp. 678688, Mar. 2004. sign and system architecture analysis for broad-
[33] T. Yoshihara, S. Kasahara, and Y. Takahashi, Practical Time-scale band wireless networks, Narrowband-IoT and
Fitting of Self-similar Trafc with Markov-modulated Poisson LoRaWAN systems.
Process, Telecommunication Systems, vol. 17, no. 1-2, pp. 185211,
2001.
[34] 3GPP Technical Specication Group Radio Access Network, Evolved
Universal Terrestrial Radio Access (E-UTRA) - Further advancements
for E-UTRA physical layer aspects (Release 9), 3GPP TS 36.814 V9.0.0,
Mar. 2010.
[35] S. Herrera-Alonso, M. Rodrguez-Prez, M. Fernndez-Veiga, and
C. Lpez-Garca, Adaptive DRX Scheme to Improve Energy Ef-
ciency in LTE Networks With Bounded Delay, IEEE Journal on
Selected Areas in Communications, vol. 33, no. 12, pp. 29632973,
Dec. 2015.

Kai-Ten Feng received the B.S. degree from

the National Taiwan University, Taipei, Taiwan,
in 1992, the M.S. degree from the University of
Michigan, Ann Arbor, in 1996, and the Ph.D. de-
gree from the University of California, Berkeley,
in 2000. Yu-Ping Yu received the B.S. and M.S. degrees
Since August 2011, he has been a full Profes- in communications engineering from the Na-
sor with the Department of Electrical and Com- tional Chiao Tung University, Hsinchu, Taiwan,
puter Engineering, National Chiao Tung Univer- in 2010 and 2012, respectively. His research
sity (NCTU), Hsinchu, Taiwan, where he was interests are in the areas of system design
an Associate Professor and Assistant Professor of broadband wireless networks, power-saving
from August 2007 to July 2011 and from February 2003 to July 2007, mechanisms, and analytical modelling.
respectively. He served as the Associated Dean of Electrical and
Computer Engineering College at NCTU starting from February 2017.
From July 2009 to March 2010, he was a Visiting Research Fellow
with the Department of Electrical and Computer Engineering, University
of California at Davis. Between 2000 and 2003, he was an In-Vehicle
Development Manager/Senior Technologist with OnStar Corporation, a
subsidiary of General Motors Corporation, where he worked on the de-
sign of future Telematics platforms and in-vehicle networks. His current
research interests include broadband wireless networks, cooperative
and cognitive networks, smart phone and embedded system designs,
wireless location technologies, and intelligent transportation systems.
Dr. Feng received the Best Paper Award from the Spring 2006 IEEE
Vehicular Technology Conference, which ranked his paper rst among
the 615 accepted papers. He also received the Outstanding Youth
Electrical Engineer Award in 2007 from the Chinese Institute of Electrical
Engineering, and the Distinguished Researcher Award from NCTU in
2008, 2010, and 2011. He has also served on the technical program
committees in various international conferences.

1536-1276 (c) 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.