Skip to main content
SpringerLink
Log in

A Fast TDMA Schedule Based on Greedy Approach

  • Conference paper
  • First Online:
Ubiquitous Networking (UNet 2019)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 12293))

Included in the following conference series:

  • 342 Accesses

Abstract

TDMA schedule is a complex problem with ad hoc. In order to minimize frame length, maximize channel utilization, reduce running time and increase fairness, a TDMA (M-TDMA) based on greedy selection and matrix OR is proposed. M-TDMA minimizes the frame length and maximizes the network throughput through greedy selection. It reduces the computing time by matrix OR, and increases fairness by random selection. The simulations show that the computing time and average delay of M-TDMA are significantly lower than that of TDMA schemes based on SVC. M-TDMA is also superior to TP-TDMA and N-TDMA in fairness.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ephremides, A., Truong, T.V.: Scheduling broadcast in multi-hop radio networks. IEEE Trans. Commun. 38(4), 456–460 (1990)

    Google Scholar 

  2. Aggeliki, S., Dimitrios, J.V., Dimitrios, D.V.: A survey of TDMA scheduling schemes in wireless multihop networks. ACM Comput. Surv. 47(3), 1–39 (2015)

    Google Scholar 

  3. Jaehyun Yeo, F., Heesoo Lee, S., Sehun Kim, T.: An efficient broadcast scheduling algorithm for TDMA ad-hoc networks. Comput. Oper. Res. 29(13), 1793–1806 (2002)

    Article  Google Scholar 

  4. Clayton, W., Commander, F., Panos, M., Pardalos, S.: A combinatorial algorithm for the TDMA message scheduling problem. Computat. Optimizat. Appl. 43(3), 449–460 (2009)

    Google Scholar 

  5. Sinem, C.E., Pravin, V.: TDMA scheduling algorithms for wireless sensor networks. Wireless NetWork 16, 985–997 (2010)

    Google Scholar 

  6. Enrico Malaguti, F., Paolo Toth, S.: A survey on vertex coloring problems. Int. Trans. Oper. Res. 17(1), 1–34 (2009)

    Article  MathSciNet  Google Scholar 

  7. Komosko, L., Batsyn, M., Segundo, P.S., Pardalos, P.M.: A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations. J. Combinat. Optim. 31(4), 1665–1677 (2015). https://doi.org/10.1007/s10878-015-9862-1

    Article  MathSciNet  MATH  Google Scholar 

  8. Wang, G., Ansari, N.: Optimal broadcast scheduling in packet radio networks using mean field annealing. IEEE J. Select. Areas Commun. 15(2), 250–260(1997)

    Google Scholar 

  9. Wang Lingzhi, F., Chen Lingyu, S., Yuan Aisha, T.: N-time division multiple access dynamic slot allocation protocol based on I-sequential vertex coloring algorithm. Comput. Eng. 42(1), 89–94 (2016)

    Google Scholar 

  10. Zhang Xizheng, F., Wang Yaonan, S.: New mixed broadcast scheduling approach using neural networks and graph coloring in wireless sensor network. J. Syst. Eng. Electron. 20(1), 185–191 (2009)

    Google Scholar 

  11. Haixiang Shi, F., Lipo Wang, S.: Broadcast scheduling in wireless multihop networks using a neural network based hybrid algorithm. Neural Netw. 18(5), 765–771 (2005)

    Google Scholar 

  12. Shuai, X.: A greedy approach for TDMA based on matrix operation. In: Proceedings of CyberC, pp. 284–287 (2019)

    Google Scholar 

  13. Arivudainambi, D., Rekha, D.: An evolutionary algorithm for broadcast scheduling in wireless multihop networks. Wireless Netw. 18, 787–798 (2012)

    Google Scholar 

  14. Nobuo, F., Junji, K.: A gradual neural network algorithm for broadcast scheduling problems in packet radio networks. IEICE Trans Fundam. E82-A(5), 815–824(1999)

    Google Scholar 

  15. Jun, H., Hung, K.P..: Fairness of medium access control protocols for multi-hop ad hoc wireless networks. Comput. Netw. 48, 867–890 (2005)

    Google Scholar 

  16. Shi, H., Venkatesha Prasad, R., Onur, E. et al.: Fairness in wireless networks issues, measures and challenges. IEEE Commun. Surv. Tutorials 16(1), 5–24(2014)

    Google Scholar 

  17. Raj, J.: The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling. Wiley, Hoboken (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Taizhou University, Taizhou, China

    Shuai Xiaoying

Authors
  1. Shuai Xiaoying
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuai Xiaoying .

Editor information

Editors and Affiliations

  1. University of Limoges, Limoges, France

    Oussama Habachi

  2. University of Limoges, Limoges, France

    Vahid Meghdadi

  3. Hassan II University, Casablanca, Morocco

    Essaid Sabir

  4. University of Limoges, Limoges, France

    Jean-Pierre Cances

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xiaoying, S. (2020). A Fast TDMA Schedule Based on Greedy Approach. In: Habachi, O., Meghdadi, V., Sabir, E., Cances, JP. (eds) Ubiquitous Networking. UNet 2019. Lecture Notes in Computer Science(), vol 12293. Springer, Cham. https://doi.org/10.1007/978-3-030-58008-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58008-7_3

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation