See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/242731039

ADAPTIVE CALL ADMISSION CONTROL IN TDD-CDMA CELLULAR WIRELESS

NETWORKS

Article

CITATIONS READS

3 1,836

2 authors, including:

Dhananjay Kumar
Anna University, Chennai
86 PUBLICATIONS   332 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

ENERGY EFFICIENT DATA AGGREGATION TECHNIQUES FOR WIRELESS MULTIMEDIA SENSOR NETWORKS View project

All content following this page was uploaded by Dhananjay Kumar on 13 January 2016.

The user has requested enhancement of the downloaded file.

 ADAPTIVE CALL ADMISSION CONTROL IN TDD-CDMA
CELLULAR WIRELESS NETWORKS

Dhananjay Kumar 1, Chellappan C2

1
Department of Information Technology, Anna University, Chennai
1
dhananjay@annauniv.edu
2
Department of Computer Science & Engineering, Anna University, Chennai
2
drcc@annauniv.edu

ABSTRACT
The Code Division Multiple Access system with Time Division Duplex mode
(TDD-CDMA), adopting unbalanced slot allocation between uplink and
downlink, can meet the asymmetric traffic requirement of multimedia services.
Here a call admission control policy is proposed to support different multimedia
applications. The scheme operates at the connection-level where the CDMA
code of ongoing call can be dynamically changed to provide an acceptable trade
off level between connection blocking and dropping probabilities for different
traffic class. Although Orthogonal Variable Spreading Factor (OVSF) code is
used in simulation here, the paramount interest is on algorithm that allows
optimum use of the TDD-CDMA resources i.e. code and time slots. Simulation
results shows that on the expense of resource allocated to non real-time
services, the call dropping and blocking rate for high priority (real-time)
services can be minimized.
 
Keywords: TDD-CDMA; Interference; Multimedia; Call Blocking/Dropping.

 
1 INTRODUCTION
Upstream Frequency 
Band 
In future wireless networking environments, the data
traffic for Internet, real-time voice, and multimedia
traffic will coexist. For the multimedia application
such as streaming audio/video or web services, the
Downstream 
downlink traffic will be the bottleneck of the system.
On the other hand, the uplink traffic may be bursty
and irregular when mobile users use the application
like file uploading services. The dynamic change of Frequency Division Duplexing (FDD)   
the traffic asymmetry between uplink and downlink
makes the resource allocation of the future wireless
system difficult. The code division multiple access Same Upstream & 
Downstream Frequency band  
system with time division duplex mode (TDD-
CDMA) is a promising solution to cope with the
traffic asymmetry problem [1, 2].
The TDD-CDMA mode of 3GPP, named UTRA-
TDD (Also called UMTS-TDD), is based on TD-
CDMA technology, which is a mixture of TDMA
and CDMA [3]. In Frequency Division Duplex Time Division Duplexing (TDD) 

(FDD) mode, a pair of frequency band is chosen for

uplink and downlink communication, but in TDD
same frequency is used for both directions (Fig.1).
Although FDD is dominant candidate in W-CDMA
(Originally developed by NTT DoCoMo, Japan),
which uses a pair of 5 MHz-wide radio channels, the
TDD mode is more popular in the case of micro/pico
Fig.1 FDD and TDD mode of communication
cell environment because of its capacity and
flexibility to support asymmetric traffic [4,5].
Even though TDD-CDMA is not directly
compatible with UMTS (Which is based on W-
CDMA), it is closely related to W-CDMA, and

UbiCC Journal, Volume 4, Number 3, August 2009 834

 provides the same types of channels where possible.
In this paper, we investigate and analyze an adaptive
algorithm for resource allocation in TDD-CDMA
system which is one of the candidates for multiple
access technique for the fourth generation (4G)
systems [2, 6].
The resource of TDD-CDMA is divided in both
time and code domain. In a cell of a TDD-CDMA
system, the base station and all mobiles occupy a
single band employing a direct sequence spreading
waveform. The bidirectional communication
between base and mobiles is accomplished by a TDD
scheme [7]. Each slot in TDD carries traffic for
different mobile station separated by CDMA code.
Figure2 shows an example of the TDD frame
structure. A TDD frame consists of a fixed number
of time slots. At least one slot is dedicated to uplink
(from mobile to base) and at least another one slot is
dedicated to downlink (from base to mobile). The
number of uplink and downlink slot can be
adaptively controlled by the base station.
DL DL DL UL DL DL DL UL UL DL
TDD Frame  presented in Section4. Simulated result is discussed
Fig.2 Uplink and downlink in a TDD frame
In this paper, we characterize services into two
types: adaptive, and non-adaptive. In the case of a
non-adaptive service, the bandwidth of a call is fixed
throughout its lifetime and needs strict bandwidth
guarantees, else the call will be dropped. But in the
case of an adaptive service, the call will not be
dropped, but will suffer bandwidth degradation.
Many real-time multimedia services are adaptive in
nature and can operate over a wide range of
bandwidth. Adaptive Code Allocation (ACA)
algorithm is called to support the bandwidth
requirement of a new high priority calls in the
system. The ACA algorithm decreases assigned
bandwidth of ongoing connections in the cell
depending on the network load situation, by
allocating dynamic OVSF code.
N. Nasser and H. Hassanein [8,9], has proposed an
adaptive framework to support multimedia
applications, but not with respect to any existing
systems. Further it does not consider the multiple
access techniques which inherently govern the
resource allocation & hence call control mechanism.
N. Nasser again in a similar paper [10] talks about
adaptability enhancement framework, but once again
without considering under laying techniques. Zhihua
Zheng [11] has proposed an efficient dynamic
channel assignment with channel locked for TDD-
CDMA communication considering three sectored
cell. Ioannis Spyropoulos et al.[1] has proposed a
UbiCC Journal, Volume 4, Number 3, August 2009
decentralized scheme for TDD-CDMA systems,
which combines an interference-aware dynamic
channel allocation algorithm with space–time linear
minimum-mean-square-error (LMMSE) joint
detection at the base and mobile stations. Their
analysis includes outage and average throughput via
analytical approximations.
The proposed algorithm here, aims to support
multimedia calls while optimizing the resource
allocation in TDD-CDMA system, thereby reducing
both the blocking and dropping rates of real-time
multimedia calls. The proposed Call Admission
Control (CAC) algorithm is capable of offering
services even when there is insufficient number of
codes available by intelligently swapping the OVSF
codes of ongoing calls. This results in reduced
volume of the blocking and dropping rates; thus
striking a proper balance between Quality of Service
(QoS) fulfilment and code/bandwidth utilization.
This paper is organized as follows. In Section2
interference pattern for TDD-CDMA system is
presented. An introduction to OVSF and CAC
algorithm is explained in Section3. The simulation
environment for the proposed adaptive algorithm is
in Section5. We conclude with an overview of the
simulation carried out in Section6.
2 INTERFERENCE PATTERN IN TDD-CDMA
In TDD-CDMA each slot will carry many user
data on different channel separated and identified by
pseudo noise (PN) code. Considering intra-cell and
inter-cell interference separately in a multi-cell
environment, the bit energy to noise ratio can be
modelled as
Pr .SF
Eb / N 0 = (1)
I int + I ext + N 0 .W
Where Pr is the received power, SF is the
spreading factor, Iint is the internal noise within the
cell, Iext is external noise coming from other cells,
No is the noise power spectral density, and W is the
total transmission bandwidth.
 
2.1 Interference in Uplink channels
Suppose mk be the number of MS served by a
channel, where k = 1,2,3,…..K, represent the kth
channel to support K type of services in a cell. Let
Pki denote the transmit power of ith MS to maintain
certain quality of service (QoS) for a kth service, and
Gki the gain between ith MS and it’s BS. The
internal interference Iint in uplink for kth channel
carrying data of Ith MS may be given by
  K mk
I int
= ∑ ∑ G ki  P ki 
(2)
k =1 i =1
k≠I i≠I
835
 A multi-user detection (MUD) factor (1-β), where
β is MUD efficiency, is multiplied with the external
interference Iint to achieve 3GPP requirements for
CDMA-TDD [12]. In other words, β is an
interference reduction factor. For example, MUD in
uplink, β = l is a case of ideal MUD, while β = 0
represents absence of interference cancellation
technique and hence employing a rake filter.
To compute external interference Iext , let ml be
the number of MS served on lth channel , where l =
1,2,…..L represents L channels in the neighbour cell
j supporting L type of multimedia application. Now
Iext may be expressed as
J L ml
I ext = ∑∑∑G
j =1 l =1 i =1
i
jl P jli (3)
Where J is the number of interfering neighbour
cells, Gijl the link gain between ith MS in neighbour
cell and the tagged BS, and Pijl the transmit power of
ith MS to support its QoS requirement in its cell.
 
2.2 Interference in Downlink Channels
Data in downlink channels (for example in W-
CDMA) are transmitted with orthogonal codes; in
other word, they are coded such that mutual
interference is minimal. Assuming perfect time
synchronization between MS and BS, and if the type
of channel is flat fading i.e. if the orthogonality is
preserved during downlink slot, then the internal
noise Iint is absent. But the multipath propagation
destroys some of this orthogonality in downlink. An
orthogonality factor (α) which is the percentage of
downlink orthogonality remaining at the mobile
receiver, is introduce to compute Iint . Now, the
internal interference Iint arising due to non-
orthogonality of the received signals is given by
L originating from mobile user.
I int = ∑
l =1
α G li Plt (4)
Where Plt is the total base station power allocated
to signals using the same scrambling code for lth
channel , Gli thelink gain between ith MS and tagged
BS for the same lth channel.
To compute the external interference Iext , we take
the advantages of similarity with (3) and can be
represented as
J L ml
I ext = ∑∑∑G
j =1 l =1 i =1
i
jl P jli (5)
Where Gijl is the link gain between ith tagged MS
and a MS in neighbor Jth cell, ml the number of MS
in a jth cell, and Pijl the transmit power of a MS in
cell J.
 
 
UbiCC Journal, Volume 4, Number 3, August 2009
3 OVSF CODE AND CAC ALGORITHM
The use of OVSF codes (Fig.3) to support wide
variety of multimedia calls has been widely
advocated [13,14]. Different spreading factor (SF)
means different code length. The requirement is to
combine different messages with different spreading
factors and keep the orthogonality between them. We
therefore need codes of different length that are still
orthogonal. It is assumed that voice traffic will
require constant bandwidth but other components of
multimedia like images, audio/video streaming will
demand higher variable data rate support. So, the
resource pool maintains OVSF code representing
different data rate R, 2R, 3R…. corresponding to SF
= 1, 2, 3,….
3.1 CAC Algorithm
When a new or a handoff call of a class arrives in
a cell, the base station (BS) calls the CAC algorithm
(Fig.4). CAC selects a code form resource
corresponding to the types service requested. After
allocating a code, the Eb/No is computed for the
current slot. If SNR falls below the threshold (γm),
next code with higher spreading factor is selected. If
no higher SF codes are available in resource pool,
and if the call has higher priority, then ACA is
called. The ACA finds whether an existing low
priority non-real time call can be bandwidth
degraded, and hence the existing code is swapped
with a low SF code. On failure of that, the
subsequent slot is declare the same status, and the
new call is accommodated in the newly declared slot.
If the subsequent slot cannot be declared same (UL
or DL) because of the existing traffic pattern, then
the new call is rejected. A new call may be a handoff
calls which have higher priority than the new calls
 
4 SIMULATION ENVIRONMENT
Simulation environment to represent TDD-CDMA
was implemented using Network Simulator-2 (NS-
2). A Universal Mobile Telecommunications System
(UMTS) patch was incorporated in existing NS-2 to
create the cellular environment. A single cell
environment with a BS and radio network controller
(RNC) in UMTS is created, but interference pattern
were implemented corresponding to the multi-cell
scenario. As per UMTS specification in a frame
length of 10ms, 15 time slots were considered. In the
simulation, 150 user equipment (UE) were created,
allowing them to move randomly across the cell and
make random request for calls according to Poisson
rate. To communicate with the BS, UE uses
dedicated channels assigned to them.
836
  

  SF = 8
SF = 1  SF = 2  SF = 4
C1 = (1, 1, 1, 1, 1, 1, 1, 1)
 
C2,1 = (1, 1, 1, 1 )
  C1 = (1, 1, 1, 1, ‐1, ‐1, ‐1, ‐1) 
C2,1 = (1, 1) 
 
C1 = (1, 1, ‐1, ‐1, 1, 1, ‐1, ‐1) 
C2,1 = (1, 1, ‐1, ‐1 )
 
C1 = (1, 1, ‐1, ‐1, ‐1, ‐1, 1, 1) 
 
C1,1 = (1) 
C1 = (1, ‐1, 1, ‐1, 1, ‐1, 1, ‐1) 
  C2,1 = (1, ‐1, 1, ‐1 )
C1 = (1, ‐1, 1, ‐1, ‐1, 1, ‐1, 1) 
  C2,1 = (1, ‐1) 
C1 = (1, ‐1, ‐1, 1, 1, ‐1, ‐1, 1) 
  C2,1 = (1, ‐1, ‐1, 1 )

  C1 = (1, ‐1, ‐1, 1, ‐1, 1, 1, ‐1) 

     

Fig.3 Orthogonal variable spreading factor code

Following are the major functions implemented in 4.3 Termination of Connection by UE

NS-2. We have also considered call holding time, with
an upper bound, which is the waiting time between
 
the period, when the call gets connected and the
4.1 Request for Connection by UE
resource gets allocated. Once the timer
New call arrival rate is assumed to follow Poisson
corresponding to call holding expires, a terminate
Process with rates λ. i.e. λ calls per second. In the
packet is sent to BS. On receiving this packet BS
simulation, λ = 1 call/sec to 16 calls/sec were
calls the terminate procedure to free the resources
considered and each runs for about 10 seconds. A
allocated for that call.
UE sends request for call connection to BS by
sending a request packet. The request packet
4.4 Recording by BS
contains the class type, call type and link required by
For each λ value for call arriving, the simulation is
the call.
run for 10 seconds and the BS maintains the number
of calls blocked and dropped in the process. These
4.2 Processing Request by BS
will be recorded after the entire simulation and will
The BS receives random call request from the be used for plotting graphs.
users according to Poisson distribution. This call
 
request may be for a new call or a handoff call. The
4.5 Segregation of Calls
BS on receiving request packet for a new call, try to
We consider two types of calls, namely class1 and
allocate available code (bandwidth) efficiently
class2. Time insensitive calls are considered in
among users, which is done by calling the CAC
class1, e.g. Web Browsing, Data upload/download,
algorithm. Also, the BS maintains details of currently
email services etc. Time sensitive calls are
ongoing calls for each class in linked lists.
considered in class2, e.g. Audio/Video streaming,
Telephonic etc. Handoff calls considered here falls
under class2 i.e. it has higher priority than class1
service.

 
UbiCC Journal, Volume 4, Number 3, August 2009 837
 Start 

Select a code 
corresponding to the BWi 
requirement 

Estimate SNRi in the 
current slot 

th
Allocate the code for i  call 
Is SNRi > γm 
Yes

No 

Choose a code with next  Update code resource pool  
higher SF 

Pick‐up next unallocated 
Is SF > Am  
call  
No 

Yes 

Is it class2  All call 
call  Yes accommodate
Call ACA procedure   No 
No 
Yes

Find if it can be 
accommodated in next  Code  End 
slot   available
No Yes

Declare next slot in 
Next slot  same direction UL/DL  
Yes
No 

th
Reject i  call  

Fig.4 Flow chart of CAC algorithm

 
5 RESULTS

The record created by BS after the simulation is
used to plot connection dropping and blocking rate.
 
5.1 Call Dropping
Fig.5 shows call dropping rate vs. call arrival rate
(Poisson Rate). As expected, as the call arrival rate
increases the call dropping rate increases. Also 
the call dropping rate for class1 is greater than
class2. This is because class2 has higher priority than
class1. We also note that, for a call arrival rate λ = 6,
for both class1 and class2, the call dropping rate is
less than 0.5, In particular for class2, it is less than
0.2.

 
UbiCC Journal, Volume 4, Number 3, August 2009 838
 5.2 Call Blocking During system operation, and because of the
The plot in Figure6 corresponds to call blocking statistical nature of the arrival and departure
rate vs. call arrival rate (Poisson Rate). Call blocking processes, the occupied codes will be randomly
rate gradually increases as arrival rate increases, and scattered across the code tree, so countermeasures
for Class2 that includes handoff calls has higher need to be taken.
priority, blocking rate is low. Although for a call
arrival rate λ = 6, call blocking rate is around 0.55 7 REFERENCES
for class 1, it is less than 0.3 for class 2.
[1] Ioannis Spyropoulos, and James R. Zeidler:
Supporting Asymmetric Traffic in a
TDD/CDMA Cellular Network via
Interference-Aware Dynamic Channel
Allocation and Space–Time LMMSE Joint
Detection, IEEE Transaction on Vehicular
Technology Vol.58, No.2, February (2009).
[2] Ming Yang, and Peter Han Joo Chong: Uplink
Capacity Analysis for Multihop TDD-CDMA
Cellular System, IEEE Transaction on
Communication Vol.57, No.2, February (2009).
[3] 3GPP Technical Specification for CDMA-
TDD:TS25.221, TS25.222, TS25.223, and
Fig.5 Call dropping rate vs. arrival rate TS25.224. http://www.3gpp.org.
  [4] Overview of The Universal Mobile
Telecommunication System,
http://www.umtsworld.com/technology/overvie
w.htm.
[5] Maryam Arabshahi and Peter Han Joo Chong:
High-Speed Multimedia Services for TDD-
CDMA Multihop Cellular Networks,
International Conference on Wireless
Communications and Mobile Computing, 2008,
IEEE xplore (2008).
[6] R. Esmailzadeh, M. Nakagawa, and Alan Jones:
TDD-CDMA for the 4th Generation of wireless
communications”, IEEE Wireless
Communication Magazine, pp.8-15, August
(2003).
Fig.6 Call blocking vs. arrival rate [7] Ki-Dong Lee; Yi, B.K.; Kun-Nyeong Chang;
Leung, V: Information Exchange Based Low-
Complexity Slot Allocation in TDD-CDMA
6 CONCLUSION
Cellular Systems, International Conference on
Wireless Communications and Mobile
A call admission control algorithm for multimedia Computing, 2008, IEEE xplore (2008).
call is implemented in TDD-CDMA system. The [8] N. Nasser and H. Hassanein: Connection-level
algorithm considers three parameters namely SNR, Performance Analysis for Adaptive Bandwidth
available OVSF code, and time slot. The framework Allocation in Multimedia Wireless Cellular
achieves a better connection dropping and blocking Networks, Proceedings of the IEEE International
rate for higher priority calls on the expense of non- Performance Computing and Communications
real time lower priority calls. Class2 calls include Conference (IPCCC)-2004, Phoenix, Arizona,
handoff calls which are of higher priority in any pp. 61- 68 (2004).
systems. Simulation result shows that connection [9] N. Nasser and H. Hassanein: Prioritized Multi-
dropping rate for class2 is less than 0.2 for an arrival class Adaptive Framework for Multimedia
rate λ = 6. For the same parameter (λ = 6) although Wireless Networks, Proceedings of the IEEE
connection blocking rate for class 1 is more than 0.5, International Conference on Communications
for class2, it is below 0.3 (ICC)-2004, Paris, France, Vol. 7, pp. 4295-
Although we have categorized only two classes of
4300 (2004).
calls, there could be more than two, and exhaustive
simulation needs to be carried out to study the
connection dropping and blocking rate separately.

 
UbiCC Journal, Volume 4, Number 3, August 2009 839
 [10] Nidal Nasser: Adaptability Enhanced
Framework for Provisioning Connection-level
QoS in Multimedia Wireless Networks, IEEE
and IFIP International Conference on Wireless
and Optical Communications Networks
(WOCN)-2005, Dubai, UAE, pp. 275-279
(2005).
[11] Zhihua Zheng: An Efficient Dynamic Channel
Assignment with Channel Locked for TDD-
CDMA Systems, 4th IEEE International
Conference on Circuits and Systems for
Communications, May 2008. ICCSC (2008).
[12] T. Ojanpera, R. Prasad: Wideband CDMA for
Third Generation Mobile Communication”,
Artech House Publication (1998).
[13] Sun-Ho Lee and Dong-Ho Cho: OVSF Code
Assignment Method Considering Traffic
characterisrics in W-CDMA Systems,
http://whitepapers.zdnet.co.uk/0,1000000651,2
60235555p,00.htm.
[14] Angelos N. Rouskas and Dimitrios N. Skoutas:
OVSF Codes Assignemnt and Reassignement
at the Forward Link of W-CDMA 3G Systems,
IEEE PIMRC (2002).

 
UbiCC Journal, Volume 4, Number 3, August 2009 840

View publication stats