Skip to main content

Fast Randomized STDMA Link Scheduling

  • Conference paper
Mobile Lightweight Wireless Systems (Mobilight 2009)

Abstract

In this paper a fast randomized parallel link swap based packing (RSP) algorithm for timeslot allocation in a spatial time division multiple access (STDMA) wireless mesh network is presented. The proposed randomized algorithm extends several greedy scheduling algorithms that utilize the physical interference model by applying a local search that leads to a substantial improvement in the spatial timeslot reuse. Numerical simulations reveal that compared to previously scheduling schemes the proposed randomized algorithm can achieve a performance gain of up to 11%. A significant benefit of the proposed scheme is that the computations can be parallelized and therefore can efficiently utilize commoditized and emerging multi-core and/or multi-CPU processors.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akyildiz, I.F., Wang, X., Wang, W.: Wireless mesh networks: a survey. Computer Networks 47(4), 445–487 (2005)

    Article  MATH  Google Scholar 

  2. Bruno, R., Conti, M., Gregori, E.: Mesh Networks: Commodity Multihop Ad Hoc Networks. IEEE Communications, 123–131 (2005)

    Google Scholar 

  3. Nelson, R., Kleinrock, L.: Spatial-TDMA: A collision-free multihop channel access protocol. IEEE Transactions on Communications 33, 934–944 (1985)

    Article  MathSciNet  Google Scholar 

  4. Ephremides, A., Truong, T.V.: Scheduling broadcasts in multihop radio networks. IEEE Transactions on Communications 38(4), 456–460 (1990)

    Article  Google Scholar 

  5. Krumke, S., Marathe, M., Ravi, S.: Models and Approximation Algorithms for Channel Assignment in Radio Networks. ACM Wireless Networks 7, 575–584 (2001)

    Article  MATH  Google Scholar 

  6. Gronkvist, J., Hansson, A.: Comparison Between Graph-Based and Interference-Based STDMA Scheduling. IEEE MobiHoc, 255–258 (2001)

    Google Scholar 

  7. Jain, K., Padhye, J., Padmanabhan, V., Qiu, L.: Impact of Interference on Multi-Hop Wireless Network Performance. In: ACM Mobicom, pp. 66–80 (2003)

    Google Scholar 

  8. Brar, G., Blough, D.M., Santi, P.: Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks. In: 12th annual international conference on Mobile computing and networking (MOBICOM), Los Angeles, CA, USA, September 23-29 (2006)

    Google Scholar 

  9. Friderikos, V., Papadaki, K.: Interference Aware Routing for Minimum Frame Length Schedules in Wireless Mesh Networks. EURASIP Journal on Wireless Communications and Networking (2008)

    Google Scholar 

  10. Nelson, R., Kleinrock, L.: Spatial-TDMA: A collision-free multihop channel access protocol. IEEE Transactions on Communications 33(9), 934–944 (1985)

    Article  MathSciNet  Google Scholar 

  11. Hajek, B., Sasaki, G.: Link scheduling in polynomial time. IEEE Transactions on Information Theory 34, 910–917 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  12. Prohazka, C.G.: Decoupling link scheduling constraints in multihop packet radio networks. IEEE Transactions on Computers (March 1989)

    Google Scholar 

  13. Chou, A.M., Li, V.O.: Slot allocation strategies for TDMA protocols in multihop packet radio networks. In: IEEE INFOCOM 1992 (1992)

    Google Scholar 

  14. Behzad, A., Rubin, I.: On the Performance of Graph-based Scheduling Algorithms for Packet Radio Networks. In: IEEE GLOBECOM, San Francisco, CA (December 2003)

    Google Scholar 

  15. Das, A., Marks, R., Arabshahi, P., Gray, A.: Power Controlled Minimum Frame Lenght Sheduling in TDMA Wireless Networks with Sectored Antennas. In: IEEE INFOCOM 2005, Miami (March 2005)

    Google Scholar 

  16. Rhee, I., Warrier, A., Min, J., Xu, L.: DRAND: Distributed Randomized TDMA Scheduling For Wireless Adhoc Networks. In: ACM MobiHOC (2006)

    Google Scholar 

  17. Foster, I.: Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering. Addison Wesley, Reading (1995)

    MATH  Google Scholar 

  18. Friderikos, V., Papadaki, K., Wisely, D., Aghvami, H.: Multi-rate power-controlled link scheduling for mesh broadband wireless access networks. IET communications 1(5), 909–914 (2007)

    Article  Google Scholar 

  19. Papadaki, K., Friderikos, V.: Approximate dynamic programming for link scheduling in wireless mesh networks. Computers & Operations Research 35(12), 3848–3859 (2008)

    Article  MATH  Google Scholar 

  20. Gronkvist, J.: Traffic controlled spatial reuse TDMA in multi-hop radio networks. In: 9th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 1998), Boston, Mass, USA, September 1999, vol. 3, pp. 1203–1207 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Gomez, S., Gras, O., Friderikos, V. (2009). Fast Randomized STDMA Link Scheduling. In: Granelli, F., Skianis, C., Chatzimisios, P., Xiao, Y., Redana, S. (eds) Mobile Lightweight Wireless Systems. Mobilight 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03819-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03819-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03818-1

  • Online ISBN: 978-3-642-03819-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics