HAL Id: tel-02868490
https://tel.archives-ouvertes.fr/tel-02868490
Submitted on 15 Jun 2020
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Hyperfractals for wireless networks modelling
Dalia-Georgiana Popescu
To cite this version:
Dalia-Georgiana Popescu. Hyperfractals for wireless networks modelling. Networking and Internet
Architecture [cs.NI]. Sorbonne Université, 2018. English. �NNT : 2018SORUS264�. �tel-02868490�
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
mobile nodes relays
100 101 10
10 10 100
cumulated distance
density as function of cumulated distance cumulated distance F+1)
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
mH
mV x
x H
V
x
mV y x
mH
O O
15 20 25 30 35 40
0 2 4 6 8 10 12x 109
nr hops
energy
0 200 400 600 800 1000 0
0.5 1 1.5
2 x 10
5index nodes
lo a d
0 500 1000
0 2 4 6 8 x 10
4index nodes
lo a d
0.5 1 1.5 2 2.5
x 104 0.6
0.8 1 1.2 1.4 1.6 1.8 2 2.2 2.4x 104
Cartesian coordinate x
Cartesian coordinate y
Cologne network topology and coverage
Base stations locations Coverage
0.7 0.8 0.9 1 1.1 1.2 1.3 1.4 x 104 1.45
1.5 1.55 1.6 1.65 1.7
x 104
Cartesian coordiante x
Cartesian cordinate y
UE trajectory through the network
Base stations locations Coverage UE trajectory
1.4 1.45 1.5 1.55
x 104 1
1.1 1.2 1.3 1.4 1.5 1.6 1.7
x 104
Cartesian coordinate x
Cartesian coordinate y
UE trajectory through the network
Base stations locations Coverage
UE trajectory
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
mobile nodes relays
200 0 400 600 800 1000 1200 1400 1600 500
1000 1500
n
number of relays
computed, k
max=20
computed, k
max=40
computed, k
max=60
measured
10
010
110
10 10 10
0cumulated distance
density as function of cumulated distance
cumulated distance
F+1)10 10 10 100.1 100
cumulated distance
density as function of cumulated distance cumulated distance F+1)
100 101 10
10 100
cumulated distance
density as function of cumulated distance cumulated distance F+1)
10
010
10 10
010
1cumulated distance
density as function of cumulated distance
cumulated distance
F+1)200 400 600 800 1000 1200 1400 1600 0.9
0.91 0.92 0.93 0.94 0.95 0.96 0.97 0.98 0.99
Fraction of total nr of points in giant component
200 400 600 800 1000 1200 1400 1600
30 40 50 60 70 80 90 100 110
Number of points N nr points outside of the giant component N1/3
mH
mV x
x H
V
x
mV y x
mH
O O
15 20 25 30 35 40 0
2 4 6 8 10 12x 109
nr hops
energy
15 20 25 30 35 0.6
0.8 1 1.2 1.4 x 10
5k hops
m in im u m e n e rg y
10
1.310
1.410
410
510
6k hops
m in im u m e n e rg y
22 24 26 28 30 32
200 250 300 350 400
k hops
m in im u m e n e rg y
10
1.3710
1.4310
1.4910
2.410
2.5k hops
m in im u m e n e rg y
0 20 40 60 80
0.5 1 1.5 2 2.5
3 x 10
5k hops
m in im u m e n e rg y
10
1.310
1.810
410
510
6k hops
m in im u m e n e rg y
20 30 40 50 60 70 1
2 3 4 5 x 10
5k hops
m in im u m e n e rg y
10
1.510
1.610
1.710
5.110
5.310
5.5k hops
m in im u m e n e rg y
10 15 20 25 30 35 40
1 2 3 4 5 6x 107
k hops
minimum energy
101.1 101.3 101.5
107.1 107.3 107.5 107.7
k hops
minimum energy
102 106
108 1010
path length
path maximum energy
n=500 n=800
101 102
106 108 1010
path length
path maximum energy n=500
n=800
0 200 400 600 800 1000 0
0.5 1 1.5
2 x 10
5
index nodes
lo a d
0 500 1000
0 2 4 6 8 x 10
4index nodes
lo a d
400 5 600 800 1000 1200
10 15 20
nr points d
m=3,d
r=3 d
m=3, d
r=4.3
400 600 800 1000 1200
14 15 16 17 18 19
nr points
d el ay
d
m=3,d
r=3
d
m=3, d
r=4.3
400 600 800 1000 1200 10
12 14 16 18
nr points d
m=3,d
r=3 d
m=3, d
r=4.3
400 6 600 800 1000 1200
6.5 7 7.5 8 8.5
nr points
d el ay
d
m=3,d
r=3
d
m=3, d
r=4.3
0 2000 4000 6000 8000 0
1 2 3 4 5 6 7 8
n
average broadcast time
X inflexion point O(nh) O(n log n)
1.2 1.25 1.3 1.35 1.4
2.5 3 3.5
x 10
4time
nu m be r of n od es c on ta m in at ed
with teleportation
no teleportation
200 300 400 500 600 700 800 0
5 10 15 20 25 30 35 40 45 50
n delay (ms) direct route
upper bound in direct route lower bound in direct route
2000 300 400 500 600 700 800
10 20 30 40 50
n
delay (ms)
direct route
upper bound in direct route lower bound in direct
200 300 400 500 600 700 800
0 5 10 15 20 25 30 35 40 45 50
n
delay (ms)
direct route
upper bound in direct route lower bound in direct route
2000 300 400 500 600 700 800
5 10 15 20 25 30 35 40 45 50
n
delay (ms)
diverted route
upper bound in diverted route lower bound in diverted route
200 300 400 500 600 700 800
0 10 20 30 40 50
n
delay (ms)
diverted route upper bound in diverted lower bound in diverted
200 300 400 500 600 700 800
0 5 10 15 20 25 30 35 40 45 50
n
delay (ms)
diverted route
upper bound in diverted route lower bound in diverted route
2000 300 400 500 600 700 800 10
20 30 40 50
n
delay (ms)
direct route
upper bound in direct route lower bound in direct
2000 300 400 500 600 700 800
10 20 30 40 50
n
delay (ms)
diverted route upper bound in diverted lower bound in diverted
2000 300 400 500 600 700 800
5 10 15 20 25 30 35 40 45 50
n
delay (ms)
direct route
upper bound in direct route lower bound in direct route
200 300 400 500 600 700 800
0 5 10 15 20 25 30 35 40 45 50
n
delay (ms)
direct route
upper bound in direct route lower bound in direct route
200 300 400 500 600 700 800 0
10 20 30 40 50
n
delay
direct route
upper bound in direct route lower bound in direct
200 300 400 500 600 700 800
0 10 20 30 40 50
n
delay
diverted route upper bound in diverted lower bound in diverted
200 300 400 500 600 700 800
0 5 10 15 20 25 30 35 40 45 50
n
delay
direct route
upper bound in direct route lower bound in direct route
200 300 400 500 600 700 800
0 5 10 15 20 25 30 35 40 45 50
n
delay
direct route
upper bound in direct route lower bound in direct route
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
0 1000 2000 3000 4000 5000 0
10 20 30 40 50
n
br oa dc as t t im e
upper bound simulations lower bound
0 1000 2000 3000 4000 5000
0 5 10 15 20 25 30 35