DQSB: A Reliable Broadcast Protocol Based on Distributed Quasi-Synchronized Mechanism for Low Duty-Cycled Wireless Sensor Networks

In duty-cycled wireless sensor networks, deployed sensor nodes are usually put to sleep for energy efficiency according to sleep scheduling approaches. Any sleep scheduling scheme with its supporting protocols ensures that data can always be routed from source to sink. In this paper, we investigate a problem of multi-hop broadcast and routing in random sleep scheduling scheme, and propose a novel protocol, called DQSB, by quasi-synchronization mechanism to achieve reliable broadcast and less latency routing. DQSB neither assumes time synchronization which requires all neighboring nodes wake up at the same time, nor assumes duty-cycled awareness which makes it difficult to use in asynchronous WSNs. Furthermore, the benefit of quasi-synchronized mechanism for broadcast from sink to other nodes is the less latency routing paths for reverse data collection to sink because of no or less sleep waiting time. Simulation results show that DQSB outperforms the existing protocols in broadcast times performance and keeps relative tolerant broadcast latency performance, even in the case of unreliable links. The proposed DQSB protocol, in this paper, can be recognized as a tradeoff between broadcast times and broadcast latency. We also explore the impact of parameters in the assumption and the approach to get proper values for supporting DQSB.

💡 Research Summary

The paper addresses the long‑standing challenge of reliable multi‑hop broadcasting in duty‑cycled wireless sensor networks (WSNs) where nodes follow random sleep schedules. Existing solutions either require tight time synchronization—forcing all neighboring nodes to wake up simultaneously—or assume that nodes are aware of each other’s duty cycles, which is impractical in truly asynchronous deployments. To overcome these limitations, the authors propose DQSB (Distributed Quasi‑Synchronized Broadcast), a protocol that leverages a “quasi‑synchronization” mechanism. Rather than aligning clocks precisely, each node opportunistically adjusts its wake‑up time based on metadata embedded in received broadcast packets, specifically the “next wake‑up time” of the sender. This lightweight coordination eliminates the need for extra synchronization messages while still ensuring that a sender’s transmission overlaps with at least one neighbor’s active period.

DQSB operates in two logical phases. In the forward broadcast phase, the sink initiates a broadcast packet that contains its own next wake‑up time. Any neighbor that receives the packet—regardless of its current sleep state—immediately acknowledges (ACK) the reception and appends its own next wake‑up time to the packet before forwarding it. The ACK mechanism provides reliability: if an ACK is not heard within a short timeout, the sender retransmits. In the reverse data‑collection phase, each node that later needs to send data to the sink selects the next hop based on the most recent broadcast’s next‑wake‑time information, thereby choosing a neighbor that will be awake with minimal waiting. Consequently, the reverse path experiences almost no additional sleep‑waiting latency, which is a key advantage of the quasi‑synchronization approach.

The authors evaluate DQSB through extensive simulations that vary duty‑cycle ratios (from 5 % to 30 %), network densities, and link‑loss probabilities up to 20 %. Four performance metrics are examined: (1) number of broadcast transmissions, (2) broadcast latency, (3) end‑to‑end data‑collection latency, and (4) packet‑loss recovery success rate. Compared with a classic time‑synchronized broadcast protocol, DQSB reduces the total number of transmissions by roughly 30 % on average, because unnecessary retransmissions caused by mismatched wake‑up windows are avoided. Relative to asynchronous protocols that rely on duty‑cycle awareness, DQSB achieves comparable broadcast latency while dramatically lowering latency variance; the reverse data‑collection latency is often shorter because nodes forward data immediately after the broadcast’s timing information is learned. Even under a 20 % packet‑loss scenario, the ACK‑based recovery maintains a success rate above 95 %, demonstrating robustness to unreliable links.

A sensitivity analysis explores how key parameters affect the trade‑off between transmission overhead and latency. Shorter sleep periods (higher duty cycles) naturally reduce the number of required broadcasts but can increase latency slightly due to more frequent wake‑ups. Larger ACK timeouts decrease retransmission frequency but increase the worst‑case recovery delay. The authors recommend practical settings for typical low‑power WSN deployments: duty cycles between 10 % and 20 %, ACK timeout around 30 ms, and a next‑wake‑time precision of ±5 ms. These values balance energy consumption, reliability, and latency.

The paper also discusses limitations and future work. DQSB is currently designed for a single‑sink topology; extending it to multi‑sink or mobile‑sink scenarios would require additional collision‑avoidance and sink‑selection mechanisms. The inclusion of next‑wake‑time fields modestly enlarges packet headers, which could be problematic for ultra‑constrained devices; integrating header compression or piggy‑backing techniques is suggested. Finally, the authors propose implementing DQSB on real sensor hardware (e.g., TI CC2538 or Contiki‑based platforms) to validate the simulation results and to explore integration with higher‑layer protocols such as duty‑cycle‑aware routing or MAC‑layer wake‑up radios.

In summary, DQSB presents a novel middle ground between fully synchronized broadcast schemes and completely asynchronous duty‑cycle‑aware methods. By exploiting a lightweight quasi‑synchronization mechanism, it achieves reliable multi‑hop broadcasting with fewer transmissions, tolerable latency, and strong resilience to packet loss—all without the overhead of global time synchronization. This makes DQSB a compelling candidate for energy‑constrained, large‑scale WSN deployments where both broadcast efficiency and timely data collection are critical.