This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts

for publication in the IEEE Globecom 2010 proceedings.

Performance Analysis of the Quick Idle State Protocol of CDMA 1xEV-DO Rev. B Systems
Venkatesh Ramaswamy and Jae Chung
Airvana, Inc. 19 Alpha Road, Chelmsford, MA 01824 Email: {vramaswamy, jchung}@airvana.com
Abstract In this paper, we study the performance of Quick Idle State Protocol (QISP) introduced in CDMA 1xEV-DO Rev. B standard to enhance the battery life of Access Terminals (ATs) in the idle mode. We develop an analytical model to assess the performance of QISP and use it to compare QISP with Enhanced Idle State Protocol (EISP) of earlier standard. Specically, we evaluate the average control channel monitoring time of ATs in the idle state as a function of AT page probability and the total number of pages in the control channel cycle. The results from the model indicate a considerable reduction in the awake time of access terminals with QISP within typical ranges of operating parameters. Finally, we offer some insights on the design of QISP within the exibility offered by the 1xEV-DO Rev. B standard.

I. I NTRODUCTION The CDMA 1xEV-DO Rev. B air-interface standard has been recently proposed and standardized by the 3rd Generation Partnership Project (3GPP2) as a solution to provide high speed data services and multimedia applications. This paper will focus on the various enhancements introduced in the idle state protocol to increase the standby time of 1xEV-DO Rev.A/Rev.B phones in the idle (dormant) mode, i.e., when the phone is not engaged in any data call or voice call. We present analysis to quantify the battery life savings due to these enhancements. To begin with, we describe those aspects of the control channel that are needed to understand the rest of the paper. Details appear in [1] and [2]. A. Control Channel Basics In 1xEV-DO systems, the common control channel is used by the access terminal (AT) to communicate with the Radio Access Network (RAN) when it is not engaged in a call (voice or data), i.e., when the AT is not assigned any trafc channel. It is used to transmit broadcast overhead messages1 and system parameters as well as to transmit dedicated messages such as page messages to specic ATs. In order to conserve battery power, the access terminal does not monitor the control channel continuously, but only periodically. This mode of operation where the AT monitors the control channel for a duration and sleeps for the rest of the time is termed as slotted-mode operationthe time between two wake-up instances generally noted as a slot-cycle 2 . The AT wakes up at pre-determined instances to check if there are any messages directed to it from
1 generally 2 also

contains system parameters and are transmitted periodically called as sleep-cycle or paging cycle

the RAN. This includes checking for pages messages and any updates in the overhead messages. If there is no page directed towards the AT, it is permitted to go to sleep immediately until the beginning of the next slot-cycle. On the other hand, if there is a page for the AT, it immediately exits the slotted-mode, sends a response on the access channel and continuously monitors the control channel for subsequent messages from the RAN. After a series of message exchanges between the AT and the RAN, a connection is established and the AT is said to be in active state until the call is terminatedat that point it again enters the idle mode. In this paper, we consider the average number of slots an access terminal monitors in the idle state as the measure of effectiveness in reducing power consumption. Control channel transmission is organized as control channel periods, each with a duration of 5.12 sec. Each period has 12 control channel cycles, and each control channel cycle in turn consists of 256 slots of each 1.66 msec duration. Every AT in the idle state monitors one or more control cycles in a control channel period. These cycles are determined by a hashing algorithm which distributes ATs across the 12 control channel cycles in a period. This also guarantees that each AT monitors the same set of control channel cycles in every control channel period. In the numerical examples presented in this paper, we assume a slot-cycle of 426 msec, which is dened as slot cycle index 6 (SCI 6) in the standards. The control channel messages can be delivered to ATs in a cycle in either synchronous capsule, asynchronous capsule or sub-synchronous capsule. Synchronous capsules are used to transmit dedicated control channel messages (such as page messages, trafc channel assignment messages and access channel acknowledgement message) or broadcast messages (such as sector parameter message, access parameter message, sync message, and quick cong message). Synchronous capsule may contain more than one packet and each packet can either be transmitted using 16 slots (38.4 kbps) or 8 slots (76.8 kbps). Asynchronous capsule can be transmitted anytime a synchronous capsule is not transmitted, and contains only one packet. Sub-synchronous capsules are introduced to transmit control channel trafc to idle ATs that wake up multiple times each control channel cycle. Since we are dealing with pages, we need only consider synchronous capsules and subsynchronous capsules. Most of the current RANs do not

978-1-4244-5637-6/10/$26.00 2010 IEEE

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE Globecom 2010 proceedings.

support sub-synchronous capsule transmission, and hence we will restrict our discussion to just synchronous capsules. B. Enhanced Idle State Protocol and Quick Idle State Protocol Idle state protocol denes the procedures used by the AT and the RAN when the AT has acquired the network but the connection is not open. Efcient use of AT battery power is a challenge and goal of idle state protocol design. As stated earlier, to maximize the standby time, ATs periodically wake up from sleep mode and monitor the control channel to check for a broadcasted overhead parameter update and a message directed to them. The 1xEV-DO network mobile devices running traditional mobile data applications such as web browser and email client use a slot cycle of 5.12 sec [3] as supported by the default idle state protocol. This interval is short enough for a device in mobility to get the overhead parameter updates in time, and also fullls the application signaling delay requirements of the traditional mobile applications that often do not even support interactive application signaling. Introduction of real-time interactive applications such as Push-To-Talk (PTT) to the mobile data networks impose an additional application centric delay requirement for the slotcycle, since the applications expect the application signaling message to be delivered within a strict time limit constraints. PTT typically requires push-to-tone signaling message to be delivered within a second [3]. The default idle state protocol with a slot-cycle of 5.12 sec can adversely impact the call setup time of PTT calls. To address this delay requirement, Enhanced Idle State Protocol (EISP) was introduced in 1xEVDO Rev. A with shorter slot cycles to speed up call establishment. Using EISP, the RAN can page different ATs in a different fashion depending on the application requirements. Using a short slot cycle, however, can signicantly increase the mobile battery consumption and thus impact the mobiles standby time. In addition to the short slot cycle, increase in the control channel usage by the interactive applications can further impact the standby time of the mobile devices. The use of interactive applications is being increased in the data networks [4]. With the increase in application signaling message exchanges by the applications, a signicant increase in the control channel trafc volume to deliver page or Data over Signaling (DoS) messages is also expected. With a VoIP call model and 180 sectors per paging area, 160 pages per paging area per second are typical [5]. As a result, the delivery of pages and DoS messages may require two or more control channel packets on every synchronous capsule. The implication is that mobile devices now have to decode multiple control channel MAC packets only to determine that there is no page message directed to the device before returning to sleep mode. This deciency in both 1xEV-DO default ISP and EISP accelerates battery consumption by the mobile devices as the control channel trafc volume increases. To overcome the deciency of EISP, a new protocol referred to as Quick Idle State Protocol (QISP) [1] is proposed.

In each control channel cycle, QISP supporting RAN transmits a single slot Quick Page indicator packet before the transmission of synchronous capsule to notify whether there is a page for each AT located in the sector. This information is coded using a multi-stage hashing scheme. The AT after decoding the packet can determine, with some probability, if there is a page directed to it in the next synchronous capsule. If the packet indicates no page for the AT in the next synchronous capsule, the protocol allows the AT to immediately return to sleep mode thereby saving considerable amount of energy. In short, QISP permits ATs to decode a single slot quick page indicator packet instead of multi-slot control channel packets when there is no page for the AT. Note that because of the use of multi-stage bitmap hashing technique, the packet may falsely indicate a page for an AT, although the false probability may be extremely low. Figure 1 portrays the difference in the operation of EISP and QISP.

Fig. 1. The top gure shows the control channel cycle for QISP and the bottom one shows that for EISP (adapted from [1]). In EISP, the AT decodes synchronous capsules in every control channel cycle even though there is no page for the AT. In QISP, a single slot packet before the synchronous capsule will indicate if there is a page arriving in the synchronous capsule or not. AT will need to monitor the control channel only if there is an indication of page, thereby reducing unnecessary battery consumption.

We now turn to the creation of quick page indicator packet using multiple hash stages with B bits in each stage. Let there be L stages, and all the bits in each stage are initially cleared (set to zero). Every AT in the idle mode is hashed to a bit at each hash stage. If there is a page for the AT, the bits corresponding to that AT in each hash stage is set to one. Figure 2 illustrates this idea. When an AT decodes the quick page indicator packet, it checks for bits it hashes to in every hash stage. If at least one of the bits is zero, then it indicates no page for that AT. It is easy to see that an AT with no page could share the same bit at each hash stage with ATs with a page, leading to a false indication that the AT has a page. We shall show later that false probability can be reduced considerably by increasing either the number of hash stages (L) or by increasing the number of bits (B) in each stage. However, the packet size of the quick page indicator packet is

978-1-4244-5637-6/10/$26.00 2010 IEEE

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE Globecom 2010 proceedings.

a function of both the number of hash stages and the number of bits in each stage and increasing any of them would result in a bigger quick page indicator packet. Most of the real systems has a limit on the number of bits that can be transmitted in a slot, and that dictates the congurations of the hashing scheme that can be deployed, and eventually limits the lower bound of the false probability that can be attained. h1
AT w/0 page

h2
1 0 1 0 0

hL1
0 0 1 0 1 0 1 1 0 0

hL

0 1 0

AT with page

B bits

1 0
AT with page

Fig. 2. A multi-stage hashing scheme used to create quick page indicator packet. This scheme has L hash stages with B bits in each stage. Each AT is hashed to exactly one bit in each stage. The packet will contain ln bits.

pf : False probabilitythe probability that quick page indicator packet indicates a page for an AT that does not have a page; L: Number of levels in the hashing scheme; B: Number of bits per level in the hashing scheme; ns : Number of slots needed to transmit the quick page indicator packet; TQISP : Number of slots the AT is awake during the idle state for QISP; TEISP : Number of slots the AT is awake during the idle state for EISP; tp : Number of slots needed to transmit a medium access control (MAC) layer packet; Tcp : Number of slots that an AT monitors to decode the synchronous capsule if there is a page for the AT in the synchronous capsule; Tcp : Number of slots that an AT monitors to decode the synchronous capsule if there is no page for the AT in the synchronous capsule. We begin by computing the expected number of slots a QISP AT has to monitor during the idle state. Dene

X=

1, 0,

if there is a page for the AT in the rst CC cycle if there is no page for the AT in the rst CC cycle.

This paper has three more sections. In Section II, we develop an analytical framework to compute the average channel monitor time of ATs in the idle state, and derive the mean awake time of ATs in the idle mode for both EISP and QISP. We devote Section III to discuss numerical results obtained using the model. Finally, in Section IV we draw conclusions and provide pointers to some possible extensions to this work. II. A NALYSIS In this section we develop an analytical model to quantify the performance of QISP. Specically, we solve for the mean number of slots the access terminal has to monitor during the idle state for QISP and compare it with that of EISP. To facilitate further discussion, we list the major parameters that are used in the model. p : Total number of pages in a control channel cycle; Np : Number of MAC layer packets needed to transmit all the pages in a control channel cycle. The rst synchronous MAC layer packet carries a Quick Cong message along with pages, and therefore can accommodate a maximum of 10 pages. The rest of the packets in a control channel synchronous capsule can carry up to 13 pages. Therefore if there are p pages, then Np is given as Np = 1 1+
p 10 13

Now the expected number of slots a QISP AT has to monitor during the idle state, denoted by E[TQISP ] can be computed by conditioning on X. That is E[TQISP ] = E[TQISP |X = 1] P{X = 1} + E[TQISP |X = 0] P{X = 0}. (2)

Consider E[TQISP |X = 1]. If there is a page, the expected number of slots the AT monitors is ns + E[Tcp ]. If there are Np packets, the page for the AT can appear in any one of the Np packets with equal probability. Therefore the average number of packets the AT has to monitor is given by E[Tcp ] = Therefore, E[TQISP |X = 1] = ns + Np + 1 2 tp . (4) 1 Np
Np

i=
i=1

Np + 1 . 2

(3)

if p 10 otherwise.

(1)

On the other hand when there is no page for AT, the hashing procedure can misclassify the AT as an AT with page in which case the AT monitors the channel for Np tp slots after decoding the quick page indicator packet. Note that the misclassication probability is fp . When the AT is not misclassied, it goes to sleep right after decoding the Quick Page indicator packet, which takes ns slots. E[Tcp ] = ns (1 fp ) + (ns + Np tp )fp = ns + Np fp tp (5)

A maximum of four MAC layer packets can be transmitted in a control channel synchronous capsule; p: Probability that the AT of interest has a page in a given control channel cycle;

By assuming that control channel cycles are independent, it follows that after the rst control channel cycle which did

978-1-4244-5637-6/10/$26.00 2010 IEEE

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE Globecom 2010 proceedings.

not have a page, the expected number of slots the AT has to monitor until the rst page is E[TQISP ]. E[TQISP |X = 0] = E[Tcp ] + E[TQISP ] = ns + Np fp tp + E[TQISP ] (6)

Substituting (6) and (4) in (7), we get E[TQISP ] = + Np + 1 tp p 2 (ns + Np fp tp + E[TQISP ])(1 p) ns + 1 1 + p Np + 1 2

trafc channel packets and control channel packets are time division multiplexed. Therefore in the forward link, trafc data may be transmitted between control channel packets, and as a consequence an AT decoding multiple control channel packets will be awake during the transmission of interlaced trafc data. We ignore this factor in the analysis because it affects both EISP and QISP in the same way. In the next section, we present numerical results obtained from the above model. III. N UMERICAL R ESULTS AND DISCUSSIONS In this section we present selected numerical results to compare the performance of QISP and EISP. We also discuss the tradeoffs that highlight the design considerations of these schemes. Specically we wish to study the behavior of QISP and EISP in terms of the ATs page probability and the total number of pages in a control channel cycle. We also study the effect of hashing scheme on the performance of QISP. The plots shown in this section are obtained using (10) and (13). For our numerical examples, we choose ns = 1 slot, tp = 8 slots (corresponding to a rate of 76.8 kbps), and L = 4 for the number of levels in the hashing schemes (as suggested in the standard [1]). Figure 3 depicts the average number of slots AT is awake during the idle state as a function of the page probability for QISP and EISP. For ATs with low page probability (such as ATs running best effort applications) the awake time is considerably reduced with QISP. As the page probability increases, the performance gain with QISP decreases.
2500

(7)

Rearranging the above equation, we get E[TQISP ] = ns + Np fp tp p tp . (8)

To complete the computation of E[TQISP ], it remains to compute the false positive probability of the hashing scheme. We can compute fp using standard probabilistic arguments as follows [6]. Since there are B bits per level, the probability of setting a certain bit is 1/B and probability of not selecting the bit is 1 1/B. The probability that after hashing pages, a certain bit is not set is given by (1 1/B) . Conversely the probability that a certain bit is set is 1 (1 1/B) . Now the probability that the bit is shared with an AT with page in all the L levels is given by fp = 1 1 1 B
L

(9)

Substituting (9) in (8) E[TQISP ] = + ns + Np p Np + 1 2 1 1 tp . 1 B

L

tp

Expected no. of slots AT monitors in idle state

1 1 p (10)

EISP QISP
2000

We now turn to the evaluation of E[TEISP ]. Using the same logic as that leading to (7), we can write E[TEISP ] = E[TEISP |X = 1] P{X = 1} + E[TEISP |X = 0] P{X = 0}. (11)

1500

1000

When the rst control channel cycle carries the page, the expected number of slots AT monitors is (Np + 1)ts /2. When the rst control channel cycle does not carry a page, the AT has to monitor an average of Np ts + E[TEISP ] slots. We can now evaluate (11) as E[TEISP ] = + Np + 1 tp p 2 (Np tp + E[TEISP ])(1 p). 1 1 . p

500

0.05

0.1

0.15

0.2

0.25

0.3

0.35

0.4

0.45

0.5

Page probabiliy

(12)

Simple algebraic manipulation yields E[TEISP ] = Np + 1 2 tp + Np tp (13)

Fig. 3. Average number of slots an AT is awake during idle state as a function of page probability for QISP and EISP. The following parameters are used: = 30, ns = 1, tp = 8 slots. The hashing scheme for QISP uses four levels with 30 bits in each level.

We note in passing that the actual amount of time the AT monitors the channel is more than what is given in (13) and (10). This is due to the fact that in 1xEV-DO forward link,

In Figure 4, we study the effect of control channel congestion given by the total number of pages in a control channel cycle on the performance of QISP and EISP. The page probability of the AT of interest is assumed to be 0.05. QISP outperforms EISP irrespective of the control channel

978-1-4244-5637-6/10/$26.00 2010 IEEE

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE Globecom 2010 proceedings.

congestion. As the control channel gets congested the average awake time of ATs increases with both QISP and EISP. However, QISP performs better than EISP as the control channel congestion increases as the difference in the average awake time between the schemes increases with congestion.
800

Expected no. of slots AT monitors in idle state

700

EISP QISP

schemeproviding the operator the exibility to change the number of bits in each level. The Figure 5 shows the average awake time in slots for ATs with QISP protocol for different values of the number of bits per level. The total number of pages per control channel cycle is assumed to be 30. We can readily observe from the gure that there is a signicant improvement in the performance when the number of bits per level is increased from 20 to 40. However, increasing the number of bits further yields diminishing returns. IV. C ONCLUSION AND FUTURE WORK In this work we developed an analytical framework through which control channel monitor time of ATs in idle mode can be evaluated. Using the framework, we studied the performance of Quick Idle State Protocol and compared it with Enhanced Idle State Protocol for different AT page probabilities and different control channel loading conditions. Our limited examination of the protocols reveals signicant battery life improvement with QISP when the AT page probability is low or when the control channel loading as indicated by the number of MAC packets in a control channel cycle is high. Our hope with the analysis presented here is that it will provide initial guidelines to cellular operators in evaluating various choices available to them, and provide useful hints regarding the circumstances under which QISP will yield signicant performance over earlier protocols. We concluded the discussion with some guidelines on setting the design parameters of QISP. As a possible extension to this work, we are conducting comprehensive studies using a real network to explore the performance of QISP under various operating parameters. R EFERENCES
[1] 3GPP2 C.S0024-A v1.0, CDMA 2000 High Data Rate Packet Data Air Interface Specication, Available from www.3gpp2.org. [2] T. Gopal, EVDO Rev. A control channel bandwidth analysis for paging, Proc. of IEEE Wireless Communications and Networking Conference, pp. 32623267, March 2007. [3] Airvana Inc., Push-To-Talk, Tech. Rep., 2006. [Online]. Available: http://www.airvana.com/technology/technology pushtotalk.htm [4] , VoIP, Tech. Rep., 2006. [Online]. Available: http://www.airvana.com/technology/technology voip.htm [5] M. Yavuz, S. Diaz, R. Kapoor, M. Grob, P. Black, Y. Tokgoz, and C. Lott, VoIP over cdma2000 1xEV-DO revision A, IEEE Communications Magazine, vol. 44, no. 2, pp. 5057, February 2006. [6] A. Broder and M. Mitzenmacher, Network applications of Bloom lters: A survey, in Proc. of Internet Mathematics, 2002, pp. 636646.

600

500

400

300

200

100

10

15

20

25

30

35

40

45

50

Total number of pages in a CC cycle

Fig. 4. Average number of slots AT monitors as a function of the total number of pages in a control channel cycle for QISP and EISP. The AT is assumed to have page probability of 0.05. For QISP, the hashing scheme is assumed to have four levels with 30 bits in each level.

1200

Expected no. of slots AT monitors in idle state

1000

QISP with 20 bits/level QISP with 40 bits/level QISP with 60 bits/level

800

600

400

200

0.05

0.1

0.15

0.2

0.25

0.3

0.35

0.4

0.45

0.5

Page probabiliy

Fig. 5. Average number of slots AT monitors in idle state as a function of page probability for different number of bits per level of hashing scheme with four levels. The total number of pages per control channel cycle is assumed to be 30.

What is the effect of hashing scheme conguration on the performance of QISP? We answer this question in Figure 5. Note that two parameters associated with the hashing schemes are the number of hash levels L and the number of bits per hash level B. The size of quick page indicator packet is given by LB. The standard recommends a four level hashing

978-1-4244-5637-6/10/$26.00 2010 IEEE