-
Notifications
You must be signed in to change notification settings - Fork 35
/
mobility.py
771 lines (599 loc) · 28.4 KB
/
mobility.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
# coding: utf-8
#
# Copyright (C) 2008-2010 Istituto per l'Interscambio Scientifico I.S.I.
# You can contact us by email (isi@isi.it) or write to:
# ISI Foundation, Viale S. Severo 65, 10133 Torino, Italy.
#
# This program was written by André Panisson <panisson@gmail.com>
#
'''
Created on Jan 24, 2012
@author: André Panisson
@contact: panisson@gmail.com
@organization: ISI Foundation, Torino, Italy
'''
import numpy as np
from numpy.random import rand
# define a Uniform Distribution
U = lambda MIN, MAX, SAMPLES: rand(*SAMPLES.shape) * (MAX - MIN) + MIN
# define a Truncated Power Law Distribution
P = lambda ALPHA, MIN, MAX, SAMPLES: ((MAX ** (ALPHA+1.) - 1.) * rand(*SAMPLES.shape) + 1.) ** (1./(ALPHA+1.))
# define an Exponential Distribution
E = lambda SCALE, SAMPLES: -SCALE*np.log(rand(*SAMPLES.shape))
def random_waypoint(nr_nodes, dimensions, velocity=(0.1, 1.), wt_max=None):
'''
Random Waypoint model.
Required arguments:
*nr_nodes*:
Integer, the number of nodes.
*dimensions*:
Tuple of Integers, the x and y dimensions of the simulation area.
keyword arguments:
*velocity*:
Tuple of Integers, the minimum and maximum values for node velocity.
*wt_max*:
Integer, the maximum wait time for node pauses.
If wt_max is 0 or None, there is no pause time.
'''
MAX_X,MAX_Y = dimensions
MIN_V, MAX_V = velocity
NODES = np.arange(nr_nodes)
x = U(0, MAX_X, NODES)
y = U(0, MAX_Y, NODES)
x_waypoint = U(0, MAX_X, NODES)
y_waypoint = U(0, MAX_Y, NODES)
wt = np.zeros(nr_nodes)
velocity = U(MIN_V, MAX_V, NODES)
theta = np.arctan2(y_waypoint - y, x_waypoint - x)
costheta = np.cos(theta)
sintheta = np.sin(theta)
while True:
# update node position
x += velocity * costheta
y += velocity * sintheta
# calculate distance to waypoint
d = np.sqrt(np.square(y_waypoint-y) + np.square(x_waypoint-x))
# update info for arrived nodes
arrived = np.where(d<=velocity)[0]
if wt_max:
velocity[arrived] = 0.
wt[arrived] = U(0, wt_max, arrived)
# update info for paused nodes
wt[np.where(velocity==0.)[0]] -= 1.
# update info for moving nodes
arrived = np.where(np.logical_and(velocity==0., wt<0.))[0]
if arrived.size > 0:
x_waypoint[arrived] = U(0, MAX_X, arrived)
y_waypoint[arrived] = U(0, MAX_Y, arrived)
velocity[arrived] = U(MIN_V, MAX_V, arrived)
theta[arrived] = np.arctan2(y_waypoint[arrived] - y[arrived], x_waypoint[arrived] - x[arrived])
costheta[arrived] = np.cos(theta[arrived])
sintheta[arrived] = np.sin(theta[arrived])
yield np.dstack((x,y))[0]
class StochasticWalk(object):
def __init__(self, nr_nodes, dimensions, FL_DISTR, VELOCITY_DISTR, WT_DISTR=None, border_policy='reflect'):
'''
Base implementation for models with direction uniformly chosen from [0,pi]:
random_direction, random_walk, truncated_levy_walk
Required arguments:
*nr_nodes*:
Integer, the number of nodes.
*dimensions*:
Tuple of Integers, the x and y dimensions of the simulation area.
*FL_DISTR*:
A function that, given a set of samples,
returns another set with the same size of the input set.
This function should implement the distribution of flight lengths
to be used in the model.
*VELOCITY_DISTR*:
A function that, given a set of flight lengths,
returns another set with the same size of the input set.
This function should implement the distribution of velocities
to be used in the model, as random or as a function of the flight lengths.
keyword arguments:
*WT_DISTR*:
A function that, given a set of samples,
returns another set with the same size of the input set.
This function should implement the distribution of wait times
to be used in the node pause.
If WT_DISTR is 0 or None, there is no pause time.
*border_policy*:
String, either 'reflect' or 'wrap'. The policy that is used when the node arrives to the border.
If 'reflect', the node reflects off the border.
If 'wrap', the node reappears at the opposite edge (as in a torus-shaped area).
'''
self.collect_fl_stats = False
self.collect_wt_stats = False
self.border_policy = border_policy
self.dimensions = dimensions
self.nr_nodes = nr_nodes
self.FL_DISTR = FL_DISTR
self.VELOCITY_DISTR = VELOCITY_DISTR
self.WT_DISTR = WT_DISTR
def __iter__(self):
def reflect(xy):
# node bounces on the margins
b = np.where(xy[:,0]<0)[0]
if b.size > 0:
xy[b,0] = - xy[b,0]
cosintheta[b,0] = -cosintheta[b,0]
b = np.where(xy[:,0]>MAX_X)[0]
if b.size > 0:
xy[b,0] = 2*MAX_X - xy[b,0]
cosintheta[b,0] = -cosintheta[b,0]
b = np.where(xy[:,1]<0)[0]
if b.size > 0:
xy[b,1] = - xy[b,1]
cosintheta[b,1] = -cosintheta[b,1]
b = np.where(xy[:,1]>MAX_Y)[0]
if b.size > 0:
xy[b,1] = 2*MAX_Y - xy[b,1]
cosintheta[b,1] = -cosintheta[b,1]
def wrap(xy):
b = np.where(xy[:,0]<0)[0]
if b.size > 0: xy[b,0] += MAX_X
b = np.where(xy[:,0]>MAX_X)[0]
if b.size > 0: xy[b,0] -= MAX_X
b = np.where(xy[:,1]<0)[0]
if b.size > 0: xy[b,1] += MAX_Y
b = np.where(xy[:,1]>MAX_Y)[0]
if b.size > 0: xy[b,1] -= MAX_Y
if self.border_policy == 'reflect':
borderp = reflect
elif self.border_policy == 'wrap':
borderp = wrap
else:
borderp = self.border_policy
MAX_X, MAX_Y = self.dimensions
NODES = np.arange(self.nr_nodes)
xy = U(0, MAX_X, np.dstack((NODES,NODES))[0])
fl = self.FL_DISTR(NODES)
velocity = self.VELOCITY_DISTR(fl)
theta = U(0, 2*np.pi, NODES)
cosintheta = np.dstack((np.cos(theta), np.sin(theta)))[0] * np.dstack((velocity,velocity))[0]
wt = np.zeros(self.nr_nodes)
if self.collect_fl_stats: self.fl_stats = list(fl)
if self.collect_wt_stats: self.wt_stats = list(wt)
while True:
xy += cosintheta
fl -= velocity
# step back for nodes that surpassed fl
arrived = np.where(np.logical_and(velocity>0., fl<=0.))[0]
if arrived.size > 0:
diff = fl[arrived] / velocity[arrived]
xy[arrived] += np.dstack((diff,diff))[0] * cosintheta[arrived]
# apply border policy
borderp(xy)
if self.WT_DISTR:
velocity[arrived] = 0.
wt[arrived] = self.WT_DISTR(arrived)
if self.collect_wt_stats: self.wt_stats.extend(wt[arrived])
# update info for paused nodes
wt[np.where(velocity==0.)[0]] -= 1.
arrived = np.where(np.logical_and(velocity==0., wt<0.))[0]
# update info for moving nodes
if arrived.size > 0:
theta = U(0, 2*np.pi, arrived)
fl[arrived] = self.FL_DISTR(arrived)
if self.collect_fl_stats: self.fl_stats.extend(fl[arrived])
velocity[arrived] = self.VELOCITY_DISTR(fl[arrived])
v = velocity[arrived]
cosintheta[arrived] = np.dstack((v * np.cos(theta), v * np.sin(theta)))[0]
yield xy
class RandomWalk(StochasticWalk):
def __init__(self, nr_nodes, dimensions, velocity=1., distance=1., border_policy='reflect'):
'''
Random Walk mobility model.
This model is based in the Stochastic Walk, but both the flight length and node velocity distributions are in fact constants,
set to the *distance* and *velocity* parameters. The waiting time is set to None.
Required arguments:
*nr_nodes*:
Integer, the number of nodes.
*dimensions*:
Tuple of Integers, the x and y dimensions of the simulation area.
keyword arguments:
*velocity*:
Double, the value for the constant node velocity. Default is 1.0
*distance*:
Double, the value for the constant distance traveled in each step. Default is 1.0
*border_policy*:
String, either 'reflect' or 'wrap'. The policy that is used when the node arrives to the border.
If 'reflect', the node reflects off the border.
If 'wrap', the node reappears at the opposite edge (as in a torus-shaped area).
'''
if velocity>distance:
# In this implementation, each step is 1 second,
# it is not possible to have a velocity larger than the distance
raise Exception('Velocity must be <= Distance')
fl = np.zeros(nr_nodes)+distance
vel = np.zeros(nr_nodes)+velocity
FL_DISTR = lambda SAMPLES: np.array(fl[:len(SAMPLES)])
VELOCITY_DISTR = lambda FD: np.array(vel[:len(FD)])
StochasticWalk.__init__(self, nr_nodes, dimensions, FL_DISTR, VELOCITY_DISTR,border_policy=border_policy)
class RandomDirection(StochasticWalk):
def __init__(self, nr_nodes, dimensions, wt_max=None, velocity=(0.1, 1.), border_policy='reflect'):
'''
Random Direction mobility model.
This model is based in the Stochastic Walk. The flight length is chosen from a uniform distribution,
with minimum 0 and maximum set to the maximum dimension value.
The velocity is also chosen from a uniform distribution, with boundaries set by the *velocity* parameter.
If wt_max is set, the waiting time is chosen from a uniform distribution with values between 0 and wt_max.
If wt_max is not set, waiting time is set to None.
Required arguments:
*nr_nodes*:
Integer, the number of nodes.
*dimensions*:
Tuple of Integers, the x and y dimensions of the simulation area.
keyword arguments:
*wt_max*:
Double, maximum value for the waiting time distribution.
If wt_max is set, the waiting time is chosen from a uniform distribution with values between 0 and wt_max.
If wt_max is not set, the waiting time is set to None.
Default is None.
*velocity*:
Tuple of Doubles, the minimum and maximum values for node velocity.
*border_policy*:
String, either 'reflect' or 'wrap'. The policy that is used when the node arrives to the border.
If 'reflect', the node reflects off the border.
If 'wrap', the node reappears at the opposite edge (as in a torus-shaped area).
'''
MIN_V, MAX_V = velocity
FL_MAX = max(dimensions)
FL_DISTR = lambda SAMPLES: U(0, FL_MAX, SAMPLES)
if wt_max:
WT_DISTR = lambda SAMPLES: U(0, wt_max, SAMPLES)
else:
WT_DISTR = None
VELOCITY_DISTR = lambda FD: U(MIN_V, MAX_V, FD)
StochasticWalk.__init__(self, nr_nodes, dimensions, FL_DISTR, VELOCITY_DISTR, WT_DISTR=WT_DISTR, border_policy=border_policy)
class TruncatedLevyWalk(StochasticWalk):
def __init__(self, nr_nodes, dimensions, FL_EXP=-2.6, FL_MAX=50., WT_EXP=-1.8, WT_MAX=100., border_policy='reflect'):
'''
Truncated Levy Walk mobility model, based on the following paper:
Injong Rhee, Minsu Shin, Seongik Hong, Kyunghan Lee, and Song Chong. On the Levy-Walk Nature of Human Mobility.
In 2008 IEEE INFOCOM - Proceedings of the 27th Conference on Computer Communications, pages 924-932. April 2008.
The implementation is a special case of the more generic Stochastic Walk,
in which both the flight length and waiting time distributions are truncated power laws,
with exponents set to FL_EXP and WT_EXP and truncated at FL_MAX and WT_MAX.
The node velocity is a function of the flight length.
Required arguments:
*nr_nodes*:
Integer, the number of nodes.
*dimensions*:
Tuple of Integers, the x and y dimensions of the simulation area.
keyword arguments:
*FL_EXP*:
Double, the exponent of the flight length distribution. Default is -2.6
*FL_MAX*:
Double, the maximum value of the flight length distribution. Default is 50
*WT_EXP*:
Double, the exponent of the waiting time distribution. Default is -1.8
*WT_MAX*:
Double, the maximum value of the waiting time distribution. Default is 100
*border_policy*:
String, either 'reflect' or 'wrap'. The policy that is used when the node arrives to the border.
If 'reflect', the node reflects off the border.
If 'wrap', the node reappears at the opposite edge (as in a torus-shaped area).
'''
FL_DISTR = lambda SAMPLES: P(FL_EXP, 1., FL_MAX, SAMPLES)
if WT_EXP and WT_MAX:
WT_DISTR = lambda SAMPLES: P(WT_EXP, 1., WT_MAX, SAMPLES)
else:
WT_DISTR = None
VELOCITY_DISTR = lambda FD: np.sqrt(FD)/10.
StochasticWalk.__init__(self, nr_nodes, dimensions, FL_DISTR, VELOCITY_DISTR, WT_DISTR=WT_DISTR, border_policy=border_policy)
class HeterogeneousTruncatedLevyWalk(StochasticWalk):
def __init__(self, nr_nodes, dimensions, WT_EXP=-1.8, WT_MAX=100., FL_EXP=-2.6, FL_MAX=50., border_policy='reflect'):
'''
This is a variant of the Truncated Levy Walk mobility model.
This model is based in the Stochastic Walk.
The waiting time distribution is a truncated power law with exponent set to WT_EXP and truncated WT_MAX.
The flight length is a uniform distribution, different for each node. These uniform distributions are
created by taking both min and max values from a power law with exponent set to FL_EXP and truncated FL_MAX.
The node velocity is a function of the flight length.
Required arguments:
*nr_nodes*:
Integer, the number of nodes.
*dimensions*:
Tuple of Integers, the x and y dimensions of the simulation area.
keyword arguments:
*WT_EXP*:
Double, the exponent of the waiting time distribution. Default is -1.8
*WT_MAX*:
Double, the maximum value of the waiting time distribution. Default is 100
*FL_EXP*:
Double, the exponent of the flight length distribution. Default is -2.6
*FL_MAX*:
Double, the maximum value of the flight length distribution. Default is 50
*border_policy*:
String, either 'reflect' or 'wrap'. The policy that is used when the node arrives to the border.
If 'reflect', the node reflects off the border.
If 'wrap', the node reappears at the opposite edge (as in a torus-shaped area).
'''
NODES = np.arange(nr_nodes)
FL_MAX = P(-1.8, 10., FL_MAX, NODES)
FL_MIN = FL_MAX/10.
FL_DISTR = lambda SAMPLES: rand(len(SAMPLES)) * (FL_MAX[SAMPLES] - FL_MIN[SAMPLES]) + FL_MIN[SAMPLES]
WT_DISTR = lambda SAMPLES: P(WT_EXP, 1., WT_MAX, SAMPLES)
VELOCITY_DISTR = lambda FD: np.sqrt(FD)/10.
StochasticWalk.__init__(self, nr_nodes, dimensions, FL_DISTR, VELOCITY_DISTR, WT_DISTR=WT_DISTR, border_policy=border_policy)
def stochastic_walk(*args, **kwargs):
return iter(StochasticWalk(*args, **kwargs))
def random_walk(*args, **kwargs):
return iter(RandomWalk(*args, **kwargs))
def random_direction(*args, **kwargs):
return iter(RandomDirection(*args, **kwargs))
def truncated_levy_walk(*args, **kwargs):
return iter(TruncatedLevyWalk(*args, **kwargs))
def heterogeneous_truncated_levy_walk(*args, **kwargs):
return iter(HeterogeneousTruncatedLevyWalk(*args, **kwargs))
def gauss_markov(nr_nodes, dimensions, velocity_mean=1., alpha=1., variance=1.):
'''
Gauss-Markov Mobility Model, as proposed in
Camp, T., Boleng, J. & Davies, V. A survey of mobility models for ad hoc network research.
Wireless Communications and Mobile Computing 2, 483-502 (2002).
Required arguments:
*nr_nodes*:
Integer, the number of nodes.
*dimensions*:
Tuple of Integers, the x and y dimensions of the simulation area.
keyword arguments:
*velocity_mean*:
The mean velocity
*alpha*:
The tuning parameter used to vary the randomness
*variance*:
The randomness variance
'''
MAX_X, MAX_Y = dimensions
NODES = np.arange(nr_nodes)
x = U(0, MAX_X, NODES)
y = U(0, MAX_Y, NODES)
velocity = np.zeros(nr_nodes)+velocity_mean
theta = U(0, 2*np.pi, NODES)
angle_mean = theta
alpha2 = 1.0 - alpha
alpha3 = np.sqrt(1.0 - alpha * alpha) * variance
while True:
x = x + velocity * np.cos(theta)
y = y + velocity * np.sin(theta)
# node bounces on the margins
b = np.where(x<0)[0]
x[b] = - x[b]; theta[b] = np.pi-theta[b]; angle_mean[b] = np.pi-angle_mean[b]
b = np.where(x>MAX_X)[0]
x[b] = 2*MAX_X - x[b]; theta[b] = np.pi-theta[b]; angle_mean[b] = np.pi-angle_mean[b]
b = np.where(y<0)[0]
y[b] = - y[b]; theta[b] = -theta[b]; angle_mean[b] = -angle_mean[b]
b = np.where(y>MAX_Y)[0]
y[b] = 2*MAX_Y - y[b]; theta[b] = -theta[b]; angle_mean[b] = -angle_mean[b]
# calculate new speed and direction based on the model
velocity = (alpha * velocity +
alpha2 * velocity_mean +
alpha3 * np.random.normal(0.0, 1.0, nr_nodes))
theta = (alpha * theta +
alpha2 * angle_mean +
alpha3 * np.random.normal(0.0, 1.0, nr_nodes))
yield np.dstack((x,y))[0]
def reference_point_group(nr_nodes, dimensions, velocity=(0.1, 1.), aggregation=0.1):
'''
Reference Point Group Mobility model.
In this implementation, group trajectories follow a random direction model,
while nodes follow a random walk around the group center.
The parameter 'aggregation' controls how close the nodes are to the group center.
Required arguments:
*nr_nodes*:
list of integers, the number of nodes in each group.
*dimensions*:
Tuple of Integers, the x and y dimensions of the simulation area.
keyword arguments:
*velocity*:
Tuple of Doubles, the minimum and maximum values for group velocity.
*aggregation*:
Double, parameter (between 0 and 1) used to aggregate the nodes in the group.
Usually between 0 and 1, the more this value approximates to 1,
the nodes will be more aggregated and closer to the group center.
With a value of 0, the nodes are randomly distributed in the simulation area.
With a value of 1, the nodes are close to the group center.
'''
try:
iter(nr_nodes)
except TypeError:
nr_nodes = [nr_nodes]
NODES = np.arange(sum(nr_nodes))
groups = []
prev = 0
for (i,n) in enumerate(nr_nodes):
groups.append(np.arange(prev,n+prev))
prev += n
g_ref = np.empty(sum(nr_nodes), dtype=np.int)
for (i,g) in enumerate(groups):
for n in g:
g_ref[n] = i
FL_MAX = max(dimensions)
MIN_V,MAX_V = velocity
FL_DISTR = lambda SAMPLES: U(0, FL_MAX, SAMPLES)
VELOCITY_DISTR = lambda FD: U(MIN_V, MAX_V, FD)
MAX_X, MAX_Y = dimensions
x = U(0, MAX_X, NODES)
y = U(0, MAX_Y, NODES)
velocity = 1.
theta = U(0, 2*np.pi, NODES)
costheta = np.cos(theta)
sintheta = np.sin(theta)
GROUPS = np.arange(len(groups))
g_x = U(0, MAX_X, GROUPS)
g_y = U(0, MAX_X, GROUPS)
g_fl = FL_DISTR(GROUPS)
g_velocity = VELOCITY_DISTR(g_fl)
g_theta = U(0, 2*np.pi, GROUPS)
g_costheta = np.cos(g_theta)
g_sintheta = np.sin(g_theta)
while True:
x = x + velocity * costheta
y = y + velocity * sintheta
g_x = g_x + g_velocity * g_costheta
g_y = g_y + g_velocity * g_sintheta
for (i,g) in enumerate(groups):
# step to group direction + step to group center
x_g = x[g]
y_g = y[g]
c_theta = np.arctan2(g_y[i] - y_g, g_x[i] - x_g)
x[g] = x_g + g_velocity[i] * g_costheta[i] + aggregation*np.cos(c_theta)
y[g] = y_g + g_velocity[i] * g_sintheta[i] + aggregation*np.sin(c_theta)
# node and group bounces on the margins
b = np.where(x<0)[0]
if b.size > 0:
x[b] = - x[b]; costheta[b] = -costheta[b]
g_idx = np.unique(g_ref[b]); g_costheta[g_idx] = -g_costheta[g_idx]
b = np.where(x>MAX_X)[0]
if b.size > 0:
x[b] = 2*MAX_X - x[b]; costheta[b] = -costheta[b]
g_idx = np.unique(g_ref[b]); g_costheta[g_idx] = -g_costheta[g_idx]
b = np.where(y<0)[0]
if b.size > 0:
y[b] = - y[b]; sintheta[b] = -sintheta[b]
g_idx = np.unique(g_ref[b]); g_sintheta[g_idx] = -g_sintheta[g_idx]
b = np.where(y>MAX_Y)[0]
if b.size > 0:
y[b] = 2*MAX_Y - y[b]; sintheta[b] = -sintheta[b]
g_idx = np.unique(g_ref[b]); g_sintheta[g_idx] = -g_sintheta[g_idx]
# update info for nodes
theta = U(0, 2*np.pi, NODES)
costheta = np.cos(theta)
sintheta = np.sin(theta)
# update info for arrived groups
g_fl = g_fl - g_velocity
g_arrived = np.where(np.logical_and(g_velocity>0., g_fl<=0.))[0]
if g_arrived.size > 0:
g_theta = U(0, 2*np.pi, g_arrived)
g_costheta[g_arrived] = np.cos(g_theta)
g_sintheta[g_arrived] = np.sin(g_theta)
g_fl[g_arrived] = FL_DISTR(g_arrived)
g_velocity[g_arrived] = VELOCITY_DISTR(g_fl[g_arrived])
yield np.dstack((x,y))[0]
def tvc(nr_nodes, dimensions, velocity=(0.1, 1.), aggregation=[0.5,0.], epoch=[100,100]):
'''
Time-variant Community Mobility Model
This is a variant of the original definition, in the following way:
- Communities don't have a specific area, but a reference point where the
community members aggregate around.
- The community reference points are not static, but follow a random direction model.
- You can define a list of epoch stages, each value is the duration of the stage.
For each stage a different aggregation value is used (from the aggregation parameter).
- Aggregation values should be doubles between 0 and 1.
For aggregation 0, there's no attraction point and the nodes move in a random walk model.
For aggregation near 1, the nodes move closer to the community reference point.
Required arguments:
*nr_nodes*:
list of integers, the number of nodes in each group.
*dimensions*:
Tuple of Integers, the x and y dimensions of the simulation area.
keyword arguments:
*velocity*:
Tuple of Doubles, the minimum and maximum values for community velocities.
*aggregation*:
List of Doubles, parameters (between 0 and 1) used to aggregate the nodes around the community center.
Usually between 0 and 1, the more this value approximates to 1,
the nodes will be more aggregated and closer to the group center.
With aggregation 0, the nodes are randomly distributed in the simulation area.
With aggregation near 1, the nodes are closer to the group center.
*epoch*:
List of Integers, the number of steps each epoch stage lasts.
'''
if len(aggregation) != len(epoch):
raise Exception("The parameters 'aggregation' and 'epoch' should be of same size")
try:
iter(nr_nodes)
except TypeError:
nr_nodes = [nr_nodes]
NODES = np.arange(sum(nr_nodes))
epoch_total = sum(epoch)
def AGGREGATION(t):
acc = 0
for i in range(len(epoch)):
acc+=epoch[i]
if t%epoch_total <= acc: return aggregation[i]
raise Exception("Something wrong here")
groups = []
prev = 0
for (i,n) in enumerate(nr_nodes):
groups.append(np.arange(prev,n+prev))
prev += n
g_ref = np.empty(sum(nr_nodes), dtype=np.int)
for (i,g) in enumerate(groups):
for n in g:
g_ref[n] = i
FL_MAX = max(dimensions)
MIN_V,MAX_V = velocity
FL_DISTR = lambda SAMPLES: U(0, FL_MAX, SAMPLES)
VELOCITY_DISTR = lambda FD: U(MIN_V, MAX_V, FD)
def wrap(x,y):
b = np.where(x<0)[0]
if b.size > 0:
x[b] += MAX_X
b = np.where(x>MAX_X)[0]
if b.size > 0:
x[b] -= MAX_X
b = np.where(y<0)[0]
if b.size > 0:
y[b] += MAX_Y
b = np.where(y>MAX_Y)[0]
if b.size > 0:
y[b] -= MAX_Y
MAX_X, MAX_Y = dimensions
x = U(0, MAX_X, NODES)
y = U(0, MAX_Y, NODES)
velocity = 1.
theta = U(0, 2*np.pi, NODES)
costheta = np.cos(theta)
sintheta = np.sin(theta)
GROUPS = np.arange(len(groups))
g_x = U(0, MAX_X, GROUPS)
g_y = U(0, MAX_X, GROUPS)
g_fl = FL_DISTR(GROUPS)
g_velocity = VELOCITY_DISTR(g_fl)
g_theta = U(0, 2*np.pi, GROUPS)
g_costheta = np.cos(g_theta)
g_sintheta = np.sin(g_theta)
t = 0
while True:
t += 1
# get aggregation value for this step
aggr = AGGREGATION(t)
x = x + velocity * costheta
y = y + velocity * sintheta
# move reference point only if nodes have to go there
if aggr > 0:
g_x = g_x + g_velocity * g_costheta
g_y = g_y + g_velocity * g_sintheta
# group wrap around when outside the margins (torus shaped area)
wrap(g_x, g_y)
# update info for arrived groups
g_arrived = np.where(np.logical_and(g_velocity>0., g_fl<=0.))[0]
g_fl = g_fl - g_velocity
if g_arrived.size > 0:
g_theta = U(0, 2*np.pi, g_arrived)
g_costheta[g_arrived] = np.cos(g_theta)
g_sintheta[g_arrived] = np.sin(g_theta)
g_fl[g_arrived] = FL_DISTR(g_arrived)
g_velocity[g_arrived] = VELOCITY_DISTR(g_fl[g_arrived])
# update node position according to group center
for (i,g) in enumerate(groups):
# step to group direction + step to reference point
x_g = x[g]
y_g = y[g]
dy = g_y[i] - y_g
dx = g_x[i] - x_g
c_theta = np.arctan2(dy, dx)
# invert angle if wrapping around
invert = np.where((np.abs(dy)>MAX_Y/2)!=(np.abs(dx)>MAX_X/2))[0]
c_theta[invert] = c_theta[invert] + np.pi
x[g] = x_g + g_velocity[i] * g_costheta[i] + aggr*np.cos(c_theta)
y[g] = y_g + g_velocity[i] * g_sintheta[i] + aggr*np.sin(c_theta)
# node wrap around when outside the margins (torus shaped area)
wrap(x,y)
# update info for nodes
theta = U(0, 2*np.pi, NODES)
costheta = np.cos(theta)
sintheta = np.sin(theta)
yield np.dstack((x,y))[0]