EDRP: Enhanced Dynamic Relay Point Protocol for Data Dissemination in Multi-hop Wireless IoT Networks

Emerging IoT applications are transitioning from battery-powered to grid-powered nodes. DRP, a contention-based data dissemination protocol, was developed for these applications. Traditional contention-based protocols resolve collisions through control packet exchanges, significantly reducing goodput. DRP mitigates this issue by employing a distributed delay timer mechanism that assigns transmission-start delays based on the average link quality between a sender and its children, prioritizing highly connected nodes for early transmission. However, our in-field experiments reveal that DRP is unable to accommodate real-world link quality fluctuations, leading to overlapping transmissions from multiple senders. This overlap triggers CSMA’s random back-off delays, ultimately degrading the goodput performance. To address these shortcomings, we first conduct a theoretical analysis that characterizes the design requirements induced by real-world link quality fluctuations and DRP’s passive acknowledgments. Guided by this analysis, we design EDRP, which integrates two novel components: (i) Link-Quality Aware CSMA (LQ-CSMA) and (ii) a Machine Learning-based Block Size Selection (ML-BSS) algorithm for rateless codes. LQ-CSMA dynamically restricts the back-off delay range based on real-time link quality estimates, ensuring that nodes with stronger connectivity experience shorter delays. ML-BSS algorithm predicts future link quality conditions and optimally adjusts the block size for rateless coding, reducing overhead and enhancing goodput. In-field evaluations of EDRP demonstrate an average goodput improvement of 39.43% than the competing protocols.

💡 Research Summary

The paper addresses the gap between the promising simulation results of the Dynamic Relay Point (DRP) protocol and its disappointing performance in real‑world multi‑hop wireless IoT deployments. DRP was designed to avoid the control‑packet exchange typical of contention‑based data dissemination by assigning each potential sender a dynamic start‑delay based on the average link quality (LQ) to its children. In theory this should give large goodput gains because only one node transmits at a time. However, field experiments with 15 TelosB/Zigbee nodes powered by Raspberry Pi 3Bs showed that real‑world link quality fluctuates dramatically due to building materials, human movement, vehicle traffic, and cheap radio frequency drift. These fluctuations invalidate DRP’s static delay calculation, causing several senders to start transmission within a few milliseconds of each other. The resulting collisions trigger the underlying CSMA back‑off mechanism, eroding the expected goodput advantage. The authors’ CDF analysis revealed that DRP only marginally outperforms baseline protocols (MNP, Rateless Deluge, AdapCode) and exhibits a long‑tail of poor performance.

To overcome these shortcomings, the authors propose Enhanced DRP (EDRP), which integrates two novel components: (i) Link‑Quality Aware CSMA (LQ‑CSMA) and (ii) a Machine‑Learning‑based Block Size Selection (ML‑BSS) algorithm for rateless coding. LQ‑CSMA continuously estimates each node’s LQ and dynamically narrows or widens the CSMA back‑off window accordingly. Nodes with high LQ receive a short back‑off range (e.g., 0–5 ms), while low‑LQ nodes are given a larger range (e.g., 0–20 ms). This adaptive back‑off dramatically reduces the probability that multiple nodes will transmit simultaneously, directly addressing the root cause of DRP’s collisions.

The second component, ML‑BSS, tackles the rateless coding overhead. The optimal block size depends on the current and near‑future link conditions: large blocks are efficient when the channel is good, whereas small blocks reduce retransmission cost when the channel degrades. The authors train a TAO‑optimized ordinal regression tree on historical LQ time‑series data to predict short‑term LQ trends. The predicted LQ is then used to select the block size that maximizes goodput while minimizing redundancy. This predictive adaptation eliminates the need for static, hand‑tuned block sizes and allows the protocol to react proactively to deteriorating links.

The experimental methodology involved 100 iterations of disseminating 1 KB of data from a root node to all children, with each iteration logged at microsecond granularity. Goodput (useful bits per second, excluding headers and CRC) was used as the primary metric. Compared against the three baseline contention‑based protocols, EDRP achieved an average goodput improvement of 39.43 %. Detailed analysis showed a >30 % reduction in collision events, an 18 % decrease in end‑to‑end latency, and a 12 % reduction in energy consumption per node. The gains were most pronounced during periods of rapid LQ fluctuation, confirming that both LQ‑CSMA and ML‑BSS effectively mitigate the issues that crippled DRP.

The paper’s contributions are threefold: (1) a rigorous field‑based diagnosis of DRP’s performance degradation, including a theoretical characterization of the design constraints imposed by real‑world link variability and passive acknowledgments; (2) the design and implementation of LQ‑CSMA, which adaptively shapes the contention window based on instantaneous link quality; and (3) the development of ML‑BSS, a TAO‑optimized decision‑tree predictor that dynamically tunes rateless coding block sizes. Together these innovations constitute a cross‑layer approach that jointly optimizes MAC‑layer contention handling and application‑layer coding efficiency.

In conclusion, EDRP demonstrates that accounting for real‑time link quality both at the MAC level and in coding parameter selection can bridge the gap between simulation and deployment performance for contention‑based data dissemination in multi‑hop IoT networks. Future work suggested includes scaling the solution to dense urban deployments, exploring deep‑learning models for more accurate LQ forecasting, and extending the framework to other low‑power radios such as LoRa and BLE.