Cell To Switch Assinment
Cell To Switch Assinment
Cell To Switch Assinment
5 3 4 6 2
M + + + s
1 ' ' &' '
0
ij
y if i j connected with a common switch
otherwise
=
=
1
m
ik ik
k
C c x
=
=
19
(5)
This is also very obvious like (2)
Handoff cost from ith cell can be express as
(6)
For proving it 1st notice that
(
) Otherwise
I.e. we eliminate the simple handoff from cost function.
So
- For some other time it is
are constant
So we have two single home problem in the cost function but we can/t simply write them side
by side because we may over calculated the cabling cost . So we define ne variable as
(8)
1
(1 )
n
ij ij
j
H h y
=
=
1 1 1 1
(1 )
n m n n
ik ik ij ij
i k i j
c x h y
= = = =
+
20
Here is the or operation
So the cost function is
' '
1 1 1 1 1 1
(1 ) (1 )
ij ij
n m n n n n
ik ik ij ij
i k i j i j
c w h y h y
= = = = = =
+ +
(9)
2.12 Single homing in UMTS
The basic problem is that UMTS is three layer, so we cannot simply formulated its cost function
Here complex handoff is hard handoff and soft and softer are called simple handoff as discuss
before
Fig.15. typical UMTS architecture
The assumptions are
There are I{1,2,n} cells , J{1,2,r} RNC, K{1,2,m} MSCs and L{1,2,s} SGSN
-
12
ij
c cabling cost between ith BSC and jth RNC
-
23
jk
c cabling cost between jth RNC and Kth MSC
-
24
jl
c cabling cost between jth RNC and lth SGSN
-
2
vj
w circuit switching cap. For of jth RNC
21
-
2
dj
w packet switching cap. For of jth RNC
-
3
vk
w capacity of MSC k
-
4
dl
w capacity of SGSN l
-
12
vi
f amount of voice traffic of node B
-
12
di
f amount of data traffic of node B
-
23
vj
f amount of voice traffic of RNC j
-
24
dj
f amount of data traffic of RNC j
-
'
3
ii
h complex handoff involving MSCs
-
'
4
ii
h complex handoff involving two SGSN
So as previously define
12
1
ij
x = If I ith BSC is connected with jth MSC
12
0
ij
x = Otherwise
23
1
0
jk
x if jthRNCconnect withKthMSC
otherwise
=
=
24
1
0
jl
x if jthRNCconnect withlthSGSN
otherwise
=
=
Also define
'
'
12
1 &
0
ii
y if both i i conectedwithsameRNC
otherwise
=
=
'
'
23
1 &
0
jj
y if both j j conectedwithsameMSC
otherwise
=
=
'
'
24
1 &
0
jj
y if both j j conectedwithsameSGSN
otherwise
=
=
Considering two classes of traffic, the traffic generated by all Nodes Bs connected with RNC j
cannot exceed the RNC capacities in term of voice and data traffic which is expressed as follow
22
12 12 2
12 12 2
vi ij vj
i I
di ij dj
i I
f x w j J
f x w j J
e
e
s e
s e
(10)
Similarly, voice traffic from the RNCs to MSC k cannot exceed the MSC capacity, which is
express as follows:
23 23 3
vj jk vk
j J
f x w k K
e
s e
(11)
Also, data traffic from the RNC to SGSN l cannot exceed the SGSN capacity, which is express as
follow
24 24 4
dj jl vl
j J
f x w l L
e
s e
(12)
Like the previous solution we can express our cabling cost in similar way but the only problem is
we shod consider three case BSC RNC, RNC MSC and RNCSGSN
So our cabling cost is
12 12 23 23 24 24
ij ij jk jk jl jl
i I j J j J k K j J l L
C c x c x c x
e e e e e e
= + +
(13)
Now in case of handoff cost again we three layer architecture now considering the liner
programming we can express the BSCRNCMSC handoff is as
'
' '
1 3 12 23
(1 )(1 )
i i
ii ii jj
i I j J i I j J
f h y y
e e e e
=
(14)
Because 1
st
consider the term
'
3 12
(1 )
i i
ii ii
i I i I
h y
e e
(15)
So the total cost function is express as
23
' '
' ' ' '
1 2 12 12 23 23 24 24 3 12 23 4 12 24
(1 )(1 ) (1 )(1 )
i i i i
ij ij jk jk jl jl ii ii jj ii ii jj
i I j J j J k K j J l L i I j J i I j J i I j J i I j J
C f f c x c x c x h y y h y y
e e e e e e e e e e e e e e
+ + = + + + +
(16)
2.13 Dual homing in UMTS
In case of dual homing in we have two options
We may connect cells with one or two RNC but only one RNC is in action at a time
We may connect RNCs with one or two MSCs and SGSN but only one MSC and SGSN is in
action at a time
In [10] authors are formulated cost function for dual homing in RNC in UMTS network
2.14 Heuristic Method
Assigning cell to switch is like Bin-picking problem in mathematics, so this is NP-hard problem
and can be solve by heuristic method. In [8] authors solve cell to switch assignment problem for
PCN network for both the single & dual home by greedy method & their own describe heuristic.
In [9],[14] authors solve the same problem by Tabu search method. In case of UMTS network
[9],[14] authors solve it by tabu and the use three level Tabu search for getting the better
solution. In [10] they compeer different Meta heuristic technique for giving us better
understanding
2.15 Tabu search
Tabu search is an adaptive technique used in combinatorial optimization problem the besic
Tabu search sis as follow
INITIALIZATION: choose an initial solution S in X
: = S (
)
nbiter: = 0 ( )
bestiter : = 0
(
)
T := null (T is Tabu list)
Continue: = true
While Continue do
If (nbiter-bestiter>kmax) or (V-T=null)
24
Then continue: = false
Else nbiter : = nbiter+1
Generate (N(S) is the neighborhoods of S)
Find the best solution S in
S: = S
Update T
If
then
bestiter := nbiter
End if
end while
3 Future work
Solving the cell to switch problem for UMTS network by some Meta heuristic method and also
involve kth step random walk model
25
References
[1] T.S,Rappaport , wireless communication principle and practices, Pearson Education India,2009
[2] B.Walke, P.Seidenberg, M.P.Althoff, UMTS the Fundamentals, John Wiley & Sons. Ltd., 2003
[3] C.Smith, D.collins, 3G wireless network, MacGraw-Hill, 2001.
[4] W. Stallings, Wireless Communications and Networks, Pearson Education, 2
nd
edition 2005
[5] A. Merchant and B. Sengupta, Assignment of cells to switches in PCS networks, IEEE/ACM
Trans. Networking (TON), Vol. 3,no.5, pp. 521-526,October 1995.
[6] F.Glover and M.Laguna ,Tabu Search, Kluwer Academic Publishers,1997
[7] M.Maitra , A.Mukherjee, D.Saha Integrated Interswitch Cable and Handoff Cost
Minimizing Heuristics for Cell-to-Switch Assignment in Wireless Cellular Networks, IEEE
transaction on vehicular technology, Vol. 58, No.9, November 2009
[8] F. Houto , S. Pierre, A tabu search approach for assigning cells to switches in cellular mobile
networks, Computer Communication, Vol. 25, no.5, pp.464-477, March 2002.
[9] M.M.Dialo, S.Pierre, R.Beaubrun,A tabu search approach for assigning node Bs to switches in
UMTS networks, IEEE Transactions on Wireless Communication, VOL.9, no.4, pp.1350-1359,
April 2010.
[10] S.K. Sadhukhan, S. Mondal, S.R.Biswas,P.Bhaumik,D. Saha , Post-deployment tuning of UMTS
cellular networks through dual-homing of RNCs, Communication Systems and Networks and
Workshops, 2009. COMSNETS 2009, First International conference, pp.1-10Jan 2009.
[11] D. C. Cox, Personal Communications-A viewpoint, IEEE Commun. Mag., pp. 8-20, Nov. 1990.
[12] J.J.Marc,V.Nielen,UMTS:A third generation mobile system, Personal, Indoor and Mobile Radio
Communications, 1992. Proceedings, PIMRC '92, Third IEEE International Symposium, October
1992
[13] M.Stemm,R.H.Katz, vertical handoff in wireless overlay network, Mobile networks and
application,VOL.3.pp.335-350,1998
[14] B.Jaumard,S.Sebbah , Multi-level tabu search for 3G network dimensioning, in Proc. IEEE
warless communications and networking conf.2007 ,PP.4411-4416.Mar 2007.
[15] M.St-Hilaire,S.Chamberland, S.Pierre,A tabu search algoritham for the global planning problem
of third generation mobile network , Computers and Electrical Engin., Vol.34,PP.470-487,2008