Critical‐Path Aware Scheduling for Latency Efficient Broadcast in Duty‐Cycled Wireless Sensor Networks

Abstract

Minimum latency scheduling has arisen as one of the most crucial problems for broadcasting in duty‐cycled Wireless Sensor Networks (WSNs). Typical solutions for the broadcast scheduling iteratively search for nodes able to transmit a message simultaneously. Other nodes are prevented from transmissions to ensure that there is no collision in a network. Such collision‐preventions result in extra delays for a broadcast and may increase overall latency if the delays occur along critical paths of the network. To facilitate the broadcast latency minimization, we propose a novel approach, critical‐path aware scheduling (CAS), which schedules transmissions with a preference of nodes in critical paths of a duty‐cycled WSN. This paper presents two schemes employing CAS which produce collision‐free and collision‐tolerant broadcast schedules, respectively. The collision‐free CAS scheme guarantees an approximation ratio of (Δ − 1)T in terms of latency, where Δ denotes the maximum node degree in a network. By allowing collision at noncritical nodes, the collision‐tolerant CAS scheme reduces up to 10.2 percent broadcast latency compared with the collision‐free ones while requiring additional transmissions for the noncritical nodes experiencing collisions. Simulation results show that broadcast latencies of the two proposed schemes are significantly shorter than those of the existing methods.