InAreaRoamingTransitionStrategy.java 5.46 KB
Newer Older
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
/*
 * Copyright (c) 2005-2010 KOM – Multimedia Communications Lab
 *
 * This file is part of PeerfactSim.KOM.
 * 
 * PeerfactSim.KOM is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * any later version.
 * 
 * PeerfactSim.KOM is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with PeerfactSim.KOM.  If not, see <http://www.gnu.org/licenses/>.
 *
 */

package de.tud.kom.p2psim.impl.topology.movement.modularosm.transition;

import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import de.tud.kom.p2psim.api.topology.movement.SimLocationActuator;
28
import de.tud.kom.p2psim.impl.topology.movement.modularosm.ModularMovementModel;
29
import de.tud.kom.p2psim.impl.topology.movement.modularosm.attraction.IAttractionGenerator;
30
31
import de.tudarmstadt.maki.simonstrator.api.Event;
import de.tudarmstadt.maki.simonstrator.api.EventHandler;
32
import de.tudarmstadt.maki.simonstrator.api.Time;
33
34
import de.tudarmstadt.maki.simonstrator.api.component.sensor.location.AttractionPoint;

35
36
37
38
39
40
41
/**
 * With this transition strategy, nodes are roaming around {@link AttractionPoint}s that have a radius. As the {@link ModularMovementModel} 
 * uses a Gauss function to add jitter and offsets to the movement, some nodes may also roam outside of the circle's radius (this is intended to make it more realistic)
 * 
 * @author Julian Zobel
 * @version 1.0, 24.01.2019
 */
42
43
44
public class InAreaRoamingTransitionStrategy extends AbstractAttractionBasedTransitionStrategy implements EventHandler {

	public static enum roamingTransitionState {
45
		PAUSE,
46
47
		ROAMING,
		TRANSITION
48
	}	
49
50
51
	
	protected Map<SimLocationActuator, roamingTransitionState> roamingStates = new LinkedHashMap<>();
	
52
53
	protected final static int EVENT_ROAMING_PAUSE_ENDED = 2;
	
54
55
56
	@Override
	public void addComponent(SimLocationActuator comp) {
		this.roamingStates.put(comp, roamingTransitionState.TRANSITION);
Julian Zobel's avatar
Julian Zobel committed
57
		AttractionPoint nextAP = pickNewAttractionPoint(comp);
58
59
60
61
62
63
		updateTargetAttractionPoint(comp, nextAP);
	}

	@Override
	public void reachedAttractionPoint(SimLocationActuator comp) {
		
64
65
66
67
68
		if(roamingStates.get(comp) == roamingTransitionState.PAUSE) {
			return;
		}
		
		// start roaming if the AP was reached 
69
		if(roamingStates.get(comp) == roamingTransitionState.TRANSITION) {			
70
71
			// schedule the end of the roaming phase, which will make a new transition			
			Event.scheduleWithDelay(gaussianDistributionPauseTime(pauseTimeMax-pauseTimeMin, 0.5*(pauseTimeMax-pauseTimeMin)), this, comp, EVENT_PAUSE_ENDED);		
72
73
		}
		
74
75
		this.roamingStates.put(comp, roamingTransitionState.PAUSE);
		// schedule roaming
76
		Event.scheduleWithDelay(gaussianDistributionPauseTime(Time.MINUTE * 1, Time.MINUTE), this, comp, EVENT_ROAMING_PAUSE_ENDED);	
77
			
78
79
	}	
	
80
81
82
83
84
85
86
87
88
89
90
91
92
	/**
	 * Use a gaussian distribution for the pause time interval generation, using a mean value and a standard deviation
	 * 
	 * @return
	 */
	private long gaussianDistributionPauseTime(double mean, double std) {		
		double x = rnd.nextGaussian() * std + mean;			
	
		if(x <= 0) return gaussianDistributionPauseTime(mean, std*0.9);		
		return (long) x;
		
	}
	
93
	private void roamAroundAttractionPoint(SimLocationActuator comp) {
94
		if(roamingStates.get(comp) != roamingTransitionState.TRANSITION) {
95
96
97
98
99
100
101
102
			AttractionPoint currentAttractionPoint = this.assignments.get(comp);
			
			if(currentAttractionPoint == null) {
				System.err.println("AP roaming failed: no AP");
			}
			
			if(currentAttractionPoint.getRadius() > 0) 
			{
103
				this.roamingStates.put(comp, roamingTransitionState.ROAMING);				
104
105
106
107
108
109
110
				notifyListenersOfAssignmentUpdate(comp, currentAttractionPoint);
			}
		}		
	}
	
	@Override
	public void eventOccurred(Object content, int type) {
111
112
113
		if(type == EVENT_PAUSE_ENDED) {		
			SimLocationActuator comp = (SimLocationActuator) content;
			
114
115
			// if the transit was triggered beforehand (e.g., attraction point moved), then do nothing.
			if(roamingStates.get(comp) != roamingTransitionState.TRANSITION) {				
116
117
				this.addComponent(comp);
			}
118
119
		}		
		else if(type == EVENT_ROAMING_PAUSE_ENDED) {
120
			
121
			SimLocationActuator comp = (SimLocationActuator) content;			
122
123
			AttractionPoint currentAttractionPoint = this.assignments.get(comp);
			
124
			// if the attraction point was removed in the meantime, go directly to transit state
125
			if(currentAttractionPoint == null || !IAttractionGenerator.attractionPoints.contains(currentAttractionPoint)) {				
126
127
128
129
130
				this.addComponent(comp);
			}
			else {			
				this.roamAroundAttractionPoint(comp);
			}
131
		}
132
133
134
	}	
	
	
Julian Zobel's avatar
Julian Zobel committed
135
	private AttractionPoint pickNewAttractionPoint(SimLocationActuator component) {		
136
		double score = rnd.nextDouble();		
137
		List<AttractionPoint> candidates = new LinkedList<>();
138
		for (AttractionPoint ap : IAttractionGenerator.attractionPoints) {
139
140
141
142
143
			
			if(ap == null) {
				continue;
			}
			
144
145
146
147
148
149
			if (ap.getWeight() >= score) {
				if(lastAssignments.get(component) == null || !ap.equals(lastAssignments.get(component))) {
					candidates.add(ap);
				}				
			}
		}
150
		
151
		if (candidates.isEmpty()) {
152
			candidates.addAll(IAttractionGenerator.attractionPoints);
153
		}
154
		
155
		AttractionPoint assignment = candidates.get(rnd.nextInt(candidates.size()));		
156
		return assignment;		
157
	}	
158
  
159
}