Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Implementation of a Centralized Scheduling Algorithm for IEEE 802.15.4e TSCH

  • Conference paper
  • First Online:
Intelligent Computing Methodologies (ICIC 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11645))

Included in the following conference series:

Abstract

IEEE 802.15.4e Time Slotted Channel Hopping (TSCH) is an important standard in the actual scalable Internet of Things (IoT), to habilitate deterministic low-power mesh networking. In TSCH, scheduling can be distributed or centralized scheduling. In this paper we describe the implementation of a centralized link scheduling for IEEE 802.15.4e TSCH based industrial Low Power Wireless Networks, known as Path Conflict free Least Laxity First (PC-LLF) algorithm in Contiki OS, a real time operating system for wireless sensor by using RPL protocol for network topology construction. PC-LLF prioritizes the assignment of the communications resources for each transmission. For each node to know its assigned cell in the schedules, we implemented a method to broadcast the schedule information packets to all transmissions generator (nodes) with the aim to reduce packets collision and loss. We compared our method with the broadcast of the same packet by Minimum Schedule Function (MSF) and the results show that our method performs better than the MSF and use less number of packets messages than other CoAP and OCARI broadcasting method. The implementation devices are Texas instruments CC 2650 Launchpad. The implementation aim is to make a real IoT network running a centralized scheduling algorithm of TSCH which can be effectively applied in the industrial networks and the results proved that.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Sinopoli, B., Sharp, C., Schenato, L., Schaffert, S., Sastry, S.S.: Distributed control applications within sensor networks. In: Proceedings of IEEE, vol. 91, no. 8, pp. 1235–1246 (2003)

    Article  Google Scholar 

  2. Zurawski, R.: Networked embedded systems: an overview. In: Zurawski, R. (ed.) Networked Embedded Systems, Ch. 1, pp. 1.11–1.16. CRC Press, Boca Raton (2009)

    Chapter  Google Scholar 

  3. Darbandi, A., Kim, M.K.: Path collision-aware real-time link scheduling for TSCH wireless networks. KSII Trans. Internet Inf. Syst. (2019). Accepted to be published

    Google Scholar 

  4. Winter, T., Thubert, P., Brandt, A., Hui, J., Kelsey, R.: RPL: IPV6 “Routing protocol for Low Power and Lossy Networks”. IETF request for comments 6550, March 2012

    Google Scholar 

  5. Pister, E.K., Thubert, E.P., Dwars, S., Phinney, T.: Industrial routing requirements in Low-Power and Lossy Networks. IETF request for comments:5673, March 2009

    Google Scholar 

  6. Dunkels, A., Gronvall, B., Voigt, T.: Contiki - a lightweight and flexible operating system for tiny networked sensors. In: 29th Annual IEEE international conference on Local Computer Networks, pp. 455–462, November 2004. 17

    Google Scholar 

  7. Contiki 3.x. https://github.com/contiki-os/contiki.Online. Accessed 2 June 2016. 17

  8. Minimum Scheduling Function (MSF). https://tools.ietf.org/html/draft-ietf-6tisch-minimal-21

  9. Breadth-First Searching (BFS) Algorithm. https://en.wikipedia.org/wiki/Breadth-first_search

  10. Livolant, E., Minet, P., Watteyne, T.: The cost of installing a 6TiSCH schedule. In: Mitton, N., Loscri, V., Mouradian, A. (eds.) ADHOC-NOW 2016. LNCS, vol. 9724, pp. 17–31. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40509-4_2

    Chapter  Google Scholar 

Download references

Acknowledgements

This work was supported by the 2019 Research Fund of University of Ulsan.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Myung Kyun Kim .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rugamba, J.P.G., Mai, D.L., Kim, M.K. (2019). Implementation of a Centralized Scheduling Algorithm for IEEE 802.15.4e TSCH. In: Huang, DS., Huang, ZK., Hussain, A. (eds) Intelligent Computing Methodologies. ICIC 2019. Lecture Notes in Computer Science(), vol 11645. Springer, Cham. https://doi.org/10.1007/978-3-030-26766-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26766-7_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26765-0

  • Online ISBN: 978-3-030-26766-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics