Adaptive Forwarding With Probabilistic Delay Guarantee in Low-Duty-Cycle WSNs

Despite many existing research on data forwarding in low-duty-cycle wireless sensor networks (WSNs), relatively little work has been done on energy-efficient data forwarding with probabilistic delay bounds. Probabilistic delay guarantees (i.e., delay bounded data delivery with reliability constraints) are of increasing importance for many delay-constrained applications, since deterministic delay bounds are prohibitively expensive to guarantee in WSNs. However, radio duty-cycling and unreliable wireless links pose challenges for achieving the probabilistic delay guarantee in WSNs. In this paper, we propose EEAF, a novel energy-efficient adaptive forwarding technique tailored for low-duty-cycle WSNs with unreliable wireless links. We show the existence of path diversity in low-duty-cycle WSNs, where delay-optimal routing and energy-optimal routing are likely following different paths. The key idea of EEAF is to exploit the intrinsic path diversity to provide probabilistic delay guarantees while minimizing transmission cost. In EEAF, an early arriving packet will be adaptively switched to the energy-optimal path for energy conservation. Delay quantiles are derived at each node in a distributed manner and are used as the guidelines in the adaptive forwarding decision making. Extensive testbed experiment and large-scale simulation show that EEAF effectively reduces the transmission cost by 12%similar to 25% with probabilistic delay guarantees under various network settings. In addition, we extend the EEAF technique with data aggregation for event-based traffic scenarios. Evaluation using publicly available WSN event traffic traces yields very encouraging results with up to 40% energy saving in probabilistic delay bounded data delivery.