49
Politecnico di Milano Facoltà di Ingegneria dell’Informazione MRN – Exercises – part B Mobile Radio Networks Prof. Antonio Capone

MRN – Exercises – part B - Intranet DEIBhome.deib.polimi.it/capone/wn/MRN-EN-Exercises-B.pdf · MRN – Exercises – part B Mobile Radio Networks Prof. Antonio Capone . ... A

Embed Size (px)

Citation preview

Politecnico di Milano Facoltà di Ingegneria dell’Informazione

MRN – Exercises – part B

Mobile Radio Networks Prof. Antonio Capone

Exercise 1 o  Consider the following FAP. Find a solution using the

greedy algorithm.

A. Capone: Reti Radiomobili 2

{ } { }{ }

{ }

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

==

=

==

1000001001010101000000100000010101110010000110000001010100101000001010000000010000010110111010000011

3,...,11,1,1,1,1,1,1,1,1,1

ij

i

cC

FmM

Exercise 1 (sol)

A. Capone: Reti Radiomobili 3

{ }

3325243154

1000001001010101000000100000010101110010000110000001010100101000001010000000010000010110111010000011

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

==ijcC

Exercise 1 (sol)

A. Capone: Reti Radiomobili 4

{ }

3325243154

1000001001010101000000100000010101110010000110000001010100101000001010000000010000010110111010000011

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

==ijcC

Greedy sequence (2, 7, 1, 5, 4, 9, 10, 6, 8, 3)

No frequency assigned.

We start from the last 3

Exercise 1 (sol)

A. Capone: Reti Radiomobili 5

{ }

3325243154

1000001001010101000000100000010101110010000110000001010100101000001010000000010000010110111010000011

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

==ijcC

3 2 (2, 7, 1, 5, 4, 9, 10, 6, 8, 3)

Exercise 1 (sol)

A. Capone: Reti Radiomobili 6

{ }

3)0,2,0(3)0,1,1(3)0,1,0(2)1,0,0(3)0,1,0(1)1,1,0(2)1,0,0(3)0,0,0(3)0,0,0(2)1,0,0(

3325243154

1000001001010101000000100000010101110010000110000001010100101000001010000000010000010110111010000011

⇒⇒

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

== ijcC

3 2 2 3 2 1 3 3 3 3

(2, 7, 1, 5, 4, 9, 10, 6, 8, 3)

Exercise 2

A. Capone: Reti Radiomobili 7

o  Consider the following FAP. The set of frequencies is not defined. Find a minimum number of frequency solution using the greedy algorithm

{ } { }

{ }

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

==

==

2200200111220000020000200020100002010002200020120000010200010020102020120020020110100020211002010112

1,1,1,1,1,1,1,1,1,1

ij

i

cC

mM

Exercise 2 (sol)

A. Capone: Reti Radiomobili 8

{ }

1)0(5)0,1,2,2,2(4)0,0,1,1,2(4)0,0,1,2,1(5)1,2,2,3(1)0,01,1,0(1)1,2,1,0(3)0,1,1(3)0,1,1(2)0,1(

9655747878

2200200111220000020000200020100002010002200020120000010200010020102020120020020110100020211002010112

⇒⇒

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

==ijcC

Exercise 3 o  Consider a mobile radio network with Geometric DCA. The system has

6 channels and the compatibility matrix reported below. To the system, completely empty at the begging, a sequence of calls arrive according to the arrival order indicated in vector S (indices in S indicate the cell of call arrival). Assuming no call termination in the considered interval, indicate for each call if it is accepted and which channel is assigned (among available channels always select that with minimum index).

A. Capone: Reti Radiomobili 9

{ }

[ ]1,2,2,1,2,4,4,3,2,1,12201221001211012

=

⎥⎥⎥⎥

⎢⎢⎢⎢

==

S

cC ij

Exercise 3 (sol)

A. Capone: Reti Radiomobili 10

Cell 1

CELL 1 1 2 3 4 5 6

1 C1 C2 C8 2

2 C3 C7 C9 1

3 0

4 C5 C6 1

Exercise 3 (sol)

A. Capone: Reti Radiomobili 11

Cell 2

CELL 2 1 2 3 4 5 6

1 C1 C2 C8 1

2 C3 C7 C9 2

3 C4 1

4 0

Exercise 3 (sol)

A. Capone: Reti Radiomobili 12

Cell 3 CELLA3 1 2 3 4 5 6

1 0

2 C3 C7 C9 1

3 C4 2

4 C5 C6 2

Exercise 3 (sol)

A. Capone: Reti Radiomobili 13

Cell 4 CELLA4 1 2 3 4 5 6

1 C1 C2 C8 1

2 0

3 C4 2

4 C5 C6 2

Exercise 3 (sol)

A. Capone: Reti Radiomobili 14

Calls 10 and 11 are rejected

Exercise 4

A. Capone: Reti Radiomobili 15

o  Consider the following radio coverage problem with (8 candidate site and 15 test points) where vij=1 if test point j is covered by site i and 0 otherwise and cj is the cost of site j. Find an admissible solution the the greedy algorithm.

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

33112131

000000111110000000001000101011010000001001111110000001010000111110000001100111000000001000010110110000111100000000000011

CV

Exercise 4 (sol)

A. Capone: Reti Radiomobili 16

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

3/53/5642/743/83

33112131

000000111110000000001000101011010000001001111110000001010000111110000001100111000000001000010110110000111100000000000011

CV

Exercise 4 (sol)

A. Capone: Reti Radiomobili 17

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

3/43/2

22/423/41

33112131

000000110110000000001000100000000000000000000100000000010000101110000000000101000000000000000110110000000100000000000000

CV

Exercise 4 (sol)

A. Capone: Reti Radiomobili 18

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

3/43/2

22/423/41

33112131

000000110110000000001000100000000000000000000100000000010000101110000000000101000000000000000110110000000100000000000000

CV

Exercise 4 (sol)

A. Capone: Reti Radiomobili 19

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

3/43/2

12/2

3/40

33112131

000000110110000000001000100000000000000000000000000000010000000110000000000000000000000000000110110000000000000000000000

CV

Exercise 4 (sol)

A. Capone: Reti Radiomobili 20

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

3/43/2

12/2

3/40

33112131

000000110110000000001000100000000000000000000000000000010000000110000000000000000000000000000110110000000000000000000000

CV

Exercise 4 (sol)

A. Capone: Reti Radiomobili 21

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

3/23/2

10

0

33112131

000000000110000000001000100000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000000

CV

Exercise 4 (sol)

A. Capone: Reti Radiomobili 22

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

3/23/2

10

0

33112131

000000000110000000001000100000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000000

CV

Exercise 4 (sol)

A. Capone: Reti Radiomobili 23

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

3/13/2

0

0

33112131

000000000100000000001000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

CV

Exercise 4 (sol)

A. Capone: Reti Radiomobili 24

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

3/13/2

0

0

33112131

000000000100000000001000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

CV

Exercise 4 (sol)

A. Capone: Reti Radiomobili 25

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

0

0

0

33112131

000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

CV

 STOP

Exercise 5

o  Calculate uplink capacity (number of voice calls) of CDMA cellular system with processing gain of 200, and minimum Eb/No equal to 10 dB assuming: a)  Single cell and no silence suppression for voice coding b)  Voice activity factor 0.35 c)  Multi-cellular scenario with inter-cell interference

equal to 60% of intra-cell interference.

A. Capone: Reti Radiomobili 26

Exercise 5 (sol)

A. Capone: Reti Radiomobili 27

a) 

21102001

)(1

min0

max=+=+≅

NEGb

Exercise 5 (sol)

A. Capone: Reti Radiomobili 28

b) 

5810200

35.011

)(

11min

0

max ≅+=+≅

NEGb

p

fνη

Exercise 5 (sol)

A. Capone: Reti Radiomobili 29

c) 

( )35

10200

6.1*35.011

)(111

min0

max ≅+=+

+≅

NEG

f b

p

fνη

Exercise 6 o  Design the multiplexing scheme of a TDMA mobile radio system

similar to GSM. The system has radio carriers with a net rate of 320 Kb/s and it requires the following logical channels: n  Traffic channels TCH (uplink and downlink) with rate 35 Kb/s n  Associated control channels SACCH (uplink and downlink) with

rate 5 Kb/s n  Broadcast channel BCCH (only downlink) with rate 10 Kb/s n  Frequency channel FCCH (only downlink) with rate 2 Kb/s n  Synchronization channel SCH (only downlink) with rate 4 Kb/s n  Paging channel PCH (only downlink) with rate 14 Kb/s n  Access grant channel AGCH (only downlink) with rate 6 Kb/s n  Random access channel RACH (only uplink) with rate 38 Kb/s

o  On a carrier you have to multiplex 7 TCHs and their 7 SACCHs and one signaling channel for each of the types indicated above. Design the multiplexing scheme indicating the frame and multiframe structure for both uplink and downlink (solutions similar to GSM will get a higher score). .

A. Capone: Reti Radiomobili 30

Exercise 6 o  7 TCH+SACCH o  1 set o signaling channels o  Frame of 8 time slots => 320/8= 40 Kb/s per slot o  TCH + SACCH: multi-frame with 8 frames o  Signaling channels set: multi-frame with 20 frames

A. Capone: Reti Radiomobili 31

TCH1 TCH1 TCH1 TCH1 TCH1 TCH1 TCH1 SACCH 1

TCH7 TCH7 TCH7 TCH7 TCH7 TCH7 TCH7 SACCH 7

.

.

.

Slot 1

Slot 7

Slot 8 DL

B B B B B F S S P P P P P P P A A A - -

R R R R R R R R R R R R R R R R R R - -

Exercise 7 o a) Define an optimization model for the radio coverage

planning that has as objective the minimization of cell overlap (sum of base stations covering test points) and as constraint full coverage.

o b) Shows that the model is equivalent yo the classical set covering with proper costs.

o c) Define a variant of the model in which a frequency must be assigned to each station and the overlap is defined considering only pairs of stations with the same frequency that cover the same test points. If necessary linearize the model.

A. Capone: Reti Radiomobili 32

Exercise 7 (sol)

A. Capone: Reti Radiomobili 33

o  a)

min aij yjj∈S∑

i∈I∑

s.t.

aij yjj∈S∑ ≥1 ∀i ∈ I

yj ∈ 0,1{ } ∀j ∈ S

Exercise 7 (sol)

A. Capone: Reti Radiomobili 34

o  b)

aij yjj∈S∑ =

i∈I∑ yj aij

i∈I∑ = yjcj

j∈S∑

j∈S∑

cj = aiji∈I∑ = Sj

Exercise 7 (sol)

A. Capone: Reti Radiomobili 35

o  c) min aijaihyjf yhf

f∈F∑

j∈S∑

h∈S∑

s.t.

aij yjfj∈S∑

f∈F∑ ≥1 ∀i ∈ I

yjf ∈ 0,1{ } ∀j ∈ S, f ∈ F

Exercise 7 (sol)

A. Capone: Reti Radiomobili 36

o  b) continue Model can be linearized:

min aijaihz jhff∈F∑

j∈S∑

h∈S∑

s.t.yjf + yhf ≤1+ zjhf ∀i ∈ I, j ∈ S,h ∈ S

aij yjfj∈S∑

f∈F∑ ≥1 ∀i ∈ I

yjf ∈ 0,1{ } ∀j ∈ S, f ∈ F

Exercise 8

A. Capone: Reti Radiomobili 37

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

0001000100000011110111001010010001000011000101101000000010011010001000101010000001000100000000000010010000110001100000000001100011001100110010000000000101100010001000000000000100010000010000010001111010100010000000010100001110000010000010000011100111

V

Optimize coverage and plan frequencies of a mobile radio network with10 candidate sites an 25 test points based on the coverage matrix below. Assume equal installation costs. a)  Find a solution to coverage problem using the greedy algorithm (in case of equal cost use the site with lower index) b) Can you prove that the solution is optimal? c)  Assign frequencies using the greedy algorithm and minimizing the total number of frequencies. Define the compatibility matrix with cii=2 for all i, cij=1 for i≠j if i and j have a number of test points in common greater or equal 3, and cij=0 otherwise. The number of frequencies is equal to 2 for the first two stations and to 1 for all the others.

Solution 8

A. Capone: Reti Radiomobili 38

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

10883775888

0001000100000011110111001010010001000011000101101000000010011010001000101010000001000100000000000010010000110001100000000001100011001100110010000000000101100010001000000000000100010000010000010001111010100010000000010100001110000010000010000011100111

V

Solution 8

A. Capone: Reti Radiomobili 39

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

653544555

0000000000000000000000000010010001000010000100001000000010011010000000001000000001000100000000000010010000100001100000000001000001000100110000000000000100100010001000000000000100010000010000000000011010100010000000000000001100000010000010000001000110

V

Solution 8

A. Capone: Reti Radiomobili 40

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

52221343

0000000000000000000000000000000000000000000000000000000010011010000000001000000001000100000000000000000000100001100000000000000000000000110000000000000000000000001000000000000100000000010000000000010010100010000000000000001000000010000010000000000100

V

Solution 8

A. Capone: Reti Radiomobili 41

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

0110122

0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000000000100000000000000000000000000000000000000100000000000000000000000010100000000000000000000000000010000010000000000000

V

Solution 8

A. Capone: Reti Radiomobili 42

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

000012

0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000010100000000000000000000000000000000000000000000000

V

Solution 8

A. Capone: Reti Radiomobili 43

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢

=

00000

0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

V

{ } [ ]1110000011== jyY

Solution 8

A. Capone: Reti Radiomobili 44

[ ]

{ }

⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢

==

=

2111112000102101012110012

11122

ijcC

M

Solution 8

A. Capone: Reti Radiomobili 45

[ ]

{ }

⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢

==

=

211111120000102100101211100122100122

111211

ijcC

M

Solution 8

A. Capone: Reti Radiomobili 46

[ ]

{ }

⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢

==

=

2111111120000010211001012211101221110011221001122

1111111

ijcC

M

Solution 8

A. Capone: Reti Radiomobili 47

[ ]

{ }

⎥⎥⎥⎥⎥⎥⎥⎥⎥

⎢⎢⎢⎢⎢⎢⎢⎢⎢

==

=

2111111120000010211001012211101221110011221001122

2143164

ijcC

F

Exercise 9

A. Capone: Reti Radiomobili 48

o  Describe the location update mechanism of mobile radio networks;

o  Motivate why there is a tradeoff for the design of the size (number of cells) of location areas;

o  Derive a model for the optimization of location area size; o  Calculate optimal size for the case:

utente)per (traffico ser][calls/h/u 0.45

update)location di costo e paging costo tra(rapporto 0.1/utenti) (velocitàkm/h 8cella) della (lato m 300

=

==

=

=

λ

γ up CCVl

Exercise 9

A. Capone: Reti Radiomobili 49

V 8 km/h

l 0,3 km

π 3,14

u1 33,95 update/h/user

γ 0,1

λ 0,45

k

Δ 2 -16,84

Δ 3 -5,43

Δ 4 -2,51

Δ 5 -1,29

Δ 6 -0,64

Δ 7 -0,22

Δ 8 0,07