COFlood: Concurrent Opportunistic Flooding in Asynchronous Duty Cycle Networks

Abstract

For energy constrained wireless IoT nodes, their radios usually operate in duty cycle mode. With low maintenance and negotiation cost, asynchronous duty cycle radio management is widely adopted. To achieve fast network flooding is challenging in asynchronous duty cycle networks. Recently, concurrent flooding is a promising approach to improve the performance of network flooding. In concurrent flooding, a key challenge is how to select a set of concurrent senders to improve both flooding speed and energy efficiency. We observe that selecting neither large nor small number of concurrent senders can achieve the optimal performance in different deployments. In this paper, we propose COFlood (Concurrent Opportunistic Flooding), a practical and effective concurrent flooding protocol in asynchronous duty cycle networks. The basic idea is based on an energy-efficient flooding tree, COFlood opportunistically selects extra concurrent senders that can speed up network flooding. First, COFlood constructs an energy-efficient flooding tree in distributed manner. The non-leaf nodes are selected as senders and they can cover the entire network with low energy consumption. Moreover, we find that exploiting both early wakeup nodes and long lossy links can speed up the flooding tree based network flooding. Then, COFlood develops a light-weight method to select the nodes that meet the conditions of these two opportunities as opportunistic senders. We implement COFlood in TinyOS and evaluate it on two real testbeds. In comparison with state-of-the-art concurrent flooding protocol, completion time and energy consumption can be reduced by up to 35.3% and 26.6%.