Skip to main content

A Conflict-Free Low-Jitter Guaranteed-Rate MAC Protocol for Base-Station Communications in Wireless Mesh Networks

  • Conference paper

Abstract

A scheduling algorithm and MAC protocol which provides low-jitter guaranteed-rate (GR) communications between base-stations (BS) in a Wireless Mesh Network (WMN) is proposed. The protocol can provision long-term multimedia services such as VOIP, IPTV, or Video-on-Demand. The time-axis is partitioned into scheduling frames with F time-slots each. A directional antennae scheme is used to provide each directed link with a fixed transmission rate. A protocol such as IntServ is used to provision resources along an end-to-end path of BSs for GR sessions. The Guaranteed Rates between the BSs are then specified in a doubly stochastic traffic rate matrix, which is recursively decomposed to yield a low-jitter GR frame transmission schedule. In the resulting schedule, the end-to-end delay and jitter are small and bounded, and the cell loss rate due to primary scheduling conflicts is zero. For dual-channel WMNs, the MAC protocol can achieve 100% utilization, as well as near-minimal queueing delays and near minimal delay jitter. The scheduling time complexity is O(NFlogNF), where N is the number of BSs. Extensive simulation results are presented.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akyildiz, I.F., Wang, X.: A Survey on Wireless Mesh Networks. IEEE Radio Communications, S23–S30 (2005)

    Google Scholar 

  2. Cao, M., Wang, X., Kim, S.K., Madihian, M.: Multi-Hop Wireless Backhaul Networks: A Cross-Layer Design Paradigm. IEEE JSAC 25(4), 738–748 (2007)

    Google Scholar 

  3. Xergias, S., Passas, N., Salkintzis, A.K.: Centralized Resource Allocation for Multimedia Traffic in IEEE 802.16 Mesh Networks. Proc. IEEE 96(1), 54–63 (2008)

    Article  Google Scholar 

  4. Sharma, G., Mazumda, R.R., Shroff, N.B.: On the Complexity of Scheduling in Wireless Networks. In: IEEE Mobicom 2006 (2006)

    Google Scholar 

  5. Tassiulas, L., Ephremides, A.: Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks. IEEE Trans. Automatic Control 37(12), 1936–1948 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Tassiulas, L.: Linear Complexity algorithms for maximum throughput in radio networks and input queued switches. IEEE, Los Alamitos (1998)

    Book  Google Scholar 

  7. Tassiulas, L., Ephremides, A.: Joint optimal routing and scheduling in packet radio networks. IEEE Trans. Inform. Theory 38, 165–169 (1992)

    Article  MATH  Google Scholar 

  8. Jain, K., Padhye, J., Padmanabhan, V., Qiu, L.: Impact on Interference on multi-hop wireless networks performance. In: ACM Mobicom 2003 (2003)

    Google Scholar 

  9. Jain, K., Padhye, J., Padmanabhan, V., Qiu, L.: Impact of Interference on Multi-Hop Wireless Network Performance. Wireless Networks 11, 471–487 (2005)

    Article  Google Scholar 

  10. Chou, C.T., Qadir, J., Lim, J.G.: Advances and Challenges with Data Broadcasting in Wireless Mesh Networks. IEEE Comm. Magazine, 78–122 (2007)

    Google Scholar 

  11. Sharma, G., Shroff, N.B., Mazumdar, R.R.: Maximum Weighted Matching with Interference Constraints. In: IEEE Int. Conf. Pervasive Computing and Comm. Workshop (2006)

    Google Scholar 

  12. Madan, R., Cui, S., Lall, S., Goldsmith, A.J.: Cross-layer design for lifetime maximization in interference-limited wireless sensor networks. In: IEEE Infocom (2005)

    Google Scholar 

  13. Kodlialam, M., Nandagopal, T.: Characterizing Achievable rates in multi-hop wireless mesh networks: the joint routing and scheduling problem. In: ACM Mobicom 2003, San Diego, California (2003)

    Google Scholar 

  14. Cruz, R.L., Santhaman, A.V.: Optimal routing, link scheduling and power control in multi-hop wireless networks. In: Proc. IEEE Infocom, vol. 1, pp. 702–711 (2005)

    Google Scholar 

  15. Xiao, L., Johansoon, M., Boyd, S.P.: Simultaneous routing and resource allocation via dual decomposition. IEEE Trans. Comm. 52(7), 1136–1144 (2004)

    Article  Google Scholar 

  16. Elliot, T., Ephremides, A.: Joint scheduling and power control for wireless ad hoc networks. IEEE Trans. Wireless Comm. 1, 74–85 (2004)

    Google Scholar 

  17. Sharma, G., Shroff, N.B., Mazumdar, R.R.: Joint Congestion Control and Distributed Scheduling for Throughput Guarantees in Wireless Networks. In: IEEE Infocom, pp. 2072–2080 (2007)

    Google Scholar 

  18. Parekh, A.K., Gallager, R.G.: A Generalized Processor Sharing Approach to Flow Control in Integrated Service Networks: the Single Node Case. IEEE/ACM Trans. Networking 1, 344–357 (1993)

    Article  Google Scholar 

  19. Parekh, A.K., Gallager, R.G.: A Generalized Processor Sharing Approach to Flow Control in Integrated Service Networks: the Multiple Node Case. IEEE/ACM Trans. Networking 2(2), 137–150 (1994)

    Article  Google Scholar 

  20. Jajszczyk, A.: Nonblocking, Repackable and Rearrangeable Clos Networks: Fifty Years of the Theory Evolution. IEEE Comm. Magazine, 28–33 (2003)

    Google Scholar 

  21. McKeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% Throughput in an Input Queued Switch. Trans. Comm. 47(8), 1260–1267 (1999)

    Article  Google Scholar 

  22. Lotfinezhad, M., Liang, B., Sousa, E.S.: Dynamic Control of Tunable Sub-optimal Algorithms for Scheduling of Time-varying Wireless Networks. In: IEEE iWQoS Conf., Enschede, Netherlands, pp. 153–163 (2008)

    Google Scholar 

  23. Gourgy, A., Szymanski, T.H., Down, D.: On Tracking the Behaviour of an Output Queued Switch using an Input Queued Switch. IEEE Trans. Networking (submitted)

    Google Scholar 

  24. Koksal, C.E., Gallager, R.G., Rohrs, C.E.: Rate Quantization and Service Quality over Single Crossbar Switches. In: IEEE Infocom (2004)

    Google Scholar 

  25. Gopya, P., Vin, H.M.: Generalized Guaranteed Rate Scheduling Algorithms: A Framework. IEE/ACM Trans. Networking 5(4), 561–571 (1997)

    Article  Google Scholar 

  26. Keslassy, I., Kodialam, M., Lakshamn, T.V., Stiliadis, D.: On Guaranteed Smooth Scheduling for Input-Queued Switches. IEEE/ACM Trans. Networking 13(6) (2005)

    Google Scholar 

  27. Kodialam, M.S., Lakshman, T.V., Stilladis, D.: Scheduling of Guaranteed-bandwidth low-jitter traffic in input-buffered switches. US Patent Application #20030227901

    Google Scholar 

  28. Chen, W.J., Chang, C.-S., Huang, H.-Y.: Birkhoff-von Neumann Input Buffered Crossbar Switches. IEEE Trans. Comm. 49(7), 1145–1147 (2001)

    Article  MATH  Google Scholar 

  29. Chang, C.-S., Chen, W.J., Huang, H.-Y.: On Service Guarantees for Input Buffered Crossbar Switches: A Capacity Decomposition Approach by Birkhoff and von Neuman. In: IEEE iWQoS 1999, pp. 79–86 (1999)

    Google Scholar 

  30. Mohanty, S.R., Bhuyan, L.N.: Guaranteed Smooth Switch Scheduling with Low Complexity. In: IEEE Globecom, pp. 626–630 (2005)

    Google Scholar 

  31. Sun, W., Shin, K.G.: End-to-End Delay Bounds for Traffic Aggregates Under Guaranteed-Rate Scheduling Algorithms. IEEE/ACM Trans. Networking 11(3), 1188–1201 (2005)

    Article  Google Scholar 

  32. Giaccone, P., Leonardi, E., Shat, D.: Throughput Region of Finite-Buffered Networks. IEEE Trans. PDS 11(12), 251–263 (2007)

    Google Scholar 

  33. Szymanski, T.H.: QoS Switch Scheduling using Recursive Fair Stochastic Matrix Decomposition. In: IEEE Int. Conf. HPSR, pp. 417–424 (2006)

    Google Scholar 

  34. Szymanski, T.H.: A Low-Jitter Guaranteed-Rate Scheduling Algorithm for Packet-Switched IP Routers, accepted (with revision). IEEE Trans. on Comm. (2008)

    Google Scholar 

  35. Szymanski, T.H.: Method and Apparatus to Schedule Packets through a Crossbar Switch with Delay Guarantees, US Patent Application (2006)

    Google Scholar 

  36. Szymanski, T.H.: Method and Apparatus to Schedule Packets through a Wireless Mesh Network with Near Minimal Delay and Jitter, US Provisional Patent App. (2008)

    Google Scholar 

  37. Szymanski, T.H., Gilbert, D.: Delivery of Guaranteed Rate Internet Traffic with Very Low Delay Jitter. In: IEEE Pacific Rim Conf. on Comm. Comp. and Signal Processing, Canada, pp. 450–455 (2007).

    Google Scholar 

  38. Szymanski, T.H., Gilbert, D.: Low-Jitter Guaranteed-Rate Communications for Cluster Computing Systems. Pacific Rim Special Issue. Int. Journal of Computer Networks and Distributed Systems (to appear) (2008)

    Google Scholar 

  39. Szymanski, T.H.: Bounds on End-to-End Delay and Jitter in Input-Buffered and Internally Buffered IP Networks (submitted) (2008)

    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

Szymanski, T.H. (2009). A Conflict-Free Low-Jitter Guaranteed-Rate MAC Protocol for Base-Station Communications in Wireless Mesh Networks. In: Wang, C. (eds) AccessNets. AccessNets 2008. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04648-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04648-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04647-6

  • Online ISBN: 978-3-642-04648-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics