Skip to main content

TSCH Scheduling Mechanism Based on the Network’s Throughput with Dynamic Power Allocation and Slot-Frame Delay

  • Conference paper
  • First Online:
Inventive Communication and Computational Technologies (ICICCT 2023)

Abstract

In the paper, we proposed a TSCH scheduling method that performs the scheduling based on the network’s throughput with considering dynamic power allocation and slot-frame delay according to the guideline of IEEE 802.15.4e. Here, we used a bipartite graph-based solution of a link-to-cell allocation technique. The prominent Hungarian assignment algorithm was used for assigning links’ on corresponding cells’. The assignment ensured throughput maximization with dynamic power allocation and fixed slot delay, which is close to the actual scenario of data transmission scheduling of wireless communications. In the simulation, we considered a four nodes structure of a network model, which formulated eight links for data transmission. We also assumed a slot frame of four channels, and four slots formed sixteen cells for allocating links for data transmission. The simulation results showed that the proposed method demonstrated more fairness than the previously proposed techniques, and throughput and delay relations are reasonable for the fundamental nature of wireless networks.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.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

References

  1. Piyare R, Oikonomou G, Elsts A (2020) TSCH for long range low data rate applications. IEEE Access. https://doi.org/10.1109/ACCESS.2020.3046769

  2. Din IU, Guizani M, Hassan S, Kim BS, Khan MK, Atiquzzaman M, Ahmed SH (2019) The ınternet of things: a review of enabled technologies and future challenges. IEEE Access.https://doi.org/10.1109/ACCESS.2018.2886601

  3. Bae BH, Chung SH (2020) Fast synchronization scheme using 2-Way parallel rendezvous in IEEE 802.15.4 TSCH. Sensors (Switzerland) 20(5). https://doi.org/10.3390/s20051303

  4. IEEE Standard for Local and Metropolitan Area Networks-Part 15.4: Low-Rate Wireless Personal Area Networks (LR-WPANs) (n.d.)

    Google Scholar 

  5. Oh S, DY Hwang, Kim KH, Kim K (2018) Escalator: an autonomous scheduling scheme for convergecast in TSCH. Sensors (Switzerland) 18(4). https://doi.org/10.3390/s18041209

  6. Ojo M, Stefano G, Portaluri G, Adami D, Pagano M (2017) An energy efficient centralized scheduling scheme in TSCH networks. In: 2017 IEEE ınternational conference on communications workshops, ICC Workshops 2017, pp 570–75. Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/ICCW.2017.7962719.

  7. Ojo M, Giordano S (2016) An efficient centralized scheduling algorithm in IEEE 802.15.4e TSCH networks. In: 2016 IEEE conference on standards for communications and networking, CSCN 2016. Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/CSCN.2016.7785164

  8. Javan T, Nastooh MS, Hakami V (2020) IEEE 802.15.4.e TSCH-based scheduling for throughput optimization: a combinatorial multi-armed bandit approach. IEEE Sens J 20(1):525–537. https://doi.org/10.1109/JSEN.2019.2941012

    Article  Google Scholar 

  9. Haque MNM, Lee YD, Koo I (2022) Deep Learning-based scheduling scheme for IEEE 802.15.4e TSCH network. Wirel Commun Mobile Comput https://doi.org/10.1155/2022/8992478

  10. Niaz M, Haque M, Koo I (2022) TSCH-based scheduling of IEEE 802.15.4e in coexistence with ınterference network cluster: a DNN approach simulink model of controlling fuel cell powered direct current motor with comparative performance analysis view project fault diagnosis using advance hybrid algorithms view project TSCH-based scheduling of IEEE 802.15.4e in coexistence with ınterference network cluster: a DNN approach. Int J Internet Broadcast Commun 14(1):53–63https://doi.org/10.7236/IJIBC.2022.14.1.53

  11. Hameed I, Tuan PV, Koo I (2020) Exploiting a deep neural network for efficient transmit power minimization in a wireless powered communication network. Appl Sci (Switzerland) 10(13). https://doi.org/10.3390/app10134622

  12. Haque M, Niaz M, Koo I (2023) Throughput optimization of IEEE 802.15.4e TSCH-Based scheduling: a deep neural network (DNN) scheme. Inst Electr Electron Eng (IEEE) 844–49. https://doi.org/10.1109/iccit57492.2022.10054722

  13. Ma J, Qiao Y, Hu G, Li T, Huang Y, Wang Y, Zhang C (2018) Social account linking via weighted bipartite graph matching. Int J Commun Syst 31(7):e3471.https://doi.org/10.1002/dac.3471

  14. Date K, Nagi R (2016) GPU-accelerated hungarian algorithms for the linear assignment problem. Parallel Comput 57(September):52–72. https://doi.org/10.1016/j.parco.2016.05.012

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Md. Niaz Morshedul Haque .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Niaz Morshedul Haque, M., Sami, N.A., Al Masruf, A.S. (2023). TSCH Scheduling Mechanism Based on the Network’s Throughput with Dynamic Power Allocation and Slot-Frame Delay. In: Ranganathan, G., Papakostas, G.A., Rocha, Á. (eds) Inventive Communication and Computational Technologies. ICICCT 2023. Lecture Notes in Networks and Systems, vol 757. Springer, Singapore. https://doi.org/10.1007/978-981-99-5166-6_27

Download citation

Publish with us

Policies and ethics