-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathOppgave.toc
251 lines (251 loc) · 12.3 KB
/
Oppgave.toc
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
\boolfalse {citerequest}\boolfalse {citetracker}\boolfalse {pagetracker}\boolfalse {backtracker}\relax
\defcounter {refsection}{0}\relax
\select@language {UKenglish}
\defcounter {refsection}{0}\relax
\contentsline {chapter}{\numberline {1}Introduction}{1}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {1.1}Motivation}{3}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {1.2}Problem statement}{3}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {1.3}Method}{4}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {1.4}Outline}{4}
\defcounter {refsection}{0}\relax
\contentsline {chapter}{\numberline {2}Background}{6}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {2.1}Basic radio challenges}{6}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.1.1}Collisions in wireless technology}{6}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{The hidden terminal problem}{7}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {2.2}Network infrastructure}{7}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.2.1}Basic Service Set}{8}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.2.2}Extended Service Set}{8}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {2.3}MAC Layer}{9}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.3.1}Carrier Sense}{9}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.3.2}Collision Avoidance}{10}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.3.3}Distributed Coordination Function}{10}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {2.4}PHY Layer}{11}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.4.1}PLCP Protocol Data Unit}{11}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.4.2}Clear channel assessment}{12}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {2.5}Radio Frequency Interference}{12}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.5.1}Impact in 802.11}{13}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.5.2}Countermeasures}{13}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {2.6}Channels}{14}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {2.7}Relevant clustering methods}{14}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.7.1}Hierarchical Agglomerative Clustering}{14}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Distance metric}{15}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {2.7.2}K-means}{15}
\defcounter {refsection}{0}\relax
\contentsline {chapter}{\numberline {3}Related work}{17}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {3.1}Centralized Solutions}{17}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {3.1.1}Cisco RRM}{17}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{RF-Grouping}{17}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Dynamic Channel Assignment}{18}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {3.1.2}DenseAP}{18}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {3.1.3}HiveOS}{19}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {3.1.4}Comparison and assessment}{20}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {3.2}ResFi}{20}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Description}{20}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {3.3}Channel allocation using DSATUR}{21}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {3.4}Distributed clustering in ad-hoc networks}{22}
\defcounter {refsection}{0}\relax
\contentsline {chapter}{\numberline {4}Data acquisition and data structure}{24}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {4.1}Requirements and assumptions}{24}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Background}{24}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Assumptions}{25}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Requirements}{25}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {4.2}Program design}{26}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {4.2.1}Primary functionality}{26}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Signal strength calculation}{26}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Program result}{27}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {4.2.2}Data output and visual representation}{28}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {4.3}WiGLE as a data source}{28}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {4.3.1}Introduction to WiGLE}{29}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {4.3.2}Data quality}{30}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {4.3.3}REST API}{30}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Overview}{30}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Data gathering}{31}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{The Haversine Formula}{32}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {4.3.4}Data output}{34}
\defcounter {refsection}{0}\relax
\contentsline {chapter}{\numberline {5}Access point clustering}{35}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {5.1}Introduction}{35}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {5.2}Distributed group creation}{36}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.2.1}Benefits}{36}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.2.2}Challenges}{37}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {5.3}Clustering assumptions and requirements}{37}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.3.1}Clustering requirements}{38}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.3.2}Assumptions}{38}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {5.4}Program design}{39}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.4.1}Design choices}{39}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.4.2}Group framework}{39}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.4.3}Output file structure}{40}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {5.5}Cluster algorithm development}{40}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.5.1}Agglomerative clustering as a starting point}{40}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.5.2}K-Closest Neighbour Clustering}{42}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Description}{42}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.5.3}Simulations}{43}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.5.4}Observations}{43}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {5.6}K-means splitting}{46}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.6.1}Group splitting introduction}{46}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.6.2}K-means splitting}{46}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.6.3}Simulations}{48}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.6.4}Observations}{49}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {5.7}Minimum Cut Splitting}{50}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.7.1}Minimum cut}{50}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.7.2}Using minimum cut for group splitting}{51}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.7.3}Simulation}{53}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Observations}{53}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Minimum cut version 2}{55}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Simulations after re-evaluation}{56}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.7.4}Observations}{57}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {5.8}Assessment}{57}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.8.1}Result analysis}{58}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Davies-Bouldin Index}{58}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.8.2}Simulation weaknesses and data bias}{58}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Volatility}{58}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Signal strength reporting bias}{59}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Dimensionality and node location reporting bias}{60}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {5.8.3}Summary and discussion}{60}
\defcounter {refsection}{0}\relax
\contentsline {chapter}{\numberline {6}Node communication and group state synchronization}{62}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {6.1}Introduction}{62}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {6.2}Enabling technologies}{63}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {6.2.1}Distributed consensus with Raft}{63}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Why distributed consensus?}{63}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{What Raft can not help with}{63}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {6.2.2}Access point communication with ResFi}{64}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Implementation}{65}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {6.3}Component overview}{65}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {6.3.1}ResFi Overlay Network Application}{65}
\defcounter {refsection}{0}\relax
\contentsline {subsection}{\numberline {6.3.2}Protocol responsibilities}{66}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Deciding which nodes to merge with}{67}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Negotiating merges via message passing}{67}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Internal group messages}{68}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {6.4}Assessment}{68}
\defcounter {refsection}{0}\relax
\contentsline {chapter}{\numberline {7}Conclusion}{69}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {7.1}Summary}{69}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {7.2}Conclusion}{70}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {7.3}Future work}{71}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Protocol development}{71}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Security assessment}{71}
\defcounter {refsection}{0}\relax
\contentsline {subsubsection}{Clustering assessment}{71}
\defcounter {refsection}{0}\relax
\contentsline {chapter}{Appendices}{77}
\defcounter {refsection}{0}\relax
\contentsline {chapter}{\numberline {A}Simulated Group Topologies}{78}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {A.1}K-Nearest Neighbour Clustering}{78}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {A.2}K-means Split}{80}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {A.3}Original Minimum Cut Split}{82}
\defcounter {refsection}{0}\relax
\contentsline {section}{\numberline {A.4}Re-evaluated Minimum Cut Split}{84}