With the rapid proliferation of information and communications technology, industrial automation has undergone a sweeping transformation toward intelligent manufacturing. Wireless communication is widely considered to be one of the key technologies enabling intelligent manufacturing. On one hand, deterministic communication with high reliability and low latency is typically required in industrial automation applications. On the other hand, wireless communication in industrial settings is hindered by strictly limited communication resources and many other factors which mainly derive from the shared and error-prone nature of the wireless channels used. The limited communication resources and harsh channel conditions pose considerable challenges for reliable, real-time data transmission in industrial wireless networks. Resource optimization methods are vital to ensuring the deterministic performance of industrial wireless networks. Traditional resource optimization methods adopt the isolated resource optimization methods for each protocol layer, which is inherently local-optimal and leads performance uncontrollable. To focus on “Performance Controllable Industrial Wireless Networks”, this book presents thejoint resource optimization methods across multiple protocol layers for industrial wireless networks; reviews recent, major advances; and discusses the practical implementations of the proposed methods.
The joint resource optimization methods discussed here will greatly benefit scientists and researchers in the areas of industrial automation and Industrial Internet of Things. To gain the most from this book, readers should have a fundamental grasp of wireless communication, scheduling theory, and convex optimization.
Author(s): Haibin Yu, Peng Zeng, Meng Zheng, Chi Xu, Xi Jin, Wei Liang
Publisher: Springer
Year: 2023
Language: English
Pages: 177
City: Singapore
978-981-99-0389-4
1
Preface
Acknowledgments
Contents
978-981-99-0389-4_1
Chapter 1: Overview of Industrial Wireless Networks
1.1 Background of IWNs
1.1.1 Industrial Control Systems
1.1.2 Limitations of Industrial Wired Networks
1.1.3 Development of IWNs
1.1.3.1 WirelessHART
1.1.3.2 WIA-PA
1.1.3.3 ISA100.11a
1.2 Preliminary of IWNs
1.2.1 Composition and Characteristics
1.2.2 Communication Requirements for IWNs
1.2.2.1 Process Automation
1.2.2.2 Factory Automation
1.2.3 Challenges of IWNs
References
978-981-99-0389-4_2
Chapter 2: Literature Study of Resource Optimization in IWNs
2.1 Problem Formulation for Resource Optimization
2.1.1 Objective Function
2.1.2 Resource Constraints
2.2 Literature Study
2.2.1 Collision Avoidance
2.2.2 Communication Resource Allocation
2.2.3 Flow Control
2.3 Drawbacks of Existing Resource Optimization Methods
References
978-981-99-0389-4_3
Chapter 3: Joint Resource Optimization Methods for IWNs
3.1 Analysis on Couplings Between Network Resources
3.1.1 Coupled Network Resources
3.1.2 Relation Between Performance Index and Network Resources
3.2 The Loosely Coupled Decomposition-Based Dynamic Resource Regulation Framework
3.3 Convex Optimization-Based Distributed Algorithms
References
978-981-99-0389-4_4
Chapter 4: Temporal-Spatial-Frequency Resource Allocation
4.1 Background
4.2 Resource Allocation for Throughput Maximization
4.2.1 System Model
4.2.2 Optimization
4.2.2.1 Problem Formulation
4.2.2.2 Problem Transformation
4.2.2.3 Time and Power Allocation Algorithm for Spectrum Sharing
4.2.3 Performance Evaluation
4.2.4 Conclusion
4.3 Resource Allocation for Outage Minimization
4.3.1 System Model
4.3.2 Resource Allocation and Optimization
4.3.2.1 Problem Formulation
4.3.2.2 Exact Outage Probability
4.3.2.3 Asymptotic Outage Probability
4.3.2.4 Time and Power Allocation Algorithm for Spectrum Sharing
4.3.3 Performance Evaluation
4.3.4 Conclusion
References
978-981-99-0389-4_5
Chapter 5: No-Collision Scheduling Methods for Real-Time Transmission
5.1 Background
5.2 Collision Avoidance for Multiple Coexisting IWNs
5.2.1 Problem Statement
5.2.2 Algorithm Design
5.2.2.1 Flow Scheduling for the Lower Level
A. Single IWN Model
B. Establishing the Releasing Sequence Graph
C. Problem Formulation
D. Our Heuristic Algorithm: E-RM
E. Schedule Performance Analysis
F. Our Heuristic Algorithm: Z-RM
5.2.2.2 Channel Management Scheme
A. Initial Allocation
B. Dynamic Adjustment
5.2.3 Evaluations
5.2.3.1 Our Framework Vs. Centralized Managements
5.2.3.2 Scheduling Algorithm
5.2.3.3 Channel Management
5.2.4 Conclusion
5.3 Real-Time Scheduling for Event-Triggered and Time-Triggered Flows in IWNs
5.3.1 Problem Formulation
5.3.2 Algorithm Design
5.3.2.1 Fundamental Methods for Scheduling
A. Virtual Period Method
B. Slot-Multiplexed Method
C. Reverse-Scheduling Method
5.3.2.2 Comparison
5.3.2.3 A Combined Algorithm
5.3.3 Evaluations
5.3.3.1 Real Topologies
5.3.3.2 Random Topologies
5.3.4 Conclusion
References
978-981-99-0389-4_6
Chapter 6: Cross-Layer Flow Control Methods for Reliable Transmission
6.1 Background
6.2 An Automatic on-Demand Retransmission Scheme for IWNs
6.2.1 Problem Formulation
6.2.1.1 Network Devices
6.2.1.2 Superframe of IWNs
6.2.1.3 NACK-Based Retransmission Mode
6.2.2 Algorithm Design
6.2.2.1 System Model
6.2.2.2 Motivation
6.2.2.3 Scheme Description
6.2.2.4 Reliability Analysis
Reliability Analysis of the Basic Model
Reliability Analysis of the General Model
6.2.3 Performance Evaluation
6.2.3.1 Validation of Analytical Results
6.2.3.2 Performance Comparisons with Related Schemes
6.2.4 Conclusion
6.3 Joint Routing and MAC Layer Retransmission Control in IWNs
6.3.1 Problem Formulation
6.3.1.1 Network Model
6.3.1.2 Energy-Aware Utility Optimization
6.3.2 Algorithm Design
6.3.2.1 Energy-Aware Multi-Path Routing
6.3.2.2 Energy-Aware Retransmission Control
6.3.2.3 Joint Multi-Path Routing and Retransmission Control
6.3.2.4 Implementation Discussion
6.3.3 Performance Evaluation
6.3.4 Conclusion
References
978-981-99-0389-4_7
Chapter 7: Implementation Architecture and Supporting Technologies
7.1 Implementation Architecture
7.2 Key Supporting Technologies
7.2.1 Time Synchronization
7.2.2 Adaptive Frequency Hopping
7.2.3 Two-Phase Scheduling
7.2.4 Reliable Routing
7.2.5 Packet Aggregation and Disaggregation
References
