Overcoming communication failures in reliable and real-time cyber-physical networks
Abstract
Details
- Title: Subtitle
- Overcoming communication failures in reliable and real-time cyber-physical networks
- Creators
- Md Kowsar Hossain
- Contributors
- Octav Chipara (Advisor)Steve Goddard (Committee Member)Ted Herman (Committee Member)Mehrdad Moharrami (Committee Member)Cesare Tinelli (Committee Member)
- Resource Type
- Dissertation
- Degree Awarded
- Doctor of Philosophy (PhD), University of Iowa
- Degree in
- Computer Science
- Date degree season
- Summer 2025
- DOI
- 10.25820/etd.008167
- Publisher
- University of Iowa
- Number of pages
- xiii, 212 pages
- Copyright
- Copyright 2025 Md Kowsar Hossain
- Language
- English
- Date submitted
- 07/29/2025
- Description illustrations
- illustrations (some color)
- Description bibliographic
- Includes bibliographical references (pages 205-212).
- Public Abstract (ETD)
Wireless networks form the backbone of emerging cyber physical systems (CPS), yet ensuring both real-time guarantees and high reliability under the challenges of probabilistic link losses and complete link failures remains an open problem. This thesis introduces node programs that enable wireless networks to tolerate transient packet losses and complete link failures, ensuring reliable, real-time communication in CPS. Chapters 2 5 focus on handling transient losses, while Chapter 6 extends the approach to address complete link failures.
First, we introduce node communication programs as a replacement for traditional fixed schedules. These programs combine slot reservation with local adaptation. Next, we develop Recorp, a receiver-oriented node program framework that enables nodes to locally reallocate the retransmissions of flows in response to variations in link quality, increasing real-time capacity 50% to 140% and decreasing latency 27% to 70% versus static schedules. Building on these results, WARP enables on-the-fly synthesis of identical node programs in milliseconds, yielding up to 47.68% throughput gains over Recorp and reducing the time to add new flows by 5 times over a state-of-the-art centralized control plane. Next, we introduce Batching, a novel program-based approach that provides a better interface between the probabilistic behavior of the networks and the discrete nature of the scheduling, achieving up to 3 times higher throughput than single packet approach under lossy conditions. The last chapter Fallback extends our program-based scheduler to handle complete link failures, demonstrating quick recovery from up to K arbitrary failures.
Extensive simulation and testbed evaluations validate that our Recorp, WARP, and Batching approaches meet reliability and deadline targets under transient packet losses, significantly improving network latency and capacity, and our Fallback approach provides robust recovery from complete link failures.
- Academic Unit
- Computer Science
- Record Identifier
- 9984948738202771