Critical-Path Aware Scheduling for Latency Efficient Broadcast in Duty-Cycled Wireless Sensor Networks

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/wcmc/volume-2018/5017319/figures/5017319.fig.003a.svgz" name="5017319.fig.003a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>A shortest path tree. A solid link indicates an edge in the tree</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/wcmc/volume-2018/5017319/figures/5017319.fig.003b.svgz" name="5017319.fig.003b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Communication graph along with levels of nodes</td></tr></table>

<div>Level distribution in duty-cycled WSNs.</div>

Wireless Communications and Mobile Computing

fig3

Figure 3

Figure 3: Critical-Path Aware Scheduling for Latency Efficient Broadcast in Duty-Cycled Wireless Sensor Networks 