In this work, we introduce the concept of Dynamic Switch-based Forwarding (DSF) that optimizes the (i) expected data delivery ratio, (ii) expected communication delay, or (iii) expected energy consumption for low-duty-cycle wireless sensor networks under unreliable communication links. DSF

Abstract—In low duty-cycle sensor networks, sensors sleep most of their time; it is consequently hard for sensors to maintain always-awake communication links. One major challenge is therefore to design communication algorithms to reduce the delivery delay. In this paper we propose and evaluate a

We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to loss in connectivity can become a critical problem, and how to achieve delay-optimality is non-trivial. For instance

Opportunistic routing is widely known to have substantially better performance than unicast routing in wireless networks with lossy links. However, wireless sensor networks are usually duty cycled, that is, they frequently enter sleep states to ensure long network lifetime. This renders existing

Opportunistic routing is widely known to have substantially better performance than unicast routing in wireless networks with lossy links. However, wireless sensor networks are usually duty cycled, that is, they frequently enter sleep states to ensure long network lifetime. This renders existing

Abstract—In this paper, we propose three variants of WSN routing protocol: i) basic-opportunistic, ii) opportunistic with delay and iii) opportunistic with backtracking. The main idea is that a node transmits its packet to the next awake node as long as this decreases the remaining distance to the sink. The two last variants allow a packet to be discarded or moved further away from the sink if necessary. The performance evaluation is carried out by simulations and with analytical model based on a Poisson rain model. The comparison is based i) probability of packet delivery, ii) end-toend packet delay and iii) number of hops between the source and the sink node.

Abstract—Flooding in low-duty-cycle wireless sensor networks is very costly due to asynchronous schedules of sensor nodes. To adapt existing flooding-tree-based designs for low-duty-cycle networks, we shall schedule nodes of common parents wake up simultaneously. Traditionally, energy optimality

Abstract—For low-duty-cycle wireless sensor networks, mul-tihop broadcasting is a challenging problem, since every node has its own working schedules. In this paper, we design a novel broadcasting algorithm, of which key idea is to let some early wake-up nodes postpone their wake-up slots

Abstract—We investigate the trade-off between energy con-sumption and delay for critical data collection in low duty cycle wireless sensor networks, where a causality constraint exists for routing and link scheduling. We characterize the energy-delay region (E-D region) and formulate a

Abstract-The energy efficiency and delivery robustness are two critical issues for low duty cycled wireless sensor networks. The asynchronous receiver-initiated duty cycling media access control (MAC) protocols have shown the effectiveness through various studies. In receiver-initiated MACs