Dynamic Routing Algorithm for Priority Guarantee in Low Duty-Cycled Wireless Sensor Networks

It is a new challenge to provide priority-based delivery in low duty-cycled sensor networks where there are not always-awake communication paths and the wireless links are very time-varying and unreliable. In this paper, we propose a Dynamic Routing Algorithm for priority Guarantee(called DRAG) in low duty-cycled sensor networks. Both schemes of dynamic forwarding decision making and priority-based schedule are used in DRAG to achieve priority guarantee in low duty-cycled sensor networks. We evaluate DRAG via extensive simulations and the results show that DRAG can achieve good performance in delivery ratio and network delay.