Dynamic Clustering Algorithm for Tracking Targets with High and Variable Celerity (ATHVC)

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/jcnc/volume-2016/7631548/figures/7631548.fig.009a.svgz" name="7631548.fig.009a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Target speed 10 m/s with 1000 nodes</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/jcnc/volume-2016/7631548/figures/7631548.fig.009b.svgz" name="7631548.fig.009b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Target speed 30 m/s with 2000 nodes</td></tr></table>

<div>The number of clusters based on the simulation time.</div>

Journal of Computer Networks and Communications

fig9

Figure 9

Figure 9: Dynamic Clustering Algorithm for Tracking Targets with High and Variable Celerity (ATHVC) 