Abstract

In low-duty-cycle wireless networks with unreliable and correlated links, Opportunistic Routing (OR) is extremely costly because of the unaligned working schedules of nodes within a common candidate forwarder set. In this work, we propose a novel polynomial-time node scheduling scheme considering link correlation for OR in low-duty-cycle wireless networks (LDC-COR), which significantly improves the performance by assigning nodes with low correlation to a common group and scheduling the nodes within this group to wake up simultaneously for forwarding packets in a common cycle. By taking account of both link correlation and link quality, the performance of the expected transmission count (ETX) is improved by adopting the LDC-COR protocol. As a result, the energy consumption of low-duty-cycle OR is significantly reduced. LDC-COR only requires the information of one-hop neighboring nodes which introduces minimal communication overhead. The proposed LDC-COR bridges the gap between the nodes’ limited energy resource and the application lifetime requirements. We evaluate the performance of LDC-COR with extensive simulations and a physical wireless testbed consisting of 20 TelosB nodes. The evaluation results show that both transmission efficiency and energy consumption of low-duty-cycle OR are significantly improved with only a slight increase of end-to-end delay.

Highlights

  • The greedy strategy in low-duty-cycle wireless networks (LDC-COR) is our proposed grouping method based on link correlation, whose detail we have introduced in Section 4.2, and its process is shown in of each group

  • We propose LDC-COR, a novel link-correlation-based node scheduling scheme for Opportunistic Routing (OR) in low-duty-cycle wireless networks that solves the problem caused by lowduty-cycle operations

  • One important characteristic distinguishes our work from previous work is that, in addition to link quality, we explore link correlation feature to increase the reception diversity of candidate forwarder set, and let nodes within the same group wake up simultaneously to forward the data packets

Read more

Summary

Introduction

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. In low-duty-cycle wireless networks, opportunistic routing (OR) has great potential to improve the network performance by providing each transmission multiple opportunities to make progress without need for more network capacity than traditional routing protocols [5,6] It exploits the broadcast diversity benefit of wireless networks by choosing a set of nodes as forwarders to transmit the data packets rather than identifying a single forwarder in advance. Existing work on OR in low-duty-cycle wireless networks ignores the impact of reception diversity among the forwarder set, the benefits of OR cannot be fully exploited. These studies explicitly or implicitly suppose that wireless links are independent of each other.

Related Work
Impact of Link Correlation on OR
Impact of Low-Duty-Cycle Network Model
Impact of Unaligned Working Schedules on OR in Low-Duty-Cycle Networks
Main Design
Collecting Link Information
Grouping Phase
Re-Scheduling Phase
Simulation
Simulation Setup
Impact of Link Quality
Impact of Network Size
Impact of Network Density
Impact of Different K
Testbed Experiments
Indoor Experiment
Island-Node Observation
Application Scenario
Computing Costs
Theoretically Optimal
Findings
Greedy Strategy in LDC-COR
Conclusions
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.