Sei sulla pagina 1di 24

Cellular Concept Part II

Prepared by Assoc. Prof. Dr. Jafri B Din WCC FKE UT

Trunking and Grade of Service

Trunking : to accommodate a large number of users in a limited radio spectrum

! allo"s a large # of users to s$are t$e relati%el& small # of c$s in a cell b& pro%iding access to eac$ user' on demand' from a pool of a%ailable c$s ! eac$ user is allocated a c$annel on a per call basis' and upon termination of t$e call' t$e pre%iousl& occupied c$annel is immediatel& returned to t$e pool of a%ailable c$s
SET 5514 (2006) 2

Trunking and Grade of Service

SET 5514 (2006)

T$e )rade of Ser%ice ()*S)


!

+s a measure of t$e abilit& of a user to access a trunked s&stem during t$e busiest $our T$e bus& $our is based upon customer demand at t$e busiest $our during a "eek' mont$' or &ear +t is t$e "ireless engineer,s -ob to estimate t$e ma.imum re/uired capacit& and to allocate t$e proper # of c$s in order to meet t$e )*S )*S is t&picall& gi%en as t$e likeli$ood t$at a call is blocked' or t$e likeli$ood of a call e.periencing a dela& greater t$an a certain /ueuing time
SET 5514 (2006) 4

The traffic intensity offered by each user is equal to the call request rate multiplied by the holding time. Each user generates a traffic intensity of Au Erlangs

Au = H

Where

H : average duration of a call : average number of a call request per unit time for each user

For a system containing U users and an unspesified # of chs, the total offered traffic intensity, A

A = U Au

n a ! channel trun"ed system, the traffic intensity per channel, Ac Ac # U Au C


SET 5514 (2006) 5

$%& of ' ( :
the channel allocations for cell sites are designed so that ' out of )** calls +ill be bloc"ed due to channel occupancy during the busiest hour.

T+o types of trun"ed systems:


, -o queuing for call requests ./loc"ed !all !leared0 .Erlang /0 , 1ueuing is provided to hold calls +hich are bloc"ed ./loc"ed !alls 2elayed0 .Erlang !0
SET 5514 (2006) 6

Erlang /

-o queuing for call request. f no ch are available, the requesting user is bloc"ed +ithout access and is free to try again later. t assumes that calls arrive as determined by a 3oisson distribution, and there are an infinite # of users, also , There are memoryless arrivals of requests . all users, including bloc"ed users, may request a channel at any time0 , The probability of a user occupying a channel is e4ponentially distributed .longer calls are less li"ely to occur as described by an e4ponential distribution0 , There are finite # of channels available in the trun"ing pool.
SET 5514 (2006) 0

Erlang B Trunking GOS

SET 5514 (2006)

E4ample 5: 6o+ many users can be supported for *.7( bloc"ing probability for the follo+ing number of trun"ed channels in a bloc"ed calls cleared system8 a0 7 b0 )* c0 '* d0 )** Assume each user generates *.) Erlangs of traffic. 9*.) Erlang : # ' calls per hour : 6 # av of 5 minutes each call Au # ';<* = 5 # *.) Erlangs.> &olution a0 ! # 7, $%& # *.7 (, Au # *.) : From graph, A # ).)5 ? # A;Au # ).)5;*.) @ )) users b0 ! # )*, $%& # *.7 (, Au # *.) : From graph, A # 5.AB ? # A;Au # 5.AB;*.) @ C* users c0 ? # A;Au # )5;*.) @ )5* users d0 ? # A;Au # B7;*.) @ B7* users
SET 5514 (2006) 2

Erlang B

SET 5514 (2006)

10

Erlang C

1ueue is provided to hold calls +hich are bloc"ed f a ch is not available immediately, the call request may be delayed until a ch becomes available. $%& is defined as the probability that a call is bloc"ed after +aiting a specific length of time in queue. The li"elihood of a call not having immediate access to a ch is determined by the Erlang !.

SET 5514 (2006)

11

Erlang C

SET 5514 (2006)

12

E4ample C
An urban area has a population of t+o million residents. Three competing trun"ed mobile net+or"s .&ystems A, / and !0 provide cellular services in this area. &ystem A has 5AC cells +ith )A channels each, &ystem / has AB cells +ith 7D channels each, and system ! has CA cells, each +ith )** channels. i0 Find the number of users that can be supported at '( bloc"ing if each user averages t+o calls per hour at an average call duration of three minutes. ii0 Assuming that all three trun"ed systems are operated at ma4imum capacity, compute the percentage mar"et penetration of each cellular provider.

SET 5514 (2006)

1(

&olution
&ystem A i0 3robability of bloc"ing # '( # *.*' # of !hannels, C # )A Traffic ntensity per user, Au = H = ';<* 4 5 = *.) Erlangs From the graph, for $%& # *.*', ! # )A, get A # )' Erlangs Total # of users per cell, U # A/Au # )';*.) # )'* Total # of subscribers # )'* 4 5AC cells # CD,'B*. &ystem / i0 3robability of bloc"ing # '( # *.*' # of !hannels, C # 7D Traffic ntensity per user, Au = H = ';<* 4 5 = *.) Erlangs From the graph, for $%& # *.*', ! # 7D, get A # C7 Erlangs Total # of users per cell, U = A/Au # C7;*.) # C7* Total # of subscribers # C7* 4 AB cells # CC,)**. SET 5514 (2006)
14

&ystem ! i0 3robability of bloc"ing # '( # *.*' # of !hannels, ! # )** Traffic ntensity per user, Au = H = ';<* 4 5 = *.) Erlangs From the graph, for $%& # *.*', C # )**, get A # BB Erlangs Total # of users per cell, U = A/Au # BB;*.) # BB* Total # of subscribers # BB* 4 CA cells # C5,)'*. ii0 Total cellular subscribers # CD,'B* E CC,)** E C5,)'* # )5C,7**. Total population # ',***,*** Therefore ( mar"et penetration for : &ystem A : CD,'B*;',***,*** # '.5<C ( &ystem / : CC,)**;',***,*** # '.'*7 ( &ystem ! : C5,)'*;',***,*** # '.)7< ( Total mar"et penetration # <.D'7 ( 15 SET 5514 (2006)

E4ample 7
A certain city has an area of ),5** square miles and is covered by a cellular system using a sevenFcell reuse pattern. Each cell has a radius of four miles and the city is allocated C* G6H of spectrum +ith a full duple4 channel band+idth of <*"6H. Assume a $%& of '( for an Erlang / system is specified. f the offered traffic per user is *.*5 Erlangs, compute a0 The number of cells in the service area b0 The number of channels per cell c0 Traffic intensity of each cell d0 The ma4imum carried traffic e0 The total number of users that can be served for '( $%& f0 The number of mobiles per unique channel g0 The teoretical ma4 # of users could be served at one time
SET 5514 (2006) 16

SET 5514 (2006)

10

&olution
Area # ),5** miles' $%& # ' ( Au # *.*5 Erlangs -#D /W # C* G6H I # C miles /Wch # <* "6H

a0 # of cell # ),5**;.'.7AB)=C'0 # 5).'D cells # 5) cells. b0 # of ch per cell # /W ; ./Wch = D0 # C* 4 )*< ; <* 4 )*5 = D # A7.'5B # A7 channels;cell c0 From graph : ! # A7, $%& # *.*', A # B7 Erlangs d0 Ga4 carried traffic # # of cell = A # 5) = B7 # '<57 Erlangs e0 Au # *.*5 E, Ama4 # '<57 E : From A # ? Au ? # A ; Au # '<57 ; *.*5 # BD,B55 users.
SET 5514 (2006)

11

Cellular Concept (Handover)


1 6 5 7 4
Handover allows established calls to continue by switching them to another radio resource.
SET 5514 (2006) 12

2 3

Cellular concept (Cluster)

etwork ca!acity can be increased by reusing the fre"uencies.


SET 5514 (2006) 20

Cellular concept (Macrocell)


$%km.

#acrocells are used for remote or s!arsely !o!ulated. The cells ty!ically have a radius of $%&'(km.
SET 5514 (2006) 21

f0 # of mobiles per ch # # of users ; # of ch # BD,B55;.C* 4 )*<;<* 4 )*50 #BD,B55;<<< # )5' mobiles per ch g0 Ga4 # of user .theoretical0 # # of the available ch in the system . all channels occupied0 # ! = -c # A7 = 5) # ',AC7 users . 5.C ( of the customer base 0

SET 5514 (2006)

22

)ui* $
i0 &ho+ that &; .coFchannel interference0 for a mobile may be e4pressed as

S . 5N 0 = I io
Where

n : propogation po+er la+ - : number of cell per cluster io : number of coFchannel interfering cells

ii0 &tate ' assumptions to be made for the above e4pressions.


SET 5514 (2006) 2(

E4ercise ' f a signalFtoFinterference ratio of )7 d/ is required for satisfactory for a cellular system, +hat is the frequency reuse factor and cluster siHe that should be used for ma4imum capacity if the path loss e4ponent is .a0 n#C, .b0 n # 58 Assume that there are si4 coFchannel cell in the first tier, and all of them are at the same distance from the mobile. ?se suitable appro4imations.

SET 5514 (2006)

24

Potrebbero piacerti anche