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.005a.svgz" name="5017319.fig.005a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>A degree-based shortest path tree</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/wcmc/volume-2018/5017319/figures/5017319.fig.005b.svgz" name="5017319.fig.005b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Communication graph along with latency-ahead of nodes</td></tr></table>

<div>Latency-ahead values calculation.</div>

Wireless Communications and Mobile Computing

fig5

Figure 5

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