Traffic-Oriented STDMA Scheduling in Multi-hop Wireless Networks

  • Conference paper
Recent Progress in Data Engineering and Internet Technology

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 157))

Abstract

For complicated traffic-oriented transmissions (e.g., multiple multicasting) in Spatial Time Division Multiple Access (STDMA) network, scheduling algorithms are employed to determine an efficient assignment for the transmissions. In this paper, a scheduling algorithm, designated as traffic-oriented scheduling assignment (TOSA), is proposed to effectively allocate available network resource in the link-based and node-based STDMA networks. The objective of TOSA is to reduce schedule frame length by enhancing the spatial utilization within each time slot. Simulation results demonstrate that the proposed algorithms achieve a lower schedule frame length than existing STDMA scheduling algorithms.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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
EUR 29.95
Price includes VAT (Thailand)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 245.03
Price includes VAT (Thailand)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 299.99
Price excludes VAT (Thailand)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
EUR 299.99
Price excludes VAT (Thailand)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Nelson, R., Kleinrock, L.: Spatial TDMA: A Collision-Free Multihop Channel Access Protocol. IEEE Trans. Commun. 33(9), 934–944 (1985)

    Article  MathSciNet  Google Scholar 

  2. Behzad, A., Rubin, I.: On the Performance of Graph-based Scheduling Algorithms for Packet Radio Networks. In: Proceedings of IEEE Global Telecommunications Conference (GLOBECOM), vol. 6, pp. 3432–3436 (2003)

    Google Scholar 

  3. Ramanathan, S., Lloyd, E.L.: Scheduling Algorithms for Multihop Radio Networks. IEEE/ACM Trans. Netw. 1(2), 166–177 (1993)

    Article  Google Scholar 

  4. Ephremides, A., Truong, T.V.: Scheduling Broadcasts in Multihop Radio Networks. IEEE Trans. Commun. 38(4), 456–460 (1990)

    Article  Google Scholar 

  5. Badia, L., Erta, A., Lenzini, L., Zorzi, M.: A General Interference-Aware Framework for Joint Routing and Link Scheduling in Wireless Mesh Networks. IEEE Netw 22(1), 32–38 (2008)

    Article  Google Scholar 

  6. Djukic, P., Valaee, S.: Delay Aware Link Scheduling for Multi-hop TDMA Wireless Networks. IEEE/ACM Trans. Netw. 17(3), 870–883 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jung-Shian Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, JS., Liu, KH., Wang, CY., Wu, CH. (2012). Traffic-Oriented STDMA Scheduling in Multi-hop Wireless Networks. In: Gaol, F. (eds) Recent Progress in Data Engineering and Internet Technology. Lecture Notes in Electrical Engineering, vol 157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28798-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28798-5_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28797-8

  • Online ISBN: 978-3-642-28798-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Navigation