By Topic

Residual Time Aware Forwarding for Randomly Duty-Cycled Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)

This paper studies data forwarding in wireless sensor networks (WSNs) where sensor nodes are randomly duty-cycled to save energy. The duty-cycling operation requires the data delivery strategy to be more adaptive for the dynamics caused by the uncertainty of node working schedules. However, the existing maximum-advance routing scheme, at each step the forwarding node selects the node closest to the destination as its next hop forwarder among neighbors, performs poorly in randomly duty-cycled WSNs.In this paper, we propose a new residual time aware (RTA) routing metric for randomly duty-cycled WSNs. RTA is designed to be responsive to the dynamics caused by duty-cycling operation. We also present a residual time aware forwarding (RTAF) strategy using this metric for randomly duty-cycled WSNs. Simulation results demonstrate that our proposed RTAF strategy reduces the retransmissions and delivery delay introduced by the duty-cycling operation. Therefore, it is shown that RTAF increases the data delivery ratio and average advance per hop, and significantly reduces the end-to-end delivery latency.

Published in:

Computational Science and Engineering, 2009. CSE '09. International Conference on  (Volume:2 )

Date of Conference:

29-31 Aug. 2009