Dynamic routing algorithm for priority guarantee in low duty-cycled wireless sensor networks

  • Authors:
  • Guodong Sun;Bin Xu

  • Affiliations:
  • Department of computer science, Tsinghua University, Beijing, China;Department of computer science, Tsinghua University, Beijing, China

  • Venue:
  • WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 dutycycled sensor networks. We evaluate DRAG via extensive simulations and the results show that DRAG can achieve good performance in delivery ratio and network delay.