For opportunistic routing in independent duty-cycled wireless sensor networks (WSNs), a sender dynamically determines a relay candidate set depending on the real-time network conditions. Due to independent and varying duty cycle length, the sender may handle different waking-up orders of the potential forwarders when it tries to forward data packets at different time instants. Conventional opportunistic routing protocols overlook the time-varying property of the waking-up order of the candidate nodes. In this paper, we theoretically analyze how to obtain an optimal candidate set for each node in order to minimize the end-to-end latency. Then, considering the realistic scenarios, we propose an opportunistic routing which jointly considers global and localized optimizations. Based on the relatively stable topology and duty-cycle length information, an original candidate set is constructed. Then, by considering the real-time link and duty cycle information in the local context, a further optimization for the original candidate set can be achieved. Simulation results show that our proposed schemes can significantly improve the end-to-end latency compared with the benchmarks.

中文翻译：

---

具有独立占空比的异步无线传感器网络中的最短延迟机会路由

对于独立占空比无线传感器网络 (WSN) 中的机会路由，发送方根据实时网络条件动态确定中继候选集。由于独立且变化的占空比长度，发送方在尝试在不同时刻转发数据包时可能会处理潜在转发器的不同唤醒命令。传统的机会路由协议忽略了候选节点唤醒顺序的时变特性。在本文中，我们从理论上分析了如何为每个节点获取最优候选集以最小化端到端延迟。然后，考虑到现实情况，我们提出了一种机会主义路由，它联合考虑了全局和局部优化。基于相对稳定的拓扑和占空比长度信息，构建原始候选集。然后，通过考虑本地上下文中的实时链路和占空比信息，可以实现对原始候选集的进一步优化。仿真结果表明，与基准相比，我们提出的方案可以显着改善端到端延迟。