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

Authors Miguel Gutiérrez Gaitán , Luís Almeida , Pedro Miguel Santos , Patrick Meumeu Yomsi



PDF
Thumbnail PDF

File

OASIcs.NG-RES.2021.2.pdf
  • Filesize: 0.5 MB
  • 12 pages

Document Identifiers

Author Details

Miguel Gutiérrez Gaitán
  • CISTER – Research Centre in Real-Time and Embedded Computing Systems, Porto, Portugal
  • Faculty of Engineering, University of Porto, Portugal
  • Institute of Engineering, Polytechnic Institute of Porto, Portugal
  • Facultad de Ingeniería, Universidad Andrés Bello, Santiago de Chile, Chile
Luís Almeida
  • CISTER – Research Centre in Real-Time and Embedded Computing Systems, Porto, Portugal
  • Faculty of Engineering, University of Porto, Portugal
Pedro Miguel Santos
  • CISTER – Research Centre in Real-Time and Embedded Computing Systems, Porto, Portugal
  • Institute of Engineering, Polytechnic Institute of Porto, Portugal
Patrick Meumeu Yomsi
  • CISTER – Research Centre in Real-Time and Embedded Computing Systems, Porto, Portugal
  • Institute of Engineering, Polytechnic Institute of Porto, Portugal

Cite AsGet BibTex

Miguel Gutiérrez Gaitán, Luís Almeida, Pedro Miguel Santos, and Patrick Meumeu Yomsi. EDF Scheduling and Minimal-Overlap Shortest-Path Routing for Real-Time TSCH Networks. In Second Workshop on Next Generation Real-Time Embedded Systems (NG-RES 2021). Open Access Series in Informatics (OASIcs), Volume 87, pp. 2:1-2:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/OASIcs.NG-RES.2021.2

Abstract

With the scope of Industry 4.0 and the Industrial Internet of Things (IIoT), wireless technologies have gained momentum in the industrial realm. Wireless standards such as WirelessHART, ISA100.11a, IEEE 802.15.4e and 6TiSCH are among the most popular, given their suitability to support real-time data traffic in wireless sensor and actuator networks (WSAN). Theoretical and empirical studies have covered prioritized packet scheduling in extenso, but only little has been done concerning methods that enhance and/or guarantee real-time performance based on routing decisions. In this work, we propose a greedy heuristic to reduce overlap in shortest-path routing for WSANs with packet transmissions scheduled under the earliest-deadline-first (EDF) policy. We evaluated our approach under varying network configurations and observed remarkable dominance in terms of the number of overlaps, transmission conflicts, and schedulability, regardless of the network workload and connectivity. We further observe that well-known graph network parameters, e.g., vertex degree, density, betweenness centrality, etc., have a special influence on the path overlaps, and thus provide useful insights to improve the real-time performance of the network.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Real-time systems
  • Networks → Network algorithms
  • Networks → Data path algorithms
Keywords
  • Real-time communication
  • Routing
  • Scheduling
  • TDMA
  • Wireless networks

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Giuliana Alderisi, Svetlana Girs, Lucia Lo Bello, Elisabeth Uhlemann, and Mats Björkman. Probabilistic scheduling and adaptive relaying for WirelessHART networks. In 2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA), pages 1-4. IEEE, 2015. Google Scholar
  2. Sanjoy Baruah, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, and Sebastian Stiller. Improved multiprocessor global schedulability analysis. Real-Time Systems, 46(1):3-24, 2010. Google Scholar
  3. Keoma Brun-Laguna, Pascale Minet, and Yasuyuki Tanaka. Optimized scheduling for time-critical industrial IoT. In 2019 IEEE Global Communications Conference (GLOBECOM), pages 1-6. IEEE, 2019. Google Scholar
  4. Domenico De Guglielmo, Simone Brienza, and Giuseppe Anastasi. IEEE 802.15. 4e: A survey. Computer Communications, 88:1-24, 2016. Google Scholar
  5. Miguel Gutiérrez Gaitán, Patrick M. Yomsi, Pedro M. Santos, and Luís Almeida. Work-in-progress: Assessing supply/demand-bound based schedulability tests for wireless sensor-actuator networks. In 2020 16th IEEE International Conference on Factory Communication Systems (WFCS), pages 1-4. IEEE, 2020. Google Scholar
  6. Miguel Gutiérrez Gaitán and Patrick Meumeu Yomsi. FF-DBF-WIN: On the forced-forward demand-bound function analysis for wireless industrial networks. In 2018 30th Euromicro Conference on Real-Time Systems (ECRTS), Proceedings of the Work-in-Progress Session, pages 13-15, 2018. Google Scholar
  7. Miguel Gutiérrez Gaitán and Patrick Meumeu Yomsi. Multiprocessor scheduling meets the industrial wireless: A brief review. U. Porto Journal of Engineering, 5(1):59-76, 2019. Google Scholar
  8. Harrison Kurunathan, Ricardo Severino, Anis Koubâa, and Eduardo Tovar. Worst-case bound analysis for the time-critical MAC behaviors of IEEE 802.15. 4e. In 2017 IEEE 13th International Workshop on Factory Communication Systems (WFCS), pages 1-9. IEEE, 2017. Google Scholar
  9. Chenyang Lu, Abusayeed Saifullah, Bo Li, Mo Sha, Humberto Gonzalez, Dolvara Gunatilaka, Chengjie Wu, Lanshun Nie, and Yixin Chen. Real-time wireless sensor-actuator networks for industrial cyber-physical systems. Proceedings of the IEEE, 104(5):1013-1024, 2015. Google Scholar
  10. Rahul Mangharam, Anthony Rowe, Raj Rajkumar, and Ryohei Suzuki. Voice over sensor networks. In 2006 27th IEEE International Real-Time Systems Symposium (RTSS), pages 291-302. IEEE, 2006. Google Scholar
  11. Venkata Prashant Modekurthy, Dali Ismail, Mahbubur Rahman, and Abusayeed Saifullah. A utilization-based approach for schedulability analysis in wireless control systems. In 2018 IEEE International Conference on Industrial Internet (ICII), pages 49-58. IEEE, 2018. Google Scholar
  12. Marcelo Nobre, Ivanovitch Silva, and Luiz Affonso Guedes. Routing and scheduling algorithms for WirelessHART networks: A survey. Sensors, 15(5):9703-9740, 2015. Google Scholar
  13. Abusayeed Saifullah, You Xu, Chenyang Lu, and Yixin Chen. Real-time scheduling for WirelessHART networks. In 2010 31st IEEE Real-Time Systems Symposium (RTSS), pages 150-159. IEEE, 2010. Google Scholar
  14. Stefano Scanzio, Mohammad Ghazi Vakili, Gianluca Cena, Claudio Giovanni Demartini, Bartolomeo Montrucchio, Adriano Valenzano, and Claudio Zunino. Wireless sensor networks and TSCH: A compromise between reliability, power consumption, and latency. IEEE Access, 8:167042-167058, 2020. Google Scholar
  15. Emiliano Sisinni, Abusayeed Saifullah, Song Han, Ulf Jennehag, and Mikael Gidlund. Industrial internet of things: Challenges, opportunities, and directions. IEEE Transactions on Industrial Informatics, 14(11):4724-4734, 2018. Google Scholar
  16. Rasool Tavakoli, Majid Nabi, Twan Basten, and Kees Goossens. Topology management and TSCH scheduling for low-latency convergecast in in-vehicle WSNs. IEEE Transactions on Industrial Informatics, 15(2):1082-1093, 2018. Google Scholar
  17. Federico Terraneo, Paolo Polidori, Alberto Leva, and William Fornaciari. TDMH-MAC: Real-time and multi-hop in the same wireless MAC. In 2018 IEEE Real-Time Systems Symposium (RTSS), pages 277-287. IEEE, 2018. Google Scholar
  18. Mališa Vučinić, Tengfei Chang, Božidar Škrbić, Enis Kočan, Milica Pejanović-Djurišić, and Thomas Watteyne. Key performance indicators of the reference 6TiSCH implementation in Internet-of-Things scenarios. IEEE Access, 8:79147-79157, 2020. Google Scholar
  19. Chengjie Wu, Dolvara Gunatilaka, Mo Sha, and Chenyang Lu. Real-time wireless routing for industrial internet of things. In 2018 IEEE/ACM Third International Conference on Internet-of-Things Design and Implementation (IoTDI), pages 261-266. IEEE, 2018. Google Scholar
  20. Changqing Xia, Xi Jin, and Peng Zeng. Resource analysis for wireless industrial networks. In Proceedings of the 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN), pages 424-428. IEEE, 2016. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail