vbrandl/masterthesis
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

New content

Browse Source
This commit is contained in:
Valentin Brandl 2021-11-30 20:03:29 +01:00
parent 0f105288b0
commit 772191c436
2 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
content.tex
View File

@ -153,7 +153,7 @@ In the current implementation, each sensor will itself visit and monitor each ne
The idea for this work is to report newfound nodes back to the \ac{bms} backend first, where the graph of the known network is created and a sensor is selected, so that the specific ranking algorithm doesn't calculate to a suspiciously high or low value.
That sensor will be responsible to monitor the new node.
If it is not possible, to select a specific sensor so that the monitoring activity stays inconspicuous, the coordinator can do a complete shuffle of all nodes between the sensors to restore the wanted graph properties or produce a warning that another sensor might be required to stay under the radar.
If it is not possible, to select a specific sensor so that the monitoring activity stays inconspicuous, the coordinator can do a complete shuffle of all nodes between the sensors to restore the wanted graph properties or warn if more sensors are required to stay undetected.
%}}} methodology

BIN
report.pdf
View File

Binary file not shown.