EDF Scheduling and Minimal-Overlap Shortest-Path Routing for Real-Time TSCH Networks

Keyphrases

• Shortest Path Routing 100%
• TSCH Networks 100%
• Real-time Performance 100%
• Earliest Deadline First Scheduling 100%
• Popular 50%
• Performance-based 50%
• Network Configuration 50%
• Time-varying Data 50%
• Schedulability 50%
• Betweenness Centrality 50%
• Greedy Heuristic 50%
• Degree Densities 50%
• 6TiSCH 50%
• Actuator Network 50%
• Graph Network 50%
• Wireless Standards 50%
• Data Traffic 50%
• Packet Transmission 50%
• Vertex Degree 50%
• ISA100.11a 50%
• Wireless Sensor Networks 50%
• Industry 4.0 (I4.0) 50%
• Network Connectivity 50%
• WirelessHART 50%
• Transmission Conflict 50%
• Routing Decision 50%
• Wireless Actuator 50%
• Wireless Technology 50%
• Network Workload 50%
• Network Parameters 50%
• Earliest Deadline First 50%
• IEEE 802.15.4 50%
• Packet Scheduling 50%
• Industrial Internet of Things (IIoT) 50%

Computer Science

• Real Time Performance 100%
• Shortest Path Routing 100%
• Network Configuration 50%
• Wireless Sensor Network 50%
• Packet Transmission 50%
• Wireless Technologies 50%
• Routing Decision 50%
• Time Traffic Data 50%
• Industrial Internet of Things 50%
• Greedy Heuristic 50%
• Actuator Networks 50%
• Betweenness Centrality 50%
• Sensors and Actuator 50%
• Industry 4.0 50%
• Network Parameter 50%
• Packet Scheduling 50%