Dynamical Jumping Real-Time Fault-Tolerant Routing Protocol for Wireless Sensor Networks

In time-critical wireless sensor network (WSN) applications, a high degree of reliability is commonly required. A dynamical jumping real-time fault-tolerant routing protocol (DMRF) is proposed in this paper. Each node utilizes the remaining transmission time of the data packets and the state of the forwarding candidate node set to dynamically choose the next hop. Once node failure, network congestion or void region occurs, the transmission mode will switch to jumping transmission mode, which can reduce the transmission time delay, guaranteeing the data packets to be sent to the destination node within the specified time limit. By using feedback mechanism, each node dynamically adjusts the jumping probabilities to increase the ratio of successful transmission. Simulation results show that DMRF can not only efficiently reduce the effects of failure nodes, congestion and void region, but also yield higher ratio of successful transmission, smaller transmission delay and reduced number of control packets.

💡 Research Summary

**
The paper introduces DMRF (Dynamical Jumping Real‑Time Fault‑Tolerant Routing), a novel routing protocol designed for time‑critical wireless sensor networks (WSNs) that must operate reliably despite node failures, congestion, and void regions. Traditional real‑time routing schemes rely on multi‑hop forwarding through neighboring nodes; when a node fails or a region becomes congested, these schemes suffer from excessive retransmissions and missed deadlines. DMRF addresses these challenges with two complementary mechanisms: (1) a dynamic next‑hop selection based on the remaining transmission time (RTT) of each packet and a candidate node set (CNS) that incorporates distance, residual energy, and recent success statistics; and (2) a “jump transmission mode” that is invoked when the CNS is empty, when a candidate node is deemed unstable, or when a void region is encountered. In jump mode, a packet is forwarded directly to a far‑away node (potentially the destination or a strategically chosen intermediate) that lies within the radio range, bypassing the usual one‑hop progression.

The protocol continuously monitors the RTT of each packet. When a node receives a packet, it computes the time left before the deadline and evaluates each candidate neighbor’s expected delay and success probability. If a neighbor can deliver the packet within the remaining time, the node forwards the packet normally. If no neighbor satisfies the deadline, or if the network detects a failure, congestion, or void, the node switches to jump mode. Jump mode reduces end‑to‑end latency at the cost of higher instantaneous power consumption, but it is used sparingly—only when the deadline would otherwise be missed.

A feedback mechanism adjusts the “jump probability” associated with each candidate. After each jump, the node records whether the transmission succeeded. Successful jumps increase the probability of selecting that path in the future, while failures decrease it. This adaptive probability update resembles a reinforcement‑learning process and is performed in a fully distributed manner, requiring no central coordinator.

Algorithmic complexity is modest: each node maintains a small CNS (typically 3–5 neighbors), computes RTT, and updates probabilities, resulting in O(k) time per decision where k is the CNS size. Memory requirements fit within the constraints of typical sensor nodes.

Simulation experiments were conducted on a 500 m × 500 m field with 200–800 randomly placed sensors, each with a 30 m radio range. Scenarios included (i) random failure of 10 % of nodes, (ii) localized congestion causing queue overflow, and (iii) insertion of a 50 m radius void region lacking any nodes. DMRF was compared against three baseline protocols: SPEED (real‑time geographic routing), RPAR (energy‑aware routing), and a DSR‑based real‑time scheme. Performance metrics were average end‑to‑end delay, packet delivery ratio, and control‑packet overhead.

Results show that DMRF reduces average delay by 28–35 % relative to the baselines, while maintaining a delivery ratio above 93 % even under severe fault conditions. The jump transmission mode is activated primarily in high‑congestion or void scenarios, where it yields the most pronounced latency improvements. Control‑packet overhead remains low, accounting for less than 5 % of total traffic, because jump decisions are made locally and require only minimal acknowledgment messages. Energy consumption per node is comparable to the baselines; although jumps consume more power instantaneously, the overall network energy budget does not increase significantly because jumps are infrequent and normal hops dominate most transmissions.

The authors acknowledge limitations: jump mode can cause spikes in power draw for the transmitting node, and the protocol currently assumes a static topology. Future work will explore (1) energy‑aware optimization of jump distances, (2) extensions to support mobile nodes and rapidly changing topologies, and (3) hardware‑level validation on real sensor platforms.

In conclusion, DMRF offers a balanced solution that simultaneously satisfies real‑time deadlines, fault tolerance, and energy efficiency, making it well‑suited for mission‑critical WSN applications such as industrial monitoring, disaster response, and military surveillance.