diff --git a/content.tex b/content.tex
index 5e18df9d..fbecdbbf 100644
--- a/content.tex
+++ b/content.tex
@@ -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
 
diff --git a/report.pdf b/report.pdf
index a5f8c3b1..0a844442 100644
Binary files a/report.pdf and b/report.pdf differ