Abstract
Wireless sensor networks are composed of low-energy, small-size, and low-range unattended sensor nodes. Recently, it has been observed that by periodically turning on and off the sensing and communication capabilities of sensor nodes, we can significantly reduce the active time and thus prolong network lifetime. However, this duty cycling may result in high network latency, routing overhead, and neighbor discovery delays due to asynchronous sleep and wake-up scheduling. These limitations call for a countermeasure for duty-cycled wireless sensor networks which should minimize routing information, routing traffic load, and energy consumption. In this article, we propose a lightweight non-increasing delivery-latency interval routing referred as LNDIR. This scheme can discover minimum latency routes at each non-increasing delivery-latency interval instead of each time slot. Simulation experiments demonstrated the validity of this novel approach in minimizing routing information stored at each sensor. Furthermore, this novel routing can also guarantee the minimum delivery latency from each source to the sink. Performance improvements of up to 12-fold and 11-fold are observed in terms of routing traffic load reduction and energy efficiency, respectively, as compared to existing schemes.
Highlights
Wireless sensor networks (WSNs) are composed of a large number of unattended sensor nodes
We propose an non-increasing delivery-latency interval (NDI)-based routing scheme that finds minimum latency routes from sensors to the sink at each NDI instead of at each time slot, guaranteeing minimum delivery-latency routes
We introduce the concept of a NDI: a non-extendable interval of time inside the working interval of a node in which delivery latency decreases steadily or remains the same
Summary
Wireless sensor networks (WSNs) are composed of a large number of unattended sensor nodes. Most of the previous work focused on finding optimal routes at each time slot in a duty cycle, eventually resulting in high routing overhead, especially when the number of time slots is huge. This motivates us to present a new scheme to overcome these challenges. We propose an NDI-based routing scheme that finds minimum latency routes from sensors to the sink at each NDI instead of at each time slot, guaranteeing minimum delivery-latency routes This scheme is lightweight due to small routing tables on sensor nodes, reduced traffic overheads, decreased delays, and energy efficiency. Conclusions and future directions are outlined at the end of this article
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
